Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS

Cryptography from Unstructured Hardness

Project description

A new approach to make unbreakable encryption

Cryptography, essential for internet privacy and security, hinges on the conjectured difficulty of problems like factoring and discrete logarithms. These problems have algebraic structures that might expose vulnerabilities. Alarmingly, only a few hard problems underpin critical tasks like key exchange and public-key encryption. A breakthrough in algorithms could destabilise our digital security. The ERC-funded KolmoCrypt project aims to address this by creating a new cryptographic foundation based on unstructured hardness assumptions derived from Kolmogorov Complexity. This approach eliminates the weaknesses of current structured problems. It also offers a more robust and secure cryptographic framework for the internet and beyond.

Objective

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 (e.g. algebraic) *structure*, that may make them vulnerable to attacks. Furthermore, for tasks such as key exchange and public-key encryption, only a *handful* of candidate hard problems are known on which these tasks can be based. As a result, some unexpected algorithmic developments for structured problems could upend the whole infrastructure we rely on for communicating and transacting on the Internet.
In this project, we propose to develop an alternative approach: a foundation for provably-secure Cryptography from *unstructured hardness* assumptions. Towards resolving this long-standing challenge, we will leverage our recently-discovered connection between Cryptography and the seemingly unrelated area of Kolmogorov Complexity. Specifically, we will develop new hardness assumptions rooted in Kolmogorov Complexity on which the cryptographic tasks (e.g. private-key encryption, key-exchange, public-key encryption) can be based. Critically, these assumptions will lack algebraic and other computational structure that may make them vulnerable to attacks. Overall, KolmoCrypt will provide a new theoretical foundation for the hardness assumptions on which Cryptography is based, and ultimately, a more secure foundation for the Internet (and beyond).

Fields of science (EuroSciVoc)

Keywords

Programme(s)

Topic(s)

Funding Scheme

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

(opens in new window) ERC-2023-ADG

See all projects funded under this call

Host institution

TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY
Net EU contribution
€ 1 662 500,00
Address
SENATE BUILDING TECHNION CITY
32000 Haifa
Israel
Activity type
Higher or Secondary Education Establishments
Links
Total cost
€ 2 184 750,00

Beneficiaries (3)