daedalus

def SQUFOF(N):
    s = int( isqrt(N)+0.5)
    if (s**2 == N):
        return s
    for k in range(0,len(multiplier)):
        D = multiplier[k]*N
        Po = Pprev = P = isqrt(D)
        Qprev = 1
        Q = D - Po**2
        L = int(2 * isqrt(2*s))

daedalus

def miller_rabin(n, k):

    # Implementation uses the Miller-Rabin Primality Test
    # The optimal number of rounds for this test is 40
    # See http://stackoverflow.com/questions/6325576/how-many-iterations-of-rabin-miller-should-i-use-for-cryptographic-safe-primes
    # for justification

    # If number is even, it's a composite number

    if n == 2:

daedalus

#!/usr/bin/sage
# Factoring integers representing them with polynomials with order=bits
# Ex: 15 = 2^0 + 2^1 + 2^2 + 2^3 -> (2^0 + 2^1) * (2^0 + 2^2) -> 3*5
# It works well with mersenne primes but not with other composites.
# Author Dario Clavijo 2020
# GPlv3

import sys
sys.setrecursionlimit(100000)

daedalus

https://bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975
https://bitcointalk.org/index.php?topic=289795.msg3191346#msg3191346
https://bitcointalk.org/index.php?topic=289795.msg3200275#msg3200275
SECG 1.0: http://www.secg.org/SEC2-Ver-1.0.pdf

                                    ASCII "MinghuaQu"
1. secp112r1             00F50B028E|4D696E676875615175|290472783FB1
2. secp112r2             002757A111|4D696E676875615175|5316C05E0BD4
                               ----|                  |
3. secp128r1                 000E0D|4D696E676875615175|0CC03A4473D03679

daedalus

/***********************************************************************************************************
* Copyright (c) 2017, Jochen Hoenicke
* Modified by: jpyao78 https://bitcointalk.org/index.php?topic=1306983.msg51542451#msg51542451
* *
* Compile with:
* gcc -O2 -I secp256k1/src/ -I secp256k1/ break_short.c -lgmp
* gcc -O2 -I secp256k1/src/ -I secp256k1/ break-short.c -lgmp -lpthread -o break-short -mcmodel=large
***********************************************************************************************************/

#include "libsecp256k1-config.h"

daedalus

Netgear Signed TLS Cert Private Key Disclosure

Overview

There are at least two valid, signed TLS certificates that are bundled with publicly available Netgear device firmware.

These certificates are trusted by browsers on all platforms, but will surely be added to revocation lists shortly.

The firmware images that contained these certificates along with their private keys were publicly available for download through Netgear's support website, without authentication; thus anyone in the world could have retrieved these keys.

daedalus

#!/usr/bin/python

# Modified by Travis Lee
# Last Updated: 4/21/14
# Version 1.16
#
# -changed output to display text only instead of hexdump and made it easier to read
# -added option to specify number of times to connect to server (to get more data)
# -added option to send STARTTLS command for use with SMTP/POP/IMAP/FTP/etc... 
# -added option to specify an input file of multiple hosts, line delimited, with or without a port specified (host:port)

daedalus

#!/usr/bin/python

# Quick and dirty demonstration of CVE-2014-0160 by Jared Stafford (jspenguin@jspenguin.org)
# The author disclaims copyright to this source code.

import sys
import struct
import socket
import time
import select

daedalus

daedalus

From challenge-administrator@RSA.COM Sun Oct 12 09:36:34 1997
Received: from RSA.COM (chirality.rsa.com [192.80.211.33])
	by shire.ontko.com (8.8.5/8.8.5) with SMTP id JAA17505
	for ; Sun, 12 Oct 1997 09:36:33 -0500
Received: by RSA.COM 
	id AA20097; Sun, 12 Oct 97 06:29:28 PDT
Date: Sun, 12 Oct 97 06:29:28 PDT
Message-Id: <9710121329.AA20097@RSA.COM>
From: challenge-administrator@RSA.COM (RSA Factoring Challenge Administrator)
To: rayo@ontko.com