Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 51864 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Aref, Mohammad Reza
- Abstract:
- Regarding to the emergence of quantum computers and advances in the large scale implementation of them, exploiting hard problems of coding theory is of great importance.This family of problems, like those of lattices, has an acceptable resistance against classic and quantum attacks. Thus, they can be replaced with hard problems in number theory and algebra. Increasing dominance of cyberspace made us highly dependent to it. Consequently, preparing tools and methods to mitigate future threats is necessary. Digital signatures constitute an important family of cryptographic primitives. Code-based digital signatures are mostly suffering from two main drawbacks: large public key and long time of signature production. In this thesis, we introduce a secure and efficient code-based signature. This scheme exploits Courtois,Finiasz, and Sendrier structure and Polar codes. Special properties of Polar codes reduce computational overhead in signing algorithm and the influence of dominant practical attacks. Therefore, our scheme enjoys smaller public key and shorter signing time compare to former schemes available in the literature. These improvements make our scheme more practical. Moreover, we have proved existential unforgeability security for our scheme under chosen message attack in random oracle model
- Keywords:
- Code-based Signature ; Lossy Source Compression ; Rate-Distortion Bound ; Polar Code ; Code-based Cryptosystem ; Post-Quantum Cryptography
Digital Object List
محتواي کتاب
Bookmark