Results 31 to 40 of about 36,351 (194)
SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function
, 2020 Many commonly used public key cryptosystems will become insecure once a scalable quantum computer is built. New cryptographic schemes that can guarantee protection against attacks with quantum computers, so-called post-quantum algorithms, have emerged in
Anufriev, M. N. +5 more
core +1 more source
The Random Oracle Methodology, Revisited [PDF]
, 2000 We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".
Canetti, Ran +2 more
core +6 more sources
Ramanujan graphs in cryptography [PDF]
, 2018 In this paper we study the security of a proposal for Post-Quantum Cryptography from both a number theoretic and cryptographic perspective. Charles-Goren-Lauter in 2006 [CGL06] proposed two hash functions based on the hardness of finding paths in ...
Costache, Anamaria +4 more
core +2 more sources
Security Analysis of LNMNT-LightWeight Crypto Hash Function for IoT
IEEE Access, 2021 Conventional cryptographic techniques are inappropriate for resource-constrained applications in the Internet of Things (IoT) domain because of their high resources requirement.
Nubila Nabeel +2 more
doaj +1 more source
Regular and almost universal hashing: an efficient implementation [PDF]
, 2016 Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the ...
Ignatchenko, Sergey +2 more
core +2 more sources
ON THE UNIVERSAL TREE MODE OF HASH CODE GENERATION
Современные информационные технологии и IT-образование, 2018 Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architectures.
Dmitriy S. Bogdanov +2 more
doaj +1 more source
Formally based semi-automatic implementation of an open security protocol [PDF]
, 2012 International audienceThis paper presents an experiment in which an implementation of the client side of the SSH Transport Layer Protocol (SSH-TLP) was semi-automatically derived according to a model-driven development paradigm that leverages formal ...
Alfredo Pironti +37 more
core +3 more sources
Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains
Applied Sciences, 2021 Covert channels enable stealthy communications over innocent appearing carriers. They are increasingly applied in the network context. However, little work is available that exploits cryptographic primitives in the networking context to establish such ...
Jörg Keller, Steffen Wendzel
doaj +1 more source
Transparent code authentication at the processor level [PDF]
, 2009 The authors present a lightweight authentication mechanism that verifies the authenticity of code and thereby addresses the virus and malicious code problems at the hardware level eliminating the need for trusted extensions in the operating system.
A.O. Durahim +32 more
core +2 more sources
Denial-of-Service Resistance in Key Establishment [PDF]
, 2007 Denial of Service (DoS) attacks are an increasing problem for network connected systems. Key establishment protocols are applications that are particularly vulnerable to DoS attack as they are typically required to perform computationally expensive ...
Boyd, Colin +4 more
core +2 more sources