Platform for Testing and Evaluation of PUF and TRNG Implementations in FPGAs [PDF]
, 2016 Implementation of cryptographic primitives like Physical Unclonable Functions (PUFs) and True Random Number Generators (TRNGs) depends significantly on the underlying hardware.
Drutarovsky, Milos +3 more
core +1 more source
A Cipher-Agnostic Neural Training Pipeline with Automated Finding of Good Input Differences
IACR Transactions on Symmetric Cryptology, 2023 Neural cryptanalysis is the study of cryptographic primitives through machine learning techniques. Following Gohr’s seminal paper at CRYPTO 2019, a focus has been placed on improving the accuracy of such distinguishers against specific primitives, using
Emanuele Bellini +3 more
doaj +1 more source
Post-quantum cryptographic hardware primitives [PDF]
, 2020 The development and implementation of post-quantum cryptosystems have become a pressing issue in the design of secure computing systems, as general quantum computers have become more feasible in the last two years.
Agrawal, Rashmi +3 more
core
APTE: An Algorithm for Proving Trace Equivalence [PDF]
, 2014 This paper presents APTE, a new tool for automatically proving the security of cryptographic protocols. It focuses on proving trace equivalence between processes, which is crucial for specifying privacy type properties such as anonymity and unlinkability.
B. Blanchet +5 more
core +1 more source
Enhancing quantum cryptography with quantum dot single-photon sources
npj Quantum Information, 2022 Quantum cryptography harnesses quantum light, in particular single photons, to provide security guarantees that cannot be reached by classical means. For each cryptographic task, the security feature of interest is directly related to the photons’ non ...
Mathieu Bozzio +9 more
doaj +1 more source
On Pseudorandomness and Deep Learning: A Case Study
Applied Sciences, 2023 Pseudorandomness is a crucial property that the designers of cryptographic primitives aim to achieve. It is also a key requirement in the calls for proposals of new primitives, as in the case of block ciphers. Therefore, the assessment of the property is
Zahra Ebadi Ansaroudi +2 more
doaj +1 more source
Lengths May Break Privacy – Or How to Check for Equivalences with Length [PDF]
, 2013 Security protocols have been successfully analyzed using symbolic models, where messages are represented by terms and protocols by processes. Privacy properties like anonymity or untraceability are typically expressed as equivalence between processes ...
A. Armando +4 more
core +4 more sources
Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols
IACR Transactions on Symmetric Cryptology, 2020 While traditional symmetric algorithms like AES and SHA-3 are optimized for efficient hardware and software implementations, a range of emerging applications using advanced cryptographic protocols such as multi-party computation and zero knowledge proofs
Abdelrahaman Aly +3 more
doaj +1 more source
A Statistical Inference Attack on Privacy-Preserving Biometric Identification Scheme
IEEE Access, 2021 Biometric identification allows people to be identified by their unique physical characteristics. Among such schemes, fingerprinting is well-known for biometric identification.
Dongmin Kim, Kee Sung Kim
doaj +1 more source
Data Minimisation in Communication Protocols: A Formal Analysis Framework and Application to Identity Management [PDF]
, 2014 With the growing amount of personal information exchanged over the Internet, privacy is becoming more and more a concern for users. One of the key principles in protecting privacy is data minimisation. This principle requires that only the minimum amount
de Weger, Benne +2 more
core +1 more source