Skip to content

Instantly share code, notes, and snippets.

View unprovable's full-sized avatar
💭
Rubber ducked...

Mark C. unprovable

💭
Rubber ducked...
View GitHub Profile
@unprovable
unprovable / Breaking_XOR_QC.ipynb
Created November 23, 2021 12:35
Gist for Breaking XOR with Grover on Quantum Computers
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@unprovable
unprovable / rand-test-matchdiff1.csv
Created October 8, 2017 12:25
Random Numbers from Arduino Nano ATmega168
16807 16807 MATCH
282475249 282475249 MATCH
1622650073 1622650073 MATCH
984943658 984943658 MATCH
1144108930 1144108930 MATCH
470211272 470211272 MATCH
101027544 101027544 MATCH
1457850878 1457850878 MATCH
1458777923 1458777923 MATCH
2007237709 2007237709 MATCH
@unprovable
unprovable / mbedtls_gcm_esp32_example.ino
Last active December 7, 2022 02:08
MBEDTLS AES GCM example
// This is shockingly bad code... but I threw it together in ~4mins...
// because I couldn't find one anywhere and needed it for some ESP32 experimentation...
// See the MBED reference for this:
// https://tls.mbed.org/api/gcm_8h.html
#include "mbedtls/gcm.h"
void setup() {
Serial.begin(115200);
mbedtls_gcm_context aes;
__author__ = "Mark Carney aka @LargeCardinal"
__copyright__ = "The Author"
__license__ = "MIT"
__status__ = "Proof of Concept - NOT FOR PRODUCTION"
import qiskit
from qiskit import IBMQ
import math
import sympy
@unprovable
unprovable / tikz-weihrauch-diagram.tex
Created August 2, 2019 12:30
LaTeX - TikZ Weihrauch Reducibility Commutative Diagram
\begin{center}
\begin{tikzpicture}[scale=2.5]
% reducing to
\node (1) at (0,1) {$\omega^\omega$};
\node (2) at (1.5,1) {$\textbf{U}$};
\node (3) at (0,0) {$\omega^\omega \rangle$};
\node (4) at (1.5,0) {$\textbf{V}$};
% reducing from
\node (A) at (-1.5,1) {$\omega^\omega$};
\node (B) at (-3,1) {$\textbf{X}$};
@unprovable
unprovable / rand-period-test.c
Created November 17, 2017 17:09
Random Periodicity Test Code for arduino (compiled in Arduino IDE)
long rand_i, rand_j, rand_k;
unsigned long i = 0, j = 0, k = 0;
void setup() {
// put your setup code here, to run once:
rand_i = random();
rand_j = random();
rand_k = random();
Serial.begin(9600);
while (!Serial) {}
@unprovable
unprovable / test.c
Created November 18, 2017 18:42
Arduino LCG play-set
#include <stdlib.h>
#include <stdio.h>
static int do_rand(unsigned long *ctx)
{
/*
* Compute x = (7^5 * x) mod (2^31 - 1)
* wihout overflowing 31 bits:
* (2^31 - 1) = 127773 * (7^5) + 2836
* From "Random number generators: good ones are hard to find",
@unprovable
unprovable / RC-EntropyPool-testcode.c
Last active October 11, 2017 14:31
RC Entropy Pool - test circuit and code
// RC Entropy source...
// experimental code - NOT FOR USE IN PRODUCTION!!
// --- not proven to be anywhere close to CSPRNG nor TruRNG ---
// by Mark C (@LargeCardinal)
//
// So, a 1.2 to 1nF ceramic cap and 100Ohm resistor are placed in
// parallel across the A6 and GND pins. A fly wire from Digital
// pin 2 then goes to the A6 rail, powering the cap of 1nF and 100Ohm res
//
// In practice, it seems we really don't need the capacitor... maybe
@unprovable
unprovable / screenlog.0
Created October 8, 2017 12:27
Screen log from arduino nano RNG test
Random number test...
16807
282475249
1622650073
984943658
1144108930
470211272
101027544
1457850878
1458777923
@unprovable
unprovable / nmap-scan.sh
Last active June 3, 2017 07:35
nmap scanning - for speed and accuracy
#!/bin/bash
# nmap scanning for speed and accuracy!
# nmap discovery and nmap scanning don't always play well together. As such,
# you should separate them out into distinct phases.
# first we do discovery...
# a ping sweep on an internal network will find what you need.
# FIXME make the script take command line args (I've always meant to do this...)
#first, a quick ping sweep, dumping live IP's into a file: