Skip to main content
Computer Science

Return to Question

added 44 characters in body
Source Link
Turbo
Turbo
  • 2.9k
  • 14
  • 27

Why were primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography (http://en.wikipedia.org/wiki/Blum_integer)? Was there a time it was considered there could be an efficient algorithm if these primes be utilized (if so, then what exact reasons were these)?

Why were primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography (http://en.wikipedia.org/wiki/Blum_integer)? Was there a time it was considered there could be an efficient algorithm if these primes be utilized?

Why were primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography (http://en.wikipedia.org/wiki/Blum_integer)? Was there a time it was considered there could be an efficient algorithm if these primes be utilized (if so, then what exact reasons were these)?

added 86 characters in body
Source Link
Turbo
Turbo
  • 2.9k
  • 14
  • 27

Why arewere primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography (http://en.wikipedia.org/wiki/Blum_integer)? IsWas there a time it was considered there could be an efficient algorithm if these primes be utilized?

Why are primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography? Is there an efficient algorithm if these primes be utilized?

Why were primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography (http://en.wikipedia.org/wiki/Blum_integer)? Was there a time it was considered there could be an efficient algorithm if these primes be utilized?

Source Link
Turbo
Turbo
  • 2.9k
  • 14
  • 27

A question on RSA

Why are primes which are $1$ modulo $4$ considered to be weak for use in RSA cryptography? Is there an efficient algorithm if these primes be utilized?