Abstract
Identification is one of the important concerns of information security, that is widely used in our daily e-systems to approve authorised users. With the advent of quantum computers, development of quantum secure identification schemes is essential. In this paper, we give the implementation details of quantum secure Kawachi’s and Cayrel’s identification schemes performed in JavaScript. The hardness of these schemes is based on lattice-based problem SIS in post-quantum cryptography, which requires matrix-vector product operations for its execution. It’s important that for efficient implementation choosing an algorithm with low complexity needs more careful. Therefore, in identification schemes chosen for this study, we use algorithms specific to those schemes’ parameter properties. Then, we carry out matrix by sparse vector and sparse matrix by vector product operations.We provide experimental results of both standard and property-specific algorithms’ execution with their comparison. According to the experimental results, we receive improvements in the specific implementations.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Mathematical Models and Methods in Applied Sciences
Disclaimer: 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.
