The following pages link to NTRUSign (Q23703):
Displaying 46 items.
- On the geometry of cyclic lattices (Q464733) (← 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)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Fault analysis of the NTRUSign digital signature scheme (Q1947651) (← 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)
- \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)
- A practical lattice-based sequential aggregate signature (Q2283602) (← 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)
- NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model (Q2900227) (← links)
- Sealing the Leak on Classical NTRU Signatures (Q2938670) (← links)
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero (Q2971014) (← links)
- Analysis of Error Terms of Signatures Based on Learning with Errors (Q2988339) (← links)
- A Countermeasure for Protecting NTRUSign against the Transcript Attack (Q3512392) (← links)
- Public Key Identification Based on the Equivalence of Quadratic Forms (Q3525581) (← links)
- Trapdoors for hard lattices and new cryptographic constructions (Q3549701) (← links)
- An Efficient and Parallel Gaussian Sampler for Lattices (Q3582749) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- NTRUSign With a New Perturbation (Q3604617) (← links)
- Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
- Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge (Q3651592) (← links)
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems (Q4649797) (← links)
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic (Q4911599) (← links)
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures (Q4911600) (← links)
- Software Speed Records for Lattice-Based Signatures (Q4928589) (← 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)
- Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign (Q5188547) (← links)
- Information Security and Privacy (Q5315270) (← links)
- Information Security and Privacy (Q5315278) (← links)
- Cryptanalysis of SFLASH with Slightly Modified Parameters (Q5429394) (← 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)
