| |
MissionStatement
|
|
RISC Seminar
Upcoming Event(s)
Directions
Information about how to get to CWI can be found here.
Mailing List
Upcoming seminars are announced via the RISC mailing list. For
subscribing or unsubscribing, send an e-mail to Ronald Cramer and Eike Kiltz:
{cramer,kiltz} (at) cwi.nl .
Contact
For questions and comments send an e-mail to Ronald Cramer and Eike Kiltz: {cramer,kiltz} (at) cwi.nl .
Archive
[2009] [2008] [2007] [2006] [2005] [2004]
Recent Events
RISC Seminar
| Date/Time: | Wednesday 20.01.10, 10:15-14:45h |
| Location: | Snellius Building (Mathematical Institute), Leiden University |
| Room: | zaal 405 |
| 10:15-11:05h | Paul Zimmermann (INRIA Nancy):
An O(M(n) log n) algorithm for the Jacobi symbol
Abstract:
The best known algorithm to compute the Jacobi symbol of two n-bit integers
runs in time O(M(n) log n), using Schönhage's fast continued fraction
algorithm combined with an identity due to Gauss. We give a different
O(M(n) log n) algorithm based on the binary recursive gcd algorithm from
Stehlé and Zimmermann (2004). Our implementation - which to our best
knowledge is the first one in O(M(n) log n) - is faster than GMP's
quadratic implementation up from about 10000 decimal digits. This is joint
work with Richard Brent (ANU, Canberra, Australia).
[↑]
|
| 11:15-12:05h | Peter Montgomery (Microsoft and CWI):
Adapting Block Lanczos to the Huygens supercomputer
Abstract:
Huygens is a Dutch POWER 6 supercomputer at SARA.
We want to run Block Lanczos there, as part of the
linear algebra stage of the RSA-768 factoring effort.
This Lanczos step may need multiple core-years.
We strive to utilize Huygens features while keeping
the Lanczos algorithm intact. Cache awareness seems important.
Keep cores busy. Utilize 128-bit vector type.
This study is underway before the matrix is ready.
We need to guess its size and density while choosing
Lanczos parameters.
[↑]
|
| 12:05-13:00h | Lunch break |
| 13:45-14:45h |
Willemien Ekkelkamp's thesis defense (Location:
Academiegebouw, Rapenburg 73, Leiden) |
|
Special DIAMANT/AQIS/RISC seminar on the Theory and Practice of Quantum Information Processing
| Date/Time: | Wednesday 11.11.09, 12:30-17:00h |
| Location: | Z009 (Euler room), CWI Amsterdam |
| Program: |
| 12:30-13:15h | Ronald de Wolf (CWI):
Quantum computation in theory
Abstract:
We will introduce quantum computers and quantum algorithms from a theoretical perspective.
First we explain how computational concepts like bits and operations can be realized in the context
of quantum theory, and then we sketch the main quantum algorithms that we have today:
Shor's algorithm for factoring, Grover's algorithm for search, and some subsequent algorithms.
The existence of these algorithms is one of the main motivations to actually try to build quantum computers in the lab.
[↑]
|
| 13:15-14:00h | Lieven Vandersypen (TU Delft):
Quantum computation in the lab
Abstract:
Fifteen years after the discovery of Shor's algorithm, experimental
physicists have implemented various quantum protocols in the lab,
including quantum factoring. In this talk, I will discuss what "knobs"
we have available in the lab, and how we can use these knobs to
implement quantum protocols. I will also briefly summarize the
state-of-the-art in various physical realizations of quantum bits, and
comment on future prospects.
[↑]
|
| 14:00-14:45h | Serge Fehr (CWI):
Quantum cryptography - beyond QKD
Abstract:
Quantum cryptography makes use of the quantum-mechanical behavior
of nature for the design and analysis of cryptographic schemes. Optimally
- yet not always - quantum cryptography allows for the design of cryptographic
schemes whose security is guaranteed solely by the laws of nature. This is in sharp contrast to (most of) the cryptographic schemes that are in use, which can be broken with sufficient computing power.
In this talk, I will briefly recall the traditional application, quantum key distribution (QKD), but then I will mainly focus on recent new developments in quantum cryptography to 2-party cooperation (2PC). Whereas QKD protects honest parties against dishonest outsiders, 2PC protects against possibly dishonest insiders. While it has been known for a while that quantum 2PC schemes cannot be secure against adversaries that are limited merely by the laws of quantum mechanics, several quantum cryptographic schemes for different 2PC tasks have recently been proposed whose security relies on the hardness of reliably storing large quantum states. Although the laws of quantum mechanics do not forbid the possibility of storing large quantum states, from a technological point of view it appears to be an extremely difficult problem, and therefore it is well suited to base cryptographic security upon it.
I will discuss some example quantum 2PC schemes, e.g. an identification scheme that allows to prove knowledge of a password (or PIN) without actually giving away any information on it. While it is quite easy to build up some intuition that these schemes should be secure (assuming a limit on the adversary's quantum storage capabilities), proving them rigorously secure is highly non-trivial and requires new results in quantum information theory, which I will briefly discuss (if time permits).
[↑]
|
| 14:45-15:15h | Break |
| 15:15-16:00h | Carlo Beenakker (Leiden University):
Free electron quantum computation
Abstract:
Linear optics quantum computation forms a promising and popular road
towards a quantum computer, because it does not rely on interactions
between the photons, using only linear optical elements such a beam
splitters, mirrors, and phase shifters. The electronic analogue, a
quantum computer that does not rely on electron-electron interactions,
might be equally promising (not so much because the interactions between
electrons are weak, but because it is difficult to control them). A
"no-go theorem" suggests that the computational power of free fermions
(such as electrons) does not go beyond that of a classical computer.
Here we show how to work around this obstacle, and describe a CNOT gate
for non-interacting electrons.
[↑]
|
| 16:00-16:45h | Robert Spreeuw (UvA):
Array of mesoscopic ensembles for QI science on an atom chip
Abstract:
We have recently produced the first two-dimensional array of magnetic
microtraps for ultracold atoms based on patterned magnetic films. We
typically prepare hundreds of tightly confined and optically resolved
mesoscopic atom clouds containing 10-1000 atoms per site. The design of
our atom chip allows us to shift these clouds along the array and to
locally manipulate single sites using focused lasers. This system forms
an ideal starting point for scalable quantum information experiments.
Careful analysis of absorption images reveals shot-to-shot fluctuations
of the atom number well below the standard Poissonian "shot noise" level, with a Fano factor of 0.6,
for ensembles containing between 50 and 300 atoms. This could be used to
prepare ensembles with well-defined atom numbers and hence improved
fidelity of operations on ensemble qubits. We are currently
investigating the site-selective creation of hyperfine coherence and the
use of highly excited Rydberg states to mediate long-range interactions
between neighbouring microtraps. These could be used to entangle
mesoscopic ensembles of atoms.
[↑]
|
|
RISC/Intercity Number Theory Seminar
| Date/Time: | Friday, 30.10.09, 11:30-17:00h |
| Location: | Turing room, CWI Amsterdam |
| Program: |
| 11:30-12:30h | Andries Brouwer (TU Eindhoven):
The eigenvalues of the graph on the flags of a finite building, joined when in mutual general position |
| 12:30-13:30h | Break |
| 13:30-14:30h | Heng Huat Chan (National University of Singapore):
Class invariants |
| 14:45-15:45h | Juan Garay (AT&T Labs):
Secure Message Transmission with Small Public Discussion |
| 16:00-17:00h | Ronald Cramer (CWI and Leiden University):
Towers of Algebraic Function Fields in Secure Computation |
|
RISC Seminar
| Date/Time: | Wednesday 11.03.09, 11:00-13:00h |
| Location: | Snellius Building (Mathematical Institute), Leiden University |
| Room: | B01 (ground floor) |
| 11:00-11:45h | Carles Padro (UPC Barcelona):
Ideal (and non-ideal) secret sharing schemes and matroids (survey)
Abstract:
The connection between secret sharing and matroid theory is known since
the early 90s. In this talk we survey the results on this topic with
special emphasis on the most recent ones. In particular, we discuss some
recent results that have been obtained by applying, for the first time in
secret sharing, the so-called non-Shannon information inequalities.
[↑]
|
| 12:00-12:30h | David Freeman (CWI and Leiden):
Signing a linear subspace: Signatures for network coding
Abstract:
Network coding offers increased throughput and improved robustness to
random faults in completely decentralized networks. Since it does not
require centralized control, network coding has been suggested
for routing packets in ad-hoc networks, for content distribution in
peer-to-peer file systems, and for improving the efficiency of
large-scale data dissemination over the Internet.
In contrast to traditional routing schemes, however, network coding
requires intermediate nodes to modify data packets en route. For this
reason, standard signature schemes are inapplicable and it is a
challenge to provide resilience to tampering by malicious nodes.
After reviewing the basics of network coding, we will describe a secure,
efficient signature scheme that can be used in conjunction with network
coding to prevent malicious modification of
data. Our scheme can be viewed as signing linear subspaces in the sense
that a signature $\sigma$ on a subspace $V$ authenticates exactly those
vectors in $V$.
This research is joint work with Dan Boneh (Stanford), Jonathan Katz
(Maryland), and Brent Waters (Austin).
[↑]
|
| 12:30-13:00h | Alp Bassa (CWI and Leiden):
Asymptotically Good Self-Dual Codes from Towers of Function Fields
Abstract:
It has been known for a long time that the class of self-dual codes over a
finite field is asymptotically good and that it attains the
Gilbert-Varshamov bound. Stichtenoth showed that over fields with
quadratic cardinality self-dual codes even attain the Tsfasman-Vladut-Zink
bound. In this talk I will explain this construction and show how one can
obtain an analogous result for self-dual codes over cubic finite fields
using some well-known facts about quadratic forms and a new tower of
function fields.
[↑]
|
| 15:00-16:00h | Robbert de Haan's PhD defense
(Location: Academie-Gebouw, not Mathematical Institute)
|
|
DIAMANT/RISC Seminar
| Date/Time: | Wednesday 04.03.09, 14:00-16:45h |
| Location: | CWI Amsterdam, Room M280 |
| 14:00-14:45h | David Cash (Georgia Tech):
Efficient Circular-Secure Encryption from Hard Learning Problems
Abstract:
We construct efficient and natural encryption schemes that remain
secure (in the standard model) even when used to encrypt messages that
may depend upon their secret keys. Our schemes are
based on well-studied ``noisy learning'' problems. In particular, we design
1) A symmetric-key cryptosystem based on the ``learning parity with
noise'' (LPN) problem, and
2) A public-key cryptosystem based on the ``learning with errors''
(LWE) problem, a generalization of LPN that is at least as hard as
certain worst-case lattice problems (Regev, STOC 2005; Peikert,
STOC 2009).
Remarkably, our constructions are close (but non-trivial) relatives of
prior schemes based on the same assumptions --- which were proved
secure only in the usual key-independent sense --- and are nearly as
efficient. For example, our most efficient public-key scheme encrypts
and decrypts in amortized O-tilde(n) time per message bit, and has
only a constant ciphertext expansion factor. This stands in contrast
to the only other known standard-model schemes with provable security
for key-dependent messages (Boneh et a.l, CRYPTO 2008), which incur a
significant extra cost over other semantically secure schemes based on
the same assumption. Our constructions and security proofs are simple
and quite natural, and use new techniques that may be of independent
interest.
This is joint work with Chris Peikert and Amit Sahai.
[↑]
|
| 15:00-15:45h | Martijn Stam (EPFL):
Blockcipher Based Hashing Revisited
Abstract:
We revisit the rate-1 blockcipher based hash
functions as first studied by Preneel, Govaerts
and Vandewalle (Crypto'93) and later extensively analysed by Black,
Rogaway and Shrimpton (Crypto'02). We analyse a further generalization
where any pre- and postprocessing is considered.
This leads to a clearer understanding of the current classification of
rate-1 blockcipher based schemes as introduced by
Preneel et al. and refined by Black et al. In addition, we also
gain insight in chopped, overloaded and supercharged compression
functions. In the latter category we propose two compression functions
based on a single call to a blockcipher whose collision resistance
exceeds the birthday bound on the cipher's blocklength.
[↑]
|
| 16:00-16:45h | Sebastian Faust (KU Leuven):
Leakage-Resilient Signatures
Abstract:
The traditional security notion for digital signature schemes requires
it to be hard for an adversary to forge a valid signature, even after
having obtained signatures for messages of its choice. This security
notion has often proved to be insufficient in practice where an
adversary can use ``side-channel attacks'' to obtain additional
information about the secret state that is accessed to compute the
signatures.
We propose the security notion of "leakage-resilient signatures",
where the adversary may obtain arbitrary information about the secret
state, as long as the amount of this information is bounded in each
signature query. This notion naturally captures security against all
possible side-channel attacks where the adversary only obtains a
bounded amount of information during each measurement. We also provide
the first instantiation of a leakage-resilient signature scheme. Our
construction is a generic tree-based transformation from any standard
signature scheme and it is provably leakage-resilient given that the
underlying standard signature scheme is secure in the traditional
sense.
This is joint work with Eike Kiltz and Krzysztof Pietrzak
[↑]
|
|
RISC Seminar
| Date/Time: | Wednesday 21.01.09, 16:00-17:00h |
| Location: | CWI Amsterdam, Room M280 |
| 16:00-17:00h | Victor Shoup
(New York University):
Public Key Encryption: Concepts and Results, Old and New
Abstract:
I will review standard definitions of
secure public-key encryption, as well as constructions
of schemes that satisfy these definitions (under various
assumptions). I will also present an overview of recent
work on "circular secure" encryption schemes.
[↑]
|
|
Special DIAMANT/RISC seminar on Algebraic Function Fields and Their Cryptographic Applications.
| Date: | Tuesday 21.10.08 |
| Location: | CWI Amsterdam, Room M280 |
| Program: |
| 13:00-13:45h | Ignacio Cascudo Pueyo (U. de Oviedo):
Reducing the difference between the thresholds in AG-based secret sharing schemes
Abstract:
We take a closer look at the strongly multiplicative algebraic
geometric ramp schemes introduced by Chen and Cramer in 2006, and discuss
some situations where, by carefully selecting the parameters of the
scheme, the difference between the privacy and reconstruction thresholds
can be made smaller (joint work with H. Chen, R. Cramer and C. Xing).
[↑]
|
| 14:00-14:45h | Oriol Farr�s (UPC Barcelona): On the access structure of Algebraic Geometric Schemes
Abstract:
Chen and Cramer proposed a new family of linear secret sharing schemes
(LSSS), constructed from algebraic geometric Goppa codes, that provide
multiparty computation (MPC) protocols over small fields. In this talk, we
analyze how these algebraic geometric LSSS can be used to obtain secure MPC
protocols. Specifically, we study the (strong) multiplication property of
these schemes and we give a characterization of the access structure of the
schemes defined by hyperelliptic curves. Combining these results, we present
non-threshold adversary structures for which is not possible to build secure
MPC protocol by composing threshold schemes, but it is possible by using
algebraic LSSS. Joint work with Carles Padro' and Iwan Duursma.
[↑]
|
| 15:15-16:00h | Ruud Pellikaan (TU/e): Efficient construction of algebraic geometry codes; the q-th power algorithm
Abstract:
A survey of the parameters and the construction of algebraic geometry
codes will be given. The q-th power algorithm for the computation of
the integral closure of a ring in finite characteristic will be
explained in some detail.
[↑]
|
| 16:15-17:00h | Alp Bassa (EPFL Lausanne): A new tower over cubic finite fields
Abstract:
After a short introduction to towers of algebraic function fields, I
will introduce a new explicit tower over cubic finite fields, whose
limit attains Zink's lower bound. Many features of this tower are very
similar to those of an optimal tower of Garcia-Stichtenoth over
quadratic finite fields, whose modularity was shown by Elkies.
This is joint work with A. Garcia and H. Stichtenoth.
[↑]
|
|
Special RISC seminar on Quantum Information Theory.
| Date: | Thursday 09.10.08 |
| Location: | CWI Amsterdam, Room M279 |
| Program: |
| 14:00-14:45h | Serge Fehr (CWI):
High-order entropic uncertainty relations
Abstract:
We study the uncertainty of the measurement outcome when measuring an arbitrary n-qubit quantum state in a basis that is chosen at random from some fixed family of bases. We discuss several canonical cases and obtain (tight) lower bounds on the uncertainty of the measurement outcome, where the uncertainty is measured in terms of the min-entropy. Finally, we briefly point out how these quantum uncertainty relations can be used for designing quantum cryptographic scheme.
[↑]
|
| 14:45-15:30h | David P�rez Garc�a (Universidad Complutense de Madrid): Which is the dimension of my system?
Abstract:
How can one determine from experimental data the Hilbert dimension of a quantum system? We will see in the talk how this question connects with a plethora of different topics inside and outside Quantum Information Theory: Bell inequalities, quantum cryptography, quantum channels, complexity theory, abstract functional analysis, ...
[↑]
|
| 16:00-16:45h | Richard D. Gill (Leiden University): Polish poker and the Bell inequality
Abstract:
I will show that the Bell inequality can be recast in a form
appropriate to Bell-type experiments with any number of outcomes in
the two wings of the experiment. It is then interesting to study the
maximal violation possible by quantum mechanics, as the number of
outcomes increases (or if you like, as the dimension of the Hilbert
spaces increase). I will present numerical evidence for the optimal
quantum measurements and the optimal quantum state for larger and
larger dimension. It appears that quantum mechanics can asymptotically
do as well as is allowed by the mere requirement of non-signalling,
which is: perfectly. The main aim of my talk is to interest the
readers in the many open problems which are suggested by this work.
Reference: arXiv:quant-ph/0612020, joint work with Stefan Zohren,
appeared 2008 in PRL.
[↑]
|
| 16:45-17:30h | Christian Schaffner (CWI): The operational meaning of min- and max-entropy
Abstract:
We show that the conditional min-entropy Hmin(A|B) of a bipartite state
rho_AB is directly related to the maximum achievable overlap with a
maximally entangled state if only local actions on the B-part of rho_AB
are allowed. In the special case where A is classical, this overlap
corresponds to the probability of guessing A given B. In a similar vein,
we connect the conditional max-entropy Hmax(A|B) to the maximum fidelity
of rho_AB with a product state that is completely mixed on A. In the
case where A is classical, this corresponds to the security of A when
used as a secret key in the presence of an adversary holding B. Because
min- and max-entropies are known to characterize information-processing
tasks such as randomness extraction and state merging, our results
establish a direct connection between these tasks and basic operational
problems. For example, they imply that the (logarithm of the)
probability of guessing A given B is a lower bound on the number of
uniform secret bits that can be extracted from A relative to an
adversary holding B. (Joint work with Renato Renner and Robert Koenig)
[↑]
|
|
Special RISC seminar: "Cryptography Applied!".
| Date: | Thursday 02.10.08 |
| Location: | CWI Amsterdam, Room M279 |
| Program: |
| 13:00-13:45h | Ivan Damg�rd (Aarhus):
Multi-Party Computation Goes Live
Abstract:
We report on the first large-scale and practical application of
multiparty computation, which took place in January 2008. Details are
given on the background and motivation for the application, as well as
on the actual system that was employed. We end with some thoughts on
the future potential of multiparty computation in practice.
[↑]
|
| 14:00-14:45h | Tomas Toft (CWI/TU/e): Solving linear programming problems using MPC -- theory vs practice
Abstract:
There are many real-world situations, where there is much to be gained
by having access to a trusted third party. Yet typically this is
either expensive or even not possible at all. Multiparty computation
(MPC) eliminate this dilemma by providing a virtual trusted third
party, who performs the desired computation.
Practical MPC is still in its infancy, yet has been shown feasible in
real life. One interesting problem is that of solving linear
programming (LP) problems. Such problems occurs naturally, e.g. in
economics, which gives rise to a large number of motivating examples.
A relatively simple yet feasible solution to this problem is
presented. The secure computation has been implemented and solves
(small) problem instances in a reasonable amount of time. This
implementation provides a starting point for a discussion of the
differences between theory and practice.
[↑]
|
| 15:00-15:45h | Jan Camenisch (IBM Zurich): Crypto in Practice: Private Authentication
Abstract:
Our privacy is put at risk as more and more of our daily transactions
are done electronically and they all require one to reveal personal
information without being able to control what for this data is used
by whom. This is even made worse storing and mining data becomes ever
easier. In this talk we will discuss how technology can help users to
regain and retain control over their personal data. In particular, we
will see how one can authenticate without identify oneself. We will
conclude with a discussion of open problems.
[↑]
|
| 16:00-16:45h | Ivan Damg�rd (Aarhus): Theory and Practice of Personal Digital Signatures
Abstract:
We take a step towards a more realistic modeling of personal digital
signatures, where the human user, his mobile equipment, his PC and a
server where he may have an account, are all considered as independent
players in the protocol, and where only the human user is assumed
incorruptible. We then propose a protocol for issuing digital
signatures on behalf of the user. This protocol is proactively
UC-secure assuming at most one player is corrupted in every
operational phase. The protocol allows for mobile units with very
small computing power by securely outsourcing computation to the PC
and is also mobile in that it allows usage of any PC that can
communicate properly. Finally, we report on the results of a prototype
implementation of our solution.
Joint work with Gert Mikkelsen
[↑]
|
|
International School on Mathematical Cryptology and
Research Seminar on Cryptology and Coding Theory.
Scientific coordinator: Ronald Cramer (CWI and Leiden University).
| Date: | 22.09.08 - 26.09.08 |
| Location: | Faculty of Mathematics and Statistics, UPC Barcelona |
The program of the research seminar consisted of two invited talks:
and some short talks by
the Spanish Thematic
Network on Mathematics for the Information Society.
The School consisted of four full-day tutorials:
For more details and a
full program
please visit
the ISMC 2008
homepage.
Special RISC seminar on interactions between cryptography and formal methods.
|
Special RISC/Intercity seminar on the occasion of Ronald Cramer's oratie (inaugural lecture).
| Date: | Friday 21.12.07 |
| Location: | First two talks: Mathematical Institute, Leiden, room 174 |
| Inaugural lecture:
Poortgebouw, Rijsburgerweg 10, Leiden. |
| Program: |
| 11:30 - 12:30 h | Ivan Damgård
(Aarhus University, Denmark): The Past, Present and Future of Secure
Multi-Party Computation |
| 13.30 - 14.30 h | Yuval Ishai (Technion and UCLA): Secure Multi-Party Computation in the Head |
| 16.15 - 17.00 h | Ronald Cramer
(CWI, Amsterdam and Leiden university):
Inaugural lecture (in the POORTGEBOUW)
|
|
| Date: | Monday 29.10.07 |
| Location: | CWI Amsterdam, Turing Room (main auditorium) |
| Program: |
| 15.00 - 16.30 h | Adi Shamir (The Weizmann Institute of Science, Israel):
Practical Cryptanalysis of Multi-Variate Schemes |
| Note: the above is a continuous talk (75 minutes plus questions), with no break. |
| 16:30 - | Snacks and drinks |
|
|
Special RISC/Intercity seminar on computational number theory in connection with
cryptography.
|
|
RISC special day on electronic voting
|
RISC Seminar
| Date: | Monday 30.07.07 |
| Location: | CWI Amsterdam, Room M279 |
| 14:00 - 15:00 h | Tomas Toft
(Aarhus University):
Trading sugar beet contracts using MPC |
|
RISC Seminar
| Date: | Wednesday 04.07.07 |
| Location: | CWI Amsterdam, Room M280 |
| Program: |
| 13.30 - 14.15 h | Ueli Maurer (ETH Zurich, Switzerland):
Domain Extension of Public Random Functions: Beyond the Birthday Barrier |
|
Joint seminar with the Université Catholique de Louvain (UCL) Crypto Group, Belgium
| Date: | Thursday 21.06.07 - Friday 22.06.07 |
| Location: | CWI Amsterdam, Room M280 |
| Program: Thursday |
| 14.00 - 14.30 h | Francois Koeune/Ronald Cramer: Short Introduction to the groups |
| 14.30 - 15:00 h | Olivier Pereira (UCL):
The use of techniques from distributed systems for the
analysis of cryptographic protocols |
| 15.00 - 15:30 h | Francois-Xavier Standaert (UCL):
The modelling of side-channel attacks |
| 15.30 - 16:00 h | Benoit Libert (UCL):
Time capsule signatures in the standard model |
| 16.00 - 16:30 h | Serge Fehr (CWI):
Quantum Cryptography and the Bounded-Quantum-Storage Model |
| Program: Friday |
| 10.00 - 10:30 h | Robbert de Haan (CWI):
Secure Computation from Random Error Correcting Codes |
| 10.30 - 11:00 h | Dennis Hofheinz (CWI):
Security in the presence of key-dependent messages |
|
RISC/DIAMANT/Intercity Number Theory Seminar
| Date: | Friday 30.03.07 |
| Location: | Room 405 of the Mathematical Institute in Leiden |
| Program: |
| 11.00 - 11.45 h | Peter Montgomery (Microsoft Research, Redmond, WA):
Parallel block Lanczos |
| 12.00 - 12.45 h | Ramarathnam Venkatesan (Microsoft Research, Redmond, WA):
Cryptographic applications involving spectral
analysis of rapid mixing |
| 13.45 - 14.30 h | Corentin Pontreau (Univ. of Caen):
Bogomolov's problem, small points on varieties |
| 14.45 - 15.30 h | Sierk Rosema (Leiden):
Sturmian substitutions, cutting paths
and their projections |
|
For more information please visit the DIAMANT Intercity
homepage.
Fourth IACR Theory of Cryptography Conference
TCC 2007
| Date: | Thursday 21.02.07-24.02.07 |
| Location: | Trippenhuis, Amsterdam |
| Program: See TCC 2007 homepage |
|
|
|
