Results 1 to 10 of about 375,459 (282)
On the Design of Cryptographic Primitives [PDF]
Acta Applicandae Mathematicae, 2010 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.
Amparo Fúster-Sabater +10 more
core +6 more sources
A cryptographic primitive based on hidden-order groups [PDF]
Journal of Mathematical Cryptology, 2009 Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known.
Saxena Amitabh, Soh Ben
doaj +4 more sources
A Novel Design of Cryptographic SP-Network Based on Gold Sequences and Chaotic Logistic Tent System
IEEE Access, 2019 Substitution permutation network (SP-network) is a chain of linked mathematical primitives used in block cipher algorithms. The proposed novel design of cryptographic SP-network consists of three cryptographic primitives: substitution box, permutation ...
Muhammad Fahad Khan, Khalid Saleem
exaly +4 more sources
A language-dependent cryptographic primitive [PDF]
Journal of Cryptology, 1997 In this paper we provide a new cryptographic primitive that generalizes several existing zero-knowledge proofs and show that if a languageL induces the primitive, then there exists a perfect zero-knowledge proof forL. In addition, we present several kinds of languages inducing the primitive, some of which are not known to have a perfect zero-knowledge ...
Toshiya Itoh, Yuji Ohta, Hiroki Shizuya
semanticscholar +4 more sources
Verification of a Cryptographic Primitive [PDF]
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. Verifiable C is a separation logic for the C language, proved sound with respect to the operational semantics for
Andrew W. Appel
semanticscholar +4 more sources
Secure and Computationally-Efficient Cryptographic Primitive based on Cellular Automation [PDF]
, 2019 Mageto, a random number generator based on one-dimensional cellular automaton (CA) is presented. Three procedures of secure implementation using Mageto is proposed and discussed. Implementations are very efficient in a wide range of hardware and software
Vuckovac, Rade
core +2 more sources
On the Use of GF-Inversion as a Cryptographic Primitive [PDF]
ACM Symposium on Applied Computing, 2004 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 +5 more sources
Enhanced Matrix Power Function for Cryptographic Primitive Construction [PDF]
Symmetry, 2018 A new enhanced matrix power function (MPF) is presented for the construction of cryptographic primitives. According to the definition in previously published papers, an MPF is an action of two matrices powering some base matrix on the left and right. The
Eligijus Sakalauskas
openalex +2 more sources
Using quantum key distribution for cryptographic purposes: A survey
Theoretical Computer Science, 2014 The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does not provide a standalone
, +23 more
exaly +3 more sources
ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware
Workshop on Cryptographic Hardware and Embedded Systems, 2010 Stéphane Badel +7 more
openalex +2 more sources