Future Events

There are currently no items in this folder.

Past Events

SAC 2008 -- Workshop on Selected Areas in Cryptography
  Mount Allison University, 2008-08-14 08:30 - 2008-08-15 17:00

The AceCrypt research group at Mount Allison University welcomes you to the 15th Annual International Workshop on Selected Areas in Cryptography (SAC 2008).

Block Ciphers and Cryptographic Hash Functions
  Mount Allison University, Sackville, NB, 2007-08-27 10:00 - 2007-08-30 12:00

The AceCrypt research group at Mount Allison University invites you to participate in a 4-day mini course given by renowned cryptographer Vincent Rijmen, co-creator of the Advanced Encryption Standard (AES), the most widely implemented block cipher in the world.

[m=ec^2] Complex Double Bases applied to Scalar Multiplication on Algebraic Curves
  Dunn 108 (Mini Wu), 2006-11-24 14:30 - 2006-11-24 15:15

Francesco Sica wraps up m=ec^2 by exposing how the use of a double base expansion of a scalar multiplier gives way to a new class of scalar multiplication algorithms capable of beating the fastest known implementations on Koblitz curves, with negligible additional memory.

[m=ec^2] Fast Arithmetic in the Jacobian of non-Hyperelliptic Curves of Genus 3
  Dunn 108 (Mini Wu), 2006-11-24 13:45 - 2006-11-24 14:30

For the second seminar of m=ec^2, Roger Oyono will present a fast addition algorithm in the Jacobian of non-hyperelliptic curves of genus 3. The presented algorithm has a nice geometric interpretation, comparable to the classic chord and tangent law for the elliptic curves.

[m=ec^2] Divisor Class Halving on Hyperelliptic Curves
  Dunn 108 (Mini Wu), 2006-11-24 13:00 - 2006-11-24 13:45

We begin the m=ec^2 conference with Peter Birkner presenting a halving algorithm for divisor classes of genus 2 curves over finite fields of characteristic 2.

m=ec^2
  Dunn 108 (Mini Wu), 2006-11-24 13:00 - 2006-11-24 15:15

Three lectures on implementation issues for curve-based cryptography by Peter Birkner, Roger Oyono (Fields Institute) and Francesco Sica

Efficient Scalar Multiplication by Isogeny Decompositions
  Dunn 108 (MiniWu), 2006-04-11 14:00 - 2006-04-11 15:00

The authors derive a new tripling algorithm to find complexity improvements to triplication on a curve in certain projective coordinate systems, then combine this new operation to non-adjacent forms for $\ell$-adic expansions in order to obtain an improved strategy for scalar multiplication on elliptic curves.

The provable security of asymmetric privacy and authenticity: definitions, design methodologies, proof techniques and related issues
  Dunn 108 (24-25) and room Dunn 106 (26), 2005-08-24 14:30 - 2005-08-26 16:30

This series of lectures explains the provable security approach with a focus on privacy (encryption) and authenticity (signature) in the public-key setting. The scope of this course extends from foundations of encryption and signature schemes to proof methodologies (with an emphasis on the random oracle model) for existing constructions and research issues related to improving current reduction techniques. The course is therefore suitable for undergraduate and graduate students in computer science with minimal or basic knowledge in cryptography.

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
  Dunn 108, Mount Allison University, 2005-08-23 15:00 - 2005-08-23 16:00

We provide evidence that the unforgeability of several discrete-log based signatures such as Schnorr signatures *cannot* be equivalent to the discrete log problem in the standard model. This contradicts in nature well-known proofs standing in weakened proof methodologies, in particular proofs employing various formulations of the Forking Lemma in the random oracle model. Our impossibility proofs apply to many discrete-log-based signatures like ElGamal signatures and their extensions, DSA, ECDSA and KCDSA as well as standard generalizations of these, and even RSA-based signatures like GQ.

COMP/MATH 4651 - Cryptography
  Dunn 104, 2005-01-03 12:30 - 2005-04-19 13:30

This course is an introduction to cryptographic algorithms and the cryptanalysis of these algorithms, with an emphasis on the fundamental principles of information security. Topics include: classical cryptosystems, modern block and stream ciphers, public-key ciphers, digital signatures, hash functions, key distribution and agreement.

The FOX Block Ciphers
  Avard-Dixon 118, 2004-10-19 13:00 - 2004-10-19 14:00

This talk will begin with an overview of block ciphers. I will then describe the FOX block cipher family introduced at SAC 2004 by Junod and Vaudenay. This family consists of a 64-bit cipher and a 128-bit cipher. The FOX block ciphers are not substitution-permutation networks (SPNs) or Feistel networks, but instead are based on the Lai-Massey scheme. We will examine the internal components of the FOX ciphers, considering implications for security and efficiency.

Annual BBQ
  Dr. Sica's backyard, 2004-07-28 18:00 - 2004-07-28 22:00

Our first cryptographic barbeque.

Student Summer Research Presentations
  Dunn 108, 2004-07-28 15:30 - 2004-07-28 17:30

Lucas Cornelisse, Roanne Rondina and Ian Scrimger will give a short presentation of their summer research projects.

Algorithms for implementing fast arithmetic for cryptographic applications
  Avard-Dixon 118, 2004-07-16 10:30 - 2004-07-23 14:30

From July 16 to 23, we will have a summer seminar series on Implementation Issues of Cryptographical Algorithms given by our guest researcher Dr. Roberto Avanzi from the Institute for Experimental Mathematics, University of Duisburg-Essen, Germany. This event is supported in part by Leadership Mount Allison grant #211.