Aj Gappmark ajgappmark

ajgappmark / gist:afbca177d1087013873c

Created March 6, 2016 08:56 — forked from ebuckley/gist:1842461

python code to encode/decode morse code

ajgappmark / mongoose-cheatsheet.md

Created February 25, 2016 01:26 — forked from subfuzion/mongoose-cheatsheet.md

mongoose cheatsheet

Definitely not comprehensive. This is meant to be a basic memory aid with links to get more details. I'll add to it over time.

$ npm install mongoose --save

const mongoose = require('mongoose');

ajgappmark / n_queens.py

Created October 9, 2015 08:13 — forked from teh/n_queens.py

Solve n-queens with pycosat.

	# Solve n-queens problem with picosat
	import pycosat
	import numpy
	import itertools

	def get_cnf(N):
	cnf = []

	# * convert to object because pycosat expects 'int's
	# * add 1 because 0 is reserved in pycosat

ajgappmark / ruby-dbus-and-banshee.rb

Last active September 12, 2015 12:23 — forked from markoa/ruby-dbus-and-banshee.rb

ruby-dbus play with Banshee

	#!/usr/bin/env ruby

	require 'dbus'

	bus = DBus::SessionBus.instance

	banshee_service = bus.service("org.bansheeproject.Banshee")

	banshee = banshee_service.object("/org/bansheeproject/Banshee/PlayerEngine")
	puts banshee.introspect

ajgappmark / bansheeserver.py

Last active August 29, 2015 14:18 — forked from endolith/bansheeserver.py

	#!/usr/bin/env python

	#Copyright (C) 2009 Nikitas Stamatopoulos
	# Modified by [email protected] 2009-10

	#This program is free software: you can redistribute it and/or modify
	#it under the terms of the GNU General Public License as published by
	#the Free Software Foundation, either version 3 of the License, or
	#(at your option) any later version.

ajgappmark / goldwasser_micali.py

Last active August 29, 2015 14:17 — forked from brunoro/goldwasser_micali.py

	#!/usr/bin/env python
	# encoding: utf8
	from unicodedata import normalize
	from string import ascii_letters
	from random import randint

	# Miller-Rabin probabilistic primality test (HAC 4.24)
	# returns True if n is a prime number
	# n is the number to be tested
	# t is the security parameter

ajgappmark / ecc.py

Last active August 29, 2015 14:16 — forked from bellbind/ecc.py

	# Basics of Elliptic Curve Cryptography implementation on Python
	import collections


	def inv(n, q):
	"""div on PN modulo a/b mod q as a * inv(b, q) mod q
	>>> assert n * inv(n, q) % q == 1
	"""
	for i in range(q):
	if (n * i) % q == 1: