Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
From MaRDI portal
Publication:3084365
DOI10.1007/978-3-642-19379-8_29zbMath1291.94062OpenAlexW1602432826MaRDI QIDQ3084365
Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, Ludovic Perret
Publication date: 15 March 2011
Published in: Public Key Cryptography – PKC 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19379-8_29
Related Items (8)
Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ On the relation between the MXL family of algorithms and Gröbner basis algorithms ⋮ Graph-theoretic algorithms for the alternating trilinear form equivalence problem ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ On enumeration of polynomial equivalence classes and their application to MPKC ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
Uses Software
This page was built for publication: Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
