World Library  
Flag as Inappropriate
Email this Article


Article Id: WHEBN0008625699
Reproduction Date:

Title: RadioGatún  
Author: World Heritage Encyclopedia
Language: English
Subject: Panama (cryptography), SHA-3, Hash function security summary, Comparison of cryptographic hash functions, Cryptographic hash functions
Collection: Cryptographic Hash Functions, Stream Ciphers
Publisher: World Heritage Encyclopedia


RadioGatún is a cryptographic hash primitive created by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche. It was first publicly presented at the NIST Second Cryptographic Hash Workshop, held in Santa Barbara, California, on August 24–25, 2006, as part of the NIST hash function competition.

Although RadioGatún is a derivative of Panama, a stream cipher and hash construction from the late 1990s whose hash construction has been broken, RadioGatún does not have Panama's weaknesses when used as a hash function.

RadioGatún is actually a family of 64 different hash functions, distinguished by a single parameter, the word width in bits (w), adjustable between 1 and 64. The algorithm uses 58 words, each of size w, to store its internal state. Thus, for example, the 32-bit version of needs 232 bytes to store its state and the 64-bit version 464 bytes.

RadioGatún can be used either as a hash function or a stream cipher; it can output an arbitrarily long stream of pseudo-random numbers.

The same team that developed RadioGatún went on to make considerable revisions to this cryptographic primitive, leading to the Keccak SHA-3 submission.[1]


  • Claimed strength 1
  • Cryptanalysis 2
  • Test vectors 3
  • References 4
  • External links 5

Claimed strength

The algorithm's designers claim that the first 19 × w bits (where w is the word width used) of RadioGatún's output is a cryptographically secure hash function. In other words, the first 608 bits of the 32-bit version and 1216 bits of the 64-bit version of RadioGatún can be used as a cryptographic hash value.

In light of the birthday attack, this means that for a given word width w, RadioGatún is designed to have no attack with complexity less than 29.5w. This corresponds to 2304 for the 32-bit version and 2608 for the 64-bit version.


In the paper "Two attacks on RadioGatún", Dmitry Khovratovich and Alex Biryukov present two attacks that do not break the designers' security claims, one with a complexity of 218w and another with a complexity of 223.1w.[2] Khovratovich also authored a paper, entitled "Cryptanalysis of hash functions with structures", which describes an attack with a complexity of 218w.

In the paper "Analysis of the Collision Resistance of RadioGatún using Algebraic Techniques", Charles Bouillaguet and Pierre-Alain Fouque present a way of generating collisions with the 1-bit version of the algorithm using an attack that needs 224.5 operations.[3] The attack can not be extended to larger versions since "all the possible trails we knew for the 1-bit version turned out to be impossible to extend to n-bit versions." This attack is less effective than the other attacks and also does not break RadioGatún's security claim.

The most effective attack against the algorithm, one with a complexity of 211w, is given in the paper "Cryptanalysis of RadioGatun" by Thomas Fuhr and Thomas Peyrin.[4] While more effective than the other attacks, this attack still does not break the security claim.

The developers of RadioGatún have stated that their "own experiments did not inspire confidence in RadioGatún" [5]

Test vectors

The only RadioGatún variants with test vectors (published hash values for sample inputs so programmers can verify they are correctly implementing the algorithm) are the 32-bit and 64-bit versions.

These test vectors only show the first 256 bits of the output of RadioGatún's arbitrarily long output stream:

RadioGatun[32]("") =
RadioGatun[32]("The quick brown fox jumps over the lazy dog") = 
RadioGatun[32]("The quick brown fox jumps over the lazy cog") = 

And hashes in 64-bit version:

RadioGatun[64]("") =
RadioGatun[64]("The quick brown fox jumps over the lazy dog") = 
RadioGatun[64]("The quick brown fox jumps over the lazy cog") = 


  1. ^ Bertoni, Guido ; Daemen, Joan ; Peeters, Michaël ; Van Assche, Gilles. "The Road from Panama to Keccak via RadioGatún". Retrieved 2009-10-20. 
  2. ^ Khovratovich, Dmitry; Biryukov, Alex. "Two attacks on RadioGatún". 
  3. ^ Bouillaguet, Charles; Fouque, Pierre-Alain. "Analysis of the Collision Resistance of RadioGatun using Algebraic Techniques". 
  4. ^ Fuhr, Thomas; Peyrin, Thomas. "Cryptanalysis of RadioGatun". 
  5. ^ "Keccak and the SHA-3 Standardization". 

External links

  • The RadioGatún Hash Function Family, RadioGatún's official web page, with the hash's official description, public domain reference code, and test vectors
  • rg32hash, an independent public-domain implementation of the 32-bit version of RadioGatún

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.