Skip to main navigation Skip to search Skip to main content

New Design of Blockwise Interleaved Ideal Low-Rank Parity-Check Codes for Fast Post-Quantum Cryptography

  • Chanki Kim
  • , Young Sik Kim*
  • , Jong Seon No
  • *Corresponding author for this work

    Research output: Contribution to journalJournal articlepeer-review

    Abstract

    In this letter, a new design of blockwise interleaved ideal low-rank parity-check (BII-LRPC) codes is proposed for a fast cryptographic application. We show that the proposed ideal LRPC codes can be used as a key encapsulation mechanism (KEM) for post-quantum cryptography (PQC). The simulation results show that the KEM constructed from the proposed BII-LRPC codes is faster by 30-70% than the ROLLO-I algorithm, an existing LRPC-based cryptosystem.

    Original languageEnglish
    Pages (from-to)1277-1281
    Number of pages5
    JournalIEEE Communications Letters
    Volume27
    Issue number5
    DOIs
    StatePublished - 2023.05.1

    Keywords

    • Code-based cryptography
    • coding theory
    • key encapsulation mechanism (KEM)
    • low-rank parity-check (LRPC) codes
    • post-quantum cryptography (PQC)
    • rank-metric codes

    Quacquarelli Symonds(QS) Subject Topics

    • Computer Science & Information Systems
    • Mathematics
    • Engineering - Electrical & Electronic
    • Engineering - Petroleum
    • Data Science

    Fingerprint

    Dive into the research topics of 'New Design of Blockwise Interleaved Ideal Low-Rank Parity-Check Codes for Fast Post-Quantum Cryptography'. Together they form a unique fingerprint.

    Cite this