Message authentication based on cryptographically secure CRC without polynomial irreducibility test

DOI10.1007/S12095-017-0227-8zbMath1412.94169OpenAlexW2608844492WikidataQ59611627 ScholiaQ59611627MaRDI QIDQ1696144

Göran Selander, Fredrik Lindqvist, Elena Dubrova, Mats Näslund

Publication date: 14 February 2018

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-017-0227-8

zbMATH Keywords

hash functionmessage authenticationLFSRCRC

Mathematics Subject Classification ID

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

Related Items (2)

A new authentication procedure for client-server applications using HMAC ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test

Uses Software

• Grain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted \(k\)-color partitions
• New hash functions and their use in authentication and set equality
• A shift register construction of unconditionally secure authentication codes
• Universal hashing and authentication codes
• Message authentication based on cryptographically secure CRC without polynomial irreducibility test
• Partition-theoretic interpretations of certain modular equations of Schröter, Russell, and Rama\-nujan
• Authentication Key Recovery on Galois/Counter Mode (GCM)
• A Survey of Multipartitions Congruences and Identities
• Keying Hash Functions for Message Authentication
• Shift Register Sequences – A Retrospective Account
• Authentication Theory/Coding Theory
• High-speed parallel CRC circuits in VLSI
• Codes Which Detect Deception

This page was built for publication: Message authentication based on cryptographically secure CRC without polynomial irreducibility test