PERRIELLO SIMONE | Cycle: XXXV |
Section: Computer Science and Engineering
Advisor: PELOSI GERARDO
Tutor: SILVANO CRISTINA
Major Research topic:
Quantum Computing Algorithms for Cryptography: design, validation and complexity assessment ;
Abstract:
The research activity will focus on the following topics: the development of new quantum algorithms, the analysis of their complexity, practical feasibility and scalability on the Quantum Learning Machine provided by AtoS, and applications of quantum techniques to problems in classical computer science and mathematics.
Notably, one of the major quest in the quantum and cryptography communities is the evaluation of new cryptographic standards capable of resisting to attacks from quantum accelerated computers. The search is witnessed by the call for standard carried out by, among the others, the National Institute of Standards and Technology (NIST), that is expected to lead to draft of standards available by the end of 2023. For this reason, practical evaluation of the computational complexity required to attack the proposed Post-Quantum cryptoschemes will be carried out during the research activity.
Finally, the quantification of the speed-up attainable in solving problems which remain computationally hard even with a quantum computer being available (e.g., problems characterizing cryptanalytic tasks, such as the subset sum problem), will be tackled.
Notably, one of the major quest in the quantum and cryptography communities is the evaluation of new cryptographic standards capable of resisting to attacks from quantum accelerated computers. The search is witnessed by the call for standard carried out by, among the others, the National Institute of Standards and Technology (NIST), that is expected to lead to draft of standards available by the end of 2023. For this reason, practical evaluation of the computational complexity required to attack the proposed Post-Quantum cryptoschemes will be carried out during the research activity.
Finally, the quantification of the speed-up attainable in solving problems which remain computationally hard even with a quantum computer being available (e.g., problems characterizing cryptanalytic tasks, such as the subset sum problem), will be tackled.
Cookies
We serve cookies. If you think that's ok, just click "Accept all". You can also choose what kind of cookies you want by clicking "Settings".
Read our cookie policy
Cookies
Choose what kind of cookies to accept. Your choice will be saved for one year.
Read our cookie policy
-
Necessary
These cookies are not optional. They are needed for the website to function. -
Statistics
In order for us to improve the website's functionality and structure, based on how the website is used. -
Experience
In order for our website to perform as well as possible during your visit. If you refuse these cookies, some functionality will disappear from the website. -
Marketing
By sharing your interests and behavior as you visit our site, you increase the chance of seeing personalized content and offers.