Description
Leader of the group Cryptology: Ronald Cramer.
News
Five Veni grants for CWI researchers
The Netherlands Organisation for Scientific Research (NWO) has awarded Veni grants to Jop Briët, Jiyin He, Wouter Koolen, Marc Stevens and Xiaodong Zhuge of CWI.
CWI joins Sino-European research network LIAMA
Centrum Wiskunde & Informatica (CWI) has officially joined research network LIAMA. The Sino-European Laboratory in Computer Science, Automation and Applied Mathematics (LIAMA) is a research lab consisting of European and Chinese research institutes in the field of mathematics and computer science. LIAMA conducts research, training and transfer projects in these fields. CWI will join the lab as one of the founding members.
Ronald Cramer inaugurated as KNAW Member
On 30 September 2013 Ronald Cramer, head of the Cryptology group of Centrum Wiskunde & Informatica (CWI) and a professor of cryptology at the Mathematical Institute of Leiden Universi
Two CWI cryptographers honoured at CRYPTO 2013
During CRYPTO – one of the two leading crypto conferences in the world – two researchers from Centrum Wiskunde & Informatica (CWI) in Amsterdam were honoured: Ronald Cramer and Marc Stevens. The 33rd CRYPTO conference took place in Santa Barbara, Ca., USA in August 2013.
Current events
RISC seminar: Lattice based Cryptography (PROMETHEUS)
- 2019-05-03T13:30:00+02:00
- 2019-05-03T17:00:00+02:00
RISC seminar: Lattice based Cryptography (PROMETHEUS)
Start: 2019-05-03 13:30:00+02:00 End: 2019-05-03 17:00:00+02:00
Everyone is welcome to attend this CR seminar with four talks on the topics of lattice-based cryptography, lattice algorithms and cryptanalysis. Speakers:
Thomas Prest (PQShield): All Along the Ring Tower: Algebraic Structures for Fun and Profit
Serge Fehr (CWI, Amsterdam): Security of the Fiat-Shamir Transformation in the Quantum Random Oracle Model
Thijs Laarhoven (TU Eindhoven): Lattice algorithms for the closest vector problem with preprocessing
Alice Pellet--Mary (ENS Lyon): Approx-SVP in Ideal Lattices with Pre-processing and (maybe) some extensions
See the website for the abstracts.
Members
Associated Members
Publications
-
Abspoel, M.A, Bouman, N.J, Schoenmakers, L.A.M, & de Vreede, N. (2019). Fast secure comparison for medium-sized integers and its application in binarized neural networks. In Topics in Cryptology – CT-RSA 2019 (pp. 453–472). doi:10.1007/978-3-030-12612-4_23
-
Ducas, L, & Pellet-Mary, A. (2018). On the statistical leak of the GGH13 multilinear map and some variants. In Advances in Cryptology - ASIACRYPT (pp. 465–493). doi:10.1007/978-3-030-03326-2_16
-
Yu, Y, & Ducas, L. (2018). Learning strikes again: The case of the DRS signature scheme. In Advances in Cryptology - ASIACRYPT 2018 (pp. 525–543). doi:10.1007/978-3-030-03329-3_18
-
Ducas, L, & Pierrot, C.A. (2018). Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices. Designs, Codes and Cryptography. doi:10.1007/s10623-018-0573-3
-
Cramer, R.J.F, Damgård, I.B, Escudero, D, Scholl, P, & Xing, C. (2018). SPDZ_{2^k}: Efficient MPC mod 2^k for dishonest majority. In Advances in Cryptology - CRYPTO 2018 (pp. 769–798). doi:10.1007/978-3-319-96881-0_26
-
Bonnoron, G, Ducas, L, & Fillinger, M.J. (2018). Large FHE Gates from tensored homomorphic accumulator. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-89339-6_13
-
Ducas, L. (2018). Shortest vector from lattice sieving: A few dimensions for free. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 125–145). doi:10.1007/978-3-319-78381-9_5
-
Bos, J.W, Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schanck, J.M, … Stehlé, D. (2018). CRYSTALS - Kyber: A CCA-secure Module-Lattice-Based KEM. In 3rd IEEE European Symposium on Security and Privacy, EURO S & P 2018 (pp. 353–367). doi:10.1109/EuroSP.2018.00032
-
de Boer, K, Ducas, L, Jeffery, S, & de Wolf, R. M. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 101–120). doi:10.1007/978-3-319-79063-3_5
-
Benhamouda, F, Blazy, O, Ducas, L, & Quach, W. (2018). Hash Proof Systems over lattices revisited. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 644–674). doi:10.1007/978-3-319-76581-5_22
Software
NewHope: Fast implementation of a quantum-resistant key exchange
NewHope is the reference implementation of a quantum-resistant key exchange protocol.
Counter-Cryptanalysis: detecting forged digital MD5, SHA-1 signatures
The Counter-Cryptanalysis project provides a drop-in replacement for the existing cryptographic hash functions MD5 and SHA-1.
HashClash: A framework for studying the weaknesses of MD5 and SHA-1
HashClash is a software framework for cryptanalysis of the MD5 and SHA-1 cryptographic hash functions, and for Chosen-Prefix Collisions for MD5.
Current projects with external funding
-
Cryptanalysis of Lattice-based Cryptography
-
Samenwerkingsovereenkomst met TNO vwb promotieonderzoek Thomas Attema
-
Secure scalable policy-enforced distributed data processing
-
Advies inzake post-quantum cryptografie (impact quantum computing op beveiligingswaarde huidige cryptografische technieken) (Advies inzake post-quantum cryptografie)
-
Algebraic Methods for Stronger Crypto (ALGSTRONGCRYPTO)
-
PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS (PROMETHEUS)
-
Scalable Oblivious Data Analytics (SODA)
Related partners
-
ABN AMRO Bank
-
IBM
-
ING Bank
-
KLM
-
Orange SA
-
Philips
-
Royal Holloway & Bedford New College, University of London
-
Ruhr-Universität Bochum, Germany
-
Scytl Secure Electronic Voting SA
-
Thales
-
Université de Rennes
-
Weizmann Institute
-
Ecole Normale Superieure
-
TNO
-
Universidad Politecnica Catalunya
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam