| from lll_cvp import * | |
| from functools import partial | |
| def example1(): | |
| # copied from https://github.com/rkm0959/Inequality_Solving_with_CVP/blob/main/Example%20Challenge%204%20-%20HITCON%20CTF%202019%20Quals%20-%20not%20so%20hard%20RSA/solve_challenge_4.sage | |
| ## Example 4 : HITCON CTF 2019 Quals not so hard RSA | |
| ## d is 465 bits |
| from subprocess import check_output, DEVNULL, CalledProcessError | |
| import itertools | |
| import IPython | |
| import time | |
| def to_fplll_format(M): | |
| m, n = M.dimensions() | |
| ret = "" | |
| s = "[" |
| // g++ -O3 solve.cpp -fopenmp && ./a.out | |
| // | |
| // Credits: | |
| // Algorithm: @utaha1228 | |
| // Optimization: @sasdf | |
| #include "table.h" // Generated by python3 solve.py | |
| #include <omp.h> | |
| #include <cstdint> | |
| #include <cstdio> |
git config filter.strip-notebook-output.clean 'jupyter nbconvert --ClearOutputPreprocessor.enabled=True --to=notebook --stdin --stdout --log-level=ERROR'
Create a .gitattributes file inside the directory with the notebooks
Add the following to that file:
*.ipynb filter=strip-notebook-output
| from Crypto.Util.number import * | |
| PR.<qr>=PolynomialRing(ZZ) | |
| def calc_params(e,N): | |
| delta = 0.1 | |
| gama = 0.05 | |
| beta = log(e,N).n() | |
| alpha = 0.25 | |
| return alpha,beta,delta,gama |
| # Overview | |
| # This challenge is based on May's version of Wiener's Attack | |
| # (https://www.math.uni-frankfurt.de/~dmst/teaching/WS2015/Vorlesung/Alex.May.pdf) | |
| # But the attack can't be apply to the challenge because it has 2 exponents, | |
| # so you have to extend the method of May. | |
| # After LLL, choose 2 shortest vectors and reconstruct polynomial. | |
| # then pick coefficients and decrypt ciphertext | |
| import json | |
| from binascii import unhexlify |
| // ==UserScript== | |
| // @name Twitter Promoted | |
| // @namespace http://tampermonkey.net/ | |
| // @version 0.1 | |
| // @description Get rid of stupid promoted tweets | |
| // @author Mac Gaulin | |
| // @match http*://twitter.com/* | |
| // @grant none | |
| // ==/UserScript== |
| /* | |
| gcc -m64 -nostdlib -Os -mrtm -fno-toplevel-reorder -static -Wno-multichar solve.c -o solve.elf | |
| objcopy -Obinary -j .text solve.elf solve.bin | |
| Reference https://github.com/Alberts-Coffee-Hours/Mastik/blob/master/src/l1.c, | |
| https://github.com/vusec/ridl/blob/master/exploits/shadow/leak.c | |
| and https://github.com/oranav/ctf-writeups/blob/master/gctf19/RIDL/solve.c | |
| */ | |
| #include <stdio.h> | |
| #include <stdlib.h> |
| #!/usr/bin/python3 | |
| """ | |
| The decryption looks like this: | |
| (f * ctpol) % q * inverse(f, mod 3) % 3 | |
| Note that; | |
| - (f) is a "small" polynomial (61 values 1 and -1, others are zero). | |
| - (% q) is done to [-63; 64] | |
| If (f*ctpol) does not wrap over q |
