Comparison of Two Signature Schemes Based on the <i>MQ</i> Problem and Quartz-Reference-Cited by-同舟云学术

Comparison of Two Signature Schemes Based on the MQ Problem and Quartz

Published:2016 Issue:12 Volume:E99.A Page:2527-2538
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

TERADA Routo¹,ANDRADE Ewerton R.²

Affiliation:

1. Dept. of Computer Science, Universidade de São Paulo

2. Dept. of Computer Science and Escola Politécnica, Universidade de São Paulo

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E99.A/12/E99.A_2527/_pdf

Reference48 articles.

1. [1] E. Barker and A. Roginsky, NIST Special Publication 800-131a — Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths, Technical Report, National Institute of Standards and Technology, NIST, U.S. Department of Commerce, Washington DC. http://csrc.nist.gov/publications/nistpubs/800-131A/sp800-131A.pdf, 2011. Access 09/07/2013.

2. [2] M. Bellare and P. Rogaway, “The exact security of digital signatures-how to sign with RSA and Rabin,” Advances in Cryptology, EUROCRYPT'96, Lecture Notes in Computer Science, vol.1070, pp.399-416, Springer Berlin Heidelberg, Berlin, Heidelberg, 1996.

3. [3] L. Bettale, J.-C. Faugère, and L. Perret, “Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic,” Des. Codes Cryptogr., vol.69, no.1, pp.1-52, 2013.

4. [4] C. Bouillaguet, H.-C. Chen, C.-M. Cheng, T. Chou, R. Niederhagen, A. Shamir, and B.-Y. Yang, “Fast exhaustive search for polynomial systems in ${\mathbb{F}\_2}$,” Cryptographic Hardware and Embedded Systems, CHES 2010, Lecture Notes in Computer Science, vol.6225, pp.203-218, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.

5. [5] C. Bouillaguet, J.-C. Faugère, P.-A. Fouque, and L. Perret, “Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem,” Public Key Cryptography, PKC 2011, Lecture Notes in Computer Science, vol.6571, pp.473-493, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multivariate Public Key Cryptosystems;Mathematical Modelling for Next-Generation Cryptography;2017-07-26