Summwer / pro-pnj-bkzLinks
We implement the progressive Improved Progressive BKZ with Lattice Sieving presented in https://eprint.iacr.org/2022/1343, one can call it to solve LWE challenge(https://www.latticechallenge.org/lwe_challenge/challenge.php) or other approximate svp problem.
☆13Updated 7 months ago
Alternatives and similar repositories for pro-pnj-bkz
Users that are interested in pro-pnj-bkz are comparing it to the libraries listed below
Sorting:
- my ctf chals☆11Updated 3 months ago
- ☆35Updated 2 years ago
- Lattice Sieving using GPU Tensor cores based on the General Sieve Kernel (G6K)☆35Updated 6 months ago
- A Sage interface for FGb (Gröbner basis computations)☆38Updated last year
- ☆13Updated last week
- Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS☆39Updated last week
- Revisiting Differential-Linear Attacks via a Boomerang Perspective☆11Updated 2 months ago
- Number Geometry methods: Shortest Vector Problem and Shorter Basis Problem in Lattice (Hamming distance, Bounded distance decoding, bina…☆13Updated 2 years ago
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆14Updated 10 months ago
- ☆22Updated 7 months ago
- ☆34Updated 2 years ago
- ☆15Updated 2 years ago
- The General Sieve Kernel☆124Updated 3 months ago
- Functions for solving linear inequalities in integers☆56Updated 2 months ago
- Implementation of the fastest ISD algorithms☆23Updated 7 months ago
- ☆57Updated last month
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆20Updated 11 months ago
- Fast lattice reduction☆215Updated last month
- A toolkit for cryptanalysis using lattices.☆130Updated last year
- Solving linear systems over GF(2) by manipulating bitvectors☆57Updated 6 months ago
- Representing DES in Z3☆15Updated 2 years ago
- Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"☆14Updated this week
- ☆44Updated 2 years ago
- 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 rando…☆19Updated 4 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆117Updated 9 months ago
- A sage Toolkit for mounting/estimating attacks on LWE with Side Information☆50Updated 2 years ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- Bringing the power of SageMath to VS Code with this extension that offers specialized syntax highlighting, quick run capabilities, and ad…☆40Updated this week
- Automated cryptanalysis of substitution permutation network cipher☆32Updated last year
- An easy to use tool for evaluating the security of cryptographic algorithms against integral attacks.☆24Updated 6 years ago