Abstract
It is very important that the communicating parties are able to verify their identity in order to communicate with each other properly. Identification schemes are used for this purpose. The identification schemes, widely used in applications, are based on the hardness of the discrete logarithm or integer factorization problem. Shor proposed an algorithm that solve discrete logarithm and factorization problems by using quantum computers in polynomial-time. Therefore, there is a huge need for identification schemes which can be used post-quantum. In this paper, the identification schemes based on hardness of different lattice problems are surveyed. In addition, a new zero-knowledge lattice-based identification scheme is proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
