New hash functions for message authentication

DOI10.1007/3-540-49264-X_24MaRDI QIDQ2757253zbMATH OpenFDO

Authors Hugo Krawczyk

Publication date 25 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49264-X_24

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• LFSR-based hashing and authentication
• Universal hashing and authentication codes
• Universal hashing and multiple authentication
• Universal hashing and authentication codes
• Keying hash functions for message authentication

Cited in

(24)

• New hash functions and their use in authentication and set equality
• Reliable communication over partially authenticated networks
• Message authentication based on cryptographically secure CRC without polynomial irreducibility test
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Authenticating ad hoc networks by comparison of short digests
• MRD hashing.
• Input-oblivious proof systems and a uniform complexity perspective on P/poly
• Breaking and repairing an approximate message authentication scheme
• Quantum cryptography: theoretical protocols for quantum key distribution and tests of selected commercial QKD systems in commercial fiber networks
• Коды аутентификации с секретностью (обзор)
• Universal hashing and multiple authentication
• The universality of iterated hashing over variable-length strings
• MMH: Software message authentication in the Gbit/second rates
• MRD hashing
• New Constructions for Secure Hash Functions
• Direct proof of security of Wegman-Carter authentication with partially known key
• LFSR-based hashing and authentication
• Advances in Cryptology - CRYPTO 2003
• : Increasing the Security and Efficiency of
• Landau-Ramanujan keyed hash functions for message authentication
• Efficient reliable communication over partially authenticated networks
• Quantum linearization attacks
• Tighter bit-security bounds in quantum key search via the Chebyshev distance
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs

This page was built for publication: New hash functions for message authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757253)