Add security

src/SUMMARY.md

@@ -9,18 +9,20 @@
     - [Arithmetization](./intro_zk/2_arithmetization.md)
     - [Polynomial commitment schemes](./intro_zk/3_pc_schemes.md)
     - [Generating the proof](./intro_zk/4_generating_proof.md)
-    - [Other arguments](./intro_zk/5_other_arguments.md)
+    - [Other arguments (permutation)](./intro_zk/5_other_arguments.md)
 - [Polynomial commitment schemes](./pcs/1_introduction.md)
     - [KZG](./pcs/kzg.md)
 - [Protocols](./protocols/intro.md)
     - [Plonk](./protocols/plonk.md)
+    - [Hyperplonk](./protocols/plonk.md)
 - [Blockchain](./blockchain/main.md)
     - [Ethereum](./blockchain/ethereum.md)
     - [Starknet](./blockchain/starknet.md)
     - [Aztec](./blockchain/aztec.md)
     - [Zcash](./blockchain/zcash.md)
 - [Optimizations](./optimizations/intro.md)
     - [MSM](./optimizations/msm.md)
+- [Security](./security/intro.md)
 - [Miscellaneous](./misc/elliptic_curves_cyrstal.md)
 - [Bobo VM](./bobo_vm.md)
 - [More resources](./resources.md)

src/protocols/plonk.md

@@ -1,3 +1,2 @@
 # Plonk
-The [plonk paper](https://eprint.iacr.org/2019/953.pdf) is well written and the protocol is described in section 8.3. Also, this [lambdaclass blogpost](https://blog.lambdaclass.com/all-you-wanted-to-know-about-plonk/) is very good.
-
+The [plonk paper](https://eprint.iacr.org/2019/953.pdf) is well written and the protocol is described in section 8.3. Also, this [lambdaclass blogpost](https://blog.lambdaclass.com/all-you-wanted-to-know-about-plonk/) is very good. A more concise description is found in section V of this [paper](https://eprint.iacr.org/2023/691.pdf).

src/security/intro.md

@@ -0,0 +1,9 @@
+# Security
+This is a place where security issues should be explained. Example:
+
+- Discrete Log attacks: [Baby-step giant-step](https://en.wikipedia.org/wiki/Baby-step_giant-step) for groups of prime order, [Pohlig-Hellman](https://en.wikipedia.org/wiki/Pohlig%E2%80%93Hellman_algorithm) for groups whose order is a smooth integer,  SSSA attack for curves whose group order is the same as the field order, [MOV attack](https://crypto.stackexchange.com/questions/1871/how-does-the-mov-attack-work) to reduce discrete log in elliptic curves to discrte log in $\mathbb{F}_p$ by using pairings, [Singular curve](https://fdtc.deib.polimi.it/FDTC15/shared/FDTC-2015-session_4_1.pdf) reduce a curve to a simpler curve and solve there the discrete log problem.
+- [Frozen heart (Strong Fiat Shamir)](https://eprint.iacr.org/2023/691.pdf)
+
+Links:
+- [Random cybersecurity company](https://hexens.io/blog/spot-the-bug-challenge-3)
+- [Weak curves in elliptic curve cryptography](https://wstein.org/edu/2010/414/projects/novotney.pdf)