Results 101 to 110 of about 380,993 (266)
Energy-efficient cryptographic primitives
Facta universitatis - series: Electronics and Energetics, 2018 Our society greatly depends on services and applications provided by mobile communication networks. As billions of people and devices become connected, it becomes increasingly important to guarantee security of interactions of all players. In this talk we address several aspects of this important, many-folded problem.
openaire +3 more sources
Mem‐Transistor‐Based Gaussian Error–Generating Hardware for Post‐Quantum Cryptography Applications
Advanced Quantum Technologies, Volume 8, Issue 3, March 2025.The demonstration of a Gaussian error sampler system that leverages the intrinsic stochastic characteristics of mem‐transistor semiconductor devices. The demonstrated Gaussian error sampler significantly reduces computational and memory overhead compared to existing techniques.
Moon‐Seok Kim +3 more
wiley +1 more source
Notions of Reducibility between Cryptographic Primitives [PDF]
, 2004 Starting with the seminal paper of Impagliazzo and Rudich [17], there has been a large body of work showing that various cryptographic primitives cannot be reduced to each other via “black-box” reductions. The common interpretation of these results is that there are inherent limitations in using a primitive as a black box, and that these impossibility ...
Salil Vadhan +2 more
openaire +1 more source
, 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
Design and Analysis of a True Random Number Generator Based on GSR Signals for Body Sensor Networks
Sensors, 2019 Today, medical equipment or general-purpose devices such as smart-watches or smart-textiles can acquire a person’s vital signs. Regardless of the type of device and its purpose, they are all equipped with one or more sensors and often have wireless
Carmen Camara +3 more
doaj +1 more source
Lower Bounds on Signatures from Symmetric Primitives [PDF]
, 2019 We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorithms ...
Barak, Boaz, Mahmoody, Mohammad
core +1 more source
A Novel DNA Techniques to Strengthen Cryptographic Permutation Tables in Encryption Algorithm
IEEE AccessCryptography has long safeguarded sensitive data within information security. Recently, integrating traditional cryptographic methods with Deoxyribonucleic Acid (DNA) technologies sparked interest, giving rise to DNA cryptography.
Nik Azura Nik Abdullah +4 more
doaj +1 more source
On the composable security of weak coin flipping [PDF]
QuantumWeak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed from noiseless
Jiawei Wu +3 more
doaj +1 more source
The Effect of the Primitive Irreducible Polynomial on the Quality of Cryptographic Properties of Block Ciphers [PDF]
, 2020 Sajjad Shaukat Jamal +3 more
openalex +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.
Giechaskiel, I, Cremers, C, Rasmussen, K
openaire +2 more sources