An application of algebraic geometry to encryption: tame transformation method

DOI10.4171/RMI/364MaRDI QIDQ1884054zbMATH OpenFDO

Authors Tzuong-Tsieng Moh

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

zbMATH Keywords

cryptologyerror detectiontame ramificationpublic-key cipher

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)

Recommendations

• scientific article; zbMATH DE number 4048521
• Algebraical Structures of Cryptographic Transformations
• Applications of Galois geometry to cryptology
• A geometric approach to linear cryptanalysis
• scientific article; zbMATH DE number 4158545
• Advanced Encryption Standard – AES
• scientific article; zbMATH DE number 2154291
• scientific article; zbMATH DE number 1594291
• Algebraic geometry in coding theory and cryptography
• The geometry of lattice cryptography

Cites work

• scientific article; zbMATH DE number 1583768 (Why is no real title available?)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3479037 (Why is no real title available?)
• scientific article; zbMATH DE number 3518934 (Why is no real title available?)
• scientific article; zbMATH DE number 691482 (Why is no real title available?)
• scientific article; zbMATH DE number 1030996 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• scientific article; zbMATH DE number 3079627 (Why is no real title available?)
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
• A method for obtaining digital signatures and public-key cryptosystems
• A public key system with signature and master key functions
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Fast Algorithms for Manipulating Formal Power Series
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• On Cryptosystems Based on Polynomials and Finite Fields
• The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
• The inverse of an automorphism in polynomial time

Cited in

(7)

• On the termination of the general XL algorithm and ordinary multinomials
• On tameness of Matsumoto-Imai central maps in three variables over the finite field \(\mathbb F_2\)
• Algebraical Structures of Cryptographic Transformations
• A public key cryptosystem based on three new provable problems
• Cryptographic technology for benefiting from Big Data
• scientific article; zbMATH DE number 4048521 (Why is no real title available?)
• A key exchange protocol relying on polynomial maps

This page was built for publication: An application of algebraic geometry to encryption: tame transformation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884054)