RubenSomsen

SAS: Succinct Atomic Swap

Works today with [single signer ECDSA adaptor signatures][0], or with Schnorr + MuSig.
Other than the explanation below, there's also a diagram and a video.

 
Advantages:

• Requires merely two on-chain transactions for successful completion, as opposed to four
• Scriptless, and one of the chains doesn't need to support timelocks
• Can be used for efficient privacy swaps, e.g. [Payswap][1]

RealEnder

#!/usr/bin/python
import sys

if len(sys.argv) != 3 or len(sys.argv[1]) not in [12,17]:
    print 'TWC WPA-PSK generator (c) 2015, 2017 v0.2 by Alex Stanev <alex@stanev.org>'
    print 'Usage: '+sys.argv[0]+' [BSSID] [SSID]'
    exit(1)

# SSIDs
# Taken from https://www.exploit-db.com/docs/english/38082-compromising-isp-issued-802.11-wireless-cable-modem-networks-for-profit.pdf

hannob

Collecting some information about the extend and affected products and keys of the Infineon RSA vulnerability (ROCA).

• Official ROCA infos by the bug finders
• Test tool on Github
• Online test
• Information from Infineon
• CVE-2017-15361
• CERT/CC advisory

Estonian eID cards

truemongo

#!/usr/bin/python2
from random import randint, choice
from gmpy2 import is_prime # pip install gmpy2
import operator

### Code from ROCA
primes = [3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,
                       103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167]

prints = [6, 30, 126, 1026, 5658, 107286, 199410, 8388606, 536870910, 2147483646, 67109890, 2199023255550,

aparrish

scumjr

/*
 * CVE-2016-5195 dirtypoc
 *
 * This PoC is memory only and doesn't write anything on the filesystem.
 * /!\ Beware, it triggers a kernel crash a few minutes.
 *
 * gcc -Wall -o dirtycow-mem dirtycow-mem.c -ldl -lpthread
 */

#define _GNU_SOURCE

andymatuschak

A composable pattern for pure state machines with effects

State machines are everywhere in interactive systems, but they're rarely defined clearly and explicitly. Given some big blob of code including implicit state machines, which transitions are possible and under what conditions? What effects take place on what transitions?

There are existing design patterns for state machines, but all the patterns I've seen complect side effects with the structure of the state machine itself. Instances of these patterns are difficult to test without mocking, and they end up with more dependencies. Worse, the classic patterns compose poorly: hierarchical state machines are typically not straightforward extensions. The functional programming world has solutions, but they don't transpose neatly enough to be broadly usable in mainstream languages.

Here I present a composable pattern for pure state machiness with effects,

akurani

Create a Mac App for Zim Wiki

Source: Below are my step-by-step notes based on the instructions found here: https://github.com/jaap-karssenberg/zim-wiki/wiki/Install-on-OS-X-using-Platypus

Zim is a desktop wiki app written in Python and GTK. Learn more at: http://zim-wiki.org/

On Macs, you normally run the app by calling:

python zim.py

sivel

import paramiko

# provide host and port variables

t = paramiko.transport.Transport('%s:%s' % (host, port))
t.start_client()
key = t.get_remote_server_key()

if int(port) != 22:
    host = '[%s]:%s' % (host, port)

imneme

/*
 * Random-Number Utilities (randutil)
 *     Addresses common issues with C++11 random number generation.
 *     Makes good seeding easier, and makes using RNGs easy while retaining
 *     all the power.
 *
 * The MIT License (MIT)
 *
 * Copyright (c) 2015-2022 Melissa E. O'Neill
 *