SWIFFT: A Modest Proposal for FFT Hashing

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Fast Software Encryption Workshop

• Publication date

  2008-02-10

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-71039-4_4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Cryptanalysis of LASH

  2008cited by this paper
• Lattices that admit logarithmic worst-case to average-case connection factors

  2007cited by this paper
• LLL on the Average

  2006cited by this paper
• Generalized Compact Knapsacks Are Collision Resistant

  2006influential reference
• Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

  2006cited by this paper
• Collisions of SHA-0 and Reduced SHA-1

  2005cited by this paper
• The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem

  2005cited by this paper
• Cryptanalysis of the Hash Functions MD4 and RIPEMD

  2005cited by this paper
• Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings

  2005cited by this paper
• How to Break MD5 and Other Hash Functions

  2005cited by this paper
• Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance

  2004cited by this paper
• Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor

  2004cited by this paper
• Worst-case to average-case reductions based on Gaussian measures

  2004cited by this paper
• Advances in Cryptology — CRYPTO 2002

  2002cited by this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002influential reference
• A Generalized Birthday Problem

  2002cited by this paper
• Fast Software Encryption

  2002cited by this paper
• Advances in Cryptology — EUROCRYPT’ 92

  2001cited by this paper
• Advances in Cryptology — CRYPTO’ 92

  2001cited by this paper
• Noise-tolerant learning, the parity problem, and the statistical query model

  2000cited by this paper
• Advances in Cryptology — CRYPTO’ 99

  1999cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• An improved worst-case to average-case connection for lattice problems

  1997cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Collision-Free Hashing from Lattice Problems

  1996cited by this paper
• Advances in Cryptology — EUROCRYPT'94

  1994cited by this paper
• A Practical Attack against Knapsack based Hash Functions (Extended Abstract)

  1994cited by this paper
• Parallel FFT-Hashing

  1993cited by this paper
• FFT Hashing is not Collision-free

  1992cited by this paper
• FFT-Hash II, Efficient Cryptographic Hashing

  1992cited by this paper
• FFT-Hash-II is not yet Collision-free

  1992cited by this paper
• Advances in Cryptology — ASIACRYPT '91

  1991cited by this paper
• Advances in Cryptology: Eurocrypt '89

  1991cited by this paper
• The Knapsack Hash Function proposed at Crypto'89 can be broken

  1991cited by this paper
• Collisions for Schnorr's Hash Function FFT-Hash Presented at Crypto '91

  1991cited by this paper
• A Design Principle for Hash Functions

  1989cited by this paper
• How to construct random functions

  1986cited by this paper
• On Observing Nondeterminism and Concurrency

  1980cited by this paper

• ABBA: Lattice-based Commitments from Commutators

  2026cites this paper
• A High-Performance and Configurable NTT Accelerator Based on Scalable 2-D Architecture

  2026cites this paper
• MiNTT: A Family of Module Lattice-Based Cryptographic Compression Functions

  2026influential citation
• Efficient Hardware Implementation of the Lightweight CRYSTALS-Kyber

  2025cites this paper
• Secure Lattice-Based Signature Scheme for Internet of Things Applications

  2025cites this paper
• An Area-Time Efficient Hardware Architecture for ML-KEM Post-Quantum Cryptography Standard

  2025cites this paper
• A Fully Pipelined FIFO Based Polynomial Multiplication Hardware Architecture Based On Number Theoretic Transform

  2025cites this paper
• Architectures for Serial and Parallel Pipelined NTT-Based Polynomial Modular Multiplication

  2025cites this paper
• A Timing-Constrained Design Methodology for Radix- 2k NTT in Polynomial Arithmetic

  2025cites this paper
• Efficient NTT/INTT processor for FALCON post-quantum cryptography

  2025cites this paper
• Vive Galois! Part 1: Optimal SIMD Packing and Packed Bootstrapping for FHE

  2025cites this paper
• Low-Complexity NTT and INTT Structures via Twiddle Shifting

  2025cites this paper
• Towards Post-Quantum Verifiable Credentials

  2024cites this paper
• Discriminants of Number Fields

  2024cites this paper
