Results 11 to 20 of about 21,314 (180)

On the Design of Cryptographic Primitives [PDF]

open access: greenActa 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.
Pino Caballero‐Gil   +1 more
core   +7 more sources

A cryptographic primitive based on hidden-order groups [PDF]

open access: hybridJournal 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

Cryptographic primitives in blockchains

open access: hybridJournal of Network and Computer Applications, 2018
Abstract Blockchain, as one of the crypto-intensive creatures, has become a very hot topic recently. Although many surveys have recently been dedicated to the security and privacy issues of blockchains, there still lacks a systematic examination on the cryptographic primitives in blockchains.
Licheng Wang   +4 more
openalex   +3 more sources

A language-dependent cryptographic primitive [PDF]

open access: bronzeJournal of Cryptology, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toshiya Itoh, Yuji Ohta, Hiroki Shizuya
openalex   +4 more sources

CryptoKnight:generating and modelling compiled cryptographic primitives [PDF]

open access: yesInformation, 2018
Cryptovirological augmentations present an immediate, incomparable threat. Over the last decade, the substantial proliferation of crypto-ransomware has had widespread consequences for consumers and organisations alike.
Bellekens, Xavier, Hill, Gregory
core   +6 more sources

Post-Quantum Cryptographic Hardware Primitives

open access: green, 2019
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. In this work, we introduce a set of hardware post-quantum cryptographic primitives (PCPs) consisting of four frequently used security ...
Lake Bu   +3 more
openalex   +4 more sources

The Black-Box Model for Cryptographic Primitives [PDF]

open access: bronzeJournal of Cryptology, 1998
To investigate security properties of a cryptographic primitive it is useful to grasp the idea a class of attacks is based on. Having a model that describes essential features of the primitive without unnecessary details one can concentrate on what makes the primitive resistant to what class of attacks.
C. P. Schnorr, Serge Vaudenay
openalex   +4 more sources

Verification of a Cryptographic Primitive [PDF]

open access: bronzeACM 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
openalex   +3 more sources

Cryptographic primitives based on cellular transformations [PDF]

open access: yesComputer 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   +2 more sources

On the Use of GF-Inversion as a Cryptographic Primitive [PDF]

open access: bronze, 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
openalex   +4 more sources

Home - About - Disclaimer - Privacy