Efficient Variant of Rainbow without Triangular Matrix Representation - Information and Communication Technology Access content directly
Conference Papers Year : 2014

Efficient Variant of Rainbow without Triangular Matrix Representation


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.
Fichier principal
Vignette du fichier
978-3-642-55032-4_55_Chapter.pdf (93.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01397267 , version 1 (15-11-2016)





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⟩
51 View
158 Download



Gmail Facebook X LinkedIn More