Home /  Number-theoretic cryptography workshop

Workshop

Number-theoretic cryptography workshop October 16, 2000 - October 20, 2000
Registration Deadline: October 20, 2000 almost 24 years ago
To apply for Funding you must register by: July 16, 2000 about 24 years ago
Parent Program:
Organizers Eric Bach, Dan Boneh, Cynthia Dwork (chair), Shafi Goldwasser, Kevin McCurley and Carl Pomerance
Speaker(s)

Show List of Speakers

Description
This workshop will focus on number-theoretic aspects of cryptography, and will be cross-cultural, where the the cultures in question are "mathematics" and "computer science." We will be sufficiently flexible to accommodate anything exciting that arises through the fall of 2000, so any plans are tentative. We will have several survey talks on the state of the art of such central topics to number theory in cryptography as integer factorization discrete logarithm algorithms elliptic curves From the computer science side, we will survey positive applications of lattices to cryptography lattice basis reduction techniques for cryptanalysis "new" number-theoretic assumptions in vogue in 2000 A final survey talk will discuss two historical tracks that met in 1998: practical cryptosystems (RSA, El-Gamal, OAEP, and Cramer-Shoup), and the theory that lead to increasingly stronger notions of security and cryptosystems satisfying these notions (Goldwasser and Micali's construction for semantic security, Naor and Yung's construction for chosen-ciphertext security in the pre-processing mode, Dolev, Dwork and Naor's construction for non-malleability against chosen-ciphertext in the post-processing mode, and Cramer-Shoup's efficient non-malleable cca-post construction).                 
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent PhDs, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

For information about recommended hotels for visits of under 30 days, visit Short-Term Housing. Questions? Contact coord@slmath.org.

Show Directions to Venue

Show Visa/Immigration

Schedule, Notes/Handouts & Videos
Show Schedule, Notes/Handouts & Videos
Show All Collapse
Oct 16, 2000
Monday
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Good Encryption Schemes
Moni Naor
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Committments and Applications
Moni Naor
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Pseudo-Random Functions and Permutations
Moni Naor
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Interactive Proofs & Zero Knowledge
Cynthia Dwork
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Encryption - Part I
Cynthia Dwork
08:00 AM - 05:00 PM
  Code Breaking in WW II: The Enigma: the Colossus, and Bletchley Park
Anthony E. Sale
08:00 AM - 05:00 PM
  What is a proper cryptographic assumption, or The complexity of refutation
Moni Naor
08:00 AM - 05:00 PM
  Identification and signatures based on class groups
Johannes Buchmann
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Good Encryption Schemes
Moni Naor
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Committments and Applications
Moni Naor
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Pseudo-Random Functions and Permutations
Moni Naor
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Interactive Proofs & Zero Knowledge
Cynthia Dwork
08:00 AM - 05:00 PM
  Short Course on Foundations of Cryptography: Encryption - Part I
Cynthia Dwork
09:00 AM - 10:00 AM
  Short Course on Foundations of Cryptography
Cynthia Dwork (Harvard University), Moni Naor
09:30 AM - 11:00 AM
  Discrete logarithm systems based on polynomial orders
Gerhard Frey
11:00 AM - 02:00 PM
  Lattices and cryptography in theory and practice
Joseph Silverman (Brown University)
02:00 PM - 03:00 PM
  Index search, discrete logarithms, and Diffie-Hellman
Ueli Maurer
Oct 17, 2000
Tuesday
09:30 AM - 11:00 AM
  Tripartite Diffie-Hellman using pairing on elliptic curves
Antoine Joux
11:00 AM - 02:00 PM
  Random Lattices
Miklos Ajtai
02:00 PM - 03:30 PM
  Secure homomorphic multi-party computation: Efficient constructions from homomorphic threshold encryption and applications to secure distributed linear algebra
Ronald Cramer
03:30 PM - 04:30 PM
  Genus three curves over finite fields
Kristin Lauter (Facebook AI Research (FAIR) North America at Meta)
Oct 18, 2000
Wednesday
09:30 AM - 11:00 AM
  Security and efficiency issues in elliptic curve cryptography
Neal Koblitz (University of Washington)
11:00 AM - 02:00 PM
  Discrete logarithm problems arising from curve based cryptography
Ming-deh Huang
02:00 PM - 03:30 PM
  TBA
Johannes Buchmann
03:30 PM - 04:30 PM
  The Arithmetica Key exchange
Michael Anshel
Oct 19, 2000
Thursday
09:30 AM - 11:00 AM
  Solving low-degree polynomials
Don Coppersmith
11:00 AM - 02:00 PM
  Cryptanalysis of RSA using Lattice-Based Root Finding Techniques
Glenn Durfee
02:00 PM - 03:00 PM
  The orthogonal lattice and its applications to cryptanalysis
Phong Nguyen
Oct 20, 2000
Friday
09:30 AM - 11:00 AM
  The XTR Public-Key system
Arjen Lenstra
11:00 AM - 01:30 PM
  Design and implementation of a public-key signature system
Dan Bernstein
01:30 PM - 02:00 PM
  Improving lattice based cryptosystems using the Hermite Normal Form
Daniele Micciancio
02:00 PM - 04:00 PM
  Complexity of Refutation
Moni Naor
04:00 PM - 05:00 PM
  Tackling 1020 size search spaces with pencils, wheels, wires, tubes: Code breaking in WW II
Anthony Sale