Saber on ESP32

DOI10.1007/978-3-030-57808-4_21OpenAlexW3082903256MaRDI QIDQ2229290

Yingshan Yang, Xiaozhuo Gu, Bin Wang

Publication date: 23 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_21

zbMATH Keywords

efficient implementationpost-quantum cryptographySaberESP32

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items (1)

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

Uses Software

• FreeRTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster polynomial multiplication via multipoint Kronecker substitution
• Fast multiplication of polynomials over fields of characteristic 2
• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• A modular analysis of the Fujisaki-Okamoto transformation
• Faster multiplication in \(\mathbb{Z}_{2^m}[x\) on Cortex-M4 to speed up NIST PQC candidates]
• Fast polynomial transform algorithms for digital convolution
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: Saber on ESP32