Alan Kaminsky Department of Computer Science Rochester Institute of Technology 4486 + 2335 = 6821
Home Page

Parallel Crypto Minisymposium
2010 SIAM Conference on Parallel Processing and Scientific Computing

Prof. Alan Kaminsky
Rochester Institute of Technology -- Department of Computer Science


Conference

2010 SIAM Conference on Parallel Processing and Scientific Computing (PP10)
February 24-26, 2010
Seattle, WA, USA

Minisymposium Title

Parallel Crypto: Applications of Parallel Computing in Cryptography

MS19, Wednesday 24-Feb-2010, 4:30pm-6:30pm

Minisymposium Description

What can you do in 1018 operations on tomorrow's exascale computer? You can simulate 1,000,000 stars for 1,000,000 time steps with an O(n2) direct N-body astrophysics code, or you can do 14 brute force key searches on the DES block cipher (1 search = 256 keys). Cryptographic applications are ideal for parallel computers: they are usually massively parallel, requiring little or no communication; they often use minimal memory; and with typically O(2n) computational requirements they can fully utilize any number of processors. This minisymposium explores the use of parallel computing for calculating, analyzing, and attacking cryptographic primitives such as block ciphers, stream ciphers, and one-way hash functions.

Presentation: [PDF]

Minisymposium Organizer

Alan Kaminsky
Department of Computer Science
Rochester Institute of Technology

Minisymposium Presentations

Alan Kaminsky Department of Computer Science Rochester Institute of Technology 4486 + 2335 = 6821
Home Page
Copyright © 2010 Alan Kaminsky. All rights reserved. Last updated 21-Feb-2010. Please send comments to ark­@­cs.rit.edu.