Results 91 to 100 of about 23,331 (249)
Secure Authentication via Quantum Physical Unclonable Functions: A Review
Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.This in‐depth review article examines the origins, development, and evolution of Quantum Physical Unclonable Functions (QPUFs), with a particular focus on their use in secure authentication. The topic is motivated and introduced in detail, addressing both theoretical foundations and practical implementations, and is supported by a systematic article ...
Pol Julià Farré +8 more
wiley +1 more source
Certifying RSA public keys with an efficient NIZK [PDF]
, 2018 In many applications, it is important to verify that an RSA public key ( N,e ) specifies a permutation, in order to prevent attacks due to adversarially-generated public keys.
Balditimsi, Foteini +3 more
core
Blockchain in Communication Networks: A Comprehensive Review
IET Blockchain, Volume 6, Issue 1, January/December 2026.This article provides a comprehensive review of blockchain applications in communication networks, focusing on domains such as IoT, 5G, vehicular systems, and decentralised trust infrastructures. It examines key challenges—including scalability, interoperability, and latency—and outlines future directions such as lightweight consensus protocols and AI ...
Quazi Mamun, Zhenni Pan, Jun Wu
wiley +1 more source
Improving Physically Unclonable Functions’ Performance Using Second-Order Compensated Measurement
InformationIn this paper, we study the performance of second-order compensated measurement to generate a multi-bit response in physically unclonable functions (PUFs).
Jorge Fernández-Aragón +5 more
doaj +1 more source
Post-quantum signature algorithms based on the hidden discrete logarithm problem [PDF]
Computer Science Journal of Moldova, 2018 New options of the hidden discrete logarithm problem are proposed as cryptographic primitive of the post-quantum signature algorithms. Two signature schemes using computations in finite non-commutative algebras with associative multiplication operation
A.A. Moldovyan, N.A. Moldovyan
doaj
, 2010 Linear Finite State Machines (LFSMs) are particular primitives widely used in information theory, coding theory and cryptography. Among those linear automata, a particular case of study is Linear Feedback Shift Registers (LFSRs) used in many ...
Arnault, François +3 more
core +1 more source
Using Simon's Algorithm to Attack Symmetric-Key Cryptographic Primitives [PDF]
, 2017 We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon's algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives ...
Santoli, Thomas, Schaffner, Christian
core +1 more source
IET Blockchain, Volume 6, Issue 1, January/December 2026.Components of the Plonk System. ABSTRACT The promise of blockchain applications is transformative in terms of certificate verification and managing digital identities in the various fields, such as education, healthcare and land records. Nevertheless, current blockchain‐based certificate solutions have serious shortcomings: most are based on simple ...
Rajesh Bose +6 more
wiley +1 more source
On Bitcoin Security in the Presence of Broken Cryptographic Primitives [PDF]
, 2016 Digital currencies like Bitcoin rely on cryptographic primitives to operate. However, past experience shows that cryptographic primitives do not last forever: increased computational power and advanced cryptanalysis cause primitives to break frequently, and motivate the development of new ones.
Ilias Giechaskiel +2 more
openaire +1 more source