FFT program generation for ring LWE-based cryptography

DOI10.1007/978-3-030-85987-9_9zbMath1496.94060OpenAlexW3196999409MaRDI QIDQ2128754

Masahiro Masuda, Yukiyoshi Kameyama

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85987-9_9

zbMATH Keywords

fast Fourier transformring learning with errors

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

Unified program generation and verification: a case study on number-theoretic transform

Uses Software

• OCaml
• NFLlib

Cites Work

• Unnamed Item
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• NFLlib: NTT-Based Fast Lattice Library
• Modular Multiplication Without Trial Division
• On Ideal Lattices and Learning with Errors over Rings
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• Typed Tagless Final Interpreters
• Software Speed Records for Lattice-Based Signatures
• Compact Ring-LWE Cryptoprocessor

This page was built for publication: FFT program generation for ring LWE-based cryptography