A Lattice Based Public Key Cryptosystem Using Polynomial Representations

DOI10.1007/3-540-36288-6_22zbMATH Open1033.94537OpenAlexW1520844338MaRDI QIDQ4414717FDOQ4414717

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

Recommendations

• A lattice-based public-key cryptosystem
• scientific article; zbMATH DE number 1304121
• scientific article; zbMATH DE number 1612499
• scientific article; zbMATH DE number 1088230
• Coding and Cryptography

zbMATH Keywords

polynomial representationGGH cryptosystemlattice based public key cryptosystem

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• A note on partition sum polynomials
• Lattice-based public key cryptosystems invoking linear mapping mask
• Title not available (Why is that?)
• Cryptanalysis of the GGH cryptosystem
• On the smallest-basis problem underlying the GGH lattice-based cryptosystem
• A type of public cryptosystem using polynomials and pell sequences
• Gröbner bases for public key cryptography

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)