SWIFFT
From MaRDI portal
Software:23528
swMATH11588MaRDI QIDQ23528FDOQ23528
Author name not available (Why is that?)
Source code repository: https://github.com/micciancio/SWIFFT
Cited In (50)
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
- Title not available (Why is that?)
- Pseudorandom Functions: Three Decades Later
- A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings
- Full Lattice Basis Reduction on Graphics Cards
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
- Cryptographic Functions from Worst-Case Complexity Assumptions
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- An intermediate secret-guessing attack on hash-based signatures
- The extended \(k\)-tree algorithm
- Interpreting Hash Function Security Proofs
- A Toolkit for Ring-LWE Cryptography
- Hash Functions from Sigma Protocols and Improvements to VSH
- Construction of family of hash functions based on ideal lattice
- A Parallel GPU Implementation of SWIFFTX
- Improving BDD Cryptosystems in General Lattices
- The Geometry of Lattice Cryptography
- Lattice-Based Identification Schemes Secure Under Active Attacks
- A Lattice-Based Threshold Ring Signature Scheme
- Improved Zero-Knowledge Identification with Lattices
- How to Prove Knowledge of Small Secrets
- New Generic Algorithms for Hard Knapsacks
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- Parallel Shortest Lattice Vector Enumeration on Graphics Cards
- On the complexity of the BKW algorithm on LWE
- ETRU: NTRU over the Eisenstein integers
- A pseudorandom number generator based on worst-case lattice problems
- Explicit Hard Instances of the Shortest Vector Problem
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
- A characterization of chameleon hash functions and new, efficient designs
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- An Efficient Post-Quantum One-Time Signature Scheme
- Scalable zero knowledge via cycles of elliptic curves
- Improved Short Lattice Signatures in the Standard Model
- Post-quantum cryptography: lattice signatures
- CCA updatable encryption against malicious re-encryption attacks
- Cryptography from Learning Parity with Noise
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Computing Generator in Cyclotomic Integer Rings
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for software: SWIFFT
