Results 91 to 100 of about 158 (122)

Post-quantum healthcare: A roadmap for cybersecurity resilience in medical data. [PDF]

open access: yesHeliyon
SaberiKamarposhti M   +6 more
europepmc   +1 more source

Efficient Multiplier and FPGA Implementation for NTRU Prime

2021 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), 2021
As quantum computing age is emerging on horizon, many of the current cryptography standards, e.g., RSA and Elliptic Curve Cryptography, are shown to be compromised under quantum attacks according to Shor's algorithm. A multiple-round competition has been launched by NIST to decide the next generation post-quantum cryptography (PQC) standards since 2017.
Huapeng Wu
exaly   +2 more sources

A Constant Time Full Hardware Implementation of Streamlined NTRU Prime

Lecture Notes in Computer Science, 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
Adrian Marotzke
exaly   +3 more sources

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 ...
Erdem Alkim
exaly   +4 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-
Murat Cenk, Esra Yeniaras, Cenk Murat
exaly   +4 more sources

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

2023 International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan), 2023
Yasuyuki Nogami, Yuta Kodera
exaly   +2 more sources

FPTRU: Optimization of NTRU-Prime and TLS Performance Assessment

Lecture Notes in Computer Science
Yunlei Zhao, Xiaowen Hu, Zhao Yunlei
exaly   +2 more sources

Home - About - Disclaimer - Privacy