Results 71 to 80 of about 1,079 (213)
Connecting the Complexity of MQ- and Code-Based Cryptosystems [PDF]
Abstract We study the connection between the MQ problem and the decoding problem, through the intermediate MRHS representation. The main goal of this study is to explicitly bound the complexity of solving MQ systems with decoding tools.
openaire +1 more source
Codes in Dihedral Group Algebra
Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes in 1978 and no effective key attacks has been described yet.
Kirill V. Vedenev, Vladimir M. Deundyak
doaj +1 more source
Considering code-based cryptography, quasi-cyclic low-density parity-check (QC-LDPC) codes are foreseen as one of the few solutions to design post-quantum cryptosystems.
Davide Zoni +2 more
doaj +1 more source
Enhancing E‐Commerce Security Based on Involution Function Using Twin Key AES Cipher
In the realm of surging e‐commerce data and increasing digital transactions, ensuring end‐to‐end security is paramount to protect sensitive information and maintain user trust. The Advanced Encryption Standard (AES), a cornerstone of network security, relies on symmetric key encryption for secure communication.
Biresh Kumar +11 more
wiley +1 more source
A New Technique in Rank Metric Code-Based Encryption
We propose a rank metric codes based encryption based on the hard problem of rank syndrome decoding problem. We propose a new encryption with a public key matrix by considering the adding of a random distortion matrix over F q m of full column ...
Terry Shue Chien Lau, Chik How Tan
doaj +1 more source
Corruption‐Correctable MACs via Combinatorial Group Testing and Erasure Correcting Codes
We have developed a corruption‐correctable message authentication code (CCMAC) that enables data integrity to be verified and corruptions of data to be corrected up to a certain threshold. As in a previous technique for identifying corrupted points, called corruption detectable MAC (CDMAC), the proposed scheme utilizes a system model composed of two ...
Isamu Furuya +3 more
wiley +1 more source
Secure and Compact: A New Variant of McEliece Cryptosystem
This paper introduces a variant of the McEliece cryptosystem and employs the $(C_{1}, C_{1} + C_{2})$ -construction to generate a new code from two arbitrary linear codes. We propose an efficient hard-decision decoding algorithm for linear codes derived
Ekta Bindal, Abhay Kumar Singh
doaj +1 more source
Polynomial-Time Key Recovery Attack on the Lau-Tan Cryptosystem Based on Gabidulin Codes [PDF]
Wenshuo Guo, Fang‐Wei Fu
openalex +1 more source
Resisting Quantum Key Distribution Attacks Using Quantum Machine Learning
Quantum key distribution (QKD) promises secure communication but remains vulnerable to advanced quantum attacks. We propose a hybrid quantum long short‐term memory (QLSTM) model that combines quantum‐enhanced learning with classical deep learning to detect attacks such as photon‐number splitting, Trojan‐Horse and detector blinding.
Ali Al‐Kuwari +4 more
wiley +1 more source
Patients’ Data Management System Protected by Identity-Based Authentication and Key Exchange
A secure and distributed framework for the management of patients’ information in emergency and hospitalization services is proposed here in order to seek improvements in efficiency and security in this important area.
Alexandra Rivero-García +4 more
doaj +1 more source

