dagur
/
CTFWriteups
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fixed some terminoligy

This commit is contained in:
DagurB 2021-11-08 12:11:44 +00:00
parent 759690c453
commit 5b6444de55
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
DAMCTF2021/haveibeenpwned/README.md
View File

@ -1,7 +1,7 @@
# have-i-b33n-pwn3d
In this challenge we are supposed to find all passwords in a private set intersection protocol as described in [this paper](https://eprint.iacr.org/2021/1159). To be frank I didnt read the paper.
This protocol is based on elliptic curves (more specifically $y^2 = x^3 + 486662x^2 + x \mod{2^{255}-19}$) however that turns out to be bad.
## Relating the 2 lagrange polynomials
## Relating the 2 polynomials
```python
for i in range(len(passwords)):
b = sample_R()