• Efficient implementation of post quantum MLWR-based PKE scheme using NTT

  2024cites this paper
• Area and Power Efficient FFT/IFFT Processor for FALCON Post-Quantum Cryptography

  2024cites this paper
• An Area-Efficient, Conflict-Free, and Configurable Architecture for Accelerating NTT/INTT

  2024cites this paper
• Respire: High-Rate PIR for Databases with Small Records

  2024cites this paper
• High-performance montgomery modular multiplier with NTT and negative wrapped convolution

  2024cites this paper
• On-the-Fly Twiddle Factor Generator Design for Efficient Memory Management of Negative Wrapped Convolution

  2024cites this paper
• Vortex: A List Polynomial Commitment and its Application to Arguments of Knowledge

  2024cites this paper
• TOPCOAT: towards practical two-party Crystals-Dilithium

  2024cites this paper
• YPIR: High-Throughput Single-Server PIR with Silent Preprocessing

  2024cites this paper
• HMNTT: A Highly Efficient MDC-NTT Architecture for Privacy-preserving Applications

  2024cites this paper
• High-Speed NTT Accelerator for CRYSTAL-Kyber and CRYSTAL-Dilithium

  2024cites this paper
• Verifiable FHE via Lattice-based SNARKs

  2024cites this paper
• High-Efficiency Multi-Standard Polynomial Multiplication Accelerator on RISC-V SoC for Post-Quantum Cryptography

  2024cites this paper
• Optical data compression and hashing via 4f-based reconfigurable complex convolution module

  2024cites this paper
• Efficient Algorithm-Level Error Detection for Number-Theoretic Transform Used for Kyber Assessed on FPGAs and ARM

  2024cites this paper
• Quantum vs post-quantum security for future networks: Survey

  2024cites this paper
• Unified-pipelined NTT Architecture for Polynomial Multiplication in Lattice-based Cryptosystems

  2024cites this paper
• FHNTT: a flexible Number Theoretic Transform design based on hybrid-radix butterfly

  2024cites this paper
• Two-Message Authenticated Key Exchange from Public-Key Encryption

  2023cites this paper
• Post-Quantum Security: Opportunities and Challenges

  2023cites this paper
• KyberMat: Efficient Accelerator for Matrix-Vector Polynomial Multiplication in CRYSTALS-Kyber Scheme via NTT and Polyphase Decomposition

  2023cites this paper
• Revisiting Fast Fourier multiplication algorithms on quotient rings

  2023cites this paper
• HELiKs: HE Linear Algebra Kernels for Secure Inference

  2023cites this paper
• FastNTT: Design and Evaluation of Modular-Reduction Based Fast NTT Design on FPGA

  2023cites this paper
• Generating One-Hot Maps under Encryption

  2023cites this paper
• Performance of hierarchical transforms in homomorphic encryption: a case study on logistic regression inference

  2023cites this paper
• DiLizium 2.0: Revisiting 2-out-of-2 threshold Dilithium ∗

  2023cites this paper
• Michelson Interferometric Methods for Full Optical Complex Convolution

  2023cites this paper
• NTRU++: Compact Construction of NTRU Using Simple Encoding Method

  2023cites this paper
• PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic Encryption

  2023influential citation
• Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform [Lecture Notes]

  2023influential citation
• A fully classical LLL algorithm for modules

  2022cites this paper
• High-performance and Configurable SW/HW Co-design of Post-quantum Signature CRYSTALS-Dilithium

  2022cites this paper
• Hardware Design and Implementation of Post-Quantum Cryptography Kyber

  2022cites this paper
• Privacy-Preserving Post-quantum Credentials for Digital Payments

  2022influential citation
• The Influence of Public-Key Cryptography on Mathematics

  2022cites this paper
• Hashing for Secure Optical Information Compression in a Heterogeneous Convolutional Neural Network

  2022cites this paper
• BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications

  2022cites this paper
• Fast Implementation of Multiplication on Polynomial Rings

  2022cites this paper
• Faster Kyber and Dilithium on the Cortex-M4

  2022cites this paper
• SPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition

  2022cites this paper
• Vortex : Building a Lattice-based SNARK scheme with Transparent Setup

  2022cites this paper
