Description
Leader of the group Cryptology: Ronald Cramer.
Vacancies
No vacancies currently.
News
TNO, CWI and TU Delft receive 1.8 million for research in quantum security of public key infrastructures
A consortium including TNO, CWI and TU Delft received a 1.8 million grant from NWO to conduct research in the quantum security of public key infrastructures (PKI), which form the basis for secure digital connections and the protection of digital information. Research proposal HAPKIDO was submitted in response to a call from the Dutch National Science Agenda (NWA).
New code breaking record for quantum-safe cryptography
A team of CWI cryptanalysts has set a new code breaking record for the lattice shortest vector problem (SVP) - a foundation for the security of next generation public-key cryptography, designed to be secure against quantum computers.
Léo Ducas wins ERC Starting Grant for quantum-safe cryptography
Léo Ducas from CWI's Cryptology Group is awarded an ERC Starting Grant of 1.5 million euro for research on quantum-safe cryptography. Most of today’s cryptographic methods will not be secure against attacks based on possible future quantum computers.
Gearing up for QCrypt 2020
The latest top results in quantum cryptography will be shared during the upcoming tenth anniversary edition of the QCrypt conference. Welcoming hundreds of visitors from science and industry, QCrypt 2020 will take place as an online event, jointly organized by CWI and the University of Amsterdam.
Members
Associated Members
Publications
-
Ducas, L, & van Woerden, W.P.J. (2022). On the Lattice Isomorphism Problem, quadratic forms, remarkable lattices, and cryptography. In Advances in Cryptology - Eurocrypt 2022 (pp. 643–673). doi:10.1007/978-3-031-07082-2_23
-
Frixons, P, Naya-Plasencia, M, & Schrottenloher, A.C. (2022). Quantum boomerang attacks and some applications. In Proceedings of the International Conference on Selected Areas in Cryptography (pp. 332–352). doi:10.1007/978-3-030-99277-4_16
-
Debris-Alazard, T, Ducas, L, & van Woerden, W.P.J. (2022). An algorithmic reduction theory for binary codes: LLL and more. IEEE Transactions on Information Theory. doi:10.1109/TIT.2022.3143620
-
Bhaumik, R, Bonnetain, X, Chailloux, A.G, Leurent, G, Naya-Plasencia, M, Schrottenloher, A.C, & Seurin, Y. (2021). QCB: Efficient quantum-secure authenticated encryption. In Advances in Cryptology - ASIACRYPT 2021 (pp. 668–698). doi:10.1007/978-3-030-92062-3_23
-
Bonnetain, X, Leurent, G, Naya-Plasencia, M, & Schrottenloher, A.C. (2021). Quantum linearization attacks. In Advances in Cryptology - ASIACRYPT 2021 (pp. 422–452). doi:10.1007/978-3-030-92062-3_15
-
Attema, T, Cramer, R.J.F, & Rambaud, M. (2021). Compressed Σ -Protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. In Advances in Cryptology - ASIACRYPT 2021 (pp. 526–556). doi:10.1007/978-3-030-92068-5_18
-
Abspoel, M.A, Cramer, R.J.F, Escudero, D, Damgård, I.B, & Xing, C. (2021). Improved single-round secure multiplication using regenerating codes. In Advances in Cryptology - ASIACRYPT 2021 (pp. 222–244). doi:10.1007/978-3-030-92075-3_8
-
Guruswami, V, Li, R, Mosheiff, J, Resch, N.A, Silas, S, & Wootters, M. (2021). Bounds for list-decoding and list-recovery of random linear codes. IEEE Transactions on Information Theory. doi:10.1109/TIT.2021.3127126
-
Hashimoto, K, Katsumata, S, Postlethwaite, E.W, Prest, T, & Westerbaan, B. (2021). A concrete treatment of efficient continuous group key agreement via multi-recipient PKEs. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 1441–1462). doi:10.1145/3460120.3484817
-
Flórez-Gutiérrez, A, Leurent, G, Naya-Plasencia, M, Perrin, L, Schrottenloher, A.C, & Sibleyras, F. (2021). Internal symmetries and linear properties: Full-permutation distinguishers and improved collisions on Gimli. Journal of Cryptology, 34(4). doi:10.1007/s00145-021-09413-z
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
-
Samenwerkingsovereenkomst met TNO vwb promotieonderzoek Thomas Attema ()
-
Secure scalable policy-enforced distributed data processing ()
-
Algebraic Methods for Stronger Crypto (ALGSTRONGCRYPTO)
-
Alliance for Privacy Preserving Detection of Financial Crime (APP-DFC) - in kind bijdrage CWI (APP-DFC)
-
A Reduction Theory for Codes and Lattices in Cryptography (ARTICULATE)
-
Hybrid Approach for quantum-safe Public Key Infrastructure Development for Organisations (HAPKIDO)
-
Ontwikkelen en uitwerken van een Manual en Dashboard naar Post Quantum Crypto (PQC) standaarden (None)
Related partners
-
ABN AMRO Bank
-
ING Bank
-
KLM
-
TNO
-
TNO
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam