swMATH11764MaRDI QIDQ23703FDOQ23703
Author name not available (Why is that?)
Official website: http://rd.springer.com/chapter/10.1007/3-540-36563-X_9
Cited In (67)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- A novel certificateless multi-signature scheme over NTRU lattices
- Learning strikes again: the case of the DRS signature scheme
- Hawk
- A scalable post-quantum hash-based group signature
- Provably secure NTRU instances over prime cyclotomic rings
- Analysis of error terms of signatures based on learning with errors
- Lattice-based revocable certificateless signature
- NTRUSign With a New Perturbation
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- On removing rejection conditions in practical lattice-based signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- Software speed records for lattice-based signatures
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Algorithms for the Generalized NTRU Equations and their Storage Analysis
- Characterizing overstretched NTRU attacks
- Cryptography Based on Quadratic Forms: Complexity Considerations
- A practical lattice-based sequential aggregate signature
- A Countermeasure for Protecting NTRUSign against the Transcript Attack
- On the geometry of cyclic lattices
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Cryptanalysis of SFLASH with Slightly Modified Parameters
- Identification and signatures based on NP-hard problems of indefinite quadratic forms
- FLASH
- BLISS
- eBASH
- CFS
- eBACS
- BKZ
- Crypto++
- MaTRU
- NTRU
- SWIFFT
- Gaussian sampling of lattices for cryptographic applications
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- ring-LWE
- Chipwhisperer
- Falcon
- Ed25519
- fpylll
- FrodoKEM
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Compact privacy protocols from post-quantum and timed classical assumptions
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures
- GeMSS
- Modular lattice signatures, revisited
- A novel identity-based multi-signature scheme over NTRU lattices
- Sealing the leak on classical NTRU signatures
- Information Security and Privacy
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- An efficient and parallel Gaussian sampler for lattices
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Bonsai trees, or how to delegate a lattice basis
- FACCT
- GALATICS
- Rowhammer.js
- Trapdoors for hard lattices and new cryptographic constructions
- NTRUCCA: how to strengthen NTRUEncrypt to chosen-ciphertext security in the standard model
- A signature scheme from the finite field isomorphism problem
- Fault analysis of the NTRUSign digital signature scheme
- Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
- Information Security and Privacy
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
- Public Key Identification Based on the Equivalence of Quadratic Forms
- Symplectic Lattice Reduction and NTRU
This page was built for software: NTRUSign
