Abstract:
The Shor algorithm demonstrates the significant risk that quantum attacks pose to the security of widely used cryptographic primitives. However, code-based cryptography h...View moreMetadata
Abstract:
The Shor algorithm demonstrates the significant risk that quantum attacks pose to the security of widely used cryptographic primitives. However, code-based cryptography has been shown to be resistant to these attacks. To date, no polynomial-time attack exists that can break code-based cryptosystems such as the McEliece cryptosystem. Despite this, these cryptosystems are not employed in practical applications in domains such as online banking, blockchains, and e-commerce platforms. The primary reason is the large sizes of the public and private keys associated with code-based cryptosystems. In this paper, a new code-based cryptosystem is introduced which employs a dual matrix based on the transpose and inverse of the parity check matrix to reduce the key size compared to the McEliece cryptosystem.
Date of Conference: 03-04 August 2023
Date Added to IEEE Xplore: 27 September 2023
ISBN Information: