Loading...

Design and Cryptanalysis of a Code-based Public-key Cryptosystem

Kianpour, Javid | 2022

747 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 55091 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Aref, Mohammad Reza
  7. Abstract:
  8. In recent decades, the use of cryptography to ensure the security and confidentiality of telecommunications has become undeniable. In the meantime, public key primitives are one of the most important parts of cryptography. Given the advances in quantum processing and manufacturing technology of quantum computers in recent years, solving hard problems in the field of number theory, such as integer factorization and discrete logarithms, which are difficult to solve in conventional computers, are becoming possible. It is expected that the emergence of large-scale quantum computers will be able to solve these problems in a practical way using the Shor algorithm. Nowadays, most commonly used asymmetric cryptographic primitives, such as RSA, are based on these hard problems and may no longer be reliable for secure communications. In addition, large companies' investments in quantum computers have convinced researchers that large-scale quantum computers, if not already built, would emerge in the not-too-distant future. For this reason, the design of post-quantum public-key cryptographic algorithms is critical. Meanwhile, post-quantum code-based primitives suffer from large public keys and low data transfer rates. In this thesis, we introduce three public key encapsulation schemes (KEM). This scheme uses polar codes in the frameworks of the McEliece and Niederreiter cryptographic systems. Due to the properties of capacity-achieving and fast decoding, Polar codes lead to a reduction in key length in public key code-based cryptosystems. Therefore, the proposed schemes in terms of public key size and the data transfer rate are a significant advantage over the proposed schemes in this area in different security levels. In addition to computational security, proofs of formal security, IND-CPA, and IND-CCA in the random prediction model make it possible to use these schemes. Thus, in addition to the proper key size and performance, computational and theoretical security make them capable candidates for a post-quantum code-based scheme
  9. Keywords:
  10. Computational Security ; Polar Code ; Public Key Cryptography ; Security Proof ; Formal Security ; Code-based Cryptosystem ; Key Encapsulation Mechanism (KEM)

 Digital Object List

 Bookmark

...see more