The following pages link to SWIFFT (Q23528):
Displaying 50 items.
- The extended \(k\)-tree algorithm (Q431783) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- An intermediate secret-guessing attack on hash-based signatures (Q2128758) (← links)
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant (Q2195452) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
- CCA updatable encryption against malicious re-encryption attacks (Q2691599) (← links)
- CONSTRUCTION OF FAMILY OF HASH FUNCTIONS BASED ON IDEAL LATTICE (Q2792874) (← links)
- An Efficient Post-Quantum One-Time Signature Scheme (Q2807220) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Improved Short Lattice Signatures in the Standard Model (Q2874513) (← links)
- Scalable Zero Knowledge via Cycles of Elliptic Curves (Q2874542) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (Q2894439) (← links)
- Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware (Q2915119) (← links)
- Full Lattice Basis Reduction on Graphics Cards (Q2920408) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- Improving BDD Cryptosystems in General Lattices (Q3001871) (← links)
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (Q3003372) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- (Q3190516) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Parallel Shortest Lattice Vector Enumeration on Graphics Cards (Q3558303) (← links)
- New Generic Algorithms for Hard Knapsacks (Q3563838) (← links)
- A Lattice-Based Threshold Ring Signature Scheme (Q3584987) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical (Q3650703) (← links)
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures (Q3650716) (← links)
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems (Q4649797) (← links)
- A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings (Q4899217) (← links)
- A Toolkit for Ring-LWE Cryptography (Q4924402) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Interpreting Hash Function Security Proofs (Q4933215) (← links)
- A Parallel GPU Implementation of SWIFFTX (Q5014677) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy (Q5041224) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages (Q5199210) (← links)
- Lattice-Based Identification Schemes Secure Under Active Attacks (Q5445452) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
