Seminars

2006 Seminars

December

  • Virtual monotonic counters and count-limited objects using a TPM
    Luis Sarmenta, MIT
    December 13 (Wednesday): 10:30 - 11:30 am, EIT 3142
  • Ideal lattices: cryptographic applications and open problems
    Daniele Micciancio, University of California, San Diego
    December 11 (Monday): 3:30 - 4:30 pm, DC 1304
  • Two-channel message authentication in ad hoc networks
    Atefeh Mashatan, University of Waterloo
    December 6 (Wednesday): 1:30 - 2:30 pm, DC 1331
November
  • Pairing friendly curves
    Koray Karabina, University of Waterloo
    November 29 (Wednesday): 1:30 - 2:30 pm, MC 5136B
  • Isogenies as a cryptographic primitive
    David Jao, University of Waterloo
    November 22 (Wednesday): 1:30 - 2:30 pm, MC 5136
  • Cryptographic protocols for Machine Readable Travel Documents (MRTDs)
    Kim Nguyen, Bundesdruckerei GmbH
    November 17 (Friday): 1:30 - 2:30 pm, MC 5136B
  • Broadcast encryption and traitor tracing
    Dan Boneh, Stanford University
    November 16 (Thursday): 1:00 - 2:00 pm, DC 1304
  • How to attack anonymity networks
    Nick Mathewson, The Free Haven Project
    November 1 (Wednesday): 1:30 - 2:30 pm, MC 5158
October
  • How to determine whether a given ideal is principal
    Hugh Williams, University of Calgary
    October 27 (Friday): 3:30 - 4:30 pm, MC 5158
  • Divisor class halving on hyperelliptic curves
    Peter Birkner, Technical University of Denmark
    October 18 (Wednesday): 1:30 - 2:30 pm, DC 1331
  • The DNS security mess
    Daniel J. Bernstein, University of Illinois at Chicago
    October 17 (Tuesday): 1:00 - 2:00 pm, DC 1302
  • Logics for reasoning about cryptographic constructions
    Bruce Kapron, University of Victoria & Stanford University
    October 3 (Tuesday): 1:00 - 2:00 pm, MC 5136
August
  • On $\tau$-adic representations of integers
    Nevine Ebeid, University of Waterloo
    August 25 (Friday): 10:00 - 11:00 am, EIT 3151/3153
  • Parallel Montgomery multiplication in GF(2 k) using trinomial residue arithmetic
    Jean Claude Bajard, University de Montpellier
    August 24 (Thursday): 2:00 - 3:00 pm, DC 1331
  • Low complexity bit-parallel square root computation over GF(2 m) for all trinomials and its applications to cryptography
    Francisco Rodriguez-Henriquez, CINVESTAV-IPN
    August 3 (Thursday): 2:30 - 3:30 pm, DC 1331
July
  • Breaking the filter generator
    Tor Helleseth, University of Bergen
    July 25 (Tuesday): 10:00 - 11:00 am, CEIT 3142
  • Constructions of quadratic bent functions in polynomial forms
    Nam Yul Yu, University of Waterloo
    July 13 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Montgomery reduction algorithm for modular multiplication based on low-weight polynomial form integers
    Jaewook Chung, University of Waterloo
    July 6 (Thursday): 1:00 - 2:00 pm, EIT 3151/3153
  • Group structure of curves over finite fields
    Igor Shparlinski, Macquarie University
    July 4 (Tuesday): 3:30 - 4:30 pm, MC 5158
June
  • GF(2^n) multiplication algorithms using shifted polynomial bases
    Haining Fan, University of Waterloo
    June 29 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Non-hyperelliptic modular jacobians of dimension 3
    Roger Oyono, University of Waterloo
    June 27 (Tuesday): 3:30 - 4:30 pm, MC 4064
  • Fast addition on the jacobian of non-hyperelliptic curves of genus 3
    Roger Oyono, University of Waterloo
    June 15 (Thursday): 2:30 - 3:30 pm, DC 1304
  • A concurrent error detection scheme for polynomial basis multiplication
    Siavash Bayat Sarmadi, University of Waterloo
    June 1 (Thursday): 2:30 - 3:30 pm, DC 1331
May
  • Projective unified point addition formulae and side-channel attacks
    Douglas Stebila, University of Waterloo
    May 18 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model
    Sanjit Chatterjee, Indian Statistical Institute
    May 4 (Thursday): 2:30 - 3:30 pm, MC 5158
March
  • Generalized Jacobians in cryptography
    Isabelle Dechene, University of Waterloo
    Mar 23 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Crosscorrelation properties of binary sequences with ideal two-level autocorrelation
    Nam Yul Yu, University of Waterloo
    Mar 16 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Software security: Building security in
    Gary McGraw, Cigital
    Mar 13 (Monday): 2:30 - 3:30 pm, DC 1302
  • Dangerous tunes: Lessons from the Sony CD DRM episode
    J. Alex Halderman, Princeton University
    Mar 9 (Thursday): 2:30 - 3:30 pm, DC 1304
  • Algorithms from the shores of New Brunswick -- or -- Delaying group operations in scalar multiplications to combine inversions with Montgomery's technique
    Roberto Avanzi, Ruhr-Universität Bochum
    Mar 7 (Tuesday): 2:30 - 3:30 pm, DC 1304
  • Algebraic immunity of Boolean power functions
    Yassir Nawaz, University of Waterloo
    Mar 2 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Correcting errors without leaking partial information
    Adam Smith, Weizman Institute of Science
    Mar 2 (Thursday): 10:00 - 11:00 am, MC 5158
February
  • Breaking RSA may be as difficult as factoring
    Dan Brown, Certicom Corp.
    Feb 9 (Thursday): 2:30 - 3:30 pm, MC 5136
  • Playing card ciphers
    Matthew McKague, University of Waterloo
    Feb 2 (Thursday): 2:30 - 3:30 pm, DC 1331
January
  • Pairing-based cryptography at high security levels
    Alfred Menezes, University of Waterloo
    Jan 12 (Thursday): 2:30 - 3:30 pm, DC 1331
  • Elliptic curve cryptography, expander graphs, and the Generalized Riemann Hypothesis
    David Jao, Microsoft Research
    Jan 5 (Thursday): 10:00 - 11:00 am, MC 5158