Results 101 to 110 of about 26,436 (209)
The implantation of Remote Electronic Voting (REV) systems to Electoral Processes is happening at a slower pace than anticipated. One of the relevant factors explaining that reality is the lack of studies about the Cryptographic Schemes and Primitives ...
Marcos del Blanco David Yeregui +2 more
doaj +1 more source
A growing number of advanced cryptographic protocols and constructions rely on symmetric primitives known as weak pseudo-random functions (wPRFs). These functions differ significantly from traditional PRFs: they operate in constrained models where ...
Christina Boura +3 more
doaj +1 more source
Lower Bounds on Signatures from Symmetric Primitives [PDF]
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
OPTIMIZED REPRESENTATIONS IN CRYPTOGRAPHIC PRIMITIVES
This work focuses on optimization of cryptographic primitives both in theory and in applications. From a theoretical point of view, it addresses the problem of speeding up the polynomial multiplication used in Post-Quantum cryptosystems such as NTRU and McEliece. In particular, the latter extensively uses Galois fields whose elements can be represented
openaire +2 more sources
Automated Generation of Fault-Resistant Circuits
Fault Injection (FI) attacks, which involve intentionally introducing faults into a system to cause it to behave in an unintended manner, are widely recognized and pose a significant threat to the security of cryptographic primitives implemented in ...
Nicolai Müller, Amir Moradi
doaj +1 more source
Cryptographic primitives based on compact knapsack problem
In the present paper, we extend previous results of an id scheme based on compact knapsack problem defined by one equation. We present a sound three-move id scheme based on compact knapsack problem defined by an integer matrix. We study this problem by providing attacks based on lattices.
George S. Rizos +1 more
openaire +2 more sources
A Survey on the Quantum Security of Block Cipher-Based Cryptography
The development of quantum computers represents an important advancement in computing, using quantum mechanics to address problems that were previously difficult to solve. This technological advancement poses a challenge for cryptographic systems.
S. E. Bootsma, M. De Vries
doaj +1 more source
AI-driven adaptive adversaries and the erosion of cryptographic trust in public key systems
This paper examines the erosion of Public Key Cryptography (PKC) security under adaptive adversarial optimisation driven by artificial intelligence. The problem addressed is the growing mismatch between algorithm-centric cryptographic security models and
Petar Radanliev
doaj +1 more source
Post-Quantum Key Exchange in TLS 1.3: Further Analysis on Performance of New Cryptographic Standards
The emergence of quantum computing presents a significant threat to classical cryptographic primitives, particularly those employed in securing internet communications via widely used protocols such as Transport Layer Security (TLS).
Konstantina Souvatzidaki +1 more
doaj +1 more source
An Algebraic Approach to Symmetric Linear Layers in Cryptographic Primitives
Subroto RC.
europepmc +1 more source

