banksjeremy / kia Goto Github PK

Program a simulation of a network to see how it's affected by different clients.

har har.

write some tests for the binary module.

Update the crypto module to behave more consistently

• don't use .pem-style ASCII serialization, use binary (BIO) + base64 + JSON
• generate key ids based on the hash of the binary-encoded public key, not the current ASCII mess.

Write some simple tests for the asciiarmor module.

Implement the jsonrpc module. It should provide JSON-RPC client and server functionality (probably v1.0) running on Twisted's reactor.

crypto should search for the presence of M2Crypto, but if it's missing I should be able to use the openssl binary if it's available. Maybe eventually I can write a use my own C module in place of M2Crypto (I don't need to try to wrap everything).

I could start with subprocess.check_output(["openssl", "version"], stderr=subprocess.PIPE) and do something like ("10", "0") <= version.split(".") < ("11", "1").

man pages:

• openssl rsa
• openssl genrsa
• openssl rsautl
• openssl dgst if you want to support Python compiled without OpenSSL on a system with it

The readme (current version) describes three parts of dnesque.

Design

The dnesque software has three parts:

1. A client that maintains a database of known dnesque records and exchanges this information with other clients over a distributed network.
2. A dnesque-DNS bridge connected to a client, allowing systems and software to access dnesque records using the conventional DNS protocol.
3. A browser plugin connected to a client, allowing websites the communicate dnesque information directly (optional but recommended).

Get each of them working, to some extent.

Write some simple test cases for the crypto module.

Simple classes serializing to the "__type": "record" and "__type": "peer"listed in the readme.

The hashing module should contain functions for using hashes to generate data in different formats.

hashing.byte_generator(data, hash_type=hashlib.sha256) will be the basic function, generating an infinite sequence of bytes by repeatedly updating a hash with its current digest. Required higher-level functions:

• hashing.produce_bytes(data, bytes=32, hash_type=...) produces a binary.ByteArray of the specified number of randomly generated bytes.
• hashing.produce_bits(data, bits=256, hash_type=...) produces a binary.ByteArray of the specified number of randomly generated bits, padded with zeroes.
• hashing.produce_int(data, low, high, hash_type=...) produces a random integer in the range [low, high).

Write some test cases for the features of hashing.py.

Implement the bloomfilter module. It should provide a JSON-serializable class BloomFilter, doing its thing.