Hopefully fixed eqn rendering
This commit is contained in:
parent
09f03e23d1
commit
4221b13f40
|
@ -28,7 +28,7 @@ Then it computes the ciphertext, it is a permutation of the padded plaintex. For
|
|||
```
|
||||
|
||||
## Reducing s
|
||||
Due to s only being used in ![s^{i} \mod p](https://latex.codecogs.com/svg.latex?s^{i}&space;\mod&space;p) s can be reduced modulo p. That means that this can be easily brute forced as there are only p - 1 (19488) possible values for s.
|
||||
Due to s only being used in ![s^{i} \mod p](https://latex.codecogs.com/svg.latex?s%5E%7Bi%7D%26space%3B%5Cmod%26space%3Bp) s can be reduced modulo p. That means that this can be easily brute forced as there are only p - 1 (19488) possible values for s.
|
||||
|
||||
However we can create a solution which is faster than bruteforce and works for p way larger than 19489 using a known plaintext attack.
|
||||
|
||||
|
|
Loading…
Reference in a new issue