Click on a theme or a project in the table below for more information.
Subproject PDC1.2: Cryptographic Methods
Subproject leader
Dr.ir. H.J.J. te Riele (CWI)
Research description
Many modern cryptosystems are based on the difficulty
of number-theoretic problems. For example, the
well-known public-key cryptosystem RSA derives its
cryptographic strength from the difficulty of factoring
large numbers. Although practical experience with the
known algorithms for solving these problems suggests
that their solutions are intrinsically difficult, no
rigid proof of that is known thus far. These
cryptosystems are used widely and on a long-term basis,
and their providers and users are continuously
interested to know how long these may be expected to be
secure. Therefore, it is necessary to spend continuous
research efforts on the study, improvement and analysis
of existing algorithms and the development of new
algorithms for the solution of the number-theoretic
problems, which underlie modern cryptosystems. This
contributes to a permanent validation of these
cryptosystems, enlarges their reliability, and keeps
up-to-date our scientific and practical knowledge about
the best possible attacks to these systems.
Associate partners
PDC1.2 Researchers funded by BRICKS
- Dr.ir. H.J.J. te Riele (CWI)
- Prof. dr. H.C.A. van Tilborg (TU/e)
- Prof.dr. A.K. Lenstra (Citibank New York and TU/e)
- Drs. A.K. Batenburg (CWI)
- Drs. R. de Haan (CWI)
For more information, please refer to the publications and posters of this project.
|