• DiLizium 2.0: Revisiting Two-Party Crystals-Dilithium

  2022cites this paper
• High Efficient Architecture of Polynomial Multiplier with Variable Parameter Based on 2KNTT

  2022cites this paper
• LibSWIFFT - A fast C/C++ Library for the SWIFFT Secure Homomorphic Hash Function

  2021cites this paper
• A comprehensive review on collision-resistant hash functions on lattices

  2021cites this paper
• Efficient Lattice-Based Inner-Product Functional Encryption

  2021cites this paper
• Verifiable Decryption in the Head

  2021cites this paper
• Ring-LWE over two-to-power cyclotomics is not hard

  2021cites this paper
• High Performance Post-Quantum Key Exchange on FPGAs

  2021cites this paper
• Sublattice Attack on Poly-LWE with Wide Error Distributions

  2021cites this paper
• Short Identity-Based Signatures with Tight Security from Lattices

  2021cites this paper
• On Removing Rejection Conditions in Practical Lattice-Based Signatures

  2021cites this paper
• Quantum collision finding for homomorphic hash functions

  2021cites this paper
• Subset Attacks on Ring-LWE with Wide Error Distributions I

  2021cites this paper
• A Public Key Authentication and Privacy Preserving Model for Securing Healthcare System

  2021cites this paper
• DiLizium: A Two-Party Lattice-Based Signature Scheme

  2021cites this paper
• An Intermediate Secret-Guessing Attack on Hash-Based Signatures

  2021cites this paper
• Specifications and improvements of LPN solving algorithms

  2020cites this paper
• Improving the Efficiency of SVM Classification With FHE

  2020cites this paper
• A General-Purpose Number Theoretic Transform Algorithm for Compact RLWE Cryptoprocessors

  2020cites this paper
• CCA Updatable Encryption Against Malicious Re-encryption Attacks

  2020cites this paper
• Short Lattice Signatures in the Standard Model with Efficient Tag Generation

  2020cites this paper
• On the Security of Homomorphic Encryption on Approximate Numbers

  2020cites this paper
• A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem

  2020cites this paper
• A pure hardware implementation of CRYSTALS-KYBER PQC algorithm through resource reuse

  2020cites this paper
• An efficient and light weight polynomial multiplication for ideal lattice-based cryptography

  2020cites this paper
• Zero Knowledge Proofs for Decision Tree Predictions and Accuracy

  2020cites this paper
• An Ultra-Highly Parallel Polynomial Multiplier for the Bootstrapping Algorithm in a Fully Homomorphic Encryption Scheme

  2020cites this paper
• Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy

  2020cites this paper
• Sublattice Attacks on Ring-LWE with Wide Error Distributions I

  2020cites this paper
• A Privacy-Preserving Secure Framework for Electric Vehicles in IoT Using Matching Market and Signcryption

  2020cites this paper
• Mathematical Aspects of Computer and Information Sciences: 8th International Conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019, Revised Selected Papers

  2020cites this paper
• Lattice‐Based Cryptography and Internet of Things

  2020cites this paper
• Hierarchical Identity-Based Signature in Polynomial Rings

  2020cites this paper
• Learning with Physical Noise or Errors

  2020cites this paper
• Efficient and Secure Implementation of NTRUEncrypt Using Signed Sliding Window Method

  2020cites this paper
• NTTRU: Truly Fast NTRU Using NTT ∗

  2019cites this paper
• Collision Resistant Hashing from Sub-exponential Learning Parity with Noise

  2019cites this paper
• When NTT Meets Karatsuba: Preprocess-then-NTT Technique Revisited

  2019cites this paper
• Advances in Cryptology – ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part I

  2019cites this paper
• Analyzing Progressive-BKZ Lattice Reduction Algorithm

  2019influential citation
• FPGA Implementation and Comparison of Protections Against SCAs for RLWE

  2019cites this paper
• Accelerating an FHE Integer Multiplier Using Negative Wrapped Convolution and Ping-Pong FFT

  2019influential citation
• Accountable Tracing Signatures from Lattices

  2019cites this paper
• K2SN-MSS: An Efficient Post-Quantum Signature

  2019influential citation