huettenhain

#[derive(Copy,Clone,Debug)]
enum Operator {ADD, SUB, MUL, DIV}

#[derive(Copy,Clone,Debug)]
struct Operation {
    lhs: usize,
    rhs: usize,
    operator: Operator,
}

huettenhain

import idaapi
import ida_hexrays

def runonce(function):
    function._first_run = True
    def wrapper(*args, **kwargs):
        if function._first_run:
            function._first_run = False
            return function(*args, **kwargs)
    return wrapper

huettenhain

Keybase proof

I hereby claim:

• I am huettenhain on github.
• I am jesko (https://keybase.io/jesko) on keybase.
• I have a public key ASDAgH1zdcBxupLlc1BL2FZjXmLdK1Ptfxh58g0zzW55HQo

To claim this, I am signing this object:

huettenhain

# Test for weak AES keys when used in Galois Counter Mode with a block size
# of 128 bits, as explained in the paper "Cycling Attacks on GCM, GHASH and 
# Other Polynomial MACs and Hashes": https://eprint.iacr.org/2011/202.pdf

# This snippet requires the Crypto module:
# pip install Crypto

from Crypto.Cipher import AES
from Crypto.Util.number import bytes_to_long, long_to_bytes
from Crypto.Random import random