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

Key exchange for new cryptosystem analogous to LUCELG and Cramer-Shoup

Key exchange or key establishment is any process in cryptography by which users are able to share or exchange a secret key. The problem on the key exchange is how to exchange any keys or information so that no third party can obtain a copy. This paper will discuss the Diffie-Hellman key exchange and the key exchange for new cryptosystem analogous to LUCELG and Cramer-Shoup that have been proposed by the same author in 2009. In the analog cryptosystem, the encryption and decryption algorithm are based on the defined Lucas function and its security have been proved that is polynomial time equivalent to the generalized discrete logarithm problems. Hence, one protocol will be proposed to provide the key establishment. Basically the protocol uses the second order linear recurrence relation and the multiplicative group of integers modulo p. In the protocol, the third party will not be able to alter the contents of communication between three parties

Public Key Protocols over Twisted Dihedral Group Rings

Key management is a central problem in information security. The development of quantum computation could make the protocols we currently use unsecure. Because of that, new structures and hard problems are being proposed. In this work, we give a proposal for a key exchange in the context of NIST recommendations. Our protocol has a twisted group ring as setting, jointly with the so-called decomposition problem, and we provide a security and complexity analysis of the protocol. A computationally equivalent cryptosystem is also proposed

A new RSA public key encryption scheme with chaotic maps

Public key cryptography has received great attention in the field of information exchange through insecure channels. In this paper, we combine the Dependent-RSA (DRSA) and chaotic maps (CM) to get a new secure cryptosystem, which depends on both integer factorization and chaotic maps discrete logarithm (CMDL). Using this new system, the scammer has to go through two levels of reverse engineering, concurrently, so as to perform the recovery of original text from the cipher-text has been received. Thus, this new system is supposed to be more sophisticated and more secure than other systems. We prove that our new cryptosystem does not increase the overhead in performing the encryption process or the decryption process considering that it requires minimum operations in both. We show that this new cryptosystem is more efficient in terms of performance compared with other encryption systems, which makes it more suitable for nodes with limited computational ability