Improving lattice based cryptosystems using the Hermite normal form

DOI10.1007/3-540-44670-2_11MaRDI QIDQ4787204zbMATH OpenFDO

Authors Daniele Micciancio

Publication date 9 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2146/21460126

zbMATH Keywords

lattice cryptosystemslatticespublic-key encryptiontrapdoor functions

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Improving BDD cryptosystems in general lattices
• A lattice-based public-key cryptosystem
• A lattice-based public-key cryptosystem
• Public-key cryptosystems from lattice reduction problems
• Generating shorter bases for hard random lattices

Cited in

(25)

• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Second order statistical behavior of LLL and BKZ
• The inapproximability of lattice and coding problems with preprocessing
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• Storage efficient algorithm for Hermite normal form using LLL
• Post-quantum cryptography: lattice signatures
• Fast LLL-type lattice reduction
• Post-quantum forward-secure onion routing (future anonymity in today's budget)
• Estimating key sizes for high dimensional lattice-based systems
• Improving BDD cryptosystems in general lattices
• Improvement of lattice-based cryptography using CRT
• The geometry of lattice cryptography
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
• Generating shorter bases for hard random lattices
• Generating shorter bases for hard random lattices
• A Digital Signature Scheme Based on CVP  ∞
• Multi-bit Cryptosystems Based on Lattice Problems
• Quantum blockchain-enabled exchange protocol model for decentralized systems
• Cryptanalysis of the GGH cryptosystem
• Lattice polly cracker cryptosystems
• A probability inequality with application to lattice theory
• A generalization of NTRUEncrypt
• On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
• SoK: learning with errors, circular security, and fully homomorphic encryption
• Diagonally dominant matrices for cryptography

Describes a project that uses

Uses Software

• NTL
• NTRU

This page was built for publication: Improving lattice based cryptosystems using the Hermite normal form

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