Results 1 to 10 of about 238 (86)
Cryptanalyses on a Merkle-Damgård Based MAC — Almost Universal Forgery and Distinguishing-H Attacks [PDF]
This paper presents two types of cryptanalysis on a Merkle-Damgard hash based MAC, which computes a MAC value of a message M by Hash(K||l||M) with a shared key K and the message length l. This construction is often called LPMAC. Firstly, we present a distinguishing-H attack against LPMAC instantiating any narrow-pipe Merkle-Damgard hash function with O(
Sasaki Yu
exaly +5 more sources
Generic Universal Forgery Attack on Iterative Hash-Based MACs [PDF]
In this article, we study the security of iterative hash-based MACs, such as HMAC or NMAC, with regards to universal forgery attacks. Leveraging recent advances in the analysis of functional graphs built from the iteration of HMAC or NMAC, we exhibit the very first generic universal forgery attack against hash-based MACs.
Thomas Peyrin, Peyrin Thomas
exaly +3 more sources
Universal Forgery Attack Against GCM-RUP
Authenticated encryption (AE) schemes are widely used to secure communications because they can guarantee both confidentiality and authenticity of a message. In addition to the standard AE security notion, some recent schemes offer extra robustness, i.e. they maintain security in some misuse scenarios. In particular, Ashur, Dunkelman and Luykx proposed
Gaëtan Leurent +2 more
exaly +5 more sources
This paper examines the security of Rocca, an authenticated encryption algorithm designed for Beyond 5G/6G contexts. Rocca has been revised multiple times in the initialization and finalization for security reasons.
Ryunouchi Takeuchi +2 more
doaj +2 more sources
Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm
In this paper, we provide a security analysis of ELmD: a block cipher based Encrypt-Linear-mix-Decrypt authentication mode. As being one of the second-round CAESAR candidate, it is claimed to provide misuse resistant against forgeries and security against block-wise adaptive adversaries as well as 128-bit security against key recovery attacks.
Asli Bay
exaly +4 more sources
Algebraic Fault Analysis of SHA-256 Compression Function and Its Application
Cryptographic hash functions play an essential role in various aspects of cryptography, such as message authentication codes, pseudorandom number generation, digital signatures, and so on.
Kazuki Nakamura +2 more
doaj +1 more source
Certificateless cryptography resolves the certificate management problem of public-key cryptography and the key-escrow problem of identity-based cryptography.
Kyung-Ah Shim
doaj +1 more source
On Protecting SPHINCS+ Against Fault Attacks
SPHINCS+ is a hash-based digital signature scheme that was selected by NIST in their post-quantum cryptography standardization process. The establishment of a universal forgery on the seminal scheme SPHINCS was shown to be feasible in practice by ...
Aymeric Genêt
doaj +1 more source
Certificateless cryptography does not require any certificate for the public key authentication and users' public keys are transmitted with ciphertext/signatures or by making them available in the IoT-based public directory in a proper way.
Kyung-Ah Shim
doaj +1 more source
New certificateless aggregate signature scheme with universal designated verifier
Certificateless aggregate signature(CLAS) schemes with universal designated verifier had been widely applied in resource-constrained wireless mobile networks,because they could not only solve the problems of the certificate management and private key ...
Zhi-yan XU +3 more
doaj +2 more sources

