Selected Areas in Cryptography: 12th International Workshop, SAC 2005, Kingston, ON, Canada, August 11-12, 2005, Revised Selected P by Bart PreneelSelected Areas in Cryptography: 12th International Workshop, SAC 2005, Kingston, ON, Canada, August 11-12, 2005, Revised Selected P by Bart Preneel

Selected Areas in Cryptography: 12th International Workshop, SAC 2005, Kingston, ON, Canada, August…

byBart Preneel

Paperback | March 23, 2006

Pricing and Purchase Info

$125.55 online 
$150.50 list price save 16%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Selected Areas in Cryptography: 12th International Workshop, SAC 2005, Kingston, ON, Canada, August…Format:PaperbackDimensions:371 pages, 23.5 × 15.5 × 0.01 inPublished:March 23, 2006Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540331085

ISBN - 13:9783540331087

Look for similar items by category:

Reviews

Table of Contents

Stream Ciphers I.- Conditional Estimators: An Effective Attack on A5/1.- Cryptanalysis of the F-FCSR Stream Cipher Family.- Fault Attacks on Combiners with Memory.- Block Ciphers.- New Observation on Camellia.- Proving the Security of AES Substitution-Permutation Network.- Modes of Operation.- An Attack on CFB Mode Encryption as Used by OpenPGP.- Parallelizable Authentication Trees.- Improved Time-Memory Trade-Offs with Multiple Data.- Public Key Cryptography.- A Space Efficient Backdoor in RSA and Its Applications.- An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism.- Stream Ciphers II.- On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners.- Rekeying Issues in the MUGI Stream Cipher.- Key Establishment Protocols and Access Control.- Tree-Based Key Distribution Patterns.- Provably Secure Tripartite Password Protected Key Exchange Protocol Based on Elliptic Curves.- An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security.- Hash Functions.- Breaking a New Hash Function Design Strategy Called SMASH.- Analysis of a SHA-256 Variant.- Impact of Rotations in SHA-1 and Related Hash Functions.- Protocols for RFID Tags.- A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags.- Reducing Time Complexity in RFID Systems.- Efficient Implementations.- Accelerated Verification of ECDSA Signatures.- Pairing-Friendly Elliptic Curves of Prime Order.- Minimality of the Hamming Weight of the ?-NAF for Koblitz Curves and Improved Combination with Point Halving.- SPA Resistant Left-to-Right Integer Recodings.- Efficient FPGA-Based Karatsuba Multipliers for Polynomials over .