Results 121 to 130 of about 2,231 (134)

Single-Trace Side-Channel Attacks on ω-Small Polynomial Sampling: With Applications to NTRU, NTRU Prime, and CRYSTALS-DILITHIUM

2021 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), 2021
This paper proposes a new single-trace side-channel attack on lattice-based post-quantum protocols. We target the ω-small polynomial sampling of NTRU, NTRU Prime, and CRYSTALS-DILITHIUM algorithm implementations (which are NIST Round-3 finalist and alternative candidates), and we demonstrate the vulnerabilities of their sub-routines to a power-based ...
Karabulut, Emre, Alkım, Erdem, Aysu, Aydin   +2 more
openaire   +2 more sources

Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation

Journal of Cryptographic Engineering, 2022
Efficient computation of polynomial multiplication over characteristic three fields is required for post-quantum cryptographic applications which gain importance upon the recent advances in quantum computers. In this paper, we propose three new polynomial multiplication algorithms over F-3 and show that they are more efficient than the current state-of-
Esra Yeniaras, Murat Cenk
openaire   +2 more sources

A Constant Time Full Hardware Implementation of Streamlined NTRU Prime

2021
This paper presents a constant time hardware implementation of the NIST round 2 post-quantum cryptographic algorithm Streamlined NTRU Prime. We implement the entire KEM algorithm, including all steps for key generation, encapsulation and decapsulation, and all en- and decoding. We focus on optimizing the resources used, as well as applying optimization
openaire   +1 more source

NTRU Prime

2017
Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems.
Bernstein, Daniel J., Chuengsatiansup, Chitchanok, Lange, Tanja, Vredendaal, Christine van   +3 more
openaire   +1 more source

Secure and efficient hardware implementations of NTRU Prime

Streamlined NTRU Prime ist ein Kryptographischer Algorithmus mit dem Ziel, das Risiko von gitterbasiertem KEM zu senken, bei einer nur niedrigem Leistungseinbuße. Wir untersuchen, inwieweit diese Leistungseinbußen auch für Hardwareimplementierungen gelten und ob wir diese mit spezialisierten Designs weiter mindern können.
openaire   +1 more source

Efficient NTT Multiplier of NTRU Prime PQC Algorithm

2023
Salarifard, Raziyeh, Rashidian, Reza, Kharazmi, Reyhaneh, Jahanian, Ali   +3 more
openaire   +1 more source

A Proposal for Efficient Multiplication and Inverse Calculation in Streamlined NTRU Prime

2023 International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan), 2023
Masakazu Awakiahra, Jun Miura, Md. Arshad Ali, Takuya Kusaka, Yasuyuki Nogami, Yuta Kodera   +5 more
openaire   +1 more source

Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime

2022
Esra Yeniaras, Murat Cenk
openaire   +1 more source

ANALYSIS OF ASYMMETRIC NTRU PRIME IIT UKRAINE ENCRYPTION ALGORITHM WITH REGARDS TO KNOWN ATTACKS

Telecommunications and Radio Engineering, 2018
I. D. Gorbenko, O. G. Kachko, M. V. Yesina   +2 more
openaire   +1 more source

CALCULATION OF GENERAL PARAMETERS FOR NTRU PRIME UKRAINE OF 6-7 LEVELS OF STABILITY

Telecommunications and Radio Engineering, 2019
I. D. Gorbenko, A. N. Alekseychuk, O. G. Kachko, M. V. Yesina, I. V. Stelnik, S. O. Kandy, V. A. Bobukh, V. A. Ponomar   +7 more
openaire   +1 more source