Generic Case Complexity August 13 to August 17, 2007 AIM Research Conference Center, Palo Alto, CA Organizers: Robert Gilman, Alexei Miasnikov, Vladimir Shpilrain, and Rebecca Wright Description: This workshop, sponsored by AIM and the NSF, will be devoted to exploring the potential contribution of generic-case complexity to cryptography. Generic-case complexity is a new complexity measure which seems to be useful for assessing the algorithmic security of public key cryptosystems. The intended intended participants include cryptographers, mathematicians, and students. Deadline: April 1, 2007 Details: http://aimath.org/ARCC/workshops/gccomplexity.html