World Library  
Flag as Inappropriate
Email this Article

JH (hash function)

Article Id: WHEBN0020442598
Reproduction Date:

Title: JH (hash function)  
Author: World Heritage Encyclopedia
Language: English
Subject: NIST hash function competition, Rebound attack, SIMD (hash function), VMAC, Lane (hash function)
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

JH (hash function)

JH
General
Designers Hongjun Wu
Certification SHA-3 finalist
Detail
Digest sizes 224, 256, 384, 512
Speed 16.1 cpb on Core 2 in 64-bit mode using SSE2; 37.3 cpb using ANSI C.

JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu. Though chosen as one of the five finalists of the competition, JH ultimately lost to NIST hash candidate Keccak.[1] JH has a 1024-bit state, and works on 512-bit input blocks. Processing an input block consists of three steps:

  1. XOR the input block into the left half of the state.
  2. Apply a 42-round unkeyed permutation (encryption function) to the state. This consists of 42 repetitions of:
  3. Break the input into 256 4-bit blocks, and map each through one of two 4-bit S-boxes, the choice being made by a 256-bit round-dependent key schedule. Equivalently, combine each input block with a key bit, and map the result through a 5→4 bit S-box.
  4. Mix adjacent 4-bit blocks using a maximum distance separable code over GF(24).
  5. Permute 4-bit blocks so that they will be adjacent to different blocks in following rounds.
  6. The final half-round consists of an S-box substitution without a following MDS or permutation step.
  7. XOR the input block into the right half of the state.
  8. The resulting digest is the first 224, 256, 384 or 512 bits from the 1024-bit final value. It is well suited to a bit slicing implementation using the SSE2 instruction set, giving speeds of 16.8 Cycles per byte.

    References

    1. ^ "NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition".  

    External links

    • The JH web site
    • JH page on the SHA-3 Zoo
    • VHDL source code developed by the Cryptographic Engineering Research Group (CERG) at George Mason University


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 USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov 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.