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

DOI10.1007/978-3-319-72565-9_11zbMath1384.94021OpenAlexW2778118893MaRDI QIDQ1746969

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

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)

Related Items (1)

An improvement of 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
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• A Multivariate Encryption Scheme with Rainbow
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• ZHFE, a New Multivariate Public Key Encryption Scheme
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem
• An Algebraic Surface Cryptosystem
• Minkowski's Convex Body Theorem and Integer Programming
• A Selection of Recent Lattice-Based Signature and Encryption Schemes
• Solving BDD by Enumeration: An Update
• Simple Matrix Scheme for Encryption
• Lattice Decoding Attacks on Binary LWE
• Predicting Lattice Reduction
• On lattices, learning with errors, random linear codes, and cryptography

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