2021
DOI: 10.20944/preprints202104.0734.v1
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Code-based Post-Quantum Cryptography

Abstract: Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or in transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems based on modular arithmetic to the contemporary cryptosystems based on quantum computing. The emergence of quantum computing imposes a major threat on the modern cryptosystems based on modular arithmetic whereby, even the computationally hard problems which constitute for t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…A message is encrypted with a set of attributes in the KP-ABE scheme, and the user's private keys are linked to an access structure. If the access structure in the user's private key can satisfy the encrypted data's attributes, the message can be recovered successfully [2,4,[10][11][12]16,17,[30][31][32][33][34][35][36][37][38][39][40]. Generally, the KP-ABE scheme is constructed based on four basic algorithms: setup, key generation, encryption, and decryption, as summarized below.…”
Section: Kp-abe Schemesmentioning
confidence: 99%
“…A message is encrypted with a set of attributes in the KP-ABE scheme, and the user's private keys are linked to an access structure. If the access structure in the user's private key can satisfy the encrypted data's attributes, the message can be recovered successfully [2,4,[10][11][12]16,17,[30][31][32][33][34][35][36][37][38][39][40]. Generally, the KP-ABE scheme is constructed based on four basic algorithms: setup, key generation, encryption, and decryption, as summarized below.…”
Section: Kp-abe Schemesmentioning
confidence: 99%
“…The widely used public key cryptosystems 1 have been broken by the rapid development of quantum computers. The discrete logarithmic and integer factorization problems serve as the foundation for the security of these public key cryptosystems 2 . But, in 1994, Peter Shor 3 developed an algorithm that could break these public key cryptosystems.…”
Section: Introductionmentioning
confidence: 99%
“…In this regard, Post-Quantum Cryptography(PQC) is a promising contender that can withstand quantum computers 5 . Code-based cryptography 2 is acknowledged as resistant to quantum computing which involves decoding a random linear code based on a hard coding theory problem in some metric. The McEliece cryptosystem 6 has historically been the well-known cryptosystem and suffers from the drawback of having a huge public key size despite the quick encoding and decoding processes.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, quantum computers can hack traditional algorithms and deploy publickey encryption schemes [6]. While several promising post quantum cryptography (PQC) [7] candidates have been identified, such as lattice-based [8], code-based [9], and hash-based cryptography [10], there are still open research questions and challenges that need to be addressed: − Shor's quantum prime factorization algorithm poses a threat to existing cryptosystems based on discrete logarithmic problems and integer factorization. Thus, it is necessary to conduct research in order to comprehend and quantify the implications of replacing current cryptographic algorithms with PQC algorithms [11].…”
Section: Introductionmentioning
confidence: 99%