Description
Leader of the group Cryptology: Ronald Cramer.
Vacancies
No vacancies currently.
News
CRYPTO 2017 Best Paper Award for breaking SHA-1 security standard
A team of researchers from CWI and Google have won the CRYPTO 2017 Best Paper Award for being the first to break the SHA-1 internet security standard in practice. Marc Stevens (CWI) explained this research during a plenary talk at CRYPTO 2017 in Santa Barbara (USA).
CWI and Google research team wins Pwnie Award for Best Cryptographic Attack
Researchers at CWI and Google have won the Pwnie Award for Best Cryptographic Attack at the BlackHat USA security conference. They were awarded the prize for being the first to break the SHA-1 internet security standard in practice.
Marc Stevens’ project awarded funding in ‘Big Data: real time ICT for logistics’ programme
NWO has granted five applications within the ‘Big Data: real time ICT for logistics’ research programme. CWI’s Marc Stevens is the main applicant of one of the five granted research projects: 'Secure scalable policy-enforced distributed data processing'.
Cécile Pierrot wins Cercle K2 Cybersecurity Trophy 2017
Cécile Pierrot from the Cryptology research group at CWI won the first Cybersecurity Trophy granted by Cercle K2. This French think tank awards prizes in 22 topics every two years. It aims at stimulating interdisciplinarity and promoting young researchers. The Cybersecurity Trophy 2017 rewarded Pierrot’s PhD thesis, which she defended at UPMC in Paris on 25 November 2016. The jury praised her for both theoretical and practical impacts of her results.
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