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 |
What are RC2 and RC4?
What are alternatives to RSA?
What other stream ciphers are there?
What is Capstone ?
What is a digital time-stamping service?
What is the significance of one-way functions for cryptography?
Are elliptic curve cryptosystems secure ?
What are lattice-based cryptosystems ?
Can rsa be exported from the united states?
What is quantum cryptography ?
What happens if my private key is compromised?
What is the RSA Factoring Challenge?