Results 51 to 60 of about 367,345 (251)
Secure Single-Server Aggregation with (Poly)Logarithmic Overhead
IACR Cryptology ePrint Archive, 2020 Secure aggregation is a cryptographic primitive that enables a server to learn the sum of the vector inputs of many clients. Bonawitz et al. (CCS 2017) presented a construction that incurs computation and communication for each client linear in the ...
James Bell +4 more
semanticscholar +1 more source
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
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.This paper addresses the limitations of existing conditional privacy‐preserving authentication (CPPA) schemes in vehicular ad hoc networks (VANETs), which are either computationally heavy or vulnerable to quantum attacks. It proposes a multi‐aggregator lattice‐based CPPA (MA‐LCPPA) framework that distributes verification across multiple roadside units ...
Adi El‐Dalahmeh, Jie Li
wiley +1 more source
The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.
Ìнформаційні технології в освіті, 2009 An iterative algorithm used with variable block size of public key encryption, multiple 32-m bits. Encrypt text runs in steps. As cryptographic primitives are used: stochastic scrolling block, bi-directional sliding coding, nonlinear and stochastic ...
A. Beletsky, A. Beletsky
doaj
One-time memory from isolated Majorana islands
New Journal of Physics, 2022 A one-time memory (OTM) stores two bits such that either bit can be retrieved, but not both. One-time memories have been shown to allow for secure classical and quantum computations.
Sourav Kundu, Ben Reichardt
doaj +1 more source
A Comprehensive and Reproducible Comparison of Cryptographic Primitives Execution on Android Devices [PDF]
, 2021 Aleksandr Ometov +4 more
openalex +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.For nonzero coprime integers a and b, a positive integer l is said to be good with respect to a and b if there exists a positive integer k such that l divides ak + bk. Since the early 1990s, the notion of good integers has attracted considerable attention from researchers. This continued interest stems from both their elegant number‐theoretic structure
Somphong Jitman, Anwar Saleh Alwardi
wiley +1 more source
Magnetic Unclonable Functions Leveraging Remanence and Anhysteretic States
Advanced Functional Materials, Volume 35, Issue 52, December 23, 2025.A micrometric array of magnetic pillars provides a stable and unclonable hardware for generating cryptographic keys. From a single device, the ability is demonstrated to produce a 470‐bit key while also offering a reconfigurable mode of operation.
Alessandro Magni +6 more
wiley +1 more source
Memristive crypto primitive for building highly secure physical unclonable functions
Scientific Reports, 2015 Physical unclonable functions (PUFs) exploit the intrinsic complexity and irreproducibility of physical systems to generate secret information. The advantage is that PUFs have the potential to provide fundamentally higher security than traditional ...
Yansong Gao +4 more
semanticscholar +1 more source
THE TABULAR OF CRYPTOGRAPHIC PRIMITIVES OF NONLINEAR SUBSTITUTIONS
Ìнформаційні технології в освіті, 2015 Classic primitives nonlinear substitution is a simple replacing each character encrypted text on a fixed symbol of the same alphabet, actually realizing the transformation one alphabet simple substitution cipher. And as a consequence - the entropy cipher
A. Beletsky
doaj