Results 21 to 30 of about 1,377 (175)
Public-Key Cryptosystems and Bounded Distance Decoding of Linear Codes
Error-correcting codes form an important topic in information theory. They are used to correct errors that occur during transmission on a noisy channel. An important method for correcting errors is bounded distance decoding.
Selda Çalkavur
doaj +1 more source
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
The paper cryptanalyses a public-key cryptosystem recently proposed by Grigoriev and Ponomarenko, which encrypts an element from a fixed finite group defined in terms of generators and relations to produce a ciphertext from .
Choi Su-Jeong +2 more
doaj +1 more source
ABSTRACT This paper presents MusicoCrypt, a context‐bound music‐modulated stream‐encryption framework that incorporates audio‐derived public side information into a pseudorandom‐function‐centered encryption workflow. A shared reference recording is processed using a pitch‐tracking pipeline, and ordered note pairs are encoded as residues in ℤ132 ...
Cilen Gulsum Turan +2 more
wiley +1 more source
ABSTRACT Quantum‐native communication systems are reshaping secure, programmable, and coherence‐aware networking beyond the classical paradigm. As intelligent physical infrastructures, ranging from unmanned aerial vehicle swarms to satellite Quantum Key Distribution (QKD) platforms, demand trust, synchronization, and ultra‐reliability, conventional ...
Shakil Ahmed +2 more
wiley +1 more source
RSA: A number of formulas to improve the search for p+qp+q
Breaking RSA is one of the fundamental problems in cryptography. Due to its reliance on the difficulty of the integer factorization problem, no efficient solution has been found despite decades of extensive research. One of the possible ways to break RSA
Mohammed Ahmed, Alkhelaifi Abdulrahman
doaj +1 more source
Fair Public-Key Cryptosystems [PDF]
We show how to construct public-key cryptosystems that are fair, that is, strike a good balance, in a democratic country, between the needs of the Government and those of the Citizens. Fair public-key cryptosystems guarantee that: (1) the system cannot be misused by criminal organizations and (2) the Citizens mantarn exactly the same rights to privacy ...
openaire +1 more source
Recent proposals by Mahmood et al., Braeken et al., and Chaudhry et al. aimed at establishing secure communication in AMI, asserting their methods fulfil the requisite security criteria. This paper, however, reveals that each of these proposals exhibits security vulnerabilities and lacks sufficient features for deployment.
Ahmad Rahdari, Bahareh Akhbari
wiley +1 more source
AN IDEA FOR KNAPSACK CRYPTOSYSTEM BACKDOOR
There are practically no known backdoors in a knapsack cryptosystem, the security of which is based on the difficulty of solving the knapsack packing problem.
Mikhail A. Ivanov
doaj +1 more source
Intrusion detection for FDIAs is proposed using three approaches. (1) a stack‐based model containing an expansion decision tree and neural network, (2) recurrent neural networks (RNNs) and (3) convolutional neural networks (CNNs). The first two methods are based on the initial preprocessing of row instances, whereas the last one involves the time ...
Zeeshan Haider +3 more
wiley +1 more source
A Novel Combinatorial Public Key Cryptosystem [PDF]
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptographic community. In this paper, a combinatorial public key cryptosystem is proposed. The security of the proposed cryptosystem is dependent on a combinatorial problem involving
Baocang Wang, Yupu Hu
openaire +2 more sources

