Fermat question: a simple-non optimized version of Fermat's Factorization.

Adding fermat's factorization, which attempts to solve the equation
 N = a² -b²
This is not tested yet, I am running it now with some keys, but these things
take time™
Setting defualt port to the one written in /etc/services for https.

This way there's the possibility to just write
./qa -r google.com
without having to specify the port. Finally, adding some ore unittests to
test_cmmdline.test, shrinking the old ones and adding some new, requiring the
network.

XXX. using interface wlan0 as default, must be changed.
Specifying default arguments in the usage string.
Ignoring more files: generated from makefile, and with make check.

Ignore test files, except source ones, plus test-driver.
Ignore *.Po, apparently generated for tracking dependencies with make, and
stamp-h1, used for timestarmping configure.
Random tests: [cryptowars] keys.

Note: testing only key 3 for now, as I still have to which algorithms the other
are vulnerable.
[cryptowars] http://cryptowars2011.forumfree.it/?t=59997650
Removing optimization, use debug flags also for bignums when debugging.
Irrelevant changes to thesis's main.

Make ada's quote bigger, add kopimi logo instead of any stupid licensing advert.
Use assert() instead of brutally exiting with EXIT_FAILURE.
Merge branch 'feature/fermat'
Giving structure to the book: creating chapters, and filling the one about Fermat.

* Trying to import latex packages in alphabetical order
* Creating new wrappers for natural numbers, big-O notation
* Playing with the algorithmic packages, and writing pseudocode for euler's GCD
  and Fermat's factorization algorithm
* Creating a bunch of file that I am going to write in the next couple of days
* Stating to write fermat's chapter, and proceeding with the following schema:
   - introduction, peculiarities of the method and purpose
   - mathematicla basis
   - pseudocode, eventually describing what's optimizable from the calculator's
     pov
   - thoughts about parallelization: is it parallelizable? if so, what's the
     best approach i've found?
Removing dedica page. :(

Apparently is not good for a bachelor to dedicate the thesis to someone.
Fixing and testing Fermat's factorization implementation.

XXX. Note that it is being currently tested against small numbers. It shall be
checked even with something more appropriate, like twin/sexy primes with a lot
of digits.