of US government information. COSIC is also coordinating ECRYPT , a European wide ... http www.esat.kuleuven.ac.be cosic Official Website of COSIC http www.ecrypt.eu.org ECRYPT Category ... more details
about the cryptographic hash function the Egyptian pharaoh Sneferu Snefru is a cryptographic hash function invented by Ralph Merkle in 1990 ref cite journal author Ralph C. Merkle journal Journal of Cryptology volume 3 issue 1 pages 43 58 year 1990 title A fast software one way hash function J. Cryptology doi 10.1007 BF00203968 url http www.springerlink.com content t10683l407363633 accessdate 2011 04 06 ref which supports 128 bit and 256 bit output. It was named after the Ancient Egypt Egyptian Pharaoh Sneferu , continuing the tradition of the Khufu and Khafre Khufu Khufu and Khufu and Khafre Khafre Khafre block cipher s. The original design of Snefru was shown to be insecure by Eli Biham and Adi Shamir who were able to use differential cryptanalysis to find hash collisions. The design was then modified by increasing the number of iterations of the main pass of the algorithm from two to eight. Although differential cryptanalysis can break the revised version with less complexity than brute force attack brute force search a certificational weakness , the attack requires math 2 88.5 math operations and is thus not currently feasible in practice. ref cite paper author Eli Biham date 2008 07 19 title New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru publisher Springer Berlin Heidelberg url http www.springerlink.com content 208q118x13181g32 ref References reflist html body btn Snefru Facts btn body html External links http ehash.iaik.tugraz.at wiki Snefru n Ecrypt page http rhash.sourceforge.net RHash , an open source command line tool, which can calculate and verify Snefru 128 and Snefru 256 Cryptography navbox hash Category Broken hash functions Category Article Feedback 5 crypto stub de Snefru Hashfunktion fr Snefru pl Snefru kryptografia ru Snefru ... more details
Unreferenced date December 2009 Snuffle is an cryptography encryption system designed by Daniel Bernstein and the subject of his court case, Bernstein v. United States . Often lost in the discussion of Bernstein v. United States , the court case that overturned and eventually eliminated US export of cryptography export restrictions on cryptography , is that the subject of the case, Snuffle, was itself an attempt to bypass the regulations. Snuffle showed how to use a cryptographic hash function , which was legal to export, as a strong encryption system, which was illegal to export. The irony of the case was that it was not the hash that was illegal, but the software that showed how to use it. Snuffle source code is widely available on the Internet and included on the disks accompanying Bruce Schneier s Applied Cryptography . Although his court case was dismissed in October 2003, Bernstein still As of 2007 lc on has not published his cryptography pages or the technical papers describing Snuffle. In early 2005, Bernstein submitted an updated version of Snuffle, called Snuffle 2005 based on his Salsa20 hash function, to the ECRYPT Stream Cipher project. How Snuffle works Stream ciphers work by taking a string the encryption key and deterministically generating a bunch of random seeming text, called keystream , from that key. That keystream is then XOR ed against the message one wants to encipher. To decipher the text, the recipient simply hands the same key to the stream cipher to produce an identical keystream and XORs it with the ciphertext, resulting in the original message. Snuffle simply works by running the hash function in Block cipher modes of operation Counter CTR counter mode generating the keystream by hashing the key with a message based Cryptographic nonce nonce and sequential integers 1, 2, 3, 4, etc. appended. See also Junger v. Daley Category Cryptographic algorithms ... more details
In cryptography , Achterbahn is the name of a synchronous stream cipher algorithm submitted to the eSTREAM Project of the eCRYPT network. In the final specification the cipher is called ACHTERBAHN 128 80 , because it supports the key lengths of 80 bits and 128 bits, respectively . ref cite journal author Berndt M. Gammel , Rainer G ttfert , and Oliver Kniffler , title ACHTERBAHN 128 80 publisher ECRYPT Stream Cipher Project Report date 30. June 2006 url http www.ecrypt.eu.org stream p2ciphers achterbahn achterbahn p2.pdf ref Achterbahn was developed by Berndt Gammel , Rainer G ttfert and Oliver Kniffler . Achterbahn means rollercoaster in German , though a literal translation of the term would be eight track , which indicates that the cipher can encrypt eight bit streams in parallel. The parameters of the cipher are given in the following table center class wikitable align right align center ACHTERBAHN 80 align center ACHTERBAHN 128 align right Max. key length align center 80 bit align center 128 bit align right Max. IV length align center 80 bit align center 128 bit align right Max. frame length align center 2 sup 44 sup align center 2 sup 44 sup align right Internal state align center 297 bit align center 351 bit center ACHTERBAHN 128 is downward compatible and can produce the same keystream as ACHTERBAHN 80 if so desired. The keystream generator of ACHTERBAHN 128 80 is based on the design principle of the nonlinear combination generator, however it deploys primitive nonlinear feedback shift registers NLFSR instead of linear ones LFSR . Security There are no known cryptanalytic attacks against ACHTERBAHN 128 80 for the tabulated parameters that are faster than brute force attack . Recent analysis showed that attacks are possible if larger frame Packet information technology packet lengths are used in a communication protocol ref cite journal author Mar a Naya Plasencia title Cryptanalysis of Achterbahn 128 80 publisher Fast Software Encryption, 14th International ... more details
Infobox scientist image Replace this image male.svg Only freely licensed images may be used to depict living people. See WP NONFREE . image size 150px name Bart Preneel caption birth date residence flagicon Belgium Leuven , Belgium nationality Belgium Belgian work institution Katholieke Universiteit Leuven br University of California at Berkeley UCB alma mater Katholieke Universiteit Leuven field Cryptography known for Cryptographic hash functions Hash Functions br cryptanalysis br RIPEMD br One way compression function Miyaguchi Preneel Miyaguchi Preneel scheme occupation Professor , COSIC doctoral students Christophe De Canni re br Frederik Vercauteren br Souradyuti Paul website http homes.esat.kuleuven.be preneel Bart Preneel is a Belgium Belgian cryptographer and cryptanalyst . He is a professor at Katholieke Universiteit Leuven , in the COSIC group, ref cite web last first authorlink coauthors title K.U.Leuven Who is who work publisher K.U.Leuven date url http cwisdb.kuleuven.be persdb bin persdb?lang E&oproep persoon&fnaam u0003308 format doi accessdate 2008 03 27 ref president of the International Association for Cryptologic Research , and project manager of ECRYPT . Simultaneously with Shoji Miyaguchi , he invented the One way compression function Miyaguchi Preneel Miyaguchi Preneel scheme , a robust structure used in hash functions such as Whirlpool algorithm Whirlpool . He is one of the authors of the RIPEMD 160 hash function. He was also a co inventor of the stream cipher MUGI which later on went on to become a Japanese standard, and of the stream cipher Trivium cipher Trivium which is a well received entrant to the eSTREAM project. He has also contributed to the cryptanalysis of RC4 , SOBER t32 , MacGuffin cipher MacGuffin , Phelix Helix , Phelix , Py cipher Py , Py cipher TPypy , the HAVAL cryptographic hash function and the SecurID hash function, among others. References references External links http www.esat.kuleuven.ac.be preneel Home page Persondat ... more details
Rabbit is a high speed stream cipher first presented ref M. Boesgaard, M. Vesterager, T. Pedersen, J. Christiansen, O. Scavenius. Rabbit A High Performance Stream Cipher. Proc. FSE 2003. Springer LNCS 2887, pp. 307 329 http www.cryptico.com Files filer rabbit fse.pdf PDF ref in February 2003 at the 10th FSE workshop. In May 2005, it was submitted to the eSTREAM project of the ECRYPT network. Rabbit was designed by Martin Boesgaard , Mette Vesterager , Thomas Pedersen CS Thomas Pedersen , Jesper Christiansen CS Jesper Christiansen and Ove Scavenius . Rabbit uses a 128 bit key and a 64 bit initialization vector. The cipher was designed with high performance in software in mind, where fully optimized implementations achieve an encryption speed of up to 3.7 Cycles per byte CPB on a Pentium 3, and of 9.7 Cycles per byte CPB on an ARM7. However, the cipher also turns out to be very fast and compact in hardware. The core component of the cipher is a bitstream generator which encrypts 128 message bits per iteration. The cipher s strength rests on a strong mixing of its inner state between two consecutive iterations. The mixing function is entirely based on arithmetical operations that are available on a modern processor, i.e., no substitution box S boxes or lookup tables are required to implement the cipher. The authors of the cipher have provided a full set of cryptanalytic white papers on the Cryptico home page. ref M. Boesgaard, T. Pedersen, M. Vesterager, E. Zenner. The Rabbit Stream Cipher Design and Security Analysis. Proc. SASC 2004. http www.cryptico.com files filer rabbit sasc final.pdf PDF ref It is also described in RFC 4503. Cryptico had patent s pending for the algorithm and for many years required a license fee for commercial use of the cipher which was waived for non commercial uses. However, the algorithm was made free for any use on October 6, 2008. ref http www.ecrypt.eu.org stream phorum read.php?1,1244 ref Security Rabbit claims 128 bit security against ... more details
127 publisher Springer year 2007 ref ref name ECRYPT cite techreport author1 Christophe De Canni re ... off Algorithm institution ECRYPT Stream Cipher Project number 40 year 2005 url http www.ecrypt.eu.org ... more details
Infobox cryptographic hash function name Keccak image caption General designers Guido Bertoni , Joan Daemen , Micha l Peeter s and Gilles Van Assche . publish date series derived from derived to related to certification SHA 3 finalist Detail digest size arbitrary structure rounds speed 12.5 cycles per byte cpb on Core 2 . cryptanalysis Keccak pronounced k t ak , like ketchak ref cite web title The Keccak sponge function family Specifications summary url http keccak.noekeon.org specs summary.html accessdate 2011 05 11 coauthors Guido Bertoni, Joan Daemen, Micha l Peeters and Gilles Van Assche ref is a cryptographic hash function designed by Guido Bertoni, Joan Daemen , Micha l Peeters and Gilles Van Assche. Building upon RadioGat n , Keccak is one of five finalists in the NIST hash function competition to select a SHA 3 algorithm. The authors claim 12.5 cycles per byte on an Intel Core 2 CPU. It is notably faster than all other finalists in hardware implementations. ref Citation title Fair and Comprehensive Performance Evaluation of 14 Second Round SHA 3 ASIC Implementations url http csrc.nist.gov groups ST hash sha 3 Round2 Aug2010 documents papers SCHAUMONT SHA3.pdf first1 Xu last1 Guo first2 Sinan last2 Huang first3 Leyla last3 Nazhandali first4 Patrick last4 Schaumont journal NIST 2nd SHA 3 Candidate Conference month Aug. year 2010 accessdate 2011 02 18 page 12 Keccak is second only to Luffa, which did not advance to the final round. ref Keccak uses the sponge construction ref cite web url http sponge.noekeon.org title Sponge Functions publisher Ecrypt Hash Workshop 2007 coauthors Guido Bertoni, Joan Daemen, Micha l Peeters and Gilles Van Assche ref ref cite web url http sponge.noekeon.org title On the Indifferentiability of the Sponge Construction publisher EuroCrypt 2008 coauthors Guido Bertoni, Joan Daemen, Micha l Peeters and Gilles Van Assche ref in which message blocks are XORed into the initial bits of the state, which is then invertibly permuted. In its l ... more details
WAY, GOST, SHARK, CAST 128, and Square. Performance In a 2007 ECRYPT workshop paper focusing on public ... Libraries for Public Key Cryptography publisher ECRYPT Workshop on Software Performance Enhancement ... more details
Encyclopedia
top
