veorq

Not many papers share a critical view of the cryptography field, and when such papers are published they tend to be dismissed as "extreme opinions". But not talking about potential deficiencies is harmful for everyone on the long run, even if many actors' self-interest is the status quo (example: USSR). So here's a list of crypto papers and essays not purely technical, sometimes called "controverial", in arbitrary order (please send suggestions of missing entries):

Rogaway - The moral character of cryptographic work - https://web.cs.ucdavis.edu/~rogaway/papers/moral.pdf

Bernstein - A discretization attack - https://cr.yp.to/papers/categories-20200918.pdf

Bernstein - Non-uniform cracks in the concrete: the power of free precomputation -

veorq

Recommended reading for writers of research papers:

Knuth/Larrabee/Roberts http://tex.loria.fr/typographie/mathwriting.pdf

Bernstein http://cr.yp.to/writing.html

Goldreich http://www.wisdom.weizmann.ac.il/~oded/writing.html

Tao https://terrytao.wordpress.com/advice-on-writing-papers/

veorq

### Keybase proof

I hereby claim:

  * I am veorq on github.
  * I am veorq (https://keybase.io/veorq) on keybase.
  * I have a public key whose fingerprint is 552D 1262 0D6D D218 31C9  F8C0 BB9E 780D 4EC8 0BA4

To claim this, I am signing this object:

veorq

"""

This is an EXPERIMENTAL password hash with time and memory parameters,
such that the time parameter does not affect the memory required (but
does affect the number of memory accesses).

This was quickly designed, with no real test, so it's probably a silly
design and the code may be broken. Therefore, please:
- Do not use it to hash real passwords! 
- Attack it! (circumvent the time/memory requirements, find biases...)