An application of algebraic geometry to encryption: tame transformation method
From MaRDI portal
Publication:1884054
DOI10.4171/RMI/364zbMath1058.94012MaRDI QIDQ1884054
No author found.
Publication date: 25 October 2004
Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/39736
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)
Related Items (5)
Cryptographic Technology for Benefiting from Big Data ⋮ On tameness of Matsumoto-Imai central maps in three variables over the finite field \(\mathbb F_2\) ⋮ A public key cryptosystem based on three new provable problems ⋮ On the termination of the general XL algorithm and ordinary multinomials ⋮ A key exchange protocol relying on polynomial maps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Functional decomposition of polynomials: the tame case
- Functional decomposition of polynomials: the wild case
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- The inverse of an automorphism in polynomial time
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
- The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
- On Cryptosystems Based on Polynomials and Finite Fields
- A method for obtaining digital signatures and public-key cryptosystems
- Fast Algorithms for Manipulating Formal Power Series
- A public key system with signature and master key functions
This page was built for publication: An application of algebraic geometry to encryption: tame transformation method