The matrix reloaded: multiplication strategies in FrodoKEM

DOI10.1007/978-3-030-92548-2_5zbMath1504.94108OpenAlexW3176335429MaRDI QIDQ2149815

Joost Renes, Tobias Schneider, Maximilian Ofner, Christine van Vredendaal, Joppe W. Bos

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92548-2_5

zbMATH Keywords

matrix multiplicationpost-quantum cryptographysoftware implementationStrassen algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Uses Software

• BLIS
• GitHub
• Saber
• FrodoKEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• NTRU prime: reducing attack surface at low cost
• Worst-case to average-case reductions for module lattices
• Gaussian elimination is not optimal
• A Decade of Lattice Cryptography
• (Leveled) fully homomorphic encryption without bootstrapping
• BLIS: A Framework for Rapidly Instantiating BLAS Functionality
• Batch Verification of ECDSA Signatures
• Anatomy of high-performance matrix multiplication
• On Ideal Lattices and Learning with Errors over Rings
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• Pseudorandomness of ring-LWE for any ring and modulus
• Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials
• On lattices, learning with errors, random linear codes, and cryptography