Commit 5e75d8f

authored

Update README.md

1 parent cd2db21 commit 5e75d8fCopy full SHA for 5e75d8f

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -8,4 +8,4 @@ This is a Python3 implementation to the RSA encryption algorithm using the Exten`
`8`	`8`
`9`	`9`	`## Implementation Note`
`10`	`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)`
	`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)