The following pages link to (Q4737253):
Displaying 36 items.
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Matrix product constraints by projection methods (Q1675556) (← links)
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (Q1698622) (← links)
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) (Q1746982) (← links)
- Fault analysis of the NTRUSign digital signature scheme (Q1947651) (← links)
- Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) (Q2009413) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\) (Q2118552) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Lattices with symmetry (Q2408587) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Key exchange protocols over noncommutative rings. The case of (Q4903468) (← links)
- Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm (Q5001674) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- Testing Isomorphism of Lattices over CM-Orders (Q5232327) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Provably Secure NTRU Instances over Prime Cyclotomic Rings (Q5738796) (← links)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
- A new offer of <scp>NTRU</scp> cryptosystem with two new key pairs (Q6087710) (← links)
- NTRU over Galois rings (Q6109228) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON (Q6595914) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- An algorithm for solving the principal ideal problem with subfields (Q6605891) (← links)
- Cryptanalysis of the \textsc{Peregrine} lattice-based signature scheme (Q6635758) (← links)
- Cryptanalysis of rank-2 module-LIP in totally real number fields (Q6637723) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- FuLeakage: breaking FuLeeca by learning attacks (Q6652988) (← links)
