A public-key cryptosystem based on inhomogeneous cellu lar automata is prop osed . The running time of all known algorithms for br eaking t he system grows exponenti ally with the cipher block length.

We point out, in this paper, that the theory of generalized inverses of matrices over nite elds is a potential tool in cryptographic research, by proposing a public key cryptosystem. We analyse some properties of the public key cryptosystem and compare them with those of McEliece's public key cryptosystem. The idea is similar to that of McEliece's public key cryptosystem in terms of the usage o...

This paper presents a survey of key evolving cryptosystems in the public key setting, focusing on two main approaches: ‘forward security’ and ‘intrusion resilience’. The essential feature of this design strategy is that the secret key changes over time, while the corresponding public key remains unchanged. Key evolving cryptosystems can limit the damage caused by an attacker who occasionally le...

It is striking to observe that two decades after the discovery of public-key cryptography, the cryptographer’s toolbox contains only a dozen of asymmetric encryption schemes. This rarity and the fact that today’s most popular schemes had so far defied all complexity classification a.ttempts strongly motivates the design of new asymmetric cryptosystems. Interestingly, the crypt,ographic communit...

We discuss a matrix public key cryptosystem and its numerical implementation.

We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability. To our best knowledge...

In this paper, the authors give the definitions of a coprime sequence and a lever function, and describe the five algorithms and six characteristics of a prototypal public key cryptosystem which is used for encryption and signature, and based on three new problems and one existent problem: the multivariate permutation problem (MPP), the anomalous subset product problem (ASPP), the transcendenta...

This paper revisits a public key cryptosystem which is based on finite Church-Rosser string-rewriting systems. We consider some ideas for cryptanalysis and discuss issues concerning practical usage. It turns out that without changing crucial details of key generation this cryptosystem does not offer acceptable cryptographic security. We also provide the source code of our rudimentary implementa...

In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon...

We present our experience from implementing the public-key cryptosystem of González, Boyd and Dawson. We discuss different computational methods and compare their relative efficiency experimentally. We also compare the efficiency of this cryptosystem with that of the ElGamal cipher.