A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Using Genetic Algorithm to Break Knapsack Cipher with Sequence Size 16
2014
Iraqi Journal for Computers and Informatics
The knapsack cipher is with a knapsack sequence of size 16 to encrypt twocharacters together. Different values of parameters have been used: Population size, mutation rate, number of generation. ...
It is one of the methods, which is used to decrypt cipher.This work focuses on using GeneticAlgorithms to cryptanalyse knapsack cipher. ...
The knapsack cryptosystem belongs to major categories of public/private key cryptosystem [2] . ...
doi:10.25195/ijci.v41i1.99
fatcat:eihtdoyeyjciji3t64felgqjdq
Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
[article]
2012
arXiv
pre-print
s cryptosystem based on Lattice basis reduction algorithms. By computing complexity of propose attack, we show that unlike Aboud's cryptanalysis, our cryptanalysis is more efficient and practicable. ...
This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new algorithm called permutation combination algorithm to enhance density of knapsack to avoid the low-density ...
Conclusion We considered cryptanalysis of a knapsack-type public key cryptosystem. ...
arXiv:1210.7417v1
fatcat:leoc6jp6xza5faz6obazian67y
Cryptanalysis of Merkle-Hellman cipher using ant colony optimization
2021
IAES International Journal of Artificial Intelligence (IJ-AI)
<p class="Abstract"><span id="docs-internal-guid-d3fe8e21-7fff-17fc-df0e-00893428243c"><span>The Merkle-Hellman (MH) cryptosystem is one of the earliest public key cryptosystems, which is introduced by ...
In this paper, we present a novel ant colony optimization (ACO) based attack for cryptanalysis of MH cipher algorithm, where two different search techniques are used. ...
Select another integer w that the gcd (m, w) =1, that is number m and w are reciprocally prime. 4. Find w -1 the inverse of the w mod m. 5. Construct the hard knapsack sequence. ...
doi:10.11591/ijai.v10.i2.pp490-500
fatcat:ablczj3nx5ajtkmzlorkozt33y
An improved knapsack public key cryptography system
2011
International Journal of Internet Technology and Secured Transactions
s cryptosystem based on Lattice basis reduction algorithms. By computing complexity of propose attack, we show that unlike Aboud's cryptanalysis, our cryptanalysis is more efficient and practicable. ...
This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new algorithm called permutation combination algorithm to enhance density of knapsack to avoid the low-density ...
We can use this sequence in place of to private key (ܾ ଵ , ܾ ଶ , … , ܾ ୬ ).
Conclusion We considered cryptanalysis of a knapsack-type public key cryptosystem. ...
doi:10.1504/ijitst.2011.041298
fatcat:afb7k7okezfbvlp6ugb3lzeblm
The Applicability of Genetic Algorithm in Cryptanalysis: A Survey
2015
International Journal of Computer Applications
The application of Genetic Algorithm (GAs) to the field of cryptanalysis is rather unique as no robust model for cryptanalysis using Genetic Algorithm exists. ...
The paper presents the systematic review of Genetic Algorithm applied to the Cryptanalysis. ...
The work by Spillman applied GAs to a Merkle-Hellman Knapsack Cryptosystem [21] . In 1994, Clark includes GAs as one of the three optimization algorithms applied to cryptanalysis [22] . ...
doi:10.5120/ijca2015907118
fatcat:sm6xvuappbecjonuhxg4x2a6ca
Survey on Symmetric and Asymmetric Key Cryptosystems
2014
IOSR Journal of Computer Engineering
This paper discusses the two most important categories of techniques symmetric and asymmetric cryptosystems. ...
Some of these techniques have become popular and widely in use today in a varieties of applications. ...
Knapsack Cryptosystem The first algorithm for generalized public-key encryption was the knapsack algorithm developed by Ralph Merkle and Martin Hellman. ...
doi:10.9790/0661-16431118
fatcat:rl3mmtxoavctbb3sjzs6jkerny
Broadcast Attacks against Lattice-Based Cryptosystems
[chapter]
2009
Lecture Notes in Computer Science
As a result, our attacks have many security implications on most of the lattice-based or knapsack cryptosystems. ...
These problems are used in lattice based cryptography and to model attack on knapsack cryptosystems. In this work, we are able to present some attacks against both lattice and knapsack cryptosystems. ...
Intersecting lattice has shown to be interesting to perform cryptanalysis. ...
doi:10.1007/978-3-642-01957-9_28
fatcat:ht7nrvkhlnb7zb4p3nlwjbe75u
Cryptanalysis and Improvement of Akleylek et al.'s cryptosystem
[article]
2013
arXiv
pre-print
In this cryptosystem, Akleylek et al. attempt to increase security of the P2P networks by mixing ElGamal cryptosystem with knapsack problem. ...
We modify this cryptosystem in order to increase its security and efficiency. Our construction is the efficient CCA2-secure variant of the Akleylek et al.' ...
Cryptanalysis of the Akleylek et al. Cryptosystem In this section, we propose our ciphertext-only attack against Akleylek et al.'s cryptosystem to recover message. ...
arXiv:1302.2112v2
fatcat:q4ikw6gg6zbtfl7ry26d6nnvzi
A Hybrid Computational Intelligence based Technique for Automatic Cryptanalysis of Playfair Ciphers
2020
Defence Science Journal
The Playfair cipher is a symmetric key cryptosystem-based on encryption of digrams of letters. ...
This work is an attempt to automate the process of cryptanalysis using hybrid computational intelligence. ...
Parallel implementation of multiple Swarms of MPSO based proposed technique is another research initiative to reduce computational time for cryptanalysis. ...
doi:10.14429/dsj.70.15749
fatcat:ekpvzjktn5erna75tfhf3zlqqa
A Survey on Cryptography using Optimization algorithms in WSNs
2015
Indian Journal of Science and Technology
The maximum number of keys store in the Ant Colony Optimization based key generation is 52, for Novel stream cipher cryptosystem 256, for fast and secure stream cipher 256, and also for RC4 256 keys. ...
The performance of the different methods is compared with various parameters such as maximum number of keys stored, battery capacity, and runtime. ...
Particle Swarm Optimization in Cryptanalysis of DES In 21 suggested Particle Swarm Optimization which is used in the cryptanalysis of DES based on their capability to selectively discover the solution ...
doi:10.17485/ijst/2015/v8i3/59585
fatcat:ey3ix2bfkfaszhpzmkplehuxoi
Linearly shift knapsack public-key cryptosystem
1989
IEEE Journal on Selected Areas in Communications
The algorithm is easy to implement and eliminates the redundancy of many knapsack cryptosystems. ...
Second, a linearly shift method is used to improve the security of the knapsack public-key cryptosystem. ...
The first cryptanalysis to the basic Merkle-Hellman cryptosystem was published by Shamir [4] . ...
doi:10.1109/49.17717
fatcat:p6n7h7eer5hfpnbbi4aendbwzm
A New Public-Key Cryptosystem
[chapter]
1997
Lecture Notes in Computer Science
Encryption requires four multiplications / byte and decryption is roughly equivalent to the generation of an RSA signature. ...
Interestingly, the crypt,ographic community has been relat,ively more successful in the related field of identification, where a user attempts to convince another entity of his identity by means of an ...
It used the knapsack problem where P[easy] was superincreasing and shuffling was a linear operation modulo some large integer. As is well known, the knapsack cryptosystem was broken by Shamir. ...
doi:10.1007/3-540-69053-0_3
fatcat:vx3cxle56bag5lw6q6paynt6de
Page 3731 of Mathematical Reviews Vol. , Issue 90F
[page]
1990
Mathematical Reviews
Shimshon Berkovits (1-LWL)
90f:94026 94A60 11T71 90C09 Brickell, Ernest F. (1-BELL6)
The cryptanalysis of knapsack cryptosystems. ...
This paper gives a review of progress in the area of asymmetric (or public-key) cryptosystems as of 1987, with an emphasis on the knapsack ciphers and the RSA scheme. ...
A Recursive and Parallelized Dynamic Programming Implementation of Hard Merkle-Hellman Knapsack System for Public Key Cryptography
2021
Cybernetics and Information Technologies
In this paper, we discuss the working principles of the Traditional Merkle-Hellman knapsack cryptosystem, which is an Easy knapsack. ...
The challenges of Hard Knapsack and how it overcomes the shortcomings of the Traditional Easy Knapsack, are also discussed. ...
Another variant of the Merkle-Hellman cryptosystem involves using a hard knapsack even for public key. ...
doi:10.2478/cait-2021-0019
fatcat:lmi6zqxojjcrnlhlqtennoq7ea
An overview of public key cryptography
1978
Communications Society
With a public key cryptosystem, the key used to encipher a message can be made public without compromising the secrecy of a different key needed to decipher that message. ...
THE COST OF ENCRYPTION Books about World War I1 intelligence operations make it clear that the allies were routinely reading enciphered German messages. ...
I then choose another person and do the same with him. This sounds somewhat impossible and, from one point of view, it is. ...
doi:10.1109/mcom.1978.1089772
fatcat:hgzmjajgi5gnzpub6ghy23wai4
« Previous
Showing results 1 — 15 out of 204 results