Abstract
We propose a rank metric code-based signature scheme based on the rank syndrome decoding problem, and analyze its security. We also provide necessary conditions for being MRD codes. Then, we provide parameters for the constructed signature scheme based on random linear codes constructed from Cauchy matrix. We also compare the signature scheme with those code-based signature schemes submitted to the NIST call for Post-Quantum Cryptography Standardization. The comparison shows that our signature scheme performs better than those schemes in terms of public key size and secret key size. The public key size and secret key size of our signature scheme are more than 3 times and 40 times smaller than those of the signature schemes submitted to the NIST call for Post-Quantum Cryptography Standardization.
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 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.
