Poly-Dragon: an efficient multivariate public key cryptosystem

DOI10.1515/JMC.2011.002zbMath1235.94051MaRDI QIDQ2999551

Bhaba K. Sarma, Anupam Saikia, Rajesh P. Singh

Publication date: 13 May 2011

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2011.002

zbMATH Keywords

permutation polynomial; multivariate cryptography; little dragon and big dragon cryptosystems

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11T06: Polynomials over finite fields

Related Items

Unnamed Item, Some results on complete permutation polynomials and mutually orthogonal Latin squares, Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\), A public key cryptosystem using a group of permutation polynomials

Uses Software

• FGb
• FLASH

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Asymmetric Cryptography with a Hidden Monomial
• Practical Cryptanalysis of SFLASH
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Public-key cryptography using paraunitary matrices
• Differential Cryptanalysis for Multivariate Schemes