Instantly share code, notes, and snippets.

• Sort options

# Aj Gappmarkajgappmark

View 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:
View 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
View bansheeserver.py
 #!/usr/bin/env python #Copyright (C) 2009 Nikitas Stamatopoulos # Modified by endolith@gmail.com 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.
View ruby-dbus-and-banshee.rb
 #!/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
View n_queens.py
 # 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
View mongoose-cheatsheet.md

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.

#### Install

``````\$ npm install mongoose --save
``````

#### Connect

``````const mongoose = require('mongoose');
``````
View gist:afbca177d1087013873c
 morseAlphabet ={ "A" : ".-", "B" : "-...", "C" : "-.-.", "D" : "-..", "E" : ".", "F" : "..-.", "G" : "--.", "H" : "....", "I" : "..",