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