Solving the Problem of Blockwise Isomorphism of Polynomials with Circulant Matrices-Reference-Cited by-同舟云学术

Solving the Problem of Blockwise Isomorphism of Polynomials with Circulant Matrices

Published:2023-03-01 Issue:3 Volume:E106.A Page:185-192
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

HASHIMOTO Yasufumi¹

Affiliation:

1. Department of Mathematical Sciences, University of the Ryukyus

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/E106.A/3/E106.A_2022CIP0002/_pdf

Reference11 articles.

1. [1] C. Bouillaguet, J.-C. Faugére, P.-A. Fouque, and L. Perret, Isomorphism of Polynomials: New Results, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.9570, 2009.

2. [2] A. Casanova, J.C. Faugère, G. Macario-Rat, J. Patarin, L. Perret, and J. Ryckeghem, GeMSS: A Great Multivariate Short Signature, https://www-polsys.lip6.fr/Links/NIST/GeMSS.html

3. [3] J. Chen, C.H. Tan, X. Li, “Practical cryptanalysis of a public key cryptosystem based on the morphism of polynomials problem,” Tsinghua Sci. Technol., vol.23, no.6, pp.671-679, 2018. 10.26599/tst.2018.9010028

4. [4] M.-S. Chen, J. Ding, M. Kannwischer, J. Patarin, A. Petzoldt, D. Schmidt, and B.-Y. Yang, Rainbow Signature, https://www.pqcrainbow.org/

5. [5] J.-C. Faugére and L. Perret, “Polynomial equivalence problems: Algorithmic and theoretical aspects,” Eurocrypt 2006, LNCS vol.4004, pp.30-47, 2006. 10.1007/11761679_3