Foundations of Cryptographic Hardness
Ended · Israel
Source: EU Funding & Tenders Portal
A fundamental research challenge in modern cryptography is understanding the necessary hardness assumptions required to build different cryptographic primitives. Attempts to answer this question have gained tremendous success in the last 20-30 years. Most notably, it was shown that many highly complicated primitives can be based on the mere existence of one-way functions (i.e., easy to compute and
- Status
- Closed
- Sector
- Education, Power Generation (CCGT)
- Location
- Israel
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Foundations of Cryptographic Hardness
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | ended |
Taiyo status | Closed |
Taiyo last update | 2026-07-22 |
Contact
| Not available for this record. |
Description
Description | A fundamental research challenge in modern cryptography is understanding the necessary hardness assumptions required to build different cryptographic primitives. Attempts to answer this question have gained tremendous success in the last 20-30 years. Most notably, it was shown that many highly complicated primitives can be based on the mere existence of one-way functions (i.e., easy to compute and hard to invert), while other primitives cannot be based on such functions. This research has yielded fundamental tools and concepts such as randomness extractors and computational notions of entropy. Yet many of the most fundamental questions remain unanswered. Our first goal is to answer the fundamental question of whether cryptography can be based on the assumption that P not equal NP. Our second and third goals are to build a more efficient symmetric-key cryptographic primitives from one-way functions, and to establish effective methods for security amplification of cryptographic primitives. Succeeding in the second and last goals is likely to have great bearing on the way that we construct the very basic cryptographic primitives. A positive answer for the first question will be considered a dramatic result in the cryptography and computational complexity communities. To address these goals, it is very useful to understand the relationship between different types and quantities of cryptographic hardness. Such understanding typically involves defining and manipulating different types of computational entropy, and comprehending the power of security reductions. We believe that this research will yield new concepts and techniques, with ramification beyond the realm of foundational cryptography. |
Location
Country | Israel |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Education, Power Generation (CCGT) |
Article published date | 2026-01-01 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
More Education projects in Israel
- BIONDVAX UNIVERSAL FLU VACCINE (IDFF)
- Mediterranean Cooperation in the Treatment and Valorisation of Olive Mill Wastewater (OMW)
- Profitable and Sustainable artisanal olive oil industry in the Mediterranean
- Mediterranean Technology Led Incubator Co-Operation
- Cost-effective rehabilitation of public buildings into smart and resilient nano-grids using storage
- Speeding up the MED SMEs' uptaking of eco-innovative solutions in energy and water management
- Mediterranean SME working together to make cities smarter
- V house / Blatman Cohen architecture design
