ERC Advanced Grant · 2023
Cryptography from Unstructured Hardness
Cryptography—and its basic tasks such as encryption, authentication and key exchange—is essential for ensuring privacy and security on the Internet. The question of whether “unbreakable” encryption methods exist has fascinated mathematicians and cryptographers for thousands of years, and is closely related to the famous NP vs. P problem. This question is still wide open and consequently, Internet security today relies on cryptographic constructions based on the *conjectured* hardness of some computational problems (such as e.g., the factoring problem, the discrete logarithms problem or various noisy linear algebra problems). However, these conjectured hard problems all contain significant…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.