RSA Approximation

RSA Encryption

https://canihavesomecoffee.github.io/js-rsa-tool/#encrypt

Here you can create an RSA encrypted message by filling in the form. First prime: Second prime: or Choose e, so that GCD(e,K) is 1: Plain-text message:

Status: Done P is prime? Yes Q is prime? Yes N: 463573021697 K: 463571649456 GCD(E,K): GCD(17,463571649456) is 1 Number of bits per group: 39 Character(s) Decimal(s) Bit group(s) Decimal Decimal encrypted Bit group encrypted H 72 01001000 72 99340158523 001011100100001001000101000011000111011 ello 101 108 108 111 01100101 01101100 01101100 01101111 25964 37706109351 000100011000111011101011001000110100111

For ello 101 108 108 111 substitute 37706109351

Notice "l" appears twice 109 - 108 = 1 and 108 - 61 = 47

So RSA is a substitution cipher but duplicates have different values.

References

This article "RSA Approximation" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:RSA Approximation. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.

---