Survey on computationally hard problems and their applications to cryptography

Ameera Salem Abdouli, Joonsang Baek, Chan Yeob Yeun

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Security of several cryptosystems rests on different computational hard problems. Many popular cryptographic schemes are based on the intractability of number theoretic problems such as factoring and discrete logarithms. These hard problems are widely believed to be intractable for classical algorithms. However, these problems may turn to be polynomial-time solvable when the quantum computer comes into existence. Therefore, it is desired to investigate new classes of alternative candidates of hard problems that have exponential complexity to both the ordinary and quantum computers, for instance, error correcting codes, lattice problems, braid groups and subset - product. In this paper, we will focus on the computationally hard problems and their applications to cryptography.

Original languageBritish English
Title of host publication2011 International Conference for Internet Technology and Secured Transactions, ICITST 2011
Pages46-52
Number of pages7
StatePublished - 2011
Event2011 International Conference for Internet Technology and Secured Transactions, ICITST 2011 - Abu Dhabi, United Arab Emirates
Duration: 11 Dec 201114 Dec 2011

Publication series

Name2011 International Conference for Internet Technology and Secured Transactions, ICITST 2011

Conference

Conference2011 International Conference for Internet Technology and Secured Transactions, ICITST 2011
Country/TerritoryUnited Arab Emirates
CityAbu Dhabi
Period11/12/1114/12/11

Keywords

  • discrete logarithm problem
  • error-correcting codes
  • factoring problem
  • lattices

Fingerprint

Dive into the research topics of 'Survey on computationally hard problems and their applications to cryptography'. Together they form a unique fingerprint.

Cite this