commit d9666f9c8dbe82015776776ed76a05170c9bc862 parent 29bd772d0b84d29cb1ac8d99eb8482e56f013c8d Author: finwo <finwo@pm.me> Date: Tue, 29 Aug 2017 17:49:17 +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,7 +4,7 @@ A self-made cryptography algorithm. This is an example implementation of the sch ## How keys are build -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 and the multiplicant >=1, which results in ((2^32)-128)*((2^32)−1) = 18446743519658770560 possible keys. Padding is forced to further randomize the output and has no structural restrictions. ## Dependencies