Results 1 to 10 of about 130 (55)
ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS [PDF]
Barekeng, 2023 NTRU is a lattice-based public-key cryptosystem designed by Hoffstein, Pipher, and Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Fadila Paradise, Kiki Ariyanti Sugeng
doaj +4 more sources
Polynomial equation in algebraic attack on NTRU-HPS and NTRU-HRSS [PDF]
ITM Web of ConferencesNTRU is a lattice-based public-key cryptosystem designed by Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Paradise Fadila, Sugeng Kiki Ariyanti
doaj +2 more sources
A One-Time Single-bit Fault Leaks All Previous NTRU-HRSS Session Keys to a Chosen-Ciphertext Attack [PDF]
, 2022 This paper presents an efficient attack that, in the standard IND-CCA2 attack model plus a one-time single-bit fault, recovers the NTRU-HRSS session key. This type of fault is expected to occur for many users through natural DRAM bit flips.
Daniel J. Bernstein
openaire +3 more sources
Small Leaks Sink a Great Ship: An Evaluation of Key Reuse Resilience of PQC Third Round Finalist NTRU-HRSS [PDF]
, 2021 NTRU is regarded as an appealing finalist due to its long history against all known attacks and relatively high efficiency. In the third round of NIST competition, the submitted NTRU cryptosystem is the merger of NTRU-HPS and NTRU-HRSS. In 2019, Ding et al. have analyzed the case when the public key is reused for the original NTRU scheme. However, NTRU-
Xiaohan Zhang, Chi Cheng, Ruoyu Ding
openaire +3 more sources
NTT Multiplication for NTT-unfriendly Rings
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, we show how multiplication for polynomial rings used in the NIST PQC finalists Saber and NTRU can be efficiently implemented using the Number-theoretic transform (NTT).
Chi-Ming Marvin Chung +5 more
doaj +1 more source
New NTRU Records with Improved Lattice Bases [PDF]
, 2023 The original NTRU cryptosystem from 1998 can be considered the starting point of the great success story of lattice-based cryptography. Modern NTRU versions like NTRU-HPS and NTRU-HRSS are round-3 finalists in NIST\u27s selection process, and also ...
Alexander May +2 more
core
High-Speed Hardware Architectures and FPGA Benchmarking of CRYSTALS-Kyber, NTRU, and Saber [PDF]
, 2021 Performance in hardware has typically played a significant role in differentiating among leading candidates in cryptographic standardization efforts. Winners of two past NIST cryptographic contests (Rijndael in case of AES and Keccak in case of SHA-3 ...
Kamyar Mohajerani +2 more
core
Leaking-Cascade: an Optimal Construction for KEM Hybridization [PDF]
, 2023 Hybrid post-quantum cryptography is a cautious approach that aims to guard against the threat posed by the quantum computer, through the simultaneous use of Post-Quantum (PQ) and classical (i.e. pre-quantum) cryptosystems, should the post-quantum schemes
Ange Martinelli +2 more
core
Quantum-Safe Cryptography Readiness in Enterprise Networks: Challenges and Roadmap [PDF]
, 2021 With advancements in quantum computing, existing public-key cryptographic standards such as RSA and Elliptic Curve Cryptography (ECC) face an impending risk of obsolescence.
Tunji, Babatunde
core
Too Many Hints - When LLL Breaks LWE [PDF]
, 2023 All modern lattice-based schemes build on variants of the LWE problem. Information leakage of the LWE secret $\mathbf s \in \mathbb{Z}_q^n$ is usually modeled via so-called hints, i.e., inner products of $\mathbf s$ with some (random, but known) vector.
Alexander May, Julian Nowakowski
core