The following pages link to (Q4418531):
Displayed 44 items.
- NTRUSign (Q23703) (← links)
- On the geometry of cyclic lattices (Q464733) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- A scalable post-quantum hash-based group signature (Q831185) (← links)
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (Q1698622) (← links)
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- Lattice Klepto -- turning post-quantum crypto against itself (Q1746980) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Fault analysis of the NTRUSign digital signature scheme (Q1947651) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
- A signature scheme from the finite field isomorphism problem (Q2191202) (← links)
- Characterizing overstretched NTRU attacks (Q2191207) (← links)
- Modular lattice signatures, revisited (Q2302153) (← links)
- Lattice-based revocable certificateless signature (Q2333434) (← links)
- A novel identity-based multi-signature scheme over NTRU lattices (Q2676475) (← links)
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs (Q2827724) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
- Analysis of Error Terms of Signatures Based on Learning with Errors (Q2988339) (← links)
- Algebraic Cryptanalysis of CTRU Cryptosystem (Q3511333) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Algorithms for the Generalized NTRU Equations and their Storage Analysis (Q4988919) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- A Novel Certificateless Multi-signature Scheme over NTRU Lattices (Q5095936) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- Security and Trust in Sensor Networks (Q5391135) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)
- Provably Secure NTRU Instances over Prime Cyclotomic Rings (Q5738796) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- A new offer of <scp>NTRU</scp> cryptosystem with two new key pairs (Q6087710) (← links)
- Fiat-Shamir signatures based on module-NTRU (Q6108792) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple (Q6133964) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- On the hardness of the NTRU problem (Q6157484) (← links)
- Lattice-based cryptography: a survey (Q6183909) (← links)
- Compact lattice gadget and its applications to hash-and-sign signatures (Q6190144) (← links)