The following pages link to NTRU (Q23700):
Displaying 50 items.
- High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers (Q2946459) (← links)
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (Q2948346) (← links)
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors (Q2958147) (← links)
- Gröbner bases of ideals invariant under a commutative group (Q2963257) (← links)
- On error distributions in ring-based LWE (Q2971006) (← links)
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero (Q2971014) (← links)
- Choosing Parameters for NTRUEncrypt (Q2975792) (← links)
- Analysis of Error Terms of Signatures Based on Learning with Errors (Q2988339) (← links)
- Lattice Reduction Algorithms: Theory and Practice (Q3003370) (← links)
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (Q3003372) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- BKZ 2.0: Better Lattice Security Estimates (Q3102173) (← links)
- Multi-key FHE from LWE, Revisited (Q3181028) (← links)
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (Q3183586) (← links)
- BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU (Q3294884) (← links)
- A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys (Q3297504) (← links)
- Integer Reconstruction Public-Key Encryption (Q3297634) (← links)
- Low-Cost Cryptography for Privacy in RFID Systems (Q3452239) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- SWIFFT: A Modest Proposal for FFT Hashing (Q3525661) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Parallel Shortest Lattice Vector Enumeration on Graphics Cards (Q3558303) (← links)
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes (Q3562913) (← links)
- An Efficient and Parallel Gaussian Sampler for Lattices (Q3582749) (← links)
- Generalized Compact Knapsacks Are Collision Resistant (Q3591445) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU (Q3612548) (← links)
- A New Operator for Multi-addition Calculations (Q3628549) (← links)
- Reducing Key Length of the McEliece Cryptosystem (Q3637133) (← links)
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures (Q3650716) (← links)
- Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge (Q3651592) (← links)
- (Q4409120) (← links)
- A Practical Public Key Cryptosystem from Paillier and Rabin Schemes (Q4414716) (← links)
- A Lattice Based Public Key Cryptosystem Using Polynomial Representations (Q4414717) (← links)
- (Q4418531) (← links)
- (Q4425732) (← links)
- (Q4432457) (← links)
- (Q4434890) (← links)
- (Q4434891) (← links)
- (Q4434894) (← links)
- (Q4450755) (← links)
- (Q4474162) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes (Q4649796) (← links)
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems (Q4649797) (← links)
