1. Categories >> Software >> Cryptography >> Cryptography General
  2. Suggest New Category

Which is easier, factoring or discrete log?

Question Posted / chandan kishore


Which is easier, factoring or discrete log?..

Answer / Ganesh Pratap Singh

Discrete logarithm problems are generally considered harder than factoring large composite numbers. The difficulty of solving either problem is a crucial part of the security of many cryptographic systems based on RSA (factoring) and elliptic curve cryptography (discrete log).

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Cryptography General Interview Questions

Is cryptography exportable from the U.S.?

1 Answers   TCS,

What are visual secret sharing schemes?

1 Answers  

What are the prospects for theoretical factoring breakthroughs?

1 Answers   TCS,

What happens if I lose my private key?

1 Answers   TCS,

What is SecurPC ?

1 Answers   Wipro,

What are elliptic curve cryptosystems ?

1 Answers  

What is quantum cryptography ?

2 Answers  

What is PSS/PSS-R ?

1 Answers  

What are the ITU-T (CCITT) Standards ?

1 Answers  

What is a compression function?

1 Answers  

Can DES be exported from the U.S.?

1 Answers   TCS,

Which two cryptographic mechanisms provide authentication schemes?

1 Answers  

For more Cryptography General Interview Questions Click Here
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)