Results 191 to 200 of about 8,486 (220)
Some of the next articles are maybe not open access.

Highly Efficient Parallel Row-Layered Min-Sum MDPC Decoder for McEliece Cryptosystem

arXiv.org
The medium-density parity-check (MDPC) code-based McEliece cryptosystem remains a finalist of the post-quantum cryptography standard. The Min-sum decoding algorithm achieves better performance-complexity tradeoff than other algorithms for MDPC codes ...
Jiaxuan Cai, Xinmiao Zhang
semanticscholar   +1 more source

PQCMC: Post-Quantum Cryptography McEliece-Chen Implicit Certificate Scheme

IACR Cryptology ePrint Archive
In recent years, the elliptic curve Qu-Vanstone (ECQV) implicit certificate scheme has found application in security credential management systems (SCMS) and secure vehicle-to-everything (V2X) communication to issue pseudonymous certificates.
Abel C. H. Chen
semanticscholar   +1 more source

Implementing QC-MDPC McEliece Encryption

ACM Transactions on Embedded Computing Systems, 2015
With respect to performance, asymmetric code-based cryptography based on binary Goppa codes has been reported as a highly interesting alternative to RSA and ECC. A major drawback is still the large keys in the range between 50 and 100KB that prevented real-world applications of code-based cryptosystems so far.
Maurich, Ingo Von   +2 more
openaire   +1 more source

Short McEliece-based digital signatures

Proceedings IEEE International Symposium on Information Theory,, 2003
The McEliece public key encryption scheme was invented in 1978. Although it is very secure (all known attacks are still exponential) it has not been very successful as far as applications are concerned. We show how this scheme could be used for a new application: short digital signatures.
N. Courtois, M. Finiasz, N. Sendrier
openaire   +1 more source

A hardware Trojan detection method based on sensor chains for post-quantum classic McEliece circuits

2023 2nd International Conference on Informatics, Networking, and Computing (ICINC 2023)
With the rapid development of the digital society, hardware security has become a pressing issue in information security. Although the Post-Quantum Cryptography (PQC) is known for its high security, it is still threatened by hardware Trojan attacks.
Lili Wang   +4 more
semanticscholar   +1 more source

A McEliece-type Cryptosystem using a Random Inverse Matrix and an Error Vector with Large Hamming Weight

Automation, Control, and Information Technology
The McEliece cryptosystem has emerged as a finalist in Round 4 of the NIST Post-Quantum Cryptography (PQC) competition. The Shor algorithm underscores the potential vulnerability of cryptographic primitives to quantum attacks.
Farshid Haidary Makoui   +2 more
semanticscholar   +1 more source

Cryptography With Mceliece Algorithm (Code Based Cryptography)

Jurnal Teknik Indonesia
Cryptography is the science used to protect information from unauthorized access. One promising cryptographic algorithm is the McEliece algorithm, which uses code-based cryptography.
Caleg Sadrak Sinaga   +8 more
semanticscholar   +1 more source

Enhanced Layered Quasi-Cyclic Low-Density Parity-Check Codes for the McEliece Cryptosystem in Satellite Communications System

2024 International Conference on the Frontiers of Electronic, Electrical and Information Engineering (ICFEEIE)
Given the rapid advancement of quantum computing technology, the McEliece cryptosystem, rooted in coding theory, stands out as one of the few cryptographic systems resilient against quantum attacks.
Junda Zhang   +4 more
semanticscholar   +1 more source

McEliece Public-Key Cryptosystem Based on Cyclic Codes

International Conference on Wireless Communications and Signal Processing
The McEliece public key cryptosystem is known for its resistance to quantum attacks. However, its application potential remains limited due to challenges such as large key size and low coding efficiency.
Junlong Ye   +4 more
semanticscholar   +1 more source

Generalization and applications of McEliece's theorem

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
This paper describes an application of our generalization of McEliece's theorem in order to improve Serre's bound. Serre obtained sharp estimates for the number of solutions of an algebraic curve over a finite field. This improvement depends of the divisibility properties of the curve.
O. Moreno, F. Castro
openaire   +1 more source

Home - About - Disclaimer - Privacy