Cryptography with Low Complexity
The status, timeline and source of this project. A free account opens every field.
Source: EU Funding & Tenders Portal
The efficiency of cryptographic constructions is a fundamental question. Theoretically, it is important to understand how much computational resources are needed to guarantee strong notions of security. Practically, highly efficient schemes are always desirable for real-world applications. More generally, the possibility of cryptography with low complexity has wide applications for problems in com
- Status
- Closed
- Sector
- Education, Bridge, Commercial
- Location
- Israel
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Cryptography with Low Complexity
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 | The efficiency of cryptographic constructions is a fundamental question. Theoretically, it is important to understand how much computational resources are needed to guarantee strong notions of security. Practically, highly efficient schemes are always desirable for real-world applications. More generally, the possibility of cryptography with low complexity has wide applications for problems in computational complexity, combinatorial optimization, and computational learning theory. In this proposal we aim to understand what are the minimal computational resources needed to perform basic cryptographic tasks. In a nutshell, we suggest to focus on three main objectives. First, we would like to get better understanding of the cryptographic hardness of random local functions. Such functions can be computed by highly-efficient circuits and their cryptographic hardness provides a strong and clean formulation for the conjectured average-case hardness of constraint satisfaction problems - a fundamental subject which lies at the core of the theory of computer science. Our second objective is to harness our insights into the hardness of local functions to improve the efficiency of basic cryptographic building blocks such as pseudorandom functions. Finally, our third objective is to expand our theoretical understanding of garbled circuits, study their limitations, and improve their efficiency. The suggested project can bridge across different regions of computer science such as random combinatorial structures, cryptography, and circuit complexity. It is expected to impact central problems in cryptography, while enriching the general landscape of theoretical computer science. |
Location
Country | Israel |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Education, Bridge, Commercial |
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
