Daniel "unicornFurnace" Crowley
Daniel "unicornFurnace" Crowley
Not all the functions in `cryptanalib` have help blurbs. Let's document all the functions and their expected return values and whatnot like so: ``` """ Get integer nth roots. :param...
If you cryptanalyze encrypted binary data, or a very large sample, the current output from FeatherDuster (dump the output on your terminal) is really not practical. Paging large amounts of...
Web-safe base64 (base64 but with an altered charset to avoid using URL metacharacters) is really common. Let's support it.
Batch GCD can check a large number of RSA moduli for common primes quickly. An example written in Sage is available on [FactHacks](http://facthacks.cr.yp.to/).
It was suggested to me that we should have a tutorial for using FD/CA where we walk through the first few sets of cryptopals with it. This is a nice...
It would be cool to have a function whose prototype is like: `rebuild_rsa_key(p=None, q=None, d=None, dp=None, dq=None, N=None, e=None, c=None, m=None)` It would step through a bunch of use cases...
More entropy tests can't hurt in improving our analysis function, right? ...right? ...I guess I'm not convinced...
Certain attack functions such as Vaudenay's padding oracle attack or the multi-byte XOR solver would benefit from some parallelization, but currently this isn't done.
There is an attack on ECB where a secret appended to user input, encrypted, and disclosed in encrypted form can be obtained in plaintext form by bytewise brute force with...
It would be amazingly useful to allow people to identify common substrings in some corpus of plaintexts. We have common words in English in the `frequency` section of Cryptanalib already,...