Reducing the Key Size of the SRP Encryption Scheme - Extended version

Dung Hoang Duong; Albrecht Petzoldt; Tsuyoshi Takagi

Paper 2016/383

Reducing the Key Size of the SRP Encryption Scheme - Extended version

Dung Hoang Duong, Albrecht Petzoldt, and Tsuyoshi Takagi

Abstract

Multivariate Public Key Cryptography (MPKC) is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed in [24] a new multivariate encryption scheme called SRP, which offers effcient decryption, a small blow up factor between plaintext and ciphertext and resists all known attacks against multivariate schemes. However, similar to other MPKC schemes, the key sizes of SRP are quite large. In this paper we propose a technique to reduce the key size of the SRP scheme, which enables us to reduce the size of the public key by up to 54%. Furthermore, we can use the additional structure in the public key polynomials to speed up the encryption process of the scheme by up to 50%. We show by experiments that our modifications do not weaken the security of the scheme.

Note: This is the extended version of the paper that will appear at ACISP2016

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Contact author(s): duong @ imi kyushu-u ac jp
History: 2016-04-15: received
Short URL: https://ia.cr/2016/383
License: CC BY

BibTeX

@misc{cryptoeprint:2016/383,
      author = {Dung Hoang Duong and Albrecht Petzoldt and Tsuyoshi Takagi},
      title = {Reducing the Key Size of the {SRP} Encryption Scheme - Extended version},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/383},
      year = {2016},
      url = {https://eprint.iacr.org/2016/383}
}