commit 2036281621083974b98a8a7465615640b7694db3 parent 59561bf6eb4617d942bb52504322ecd5bb761bfa Author: finwo <finwo@pm.me> Date: Tue, 29 Aug 2017 17:20:52 +0200 Update README.md Diffstat:
| M | README.md | | | 2 | +- |
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/README.md b/README.md @@ -4,4 +4,4 @@ A self-made cryptography algorithm. This is an example implementation of the sch --- -Keys are composed of 2 unsigned 32-bit integers, the multiplicand and the modulator. The only restriction on these numbers is that the modulator must be >=128, which results in ((2**32)-128)*(2**32) = 18446743523953737728 possible keys. Padding is forced to further randomize the output and has no structural restrictions. +Keys are composed of 2 unsigned 32-bit integers, the multiplicand and the modulator. The only restriction on these numbers is that the modulator must be >=128, which results in ((2^32)-128)*(2^32) = 18446743523953737728 possible keys. Padding is forced to further randomize the output and has no structural restrictions.