SAC 2005 was the 12th in a series of annual workshops on Selected Areas in Cryptography. This was the 5th time the workshop was hosted by Queen’s U- versity in Kingston (the previous workshops were held here in 1994, 1996, 1998 and 1999).Other SAC workshopshave been organizedat Carleton University in Ottawa (1995, 1997 and 2003), the Fields Institute in Toronto (2001), Memorial University of Newfoundland in St. John’s (2002) and the University of Waterloo (2000 and 2004). The workshop provided a relaxed atmosphere in which - searchers in cryptography could present and discuss new work on selected areas of current interest. The themes for SAC 2005 were: – design and analysis of symmetric key cryptosystems; – primitives for symmetric key cryptography, including block and stream - phers, hash functions, and MAC algorithms; – e?cient implementations of symmetric and public key algorithms; – cryptographic algorithms and protocols for ubiquitous computing (sensor networks, RFID). A total of 96 papers were submitted. Three papers were not considered - cause they were identi?ed as being multiple submissions. After an extensive double-blind reviewing process, the program committee accepted 25 papers for presentation at the workshop. We were very fortunate to have two invited speakers at SAC 2005, who both delivered thought-provoking and entertaining talks: – Alfred Menezes: Another Look at Provable Security; – Mike Wiener: The Full Cost of Cryptanalytic Attacks.
Author(s): Elad Barkan, Eli Biham (auth.), Bart Preneel, Stafford Tavares (eds.)
Series: Lecture Notes in Computer Science 3897
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 371
Tags: Data Encryption; Operating Systems; Management of Computing and Information Systems; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Information Systems Applications (incl.Internet)
Front Matter....Pages -
Conditional Estimators: An Effective Attack on A5/1....Pages 1-19
Cryptanalysis of the F-FCSR Stream Cipher Family....Pages 20-35
Fault Attacks on Combiners with Memory....Pages 36-50
New Observation on Camellia....Pages 51-64
Proving the Security of AES Substitution-Permutation Network....Pages 65-81
An Attack on CFB Mode Encryption as Used by OpenPGP....Pages 82-94
Parallelizable Authentication Trees....Pages 95-109
Improved Time-Memory Trade-Offs with Multiple Data....Pages 110-127
A Space Efficient Backdoor in RSA and Its Applications....Pages 128-143
An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism....Pages 144-158
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners....Pages 159-174
Rekeying Issues in the MUGI Stream Cipher....Pages 175-188
Tree-Based Key Distribution Patterns....Pages 189-204
Provably Secure Tripartite Password Protected Key Exchange Protocol Based on Elliptic Curves....Pages 205-220
An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security....Pages 221-232
Breaking a New Hash Function Design Strategy Called SMASH....Pages 233-244
Analysis of a SHA-256 Variant....Pages 245-260
Impact of Rotations in SHA-1 and Related Hash Functions....Pages 261-275
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags....Pages 276-290
Reducing Time Complexity in RFID Systems....Pages 291-306
Accelerated Verification of ECDSA Signatures....Pages 307-318
Pairing-Friendly Elliptic Curves of Prime Order....Pages 319-331
Minimality of the Hamming Weight of the τ -NAF for Koblitz Curves and Improved Combination with Point Halving....Pages 332-344
SPA Resistant Left-to-Right Integer Recodings....Pages 345-358
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$ ....Pages 359-369
Back Matter....Pages -
