Secure Message Authentication Against Related-Key Attack

DOI10.1007/978-3-662-43933-3_16zbMath1321.94102OpenAlexW117856253MaRDI QIDQ2946884

Arnab Roy, Rishiraj Bhattacharyya

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_16

zbMATH Keywords

message authenticationrelated-key attackdomain extension

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system ⋮ Weak-Key and Related-Key Analysis of Hash-Counter-Hash Tweakable Enciphering Schemes ⋮ The Chaining Lemma and Its Application ⋮ Cryptanalysis of the AEAD and hash algorithm DryGASCON ⋮ On the related-key attack security of authenticated encryption schemes ⋮ Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Provably-Secure Remote Memory Attestation for Heap Overflow Protection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptographic hardware and embedded systems - CHES 2012. 14th international workshop, Leuven, Belgium, September 9--12, 2012. Proceedings
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• New types of cryptanalytic attacks using related keys
• Message Authentication, Revisited
• Correlated-Input Secure Hash Functions
• Cryptography Secure against Related-Key Attacks and Tampering
• Decoding One Out of Many
• Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices
• Distinguisher and Related-Key Attack on the Full AES-256
• Message Authentication Codes from Unpredictable Block Ciphers
• Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
• Fundamentals of Error-Correcting Codes
• Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
• Code-based cryptography
• Compact McEliece Keys from Goppa Codes
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
• Generic Related-Key Attacks for HMAC
• A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem
• Related-Key Boomerang and Rectangle Attacks
• A Related-Key Rectangle Attack on the Full KASUMI
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• Fast Software Encryption

This page was built for publication: Secure Message Authentication Against Related-Key Attack