High-Speed Masking for Polynomial Comparison in Lattice-based KEMs
With the NIST post-quantum standardization competition entering the second round, the interest in practical implementation results of the remaining NIST candidates is steadily growing. Especially implementations on embedded devices are often not protected against side-channel attacks, such as differ...
Main Authors: | Florian Bache, Clara Paglialonga, Tobias Oder, Tobias Schneider, Tim Güneysu |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2020-06-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/8598 |
Similar Items
-
Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
by: SangWoo An, et al.
Published: (2020-10-01) -
ISA Extensions for Finite Field Arithmetic
by: Erdem Alkim, et al.
Published: (2020-06-01) -
Boolean Masking for Arithmetic Additions at Arbitrary Order in Hardware
by: Florian Bache, et al.
Published: (2022-02-01) -
High-order Polynomial Comparison and Masking Lattice-based Encryption
by: Jean-Sébastien Coron, et al.
Published: (2022-11-01) -
Efficient NewHope Cryptography Based Facial Security System on a GPU
by: Phap Duong-Ngoc, et al.
Published: (2020-01-01)