Ethernet Passive Mutual Authentication Scheme on Quantum Networks. [PDF]
Tian J, Qin P, Zhao Z, Qin B.
europepmc +1 more source
On Double Cyclic Codes over Finite Chain Rings for DNA Computing. [PDF]
Ali S +4 more
europepmc +1 more source
High-security learning-based optical encryption assisted by disordered metasurface. [PDF]
Yu Z +12 more
europepmc +1 more source
Decoding the Solution for Man-at-the-End Attacks and Reverse Engineering on IoMT Devices: An Experimental Review of Techniques and Defences. [PDF]
T AH, Sriraman H.
europepmc +1 more source
A Study on Public-Key Cryptosystems Based on Error-Correcting Codes
茂紀 山川
openalex +1 more source
Blockchain-driven smart contract with key exchange protocol for secure device-to-device communication using verkle tree K-ary structures. [PDF]
Simbu A, Nandakumar S, Saravanan K.
europepmc +1 more source
Related searches:
TCHo: A Code-Based Cryptosystem
Mathematics in Industry, 2012TCHo is a public-key cryptosystem based on the hardness of finding a multiple polynomial with low weight and on the hardness of distinguishing between the output of an LFSR with noise and some random source. An early version was proposed in 2006 by Finiasz and Vaudenay with non-polynomial (though practical) decryption time.
Serge Vaudenay, Vaudenay Serge
exaly +2 more sources
A Secure Code Based Cryptosystem via Random Insertions, Deletions, and Errors
IEEE Communications Letters, 2016In this letter, a new code based cryptosystem with a public code is introduced. This cryptosystem is based on randomly flipping, deleting, and inserting bits into a codeword corresponding to a plaintext. The construction of a secure channel coding scheme using the proposed cryptosystem is presented. The key size and security of this scheme are analyzed.
Mostafa Esmaeili, T Aaron Gulliver
exaly +2 more sources
New code-based cryptosystems via the IKKR framework
Journal of Information Security and Applications, 2023One main construct for code-based public key cryptosystems is the McEliece framework that hedges upon the hardness of decoding arbitrary linear codes. Based on Goppa codes, the original McEliece cryptosystem however, suffers from having very large public keys.
Terry Shue Chien Lau +4 more
openaire +2 more sources
Unlike most papers devoted to improvements of code-based cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of strengthening which is code-independent. We show (up to some limit) that the security of the new code-based cryptosystem is much closer to the hardness of maximum likelihood decoding than in ...
Fedor I. Ivanov +3 more
openaire +1 more source

