Description
Leader of the group Cryptology: Ronald Cramer.
Vacancies
A talented Postdoc, on the subject of Codes and Lattices in Cryptography
The CWI Cryptology group is looking for a postdoc researcher interested in both codes and lattices in the context of cryptography.
News
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.
Leo Ducas (CWI Cryptology Group) involved in NIST Post-Quantum Cryptography Standardization Finalists
In its process to develop the first cryptographic standard to protect sensitive electronic data against the threat of quantum computers, the US National Institute of Standards and Technology (NIST) announced the finalists. Léo Ducas from CWI's Cryptology group is involved in several finalists of this standardization process.
Interview with Dijkstra Fellow David Chaum
David Chaum (1955) was awarded the Dijkstra Fellowship for his groundbreaking work in privacy and cryptology and the development of digital currency, which laid the technological basis for blockchain and bitcoin. This interview appeared in CWI’s staff magazine in April 2020.
Members
Associated Members
Publications
-
Don, J.W, Fehr, S, & Majenz, C. (2020). The measure-and-reprogram technique 2.0: Multi-round fiat-shamir and more. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-56877-1_21
-
Wisiol, N, Mühl, C, Pirnay, N, Nguyen, P.H, Margraf, M, Seifert, J.-P, … Rührmair, U. (2020). Splitting the Interpose PUF: A Novel Modeling Attack Strategy. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2020(3). doi:10.13154/tches.v2020.i3.97-120
-
van Woerden, W.P.J. (2020). An upper bound on the number of perfect quadratic forms. Advances in Mathematics, 365. doi:10.1016/j.aim.2020.107031
-
Canetti, R, van Dijk, M.E, Maleki, H, Rührmair, U, & Schaumont, P. (2020). Using Universal Composition to Design and Analyze Secure Complex Hardware Systems. In Proceedings of 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE). doi:10.23919/DATE48585.2020.9116295
-
Niu, X, Xing, C, & Yuan, C. (2020). Asymptotic Gilbert-Varshamov bound on frequency hopping sequences. IEEE Transactions on Information Theory, 66(2), 1213–1218. doi:10.1109/TIT.2019.2951383
-
de Boer, K, Ducas, L, & Fehr, S. (2020). On the Quantum Complexity of the Continuous Hidden Subgroup Problem. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-45724-2_12
-
Abspoel, M.A, Cramer, R.J.F, Damgård, I.B, Escudero, D, & Yuan, C. (2019). Efficient information-theoretic Secure Multiparty Computation over Z/pkZ via Galois rings. In Proceedings of the Theory of Cryptography Conference (pp. 471–501). doi:10.1007/978-3-030-36030-6_19
-
Ducas, L, Plancon, M.C.G, & Wesolowski, B.P.C. (2019). On the shortness of vectors to be found by the Ideal-SVP quantum algorithm. In Advances in Cryptology - CRYPTO 2019 (pp. 322–351). doi:10.1007/978-3-030-26948-7_12
-
Xing, C, & Yuan, C. (2019). Construction of optimal locally recoverable codes and connection with hypergraph. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.ICALP.2019.98
-
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
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)
-
A Reduction Theory for Codes and Lattices in Cryptography (ARTICULATE)
-
PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS (PROMETHEUS)
Related partners
-
ABN AMRO Bank
-
IBM
-
ING Bank
-
KLM
-
Orange SA
-
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