Commit cd2db21

authored

Update README.md

1 parent 42d79f8 commit cd2db21Copy full SHA for cd2db21

File tree

+11

-1

lines changed

+11

-1

lines changed

Lines changed: 11 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1 +1,11 @@`
`1`		`-# RSA-Encryption-Algorithm-in-Python`
	`1`	`+# RSA-Encryption-Algorithm-in-Python`
	`2`	`+`
	`3`	`+This is a Python3 implementation to the RSA encryption algorithm using the Extended Euclidean algorithm (also known as extended gcd).`
	`4`	`+`
	`5`	`+## Usage`
	`6`	`+`
	`7`	`+![How-To-Use-GIF](usage.gif)`
	`8`	`+`
	`9`	`+## Implementation Note`
	`10`	`+`
	`11`	`+The prime numbers generated (p, q) are ranged from 100 to 500 only for demo purposes while they should be very large primes like 1024 or 2048 bits long for more complex encryption - [Read more about the RSA Factoring Challenge](https://en.wikipedia.org/wiki/RSA_Factoring_Challenge)`

Comments

(0)