On enumeration of polynomial equivalence classes
From MaRDI portal
Publication:2392938
DOI10.1007/s11425-011-4355-xzbMath1279.94124MaRDI QIDQ2392938
Publication date: 5 August 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-011-4355-x
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11T06: Polynomials over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On enumeration of polynomial equivalence classes and their application to MPKC
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Unbalanced Oil and Vinegar Signature Schemes
- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
- Progress in Cryptology - INDOCRYPT 2003
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography - PKC 2005