Fast Software Encryption: 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers
Springer Science & Business Media, Jul 6, 2006 - Computers - 432 pages
Fast Software Encryption (FSE) 2006 is the 13th in a series of workshops on symmetric cryptography. It has been sponsored for the last ?ve years by the International Association for Cryptologic Research (IACR), and previous FSE workshops have been held around the world: 1993 Cambridge, UK 1994 Leuven, Belgium 1996 Cambridge, UK 1997 Haifa, Israel 1998 Paris, France 1999 Rome, Italy 2000 New York, USA 2001 Yokohama, Japan 2002 Leuven, Belgium 2003 Lund, Sweden 2004 New Delhi, India 2005 Paris, France The FSE workshop is devoted to research on fast and secure primitives for symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, encryption schemes, analysis and evaluation tools, hash fu- tions, and message authentication codes. This year more than 100 papers were submitted to FSE for the ?rst time. After an extensive review by the ProgramCommittee, 27 papers were presented at the workshop. Of course, the programwould not have been complete without the invited speaker, and the presentation by Eli Biham on the early history of di?erential cryptanalysis was particularly appreciated by workshop attendees.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Achterbahn active S-boxes addition Advances in Cryptology adversary algebraic attacks algorithm annihilator Athlon 64 bias binary bit position block cipher blockcipher Boolean function bytes characteristic ciphertext collision collision attack complexity compression function Computer Science construction CRYPTO cryptographic deﬁne Deﬁnition denote diﬀerence diﬀerential path eﬀect eﬃcient encryption equations eSTREAM Feistel ﬁnd ﬁnding ﬁrst ﬁxed fulﬁlled Hamming weight hash function HAVAL implementation input integer iterated key schedule key/IV keystream keystream bits Lecture Notes Lemma length LFSR linear approximation linear cryptanalysis LNCS local collision mask matrices message blocks message modiﬁcation message words mode monomial multicollision n-bit Notes in Computer output pair Pentium permutation plaintext polynomial probability proof queries random oracle RIPEMD round S-boxes satisﬁed Section sequence speciﬁc Springer Springer-Verlag SSSC step stream ciphers Table techniques Theorem tweakable update variables vector Wang Xiaoyun Wang