Results 1 to 10 of about 35,922 (245)
On the Design of Cryptographic Primitives [PDF]
Acta Applicandae Mathematicae. Volume 93, Numbers 1-3, pp.
279-297. Sept 2006. Springer., 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. In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic ...
Amparo Fúster-Sabater +10 more
arxiv +9 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 scenarios.
Vuckovac, Rade
arxiv +5 more sources
Post-Quantum Cryptographic Hardware Primitives [PDF]
arXiv, 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
arxiv +5 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
Cryptographic primitives in blockchains
Journal 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]
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
openalex +3 more sources
CryptoKnight:generating and modelling compiled cryptographic primitives [PDF]
Information, 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
Non-cryptographic Primitive for Pseudorandom Permutation [PDF]
Theoretical Computer Science, 2002 AbstractFour round Feistel permutation (like DES) is super-pseudorandom if each round function is random or a secret universal hash function. A similar result is known for five round MISTY type permutation. It seems that each round function must be at least either random or secret in both cases.In this paper, however, we show that the second round ...
Tetsu Iwata +2 more
openalex +5 more sources
On formal verification of arithmetic-based cryptographic primitives [PDF]
In Information Security and Cryptology - ICISC 2008, 11th
International Conference, Seoul, Korea, December 3-5, 2008, Proceedings,
volume 5461 of Lecture Notes in Computer Science, pages 368-382, Springer, 2009 Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to computationally hard problems. Those reductions can be subtle and tedious, and thus not easily checkable.
arxiv +5 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 +3 more sources