Cryptanalysis on RSA Algorithm

Free registration required

Executive Summary

RSA is one of the mathematical algorithms that faced the requirements for public application that is valuable in sending information key cryptosystems. The RSA scheme is a block via insecure channels, which is counted as the cipher in which the original message and cipher worse case used in the e-commerce and internet message are integer values in the interval [0..n - 1] today. However, there are some algebraic where n a composite modulus. assumptions which are considered to be an In this paper the authors take the public key (e, n) only to important key in this issue such as prime numbers disclose the original modulus from the RSA and integer factoring problem. scheme.

  • Format: PDF
  • Size: 256.9 KB