Acceleration of modular arithmetic in post-quantum signature schemes
Since the discovery of the Shor quantum algorithm, capable of solving factorization and discrete logarithm problems in polynomial time, post-quantum cryptographic algorithms have been actively developed. Although some of the post-quantum algorithms have already been standardized by NIST, an importan...
Saved in:
| Main Authors: | Igor Y. Zhukov, Vitaliy G. Ivanenko, Irina D. Ivanova, Nina D. Ivanova |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2024-11-01
|
| Series: | Безопасность информационных технологий |
| Subjects: | |
| Online Access: | https://bit.spels.ru/index.php/bit/article/view/1718 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes
by: Shaik Ahmadunnisa, et al.
Published: (2024-12-01) -
More on Codes Over Finite Quotients of Polynomial Rings
by: Emad Kadhim Al-Lami, et al.
Published: (2025-01-01) -
CDBS: blind signature scheme based on CRYSTALS-Dilithium algorithm
by: YANG Yatao, et al.
Published: (2024-07-01) -
Post-quantum encryption technology based on BRLWE for internet of things
by: Yitian GAO, et al.
Published: (2022-10-01) -
Generalized Centered Binomial Distribution for Bimodal Lattice Signatures
by: Seungwoo Lee, et al.
Published: (2025-01-01)