Results 1 to 10 of about 21,314 (180)
New Cryptographic Primitive: Definition, Model and Construction of Ratched Key Exchange [PDF]
Jisuanji kexue, 2022 In the application of traditional cryptography,people always assume that the endpoints are secure and the adversary is on the communication channel.However,the prevalence of malware and system vulnerabilities makes endpoint compromise a se-rious and ...
FENG Deng-guo
doaj +1 more source
Linear Complexity of Hidden Weighted Bit Functions [PDF]
Jisuanji kexue yu tansuo, 2023 Boolean functions are crucial primitive in block cipher and are also used to design pseudorandom sequences. They play a crucial role in the design of symmetric cryptography and its analysis, and the study on the cryptographic properties of Boolean ...
CHEN Zhiru, FENG Ligang, ZHU Youwen
doaj +1 more source
Non-cryptographic primitive for pseudorandom permutation [PDF]
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tetsu Iwata +2 more
openaire +3 more sources
ETRI Journal, 2023 Hardware security primitives, also known as physical unclonable functions(PUFs), perform innovative roles to extract the randomness unique to specific hardware.
Mi-Kyung Oh +3 more
doaj +1 more source
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
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
A new method for solving the elliptic curve discrete logarithm problem [PDF]
Groups, Complexity, Cryptology, 2021 The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem.
Ansari Abdullah +2 more
doaj +1 more source
Locating Side Channel Leakage in Time through Matched Filters
Cryptography, 2022 Side channel attacks provide an effective way to extract secret information from the execution of cryptographic algorithms run on a variety of computing devices.
Alessandro Barenghi +2 more
doaj +1 more source
Homomorphic signcryption with public plaintext‐result checkability
IET Information Security, 2021 Signcryption originally proposed by Zheng (CRYPTO′97) is a useful cryptographic primitive that provides strong confidentiality and integrity guarantees.
Shimin Li +3 more
doaj +1 more source
Feebly secure cryptographic primitives [PDF]
Journal of Mathematical Sciences, 2012 In 1992, A. Hiltgen provided first construction of provably (slightly) secure cryptographic primitives, namely, feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as the circuit complexity over circuits with arbitrary binary gates) is amplified only by a constant factor (in Hiltgen’s ...
Edward A. Hirsch +2 more
openaire +1 more source