On using RSA/ECC coprocessor for ideal lattice-based key exchange

DOI10.1007/978-3-030-89915-8_10zbMath1492.94117OpenAlexW3208784582MaRDI QIDQ2145301

Guénaël Renault, Simon Montoya, Aurélien Greuet

Publication date: 17 June 2022

Full work available at URL: https://hal.inria.fr/hal-03330066/file/HWPolMult.pdf

zbMATH Keywords

polynomial multiplicationlattice-based cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Faster polynomial multiplication via multipoint Kronecker substitution
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• Saber on ESP32
• Additively Homomorphic Ring-LWE Masking
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Power Analysis Attacks

This page was built for publication: On using RSA/ECC coprocessor for ideal lattice-based key exchange