Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
D Micciancio - computational complexity, 2007 - Springer
We investigate the average-case complexity of a generalization of the compact knapsack
problem to arbitrary rings: given m (random) ring elements a 1,..., am∈ R and a (random) …
problem to arbitrary rings: given m (random) ring elements a 1,..., am∈ R and a (random) …
A method for finding numerical solutions to diophantine equations using spiral optimization algorithm with clustering (SOAC)
Diophantine equations are equations containing two or more unknowns, such that only the
integer solutions are required. To find solutions of these equations numerically, we can be …
integer solutions are required. To find solutions of these equations numerically, we can be …
Particle swarm optimisation based Diophantine equation solver
The paper introduces particle swarm optimisation as a viable strategy to find numerical
solution of Diophantine equation, for which there exists no general method of finding …
solution of Diophantine equation, for which there exists no general method of finding …
Finding numerical solutions of diophantine equations using ant colony optimization
The paper attempts to find numerical solutions of Diophantine equations, a challenging
problem as there are no general methods to find solutions of such equations. It uses the …
problem as there are no general methods to find solutions of such equations. It uses the …
A knapsack-based probabilistic encryption scheme
B Wang, Q Wu, Y Hu - Information Sciences, 2007 - Elsevier
Knapsack-based cryptosystems had been viewed as the most attractive and the most
promising asymmetric cryptographic algorithms for a long time due to their NP-completeness …
promising asymmetric cryptographic algorithms for a long time due to their NP-completeness …
Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction
Researching post-quantum cryptography is now an important task in cryptography. Although
various candidates of post-quantum cryptosystems (PQC) have been constructed, sizes of …
various candidates of post-quantum cryptosystems (PQC) have been constructed, sizes of …
A public key cryptosystem based on diophantine equations of degree increasing type
S Okumura - Pacific Journal of Mathematics for Industry, 2015 - Springer
In this paper we propose a new public key cryptosystem based on diophantine equations
which we call of degree increasing type. We use an analogous method to the “Algebraic …
which we call of degree increasing type. We use an analogous method to the “Algebraic …
A connectionist network approach to find numerical solutions of Diophantine equations
The paper introduces a connectionist network approach to find numerical solutions of
Diophantine equations as an attempt to address the famous Hilbert's tenth problem. The …
Diophantine equations as an attempt to address the famous Hilbert's tenth problem. The …
A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher
ER Lira, HB de Macêdo, DA Lima, L Alt, GMB Oliveira - Natural Computing, 2023 - Springer
The one-dimensional cellular automata (CA) system detailed herein uses a hybrid
mechanism to attain reversibility, and this approach is adapted to create a novel block cipher …
mechanism to attain reversibility, and this approach is adapted to create a novel block cipher …
[PDF][PDF] The applications of genetic algorithms in cryptanalysis
AJ Bagnall - School of Information Systems, University Of East …, 1996 - academia.edu
This thesis describes a method of deciphering messages encrypted with rotor machines
utilising a Genetic Algorithm to search the keyspace. A tness measure based on the phi test …
utilising a Genetic Algorithm to search the keyspace. A tness measure based on the phi test …