Results 121 to 130 of about 343 (170)

A critical analysis of deployed use cases for quantum key distribution and comparison with post-quantum cryptography. [PDF]

EPJ Quantum Technol
Aquina N, Cimoli B, Das S, Hövelmanns K, Weber FJ, Okonkwo C, Rommel S, Škorić B, Tafur Monroy I, Verschoor S.   +9 more
europepmc   +1 more source

Secure quantum-resilient smart city communication networks using QSC-Net with MF-MBO-based energy-aware task scheduling. [PDF]

Sci Rep
Reddy NR, Dalton GA, Swathi K, Subrahmanyam DVSS, G LK, Nagaraju G.   +5 more
europepmc   +1 more source

Enhancing Cloud-Based Healthcare Security With Quantum-Secure HealthChain: A Quantum Computing and Blockchain Integrated Framework. [PDF]

Health Sci Rep
Bose R, Mondal S, Sutradhar S, Das S, Faheem M, Roy S, Ahmad Khan A.   +6 more
europepmc   +1 more source

A hybrid multi-node QKD-ECC architecture for securing IoT networks. [PDF]

Sci Rep
Chaturvedi R, Sahu D, Singh BP, Prakash S, Yang T, Rathore RS, Cengiz K, Ivković N.   +7 more
europepmc   +1 more source

SRAM based Gaussian noise generation for post quantum cryptography. [PDF]

Sci Rep
Kim MS, Jeon SB, Kim S.
europepmc   +1 more source

Cybersecuity Analysis of a Telemedicine Platform. [PDF]

Healthcare (Basel)
Nobili M, Raguseo D, Setola R.
europepmc   +1 more source

The pivotal role of software defined networks to safeguard against cyber attacks: a comprehensive review. [PDF]

PeerJ Comput Sci
Aljughaiman A, Almarri S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

NTRU+: Compact Construction of NTRU Using Simple Encoding Method

IEEE Transactions on Information Forensics and Security, 2023
Jonghyun Kim, Jong Hwan Park
exaly   +3 more sources

On the Hardness of the NTRU Problem

2021
The 25 year-old NTRU problem is an important computational assumption in public-key cryptography. However, from a reduction perspective, its relative hardness compared to other problems on Euclidean lattices is not well-understood. Its decision version reduces to the search Ring-LWE problem, but this only provides a hardness upper bound.We provide two ...
Pellet-Mary, Alice, Stehlé, Damien
openaire   +3 more sources

HPMA-NTRU: High-Performance Polynomial Multiplication Accelerator for NTRU

2022 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), 2022
Along the rapid development of large-scale quantum computers, post-quantum cryptography (PQC) has drawn significant attention from research community recently as it is proven that the existing public-key cryptosystems are vulnerable to the quantum attacks.
He, Pengzhou, Tu, Yazheng, Khalid, Ayesha, O'Neill, Maire, Xie, Jiafeng   +4 more
openaire   +2 more sources