• DocumentCode
    3712924
  • Title

    Complexity and performance of QC-MDPC code-based McEliece cryptosystems

  • Author

    Omran Al Rasheed;Predrag Ivani?

  • Author_Institution
    School of Electrical Engineering, University of Belgrade, Bul. kralja Aleksandra 73, 11120, Serbia
  • fYear
    2015
  • Firstpage
    31
  • Lastpage
    34
  • Abstract
    In this paper, we analyze security of McEliece cryptosystem based on Low Density Parity Check (LDPC) and Moderate (MDPC) codes, as well as the complexity of the corresponding cryptosystem. Several approaches are proposed to improve the cryptosystem security for the case when complexity of cryptosystem has to be below the prescribed level. A certain modifications of Gradient Descent Bit Flipping (GDBF) decoding algorithm are identified as the crucial part of the cryptosystem that could provide a good trade-off between the complexity cost, decryption latency and security level.
  • Keywords
    "Decoding","Cryptography","Complexity theory","Iterative decoding","Sparse matrices"
  • Publisher
    ieee
  • Conference_Titel
    Telecommunication in Modern Satellite, Cable and Broadcasting Services (TELSIKS), 2015 12th International Conference on
  • Print_ISBN
    978-1-4673-7515-3
  • Type

    conf

  • DOI
    10.1109/TELSKS.2015.7357731
  • Filename
    7357731