Publication:4737253
From MaRDI portal
zbMath1055.94015MaRDI QIDQ4737253
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320299.htm
cryptanalysis; NTRU; lattice reduction; signature scheme; cyclotomic integer; orthogonal lattice; NTRUSign; NSS; Galois congruence
94A60: Cryptography
94A62: Authentication, digital signatures and secret sharing
11H71: Relations with coding theory
Related Items
Key exchange protocols over noncommutative rings. The case of, Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm, Efficient Nyberg-Rueppel type of NTRU digital signature algorithm, Testing Isomorphism of Lattices over CM-Orders, A Digital Signature Scheme Based on CVP ∞, Provably Secure NTRU Instances over Prime Cyclotomic Rings, Revisiting Lattice Attacks on Overstretched NTRU Parameters, Computing Generator in Cyclotomic Integer Rings, Short Stickelberger Class Relations and Application to Ideal-SVP, NTRU Fatigue: How Stretched is Overstretched?, Lattice-based accumulator with constant time list update and constant time verification, NTRU over Galois rings, A polynomial time algorithm for breaking NTRU encryption with multiple keys, \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, Matrix product constraints by projection methods, Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures, Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\), Fault analysis of the NTRUSign digital signature scheme, Vulnerable public keys in NTRU cryptosystem, On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\), Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices, Fast reduction of algebraic lattices over cyclotomic fields, Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\), On removing rejection conditions in practical lattice-based signatures, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, Lattices with symmetry, A Subfield Lattice Attack on Overstretched NTRU Assumptions, Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings, Symplectic Lattice Reduction and NTRU, Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
