A lattice based public key cryptosystem using polynomial representations

DOI10.1007/3-540-36288-6_22MaRDI QIDQ4414717zbMATH OpenOpenAlexFDO

Authors Seong-Hun Paeng, Bae Eun Jung, Kil-Chan Ha

Publication date 27 July 2003

Published in Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36288-6_22

zbMATH Keywords

GGH cryptosystemlattice based public key cryptosystempolynomial representation

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A lattice-based public-key cryptosystem
• A lattice-based public-key cryptosystem
• A proposal of a new public key cryptosystem using matrices over a ring
• Public-key cryptosystems from lattice reduction problems
• Coding and Cryptography

Cited in

(9)

• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• A note on partition sum polynomials
• A public key encryption scheme based on the polynomial reconstruction problem
• A public key cryptosystem based on sparse polynomials
• A type of public cryptosystem using polynomials and pell sequences
• On the smallest-basis problem underlying the GGH lattice-based cryptosystem
• Gröbner bases for public key cryptography
• Lattice-based public key cryptosystems invoking linear mapping mask
• Cryptanalysis of the GGH cryptosystem

Describes a project that uses

Uses Software

• NTRU

This page was built for publication: A lattice based public key cryptosystem using polynomial representations

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