Efficient Variant of Rainbow without Triangular Matrix Representation

Abstract : Multivariate Public Key Cryptosystems (MPKC) is one of candidates for post-quantum cryptography. Rainbow is an MPKC digital signature scheme, with relatively efficient encryption and decryption processes. However, the size of MPKC key is substantially larger than that of an RSA cryptosystem for the same security level. In this paper, we propose a variant of Rainbow that has a smaller secret key. The smaller secret key is to the result of a different description of the quadratic polynomials appearing in the secret key from that of the original Rainbow. In addition, our scheme improves the efficiency of the Rainbow’s signature generation. In particular, the secret key is reduced in size by about 40% and the signature generation is sped up by about 30% at the security level of 100 bits.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01397267
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 15, 2016 - 4:04:55 PM
Last modification on : Wednesday, November 16, 2016 - 1:04:11 AM
Long-term archiving on : Thursday, March 16, 2017 - 5:33:08 PM

File

978-3-642-55032-4_55_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Takanori Yasuda, Tsuyoshi Takagi, Kouichi Sakurai. Efficient Variant of Rainbow without Triangular Matrix Representation. 2nd Information and Communication Technology - EurAsia Conference (ICT-EurAsia), Apr 2014, Bali, Indonesia. pp.532-541, ⟨10.1007/978-3-642-55032-4_55⟩. ⟨hal-01397267⟩

Share

Metrics

Record views

43

Files downloads

133