On a new fast public key cryptosystem

This paper presents a new fast public key cryptosystem namely : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function : $F(x) =(a\times x)Mod(2^p)Div(2^q)$ .\\* Mod is modulo operation , Div is integer division operation , a , p and q are integers where $( p > q )$ .\\* In this paper we also evaluate the hardness of this problem by reducing it to SAT

Multidimentional ModDiv public key exchange protocol

This paper presents Multidimentional ModDiv public key exchange protocol which security is based on the hardness of an LWR problem instance consisting on finding a secret vector $\textbf{X}$ in $\mathbb{Z}_{q}^{n}$ knowing vectors $\textbf{A}$ and $\textbf{B}$ respectively in $\mathbb{Z}_{p}^{m}$ and $\mathbb{Z}_{p-q}^{m-n}$, where elements of vector $\textbf{B}$ are defined as follows : $B(i)$ = ($\sum_{j=1}^{j=n} A(i+n-j) \times X(j)$) $Mod(P)Div(Q)$. Mod is integer modulo, Div is integer division, P and Q are known positive integers which sizes in bits are respectively p and q which satisfy $p > 2 \times q$. m and n satisfy $m >2 \times n$

Symetric encryption algorithms based on the mathematical structure underlying the three body problem

The three body problem is the founding problem of deterministic chaos theory. In this article is proposed a new stream cipher algorithm based on a mathematical structure similar to that underlying the 3 body poblem. Is also proposed to use said structure for the design of new bloc ciphers and hash functions algorithms

On a new fast public key cryptosystem

This paper presents a new fast public key cryptosystem namely : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function : F(x) = (a * x)Mod(2 power p)Div(2 power q) . Mod is modulo operation , Div is integer division operation , a , p and q are integers where (p > q) . In this paper we also evaluate the hardness of this problem by reducing it to SAT

On a new properties of number sequences ,a randomness test and a new RC4\u27s key scheduling algorithm.

In this paper, we introduce the concept of the derivative of sequence of numbers and define new statistical indices by which we discoverd new properties of randomly generated number sequences. We also build a test for pseudo random generators based on these properties and use it to confirm the weakness of RC4 key scheduling algorithm that has been reported in the litterature. In this rescpect we publish a new RC4\u27s key scheduling algorithm that don\u27t have this weakness