SubsidieMeestersReinventing Symmetric Cryptography for Arithmetization over Large fiElds
This project aims to develop efficient symmetric cryptographic algorithms in GF(q) to enhance security in complex computing environments while minimizing performance overhead.
Projectdetails
Introduction
Symmetric cryptography is finding new uses because of the emergence of novel and more complex (e.g. distributed) computing environments.
Advanced Protocols
These environments are based on sophisticated zero-knowledge and Multi-Party Computation (MPC) protocols, which aim to provide strong security guarantees of types that were unthinkable before. In particular, they make it theoretically possible to prove that a computation was done as claimed by those performing it without revealing its inputs or outputs.
This capability would make it possible, for example, for e-governance algorithms to prove that they are run honestly, and overall would increase the trust we can have in various automated processes.
Security Techniques
The security techniques providing these guarantees are sequences of operations in a large finite field GF(q), where typically q > 2^64. However, these procedures also rely on hash functions and other "symmetric" cryptographic algorithms that are defined over GF(2) = {0,1}.
Encoding GF(2) operations using GF(q) operations is very costly: relying on standard hash functions leads to significant performance overhead, to the point where the protocols mentioned before are unusable in practice.
Addressing the Bottleneck
In order to alleviate this bottleneck, it is necessary to devise symmetric algorithms that are natively described in GF(q). This change requires great care, as some hash functions described in GF(q) have already been presented and subsequently exhibited significant flaws.
The inherent structural differences between GF(2) and GF(q) are the cause behind these problems: our understanding of the construction of symmetric primitives in GF(2) does not carry over to GF(q).
Project Goals
With this project, I will bring symmetric cryptography into GF(q) in a safe and efficient way. To this end, I will rebuild the analysis tools and methods that are used both by designers and attackers.
This project will naturally lead to the design of new algorithms whose adoption will be simplified by the efficient and easy-to-use software libraries we will provide.
Financiële details & Tijdlijn
Financiële details
| Subsidiebedrag | € 1.488.988 |
| Totale projectbegroting | € 1.488.988 |
Tijdlijn
| Startdatum | 1-9-2022 |
| Einddatum | 31-8-2027 |
| Subsidiejaar | 2022 |
Partners & Locaties
Projectpartners
- INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUEpenvoerder
Land(en)
Vergelijkbare projecten binnen European Research Council
| Project | Regeling | Bedrag | Jaar | Actie |
|---|---|---|---|---|
Getting SYMmetric CryPtography Out of its Comfort ZONeThe SYMPZON project aims to innovate symmetric cryptography by developing new secure and efficient primitives over integer rings to enhance performance and security for emerging applications. | ERC Starting... | € 1.499.309 | 2025 | Details |
Solid Basis for Symmetric CryptographySoBaSyC aims to unify and optimize cryptanalysis techniques for symmetric cryptography, creating a comprehensive toolbox to enhance security and confidence in new cryptographic constructions. | ERC Consolid... | € 2.000.000 | 2024 | Details |
Trust-by-Design – Strong Security Arguments for Symmetric Key CryptographyThe project aims to accelerate the design of secure symmetric cryptographic primitives by enhancing security arguments and developing efficient algorithms for future applications. | ERC Advanced... | € 2.485.000 | 2023 | Details |
Connecting Symmetric and Asymmetric Cryptography for Leakage and FaultsThe BRIDGE project seeks to unify symmetric and asymmetric cryptography to enhance implementation security against attacks, particularly for post-quantum schemes, through innovative design strategies. | ERC Advanced... | € 2.499.560 | 2023 | Details |
Algebraic groups at the heart of post-quantum cryptographyThis project aims to enhance post-quantum cryptography by leveraging algebraic groups to improve security proofs and develop advanced cryptosystems through modern arithmetic techniques. | ERC Starting... | € 1.448.540 | 2024 | Details |
Getting SYMmetric CryPtography Out of its Comfort ZONe
The SYMPZON project aims to innovate symmetric cryptography by developing new secure and efficient primitives over integer rings to enhance performance and security for emerging applications.
Solid Basis for Symmetric Cryptography
SoBaSyC aims to unify and optimize cryptanalysis techniques for symmetric cryptography, creating a comprehensive toolbox to enhance security and confidence in new cryptographic constructions.
Trust-by-Design – Strong Security Arguments for Symmetric Key Cryptography
The project aims to accelerate the design of secure symmetric cryptographic primitives by enhancing security arguments and developing efficient algorithms for future applications.
Connecting Symmetric and Asymmetric Cryptography for Leakage and Faults
The BRIDGE project seeks to unify symmetric and asymmetric cryptography to enhance implementation security against attacks, particularly for post-quantum schemes, through innovative design strategies.
Algebraic groups at the heart of post-quantum cryptography
This project aims to enhance post-quantum cryptography by leveraging algebraic groups to improve security proofs and develop advanced cryptosystems through modern arithmetic techniques.