Results 11 to 20 of about 408,401 (216)
Verification of a Cryptographic Primitive
ACM Transactions on Programming Languages and Systems, 2015 This article presents a full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of functional correctness in the Coq proof assistant, using the Verifiable C program logic.
Andrew W. Appel
semanticscholar +2 more sources
Multipurpose Cryptographic Primitive ARMADILLO3 [PDF]
Smart Card Research and Advanced Application Conference, 2012 This paper describes a new design of the multipurpose cryptographic primitive ARMADILLO3 and analyses its security. The ARMADILLO3 family is oriented on small hardware such as smart cards and RFID chips. The original design ARMADILLO and its variants were analyzed by Sepehrdad et al.
Petr Susil, Serge Vaudenay
semanticscholar +5 more sources
Cryptographic primitives based on cellular transformations [PDF]
Computer Science Journal of Moldova, 2003 Design of cryptographic primitives based on the concept of cellular automata (CA) is likely to be a promising trend in cryptography. In this paper, the improved method performing data transformations by using invertible cyclic CAs (CCA) is considered ...
B.V. Izotov
doaj +3 more sources
Non-cryptographic primitive for pseudorandom permutation [PDF]
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T. Iwata, Tomonobu Yoshino, K. Kurosawa
semanticscholar +2 more sources
On the Use of GF-Inversion as a Cryptographic Primitive [PDF]
ACM Symposium on Applied Computing, 2003 Inversion in Galois Fields is a famous primitive permutation for designing cryptographic algorithms e.g. for Rijndael because it has suitable differential and linear properties. Inputs and outputs are usually transformed by addition (e.g. XOR) to key bits. We call this construction the APA (Add-Permute-Add) scheme.
Kazumaro Aoki, Serge Vaudenay
semanticscholar +3 more sources
On the Design of Cryptographic Primitives [PDF]
Acta Applicandae Mathematicae, 2006 The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol design. In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic ...
Pino Caballero-Gil +1 more
openaire +3 more sources
Uncloneable Cryptographic Primitives with Interaction
CoRR, 2023 44 pages, 3 ...
Anne Broadbent, Eric Culf
openaire +2 more sources
Experimental cheat-sensitive quantum weak coin flipping
Nature Communications, 2023 Quantum-enhanced versions of weak coin flipping (a cryptographic primitive where two mistrustful parties agree on a random bit while favouring opposite outcomes) have been proposed in the past but never realised.
Simon Neves +5 more
doaj +1 more source
New number-theoretic cryptographic primitives [PDF]
Journal of Mathematical Cryptology, 2020 Abstract This paper introduces new p r q -based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not
Brier Éric +3 more
openaire +4 more sources
IEEE Access, 2022 Cloud Computing has proved to be a boon for many individuals and organizations who cannot afford infrastructure and maintenance cost of resources. But the untrusted nature of Cloud Server (CS) brings many challenges related to security and trust.
Smita Chaudhari, Gandharba Swain
doaj +1 more source