Pinned Loading

1. my-ctf-challenges my-ctf-challenges Public

   My CTF challenges, especially cryptography

   Sage 22 1

2. factor-from-random-known-bits factor-from-random-known-bits Public

   Python's library written in Rust to quickly factor `n = pq` when around >50% bits of `p` and `q` are known which are distributed at random.

   Rust 18

3. snarkpy snarkpy Public

   A zk-SNARK implemented in Python & Rust compatible with snarkjs

   Python 4

4. dotfiles dotfiles Public

   My dotfiles for nvim, fish and i3wm etc. OS: manjaro, WM: i3-wm, Editor: nvim, Shell: fish

   Lua 1

5. simple CSIDH implementation. DO NOT ... simple CSIDH implementation. DO NOT use for cryptographic purpose.

   1

   # Use a small prime for brevity

   2

   p = 4 * 3 * 5 * 7 - 1

   3

   primes = [3, 5, 7]

   4

   Fp = GF(p)

   5

6. implementation of Reed-Solomon Codin... implementation of Reed-Solomon Coding using a case in https://static.chunichi.co.jp/chunichi/pages/feature/science/galois_field_in_auto_factory.html

   1

   # https://static.chunichi.co.jp/chunichi/pages/feature/QR/galois_field_in_auto_factory.html

   2

   X = GF(2).polynomial_ring().gen()

   3

   poly = X ** 8 + X ** 4 + X ** 3 + X ** 2 + 1

   4

   F = GF(2 ** 8, name="a", modulus=poly)

   5

   R.<x> = PolynomialRing(F)