Paper 2023/358

Efficient Code Based Cryptosystem with Dual Inverse Matrix

Farshid Haidary Makoui, University of Victoria
T. Aaron Gulliver, University of Victoria
Mohammad Dakhilalian, Isfahan University of Technology

The security of cryptographic primitives is an important issue. The Shor algorithm illustrates how quantum attacks threaten the security of these widely used primitives. Code-based cryptography is one of several approaches resistant to quantum attacks. To date, no attack has been able to break a code-based cryptosystem in polynomial time. Despite this level of security, these cryptosystems have not been considered for practical applications such as e-commerce, medical and industrial IoT, finance, blockchain, mobile services, and online banking. The main reason is the large public and private key sizes. This paper presents a new code-based cryptosystem based on inverse parity check matrices. The dual matrix provides both a parity check matrix transpose and a parity check matrix inverse. These are employed in the key generation, encryption, and decryption algorithms. The proposed scheme provides public and private key sizes smaller than the McEliece cryptosystem and has a higher level of security.

Available format(s)
-- withdrawn --
Public-key cryptography
Publication info
CryptographyCode-Based CryptosystemCoding TheoryPublic Key Cryptography (PKC)
Contact author(s)
Makoui @ uvic ca
agullive @ ece uvic ca
mdalian @ iut ac ir
2023-05-10: withdrawn
2023-03-11: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.