Function

XOR function

xor = lambda a, b: bytes(ai ^ bi for ai, bi in zip(a, b))

Hash

• Length extension attack (LEA)
• SHA-1 Collision

RSA

Factorize modular

Tools

• FactorDB
• Integer factorization calculator
• YAFU Docker (Yet Another Factoring Utility)

Scripts

• factordb API - API for getting well-known prime in FactorDB
• Pollard's rho - Efficient factor N when (p - 1) is smooth
• William's p+1 - Efficient factor N when (p + 1) is smooth
• Fermat factorization - Fermat Factorization : when p, q are close.
• Factors a number using the Elliptic Curve Method

with low exponent

• Hastad's Broadcast -
• Bleichenbacher

with huge exponent

• Boneh and Durfee Attack
• Wiener Attack

Others attack

• Common Modular Attack

Factoring with Partial Information

• Partial Prime
• Partial Private Key

SSL certificate using python

from Crypto.PublicKey import RSA
key = RSA.importKey(open('publickey.pem','r').read())

Converting Using OpenSSL

Source : stackoverflow

Below commands allow you to convert certificates and keys to different formats to make them compatible with specific types of servers or software.

• Convert a PEM file to (.der, .crt)

openssl x509 -outform der -in certificate.pem -out certificate.der # DER
openssl x509 -outform der -in certificate.pem -out certificate.crt # CRT
openssl pkcs12 -export -out certificate.pfx -inkey privateKey.key -in certificate.crt -certfile CACert.crt # PFX, P12
openssl crl2pkcs7 -nocrl -certfile certificate.cer -out certificate.p7b -certfile CACert.cer # P7B

• Convert a DER file (.crt .cer .der) to PEM

openssl x509 -inform der -in certificate.crt -out certificate.pem 
openssl x509 -inform der -in certificate.cer -out certificate.pem 
openssl x509 -inform der -in certificate.der -out certificate.pem

• Convert a PKCS#12 file (.pfx .p12) containing a private key and certificates to PEM

openssl pkcs12 -in keyStore.pfx -out keyStore.pem -nodes

Cryptosystem

• Paillier
• SchmidtSamoa
• OkamotoUchiyama

NTRU

• NTRU with weak parameters

Mathmatics

• Find nth_roots on modulo p
• Chinese remainder theorem