Alexandre Lacheze alexstrat

alexstrat / gist:2225368

Created March 28, 2012 10:48

	<body xmlns="http://jabber.org/protocol/httpbind">
	<iq from="[email protected]/9107" id="gV" to="[email protected]/kadoh" type="result" xmlns="jabber:client">
	<query xmlns="jabber:iq:rpc">
	<methodResponse>
	<params>
	<param>
	<value>
	<struct>
	<member>
	<name>nodes</name>

alexstrat / gist:1739988

Created February 4, 2012 20:30


	/* gcc -o bruteforce1 bruteforce1.c */
	#include <stdlib.h>
	#define BUFFER_LEN 301
	#define OVERFLOW 8

	int main()
	{
	/*
	char shellcode[] = "\xeb\x1f\x5e\x89\x76\x08\x31\xc0\x88\x46\x07"

alexstrat / IterativeFindV2

Created January 4, 2012 20:11

Iterative find process for Kademlia (v2)

	# in this algorithm, all notions of sorting, close or distance
	# are relative to the XOR distance with the target ID
	# as defined in the Kademlia spec

	- iterative find (target ID) ->
	# initializations
	HeardOf <- XOR Sorted Array of peers
	initialized with the 50 (or less) closest peers we know from the our routing table
	Reached <- XOR Sorted Array of peers
	Queried <- Array of peers

alexstrat / gist:1478859

Created December 14, 2011 22:29

	<message from='[email protected]'
	to='[email protected]'
	xml:lang='en'>
	<body>Art thou not Romeo, and a Montague?</body>
	</message>