A variant of rainbow with shorter secret key and faster signature generation

Takanori Yasuda, Jintai Ding, Tsuyoshi Takagi, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

10 被引用数 (Scopus)

抄録

Multivariate public key cryptosystems are being focused on as candidates for post-quantum cryptography. Rainbow is one of the most efficient signature schemes in multivariate public key cryptosystems. The main drawback of Rainbow is that their key size is much larger than that of RSA and ECC. In this paper, we propose an efficient variant of Rainbow that has a shorter secret key (and thus generates signatures faster) than the corresponding original Rainbow. In our scheme, we divide each layer of Rainbow into smaller blocks by using diagonal matrix representations. The size of the smaller blocks can be flexibly selected, and this enables us to carefully choose secure parameters so that our proposed scheme is secure against known attacks such as rank attacks, direct attacks, and UOV attack. We estimate that the secret key size of our proposed scheme with 100-bit security is smaller by about 40% than that of the original Rainbow. In addition, an implementation of our scheme in the C language is seen to generate signature faster by 40%.

本文言語英語
ホスト出版物のタイトルAsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography
ページ57-62
ページ数6
DOI
出版ステータス出版済み - 2013
イベント1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013 - Hangzhou, 中国
継続期間: 5 8 20135 8 2013

出版物シリーズ

名前AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography

その他

その他1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013
国/地域中国
CityHangzhou
Period5/8/135/8/13

All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンスの応用
  • ソフトウェア

フィンガープリント

「A variant of rainbow with shorter secret key and faster signature generation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル