scientific article; zbMATH DE number 2009972
From MaRDI portal
Publication:4434891
zbMath1038.94558MaRDI QIDQ4434891
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560433.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NTRUSignDecisional Lattice ProblemDistributed Lattice ReductionGGH CryptanalysisGram Matrix FactorizationIntegral Lattice Embedding Orthogonal LatticeLattice Distinguishing OracleLattice Isomorphism
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62) Relations with coding theory (11H71)
Related Items (11)
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Gaussian sampling of lattices for cryptographic applications ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Fault analysis of the NTRUSign digital signature scheme ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ Deciding Orthogonality in Construction-A Lattices ⋮ A practical algorithm for completing half-Hadamard matrices using LLL
Uses Software
This page was built for publication:
