Docker>> Cytro>> 返回
项目作者： maojui

项目描述 ：
Tools to solve CTF crypto challenge.
高级语言： Python
项目地址: git://github.com/maojui/Cytro.git
创建时间： 2017-08-11T12:25:03Z
项目社区：https://github.com/maojui/Cytro
开源协议：MIT License
下载


Crypto Tools For CTF

GitHub

In this project, I integrate some source code made by myself and collected from other great write-ups, blogs, and projects, also reimplementing to keep the project structure neat.

I always use those methods to solve crypto problem and put new attack or method after the CTF, hoping this project will bring help for other CTF players.

It’s still incomplete for now. Pull requests are always welcome.

cytro.RSA

Here provides some factorize formula to factor large RSA modulus and some common RSA attacks.

Redundant Work

  • RSAKey((n, e, d)) - Same as Crypto.PublicKey.RSA added some lazy functions. d is optional, determine is pubkey or privkey

    • encrypt(m) - return the encryption of message
    • decrypt(c) - return the decryption of cipher
    • load_pem(pem) - Read Key by String
    • load_file(key.pem) - Read Key by file path
    • cal_private(e, p, q) - return the decrypt exponent

  • solve_crt(remainders, modules) - solve Chinese Remainder Theoreme

  • factordb(n) - API for getting well-known prime in FactorDB

Factorization Method

  • gcd_multiple_keys(keys) - GCD for Multiple keys
  • factordb(n) - Check the prime is factorize in FactorDB or not
  • fermat_factorization(n) - Fermat Factorization
  • wiener(n, e) - Wiener Attack
  • boneh_durfee(n, e) - Boneh Durfee Attack
  • williams_pp1(n) - Williams p+1 Attack
  • pollard_rho(n) - Pollards-Rho
  • pollard_pm1(n) - Pollards P-1 (Go through every primes)
  • pollard_brute(n) - Pollards P-1 (Go through every integer)

RSA Specific Methods

  • Partial Key Recovery for n/2 bits of the private key
  • Chinese Remainder Theorem full private key recovery

Decoding despite invalid Public Exponent

Low Public Exponent

  • hastad_broadcast(c, N) - Hastad’s Broadcast Attack
  • common_modular(set1, set2) - Common Modulus, Common public Exponent [set:(N, e, c)]
  • franklin_reiter(n, e, c1, c2, r, a=1) - Franklin Reiter Related Message Attack :

Information LOSS : (TODO)

  • coppersmith - Coppersmith Attack
  • coppersmith_shortpad - Coppersmith Shortpad Attack
  • partial_m() - Known Partial bits of m, recover.
  • partial_p() - Known Partial bits of p, recover.
  • partial_d() - Known Partial bits of d, recover.
  • recover_key() - Known Partial bits of d, recover.

Forge Signature

  • bleichenbacher_06 - Attack on (e=3) python-rsa signature.

Others

  • noveltyprimes(n)
  • smallq(n)
  • smallfraction(n)
  • mersenne_primes(n)

cytro.DSA

  • Biased-K Attack

cytro.CBC

  • Bit-flipping attack
  • Padding Oracle
  • POODLE Attack