What is a hard problem ?



What is a hard problem ?..

Answer / Pranjal Gupta

A hard problem in cryptography refers to a mathematical problem that is believed to be computationally infeasible to solve within a reasonable amount of time using current or near-future technology. Examples include the factoring problem, the discrete logarithm problem, and the elliptic curve discrete logarithm problem.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Cryptography General Interview Questions

What are RC2 and RC4?

1 Answers   TCS,


What are alternatives to RSA?

1 Answers   TCS,


What other stream ciphers are there?

1 Answers  


What is Capstone ?

3 Answers   TCS,


What is a digital time-stamping service?

1 Answers   TCS,


What is the significance of one-way functions for cryptography?

1 Answers   TCS,


Are elliptic curve cryptosystems secure ?

1 Answers  


What are lattice-based cryptosystems ?

1 Answers  


Can rsa be exported from the united states?

1 Answers  


What is quantum cryptography ?

2 Answers  


What happens if my private key is compromised?

1 Answers   TCS,


What is the RSA Factoring Challenge?

1 Answers   TCS,


Categories
  • Cryptography Algorithms Interview Questions Cryptography Algorithms (52)
  • Digital Certificates Interview Questions Digital Certificates (23)
  • Encryption Decryption Interview Questions Encryption Decryption (77)
  • Ciphers Interview Questions Ciphers (43)
  • Cryptography Protocols Interview Questions Cryptography Protocols (31)
  • Blockchain Interview Questions Blockchain (338)
  • Cryptography General Interview Questions Cryptography General (154)
  • Cryptography AllOther Interview Questions Cryptography AllOther (0)