Search by date:
1998
|
1999
|
2000
|
2001
|
2002
|
2003
|
2004
|
2005
|
2006
|
2007
|
2008
|
2009
|
2010
|
2011
|
2012
|
2013
|
2014
|
2016
|
2017
|
2018
|
2019
| Forthcoming
If you wish to be informed about our seminars by email,
please contact Francesco Berti, Olivier Pereira or François-Xavier Standaert .
Seminars for the year 2004
January 2004
January 12, 11:00 - Arithmetic of C34 curves
by Andreas Enge
| Date: | January 12, 2004 - 11:00 |
| Location: | Salle Shannon - Maxwell Building, first floor.
Place du Levant, 3 - 1348 Louvain-la-Neuve |
| Abstract: | When conceiving a cryptosystem based on some class of algebraic curves,
it is necessary to make the arithmetic of the underlying groups explicit.
How to compute in elliptic and hyperelliptic curves is well-known.
I will expose our work on the next simple class of algebraic curves,
namely superelliptic cubics and (slightly more general) C34 curves.
Besides a new algorithm, especially easy to implement using polynomial
arithmetic, we have obtained explicit formulae suitable for implementations
in constrained devices. |
| Link: | |
January 22, 14:00 - Preuves de sécurité en clé secrète
by Jacques Patarin
| Date: | January 22, 2004 - 14:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | Dans cet exposé je présente une technique générale de preuve en
cryptographie à clé secrète: la "méthode des coefficients H". Je donne ensuite plusieurs exemples de résultats que l'on a pu obtenir au moyen de cette méthode, en particulier sur les générateurs de fonctions et les générateurs de permutations pseudo-aléatoires. On obtient alors des généralisations du One-Time Pad et du théorème de Luby-Rackoff. Enfin j'indique plusieurs problèmes ouverts qui devraient pouvoir être résolus d'ici quelques années au moyen de ces techniques. |
| Link: | |
April 2004
April 22, 11:00 - Collaborative architecture to prevent coordinated attacks from deception networks
by Joaquín García
| Date: | April 22, 2004 - 11:00 |
| Location: | Room 207, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | We present the design of a collaborative system to
share alerts between cooperative nodes in a secure multicast
infrastructure. The purpose of this system is to detect and prevent the use of deception resources to perform coordinated attacks against third party networks. By means of a decentralized scheme based on message passing, the different nodes of this system will collaborate to detect its participation on a coordinated attack and will react to
stop it. An overview of the implementation of this architecture for GNU/Linux systems will demonstrate the practicability of the system.
|
| Link: | http://www.ccd.uab.es/~joaquin/jnq/jnq160304/
http://www.ccd.uab.es/~joaquin/jnq/jnq160304.pdf
|
September 2004
September 10, 14:00 - Hardware countermeasures against side-channel attacks
by Kris Tiri
| Date: | September 10, 2004 - 14:00 |
| Location: | Salle Belevitch - Maxwell Building
Place du Levant, 3 - 1348 Louvain-la-Neuve |
| Abstract: | Small, embedded integrated circuits such as smart cards are vulnerable to
so-called side-channel attacks. The attacker can gain information and find
the secret key by monitoring the power consumption, execution time,
electromagnetic radiation and other information that is leaked by the
switching behavior of digital CMOS gates. The goal of hardware
countermeasures is to balance the power consumption of the logic gates. A
major advantage of such an approach is that it is independent of the
cryptographic algorithm or arithmetic implemented and that there is no
need to train the VLSI designer to become a security expert or vice versa.
The idea is to create digital circuit styles that have a switching
behavior independent of the data or sequence of data that they are
processing. This presentation will introduce the requirements of a
constant power consuming circuit style, present circuit styles and tackle
the key problem of balancing the interconnect load at the output of the
logic gates.
|
| Link: | |
December 2004
December 10, 00:00 - Parallel Montgomery multiplication in GF(2^k) using trinomial residue arithmetic
by Laurent Imbert
| Date: | December 10, 2004 - 00:00 |
| Location: | Salle Ampère - Maxwell building, ground floor.
Place du Levant, 3 - 1348 Louvain-la-Neuve |
| Abstract: | We propose the first general multiplication algorithm in $GF(2^k)$ with a subquadratic area complexity of $\mathcal{O}(k^{8/5}) = \mathcal{O}(k^{1.6})$. We represent the elements of $GF(2^k)$ according to $2n$ pairwise prime trinomials, $T_1,\dots,T_{2n}$, of degree $d$, such that $nd \geq k$. Our algorithm is based on Montgomery's multiplication applied to the ring formed by the direct product of the $n$ first trinomials. |
| Link: | http://eprint.iacr.org/2004/279/ |
See also:
