2017 IVth International Conference on Engineering and Telecommunication (EnT) 2017
DOI: 10.1109/icent.2017.10
|View full text |Cite
|
Sign up to set email alerts
|

Code-Based Cryptosystems Evolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Because the original ISW masking scheme [3] can only ensure the security of an XOR operation over finite field F 2 , we first need to extend the original ISW masking scheme from finite fields F 2 to F 2 to guarantee the operational security of multiplication over finite field F 2…”
Section: Higher-ordermentioning
confidence: 99%
See 1 more Smart Citation
“…Because the original ISW masking scheme [3] can only ensure the security of an XOR operation over finite field F 2 , we first need to extend the original ISW masking scheme from finite fields F 2 to F 2 to guarantee the operational security of multiplication over finite field F 2…”
Section: Higher-ordermentioning
confidence: 99%
“…However, public key cryptosystems based on coding theory will be able to resist quantum-computing attacks [2]. In 1978, the original code-based cryptosystem, the McEliece public cryptosystem based on the Goppa code, was proposed [3]. Compared with a traditional public key cryptosystem, code-based cryptography is of higher efficiency during the encryption and decryption process.…”
Section: Introductionmentioning
confidence: 99%