The rapid development of quantum computing devices promises powerful machines with the potential to confront a variety of problems that conventional computers cannot. Therefore, quantum computers generate new threats at unprecedented speed and scale and specifically pose an enormous threat to encryption. Lattice-based cryptography is regarded as the rival to a quantum computer attack and the future of post-quantum cryptography. So, cryptographic protocols based on lattices have a variety of benefits, such as security, efficiency, lower energy consumption, and speed. In this work, we study the most well-known lattice-based cryptosystems while a systematic evaluation and comparison is also presented.
The last decade, the evolution in quantum computing has been enormous and real and reliable quantum computers are being developed quickly. One of the consequences of the upcoming quantum era is to make key distribution protocols insecure, as most of them are based on discrete algorithm problems. On the other hand, quantum computing provides a powerful and prominent tool for the safe transmission of information and cryptographic schemes and many of them have already been proposed. In this work, we discuss about quantum cryptography and we present certain quantum key distribution protocols. We also discuss about ‘potential attacks that can be performed against the quantum cryptographic schemes which are based on quantum system’s imperfections and loopholes.
We present a cryptosystem which is a combination of the DRSA and ElGamal cryptosystems. Its security relies equally on the integer factorization and the discrete logarithm problems. We show that it is at least as secure as each of the DRSA and ElGamal cryptosystems (with messages from a subgroup) which are semantically secure.
16 September 2011 in Applicable Algebra in Engineering, Communication and Computing