Results 31 to 40 of about 785 (182)
Security of generalised Reed–Solomon code‐based cryptosystems
In this study, the authors elaborate on a recently proposed variant of the public‐key McEliece and Niederreiter cryptosystems using generalised Reed–Solomon (GRS) codes as private codes. The use of these codes brings known advantages in terms of public key size, but particular care is needed in the choice of parameters not to endanger the system ...
Marco Baldi +4 more
openaire +2 more sources
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
Code-based cryptosystems are promising candidates for post-quantum cryptography. Recently, generalized concatenated codes over Gaussian and Eisenstein integers were proposed for those systems. For a channel model with errors of restricted weight, those q-
Johann-Philipp Thiers +1 more
doaj +1 more source
New Code-Based Cryptosystem with Arbitrary Error Vectors
McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key ...
Fedor I. Ivanov, Eugenii Krouk
openaire +2 more sources
McEliece public key cryptosystem attack algorithm based on enumeration error vector
The research on the security of McEliece (M) public key cryptosystem was presented. The Hamming weight of error vector is less than the code length, and M public key cryptosystem based on Goppa code possesses low weight public code words. Considering the
Jing-mei LIU +3 more
doaj +2 more sources
Code-Based Cryptosystems Using Generalized Concatenated Codes [PDF]
Submitted to Springer Proceedings in Mathematics & Statistics, special issue devoted to the conference Application of Computer Algebra (ACA ...
Sven Puchinger +3 more
openaire +3 more sources
Hardware Implementation of a Polar Code-based Public Key Cryptosystem
In recent years, there have been many studies on quantum computing and the construction of quantum computers which are capable of breaking conventional number theory-based public key cryptosystems. Therefore, in the not-too-distant future, we need the public key cryptosystems that withstand against the attacks executed by quantum computers, so-called ...
Reza Hooshmand +2 more
openaire +2 more sources
Quantum Machine Learning for Cybersecurity: A Taxonomy and Future Directions
ABSTRACT Context The rapid increase in cyber threats, coupled with increasingly sophisticated attack strategies and the exponential growth of data in recent years, has exposed significant limitations in classical machine learning, rule‐based, and signature‐based defense mechanisms.
Siva Sai +5 more
wiley +1 more source
Code-Based Key Encapsulation from McEliece’s Cryptosystem [PDF]
In this paper we show that it is possible to extend the framework of Persichetti's code-based framework and create a secure KEM based on the McEliece protocol. This provides greater flexibility in the application of coding theory as a basis for cryptographic purposes.
openaire +4 more sources
ABSTRACT Telemedicine and healthcare‐IoT require medical image transmission that preserves diagnostic quality and confidentiality under noise, packet loss and cyber threats. Existing methods often separate restoration from security and lack real‐time efficiency.
Mohamed Amine Midoun +5 more
wiley +1 more source
Punctured Reed–Muller code‐based McEliece cryptosystems
The authors propose new McEliece cryptosystems based on punctured Reed–Muller (RM) codes. They successfully show that the commonly known attacks, such as the Minder–Shokrollahi attack, the Chizhov–Borodin attack, and the square code attack, are ineffective against the proposed RM code‐based McEliece cryptosystem.
Wijik Lee, Jong-Seon No, Young-Sik Kim
openaire +1 more source

