A certain number of public-key cryptosystems based on error-correcting codes have been proposed as an alternative to algorithms based on number theory. In this paper, we analyze algorithms that can be used to attack such cryptosystems in a very precise way, and optimize them. Thus, we obtain some more eecient attacks than those previously known. Even if they remain unfeasible, they indicate the...

There is a lack of more complicated ideal-lattice-based cryptosystems which require the use of lattice trapdoors, for the reason that currently known trapdoors are either only applicable to general lattices or not well-studied in the ring setting. To facilitate the development of such cryptosystems, we extend the notion of lattice trapdoors of Micciancio and Peikert (Eurocrypt ’12) into the rin...

The emergence of new embedded system technologies, such as IoT, requires the design lightweight cryptosystems to meet different hardware restrictions. In this context, concept Finite State Machines (FSMs) can offer a robust solution when using based on finite automata, known FAPKC (Finite Automaton Public Key Cryptosystems), introduced by Renji Tao. These have been proposed alternatives traditi...

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...

Any software claiming to cryptographically protect the data should use an encryption algorithm that meets public standards, and has an extensive history of independent cryptanalytic validation. However, even though they encrypt with strong encryption algorithm, most existing public-key cryptosystems, including RSA-OAEP, do not consider the “memory reconstruction attack” or the “memory core-dump...

Since the advent of side channel attacks, classical cryptanalysis is no longer sufficient to ensure the security of cryptographic algorithms. In practice, the implementation of algorithms on electronic devices is a potential source of leakage that an attacker can use to completely break a system [29, 15, 21]. The injection of faults during the execution of cryptographic algorithms is considered...

In this paper, we propose a blind signature scheme and three practical educed schemes based on elliptic curve discrete logarithm problem. The proposed schemes impart the GOST signature structure and utilize the inherent advantage of elliptic curve cryptosystems in terms of smaller key size and lower computational overhead to its counterpart public key cryptosystems such as RSA and ElGamal. The ...

Public key cryptosystems depend on complex and time consuming arithmetic operations. Public key cryptosystems require modular operations over large numbers or finite fields. Researchers are working on improving the performance of asymmetric cryptosystems while maintaining the security of the cryptographic algorithms. Parallel computing is the most promising solution to improve the computing pow...