A public-key encryption scheme based on non-linear indeterminate equations

DOI10.1007/978-3-319-72565-9_11MaRDI QIDQ1746969zbMATH OpenOpenAlexFDO

Authors Koichiro Akiyama, Yasuhiro Goto, Shinya Okumura, Tsuyoshi Takagi, Koji Nuida, Goichiro Hanaoka

Publication date 26 April 2018

Full work available at URL https://doi.org/10.1007/978-3-319-72565-9_11

zbMATH Keywords

public-key cryptosystempost-quantum cryptosystemindeterminate equationsmallest solution problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical cryptanalysis of a public-key encryption scheme based on non-linear indeterminate equations at SAC 2017
• New public-key cryptosystem based on the morphism of polynomials problem
• Public-key cryptography from new multivariate quadratic assumptions
• Extended multivariate public key cryptosystems with secure encryption function
• Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions

Cites work

• scientific article; zbMATH DE number 1722678 (Why is no real title available?)
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 3715696 (Why is no real title available?)
• scientific article; zbMATH DE number 1302849 (Why is no real title available?)
• scientific article; zbMATH DE number 1341866 (Why is no real title available?)
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 1418301 (Why is no real title available?)
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• A multivariate encryption scheme with Rainbow
• A selection of recent lattice-based signature and encryption schemes
• Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem
• An Algebraic Surface Cryptosystem
• BKZ 2.0: Better lattice security estimates
• Better key sizes (and attacks) for LWE-based encryption
• Factoring polynomials with rational coefficients
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice decoding attacks on binary LWE
• Making NTRU as secure as worst-case problems over ideal lattices
• Minkowski's Convex Body Theorem and Integer Programming
• On Lovász' lattice reduction and the nearest lattice point problem
• On lattices, learning with errors, random linear codes, and cryptography
• Predicting Lattice Reduction
• Simple matrix scheme for encryption
• Solving BDD by enumeration: an update
• ZHFE, a new multivariate public key encryption scheme

Cited in

(6)

• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
• A public key cryptosystem based on Diophantine equations of degree increasing type
• An improvement of a key exchange protocol relying on polynomial maps
• Practical cryptanalysis of a public-key encryption scheme based on non-linear indeterminate equations at SAC 2017
• A new post-quantum multivariate polynomial public key encapsulation algorithm
• scientific article; zbMATH DE number 2154094 (Why is no real title available?)

This page was built for publication: A public-key encryption scheme based on non-linear indeterminate equations

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