scientific article; zbMATH DE number 2086714
From MaRDI portal
Publication:4737253
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cryptanalysisNTRUlattice reductionsignature schemecyclotomic integerorthogonal latticeNTRUSignNSSGalois congruence
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Relations with coding theory (11H71)
Related Items (33)
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Lattices with symmetry ⋮ Matrix product constraints by projection methods ⋮ Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ A new offer of <scp>NTRU</scp> cryptosystem with two new key pairs ⋮ 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 ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ Fault analysis of the NTRUSign digital signature scheme ⋮ Key exchange protocols over noncommutative rings. The case of ⋮ Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) ⋮ Vulnerable public keys in NTRU cryptosystem ⋮ 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 ⋮ On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) ⋮ Symplectic Lattice Reduction and NTRU ⋮ 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 ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm ⋮ 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
This page was built for publication:
