|  |   
            
               
                | Fields Cryptography Retrospective MeetingMay 11-15, 2009
 
 to be held at
 Fields Institute, 222 College Street, Toronto
 | Supported by 
 
  |   
                | Organizing CommitteeJohn Friedlander, University of Toronto
 Kristin Lauter, Microsoft Research
 | Igor Shparlinski, Macquarie University
 Hugh Williams, University of Calgary
 |    This is a follow-up 
            workshop which is related to and built on the success of the Thematic 
            Program on Cryptography  which was held at the Fields institute 
            in 2006. Its purpose is to survey the foremost achievements in the 
            area (partially inspired by the success of the Thematic Program) and 
            also to outline new directions for further investigation. 
             Overview This program will engage the cryptographic and mathematical communities 
              in Canada and abroad to increase awareness of recent developments 
              in these fields and to initiate a greater degree of collaboration 
              in attacking the important problems, particularly on the boundaries. 
              Developments in certain areas of mathematics (for example, number 
              theory, combinatorics, algebraic geometry) and in cryptography are 
              both numerous and rapid; however, it is often the case that lack 
              of contacts and communication between cryptographers and mathematicians 
              presents obstacles in achieving significant advances on both sides. 
              We hope to overcome these obstacles and foster new links between 
              both areas. The specific areas of concentration will be: 
              algebraic curves and cryptographycomputational challenges arising in algorithmic number theory 
                and cryptographygroup theory based cryptographynew cryptographic protocols  It is planned to have to a series of invited talks surveying recent 
              advances in the above areas and several contributed talks by some 
              participants describing their most recent results. 
 Confirmed Speakers  
              Adi Akavia, (IAS)Daniel Bernstein (University of Illinois at Chicago )
 Reinier Bröker (Microsoft Research )
 Craig Gentry(IBM)
 Robert Granger (Claude Shannon Institute/Dublin City University 
                )
 Antoine Joux ( Université de Versailles )
 Tanja Lange (Technische Universiteit Eindhoven )
 Kenny Paterson (Royal Holloway, University of London )
 François Morain (Ecole polytechnique et University of Waterloo)
 Éric Schost (University of Western Ontario )
 Katherine Stange (Brown University )
 Rainer Steinwandt (Florida Atlantic University)
 Andrew Sutherland (MIT)
 Edlyn Teske (University of Waterloo )
 Jean-Pierre Tillich (INRIA )
   Program 
              
                 
                  | Monday, May 11 |   
                  | 8:45-9:15 | Registration and Morning Coffee and refreshments 
                    Banquet tickets for sale (The last day to purchase May 14 
                    banquet tickets) |   
                  | 9:15-9:30 | Welcome |   
                  | 9:30-10:30 | Antoine Joux, Université de Versailles Looking back at lattice-based cryptanalysis
 |   
                  | 10:30-11:00 | Break |   
                  | 11:00-Noon | Jean-Pierre Tillich, INRIA Title TBA
 |   
                  | Noon-2:00 | Lunch Break |   
                  | 2:00-3:00 | Craig Gentry, IBM Fully Homomorphic Encryption Using Ideal Lattices
 |   
                  | 3:00-3:30 | Break |   
                  | 3:30-4:30 | Rainier Steinwandt, Florida Atlantic 
                    University Speeding up algebraic attacks: Multiple Right Hand Sides 
                    in hardware?
 |   
                  | 5:00 | Reception hosted by Microsoft |   
                  | Tuesday, May 12 |   
                  | 9:00-9:30 | Morning Coffee and refreshments |   
                  | 9:30-10:30 | Andrew Sutherland, MIT Powered by Volcanoes: Three New Algorithms
 |   
                  | 10:30-11:00 | Break |   
                  | 11:00-Noon | Eric Schost, University of Western Ontario Fast arithmetics in Artin-Schreier towers over finite fields
 |   
                  | Noon-2:00 | Lunch Break |   
                  | 2:00-2:25 | Nicolas Meloni, University of Waterloo Elliptic curve point scalar multiplication combining double 
                    bases and Yao's algorithm
 |   
                  | 2:30-2:55 | Koray Karabina, University of Waterloo Factor-4 and 6 compression of cyclotomic subgroups
 |   
                  | 3:00-3:30 | Break |   
                  | 3:30-3:55 | Peter Birkner, Eindhoven University of 
                    Technology Edwards Curves and the ECM Factorisation Method
 |   
                  | 4:00-4:25 | Atefeh Mashatan, Swiss Federal Institute 
                    of Technology Recent Designs for Message Recognition Protocols
 |   
                  | 4:30-4:55 | Felix Fontein, University of Calgary A Concise Interpretation of the Infrastructure of a Global 
                    Field
 |   
                  | Wednesday, May 13 |   
                  | 9:00-9:30 | Morning Coffee and refreshments |   
                  | 9:30-10:30 | Reinier Bröker, Microsoft Research Constructing cryptographic curves with complex multiplication
 |   
                  | 10:30-11:00 | Break |   
                  | 11:00-Noon | François Morain, École Polytechnique 
                    and University of Waterloo Advances on the CM method for elliptic curves
 |   
                  | 12:00 noon | Free afternoon |   
                  | Thursday, May 14 |   
                  | 9:00-9:30 | Morning Coffee and refreshments |   
                  | 9:30-10:30 | Katherine Stange, Harvard University The Elliptic Curve Discrete Logarithm Problem and Equivalent 
                    Hard Problems for Elliptic Divisibility Sequences
 |   
                  | 10:30-11:00 | Break |   
                  | 11:00-Noon | Edlyn Teske, University of Waterloo On Pairing-Friendly Elliptic Curves
 |   
                  | Noon-2:00 | Lunch Break |   
                  | 2:00-3:00 | Adi Akavia, IAS Solving Hidden Number Problem with One Bit Oracle and Advice
 |   
                  | 3:00-3:30 | Break |   
                  | 3:30-4:30 | Kenny Paterson, Royal Holloway, University 
                    of London Non-Interactive Key Distribution and Identity-Based Encryption: 
                    A Retrospective Perspective
 |   
                  | 4:30-4:45 | Break |   
                  | 4:45-5:15 | Sanjit Chatterjee, University of Waterloo Reusing Static Keys in Key Agreement Protocols
 |   
                  | 6:00 p.m. | Conference Dinner Dinner with cash bar. A banquet dinner will be held on Thursday May 14 at a local 
                    restaurant, tickets required.
 |   
                  | Friday, May 15 |   
                  | 9:00-9:30 | Morning Coffee and refreshments |   
                  | 9:30-10:30 | Tanja Lange, Technische Universiteit 
                    Eindhoven Pairings on Edwards curves
 |   
                  | 10:30-11:00 | Break |   
                  | 11:00-Noon | Dan Bernstein, University of Illinois 
                    at Chicago High-speed cryptography
 |   
                  | Noon-2:00 | Lunch Break |   
                  |  |  |  
 Participant List 
               
                | Fullname | University Name |   
                | Akavia, Adi | MIT |   
                | Anghel, Catalina | University of Toronto |   
                | Bernstein, Daniel | University of Illinois at Chicago |   
                | Birkner, Peter | Eindhoven University of Technology |   
                | Bröker, Reinier | Microsoft Research |   
                | Brown, Dan | Certicom Research |   
                | Chatterjee, Sanjit | University of Waterloo |   
                | De Feo, Luca | LIX, Laboratoire d'Informatique de l'X |   
                | F.I. Chowdhury, Muhammad | University of Western Ontario |   
                | Fontein, Felix | University of Calgary |   
                | Friedlander, John | University of Toronto |   
                | Gentry, Craig | IBM |   
                | Gonzalez, Madeline | Florida Atlantic University |   
                | Gorla, Elisa | University of Zurich |   
                | Granger, Robert | Dublin City University |   
                | Greenberg, Matthew | University of Calgary |   
                | Hosseini Lavasani, Syed Ahmad | University of Calgary |   
                | Joux, Antoine | Université de Versailles |   
                | Karabina, Koray | University of Waterloo |   
                | Lange, Tanja | Technische Universiteit Eindhoven |   
                | Lauter, Kristin | Microsoft Research |   
                | Mashatan, Atefeh | EPFL (Swiss Federal Institute of Technology, Lausanne) |   
                | Meloni, Nicolas | University of Waterloo |   
                | Morain, Francois | École Polytechnique, LIX |   
                | Orser, Brenda | B.I.O. Letha Information Systems, Inc. |   
                | Ostafe, Alina | University of Zurich |   
                | Paterson, Kenny | Royal Holloway, University of London |   
                | Rasslan, Mohamed | Concordia University |   
                | Scheidler, Renate | University of Calgary |   
                | Schost, Éric | University of Western Ontario |   
                | Shparlinski, Igor | Macquarie University |   
                | Stange, Katherine | Brown University |   
                | Steinwandt, Rainer | Florida Atlantic University |   
                | Sutherland, Andrew | Massachusetts Institute of Technology |   
                | Teske, Edlyn | University of Waterloo |   
                | Walsh, Gary | CSEC & University of Ottawa |   
                | Weir, Colin | University of Calgary |   
                | Williams, Hugh C. | University of Calgary |   
                | Zhang, Ning | University of Waterloo |   TRAVEL SUPPORT Application for travel support for PDF's and graduate students. 
              Deadline to apply was April 1, 2009
  
              Back to top  
 |  |