Efficient code-based cryptosystems for post-quantum cryptography
| dc.contributor.author | Makoui, Farshid Haidary | |
| dc.contributor.supervisor | Gulliver, T. Aaron | |
| dc.date.accessioned | 2024-08-16T16:58:34Z | |
| dc.date.available | 2024-08-16T16:58:34Z | |
| dc.date.issued | 2024 | |
| dc.degree.department | Department of Electrical and Computer Engineering | |
| dc.degree.level | Doctor of Philosophy PhD | |
| dc.description.abstract | There is increasing growth in e-commerce, blockchain, mobile services, medical and industrial IoT, online banking, and service applications. Cryptographic primitives play a crucial role in securing these applications. Thus, the security of cryptographic primitives is an important issue. The Shor algorithm illustrates how quantum attacks seriously threaten the safety of these 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 the remarkable level of security they offer, code-based cryptosystems have received minimal attention in practical applications. The main reason is the considerably large public and private key sizes. For example, the McEliece code-based cryptosystem uses binary Goppa codes with large block sizes. The use of code-based cryptography in digital signatures is also limited, primarily because the ciphertexts do not span the entire vector space. The Courtois-Finiasz-Sendrier (CFS) scheme is a widely recognized code-based digital signature scheme. However, its adoption is limited due to the low success rate of signing which in turn increases the signature processing time. This dissertation aims to address the above challenges by introducing new code-based algorithms with smaller key sizes and reduced processing times. A scheme is introduced to construct $2^{k\times (n-k)}$ generalized inverse matrices for a matrix $H$ with dimensions $(n-k) \times n$. An algorithm is also given to construct a random inverse matrix from the $2^{k\times (n-k)}$ choices. Furthermore, a new public key generation algorithm is given that takes advantage of random inverse matrices to construct public and private keys. This algorithm plays a crucial role in the proposed code-based cryptosystem, enabling smaller key sizes compared to the traditional McEliece cryptosystem. The proposed code-based digital signature incorporates signing and verification algorithms with lower complexity and higher success rates than the CFS digital signature, leading to reduced processing times. | |
| dc.description.scholarlevel | Graduate | |
| dc.identifier.uri | https://hdl.handle.net/1828/20292 | |
| dc.language | English | eng |
| dc.language.iso | en | |
| dc.rights | Available to the World Wide Web | |
| dc.subject | cryptography | |
| dc.subject | code based encryption | |
| dc.subject | code based digital signature | |
| dc.subject | public key cryptography (PKC) | |
| dc.subject | linear block code | |
| dc.subject | random inverse matrices in cryptosystems | |
| dc.subject | non square matrix inverses | |
| dc.subject | random non square matrix inverse | |
| dc.subject | post quantum cryptography | |
| dc.title | Efficient code-based cryptosystems for post-quantum cryptography | |
| dc.type | Thesis |