Results 61 to 70 of about 2,437 (198)
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 +2 more sources
Cryptanalysis of McEliece’s Public-Key Cryptosystem [PDF]
An approach is proposed for the cryptanalysis of the well-known version of McEliece's public-key cryptosystem that is based on a new iterative optimization algorithm for decoding an arbitrary linear code. The algorithm provides guaranteed correction of all error patterns with Hamming weight less than d/2, where d is the minimum distance of the code ...
Valery I. Korzhik, Andrey I. Turkin
openaire +1 more source
Selecting parameters for secure McEliece-based cryptosystems [PDF]
In 1994, Shor showed that quantum computers will be able to break cryptosystems based on the problems of integer factorization and the discrete logarithm, for example, RSA or ECC. Code-based cryptosystems are promising alternatives to public-key schemes built on these problems, and they are believed to be secure against quantum computer attacks.
Robert Niebuhr +3 more
openaire +1 more source
polarRLCE: A New Code‐Based Cryptosystem Using Polar Codes
Security challenges brought about by the upcoming 5G era should be taken seriously. Code‐based cryptography leverages difficult problems in coding theory and is one of the main techniques enabling cryptographic primitives in the postquantum scenario. In this work, we propose the first efficient secure scheme based on polar codes (i.e., polarRLCE) which
Jingang Liu +4 more
wiley +1 more source
Oblivious Transfer via Lossy Encryption from Lattice‐Based Cryptography
Authentication is the first defence line to prevent malicious entities to access smart mobile devices (or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols. Oblivious transfer (OT) protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice‐based
Zengpeng Li +3 more
wiley +1 more source
ABSTRACT With the advent of Quantum Computing and its exponential research endeavors in the past couple of decades, we are looking at a Golden Era of Quantum Computing. We are transitioning into an age of Hybrid Classical‐Quantum Computers, where the quantum computational resources are selectively harnessed for resource‐intensive tasks. On the one hand,
Vita Santa Barletta +4 more
wiley +1 more source
Semantically Secure Symmetric Encryption with Error Correction for Distributed Storage
A distributed storage system (DSS) is a fundamental building block in many distributed applications. It applies linear network coding to achieve an optimal tradeoff between storage and repair bandwidth when node failures occur. Additively homomorphic encryption is compatible with linear network coding.
Juha Partala, Huaizhi Li
wiley +1 more source
Towards quantum‐safe blockchain: Exploration of PQC and public‐key recovery on embedded systems
This paper addresses the need for quantum‐safe blockchain solutions specifically for embedded systems by integrating Post‐Quantum Cryptography (PQC) into blockchain frameworks. We propose a quantum‐secure blockchain architecture using NIST‐standardized PQC algorithms, finding Falcon‐512 to be optimal for embedded environments due to its security and ...
Dominik Marchsreiter
wiley +1 more source
A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform
An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT‐Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors.
Srinivas Koppu +2 more
wiley +1 more source
A Fuzzy Commitment Scheme with McEliece's Cipher [PDF]
In this paper an attempt has been made to explain a fuzzy commitment scheme with McEliece scheme. The efficiency and security of this cryptosystem is comparatively better than any other cryptosystem.
Deo Brat Ojha, Ajay Sharma
doaj

