Paper 2019/1388

Secure Key Encapsulation Mechanism with Compact Ciphertext and Public Key from Generalized Srivastava code

Jayashree Dey and Ratna Dutta

Abstract

Code-based public key cryptosystems have been found to be an interesting option in the area of Post-Quantum Cryptography. In this work, we present a key encapsulation mechanism (KEM) using a parity check matrix of the Generalized Srivastava code as the public key matrix. Generalized Srivastava codes are privileged with the decoding technique of Alternant codes as they belong to the family of Alternant codes. We exploit the dyadic structure of the parity check matrix to reduce the storage of the public key. Our encapsulation leads to a shorter ciphertext as compared to DAGS proposed by Banegas et al. in Journal of Mathematical Cryptology which also uses Generalized Srivastava code. Our KEM provides IND-CCA security in the random oracle model. Also, our scheme can be shown to achieve post-quantum security in the quantum random oracle model.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. Minor revision.
Keywords
Key encapsulation mechanismGeneralized Srivastava codeQuasi-dyadic matrixAlternant decoding
Contact author(s)
deyjayashree @ iitkgp ac in
ratna @ maths iitkgp ernet in
History
2019-12-04: received
Short URL
https://ia.cr/2019/1388
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/1388,
      author = {Jayashree Dey and Ratna Dutta},
      title = {Secure Key Encapsulation Mechanism with Compact Ciphertext and Public Key from Generalized Srivastava code},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1388},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1388}},
      url = {https://eprint.iacr.org/2019/1388}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.