math

Documentation

Index

• func DoRSAencrypt(block []byte, key *rsa.PublicKey) []byte
• func MakeGAB(g int32, g_a, dh_prime *big.Int) (b, g_b, g_ab *big.Int)
• func SplitPQ(pq *big.Int) (p1, p2 *big.Int)
• func Xor(dst, src []byte)

Functions

func DoRSAencrypt

func DoRSAencrypt(block []byte, key *rsa.PublicKey) []byte

DoRSAencrypt encrypts exactly 1 message block of size 255 with the public key. Specific algorithm for mtproto, because the documentation does not indicate is this encryption working by OAEP spec or any else

func MakeGAB

func MakeGAB(g int32, g_a, dh_prime *big.Int) (b, g_b, g_ab *big.Int)

func SplitPQ

func SplitPQ(pq *big.Int) (p1, p2 *big.Int)

SplitPQ splits a number into two primes, while p1 < p2 Part of diffie hellman's algorithm, how it works - no idea

func Xor

func Xor(dst, src []byte)