FFT program generation for ring LWE-based cryptography

DOI10.1007/978-3-030-85987-9_9zbMATH Open1496.94060OpenAlexW3196999409MaRDI QIDQ2128754FDOQ2128754

Authors: 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

Recommendations

• Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
• On the design of hardware building blocks for modern lattice-based encryption schemes
• Compact ring-LWE cryptoprocessor
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• NFLlib: NTT-Based Fast Lattice Library

zbMATH Keywords

fast Fourier transformring learning with errors

Mathematics Subject Classification ID

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

Cites Work

• NFLlib: NTT-Based Fast Lattice Library
• On ideal lattices and learning with errors over rings
• Introduction to algorithms.
• Modular Multiplication Without Trial Division
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• Software speed records for lattice-based signatures
• Typed Tagless Final Interpreters
• Compact ring-LWE cryptoprocessor

Cited In (4)

• Fast Fourier orthogonalization
• Unified program generation and verification: a case study on number-theoretic transform
• Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
• On the design of hardware building blocks for modern lattice-based encryption schemes

Uses Software

• OCaml
• NFLlib

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128754)