Keccak is a cryptographic hash function submitted to the NIST hash function competition by Guido Bertoni, Joan Daemen, Michaël Peeters and Gilles Van Assche. The authors claim 12.5 cycles per byte on an Intel Core 2 CPU. Keccak uses the sponge construction[1][2] in which message blocks are XORred into the initial bits of the state, which is then invertibly permuted. The state can be 25, 50, 100, 200, 400, 800 or 1600-bit wide, organised as an array of 
bits.
External links
References
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
