Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
From MaRDI portal
Publication:4924412
DOI10.1007/978-3-642-38348-9_13zbMath1306.94034OpenAlexW214384890MaRDI QIDQ4924412
Charles Bouillaguet, Pierre-Alain Fouque, Amandine Véber
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_13
Related Items (9)
Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption ⋮ An improved affine equivalence algorithm for random permutations ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Take your MEDS: digital signatures from matrix code equivalence ⋮ 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 ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
This page was built for publication: Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
