Results 11 to 20 of about 384,292 (296)

Enhanced Matrix Power Function for Cryptographic Primitive Construction [PDF]

open access: goldSymmetry, 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

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

Experimental cheat-sensitive quantum weak coin flipping [PDF]

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

On the Bit Security of Cryptographic Primitives

open access: yesIACR Cryptology ePrint Archive, 2018
We introduce a formal quantitative notion of “bit security” for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic function requiring a brute force attack on a k-bit key space.
Micciancio, Daniele, Walter, Michael
openaire   +3 more sources

Non-cryptographic Primitive for Pseudorandom Permutation [PDF]

open access: bronzeTheoretical 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]

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

Using quantum key distribution for cryptographic purposes: A survey

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

Hound: Locating Cryptographic Primitives in Desynchronized Side-Channel Traces Using Deep-Learning [PDF]

open access: green2024 IEEE 42nd International Conference on Computer Design (ICCD)
Side-channel attacks allow to extract sensitive information from cryptographic primitives by correlating the partially known computed data and the measured side-channel signal. Starting from the raw side-channel trace, the preprocessing of the side-channel trace to pinpoint the time at which each cryptographic primitive is executed, and, then, to re ...
Davide Galli   +2 more
arxiv   +3 more sources

Bio-inspired electronic fingerprint PUF device with single-walled carbon nanotube network surface mediated by M13 bacteriophage template [PDF]

open access: yesScientific Reports, 2022
Human fingerprints are randomly created during fetal activity in the womb, resulting in unique and physically irreproducible fingerprint patterns that are applicable as a biological cryptographic primitive. Similarly, stochastically knitted single-walled
Jae-Seung Jeong   +4 more
doaj   +2 more sources

Improving security of efficient multiparty quantum secret sharing based on a novel structure and single qubits [PDF]

open access: yesScientific Reports
Quantum secret sharing is a basic quantum cryptographic primitive, which has a lot of applications in information security and privacy preservation. An efficient multiparty quantum secret sharing protocol (Kuo et al. in EPJ Quantum Technol 10(1):29, 2023)
Xiao-Qiu Cai   +3 more
doaj   +2 more sources

Home - About - Disclaimer - Privacy