Search Results

Edit: There is more information about specifically Gelfond, and more generally cryptography in the Soviet Union in the page of Moscow State University Math Insitute here. Somewhat like the GCHQ discov …

If you define hill-climbing as using some kind of fitness function (KL Divergence, conditional probability, whatever) and exploring the function's value locally towards a maximum, the Bahl paper would …

This is the referenced article in Schneier: M.J.B. Robshaw, “MD2, MD4, MD5, SHA, and Other Hash Functions,” Technical Report TR–101, Version 3.0, RSA Laboratories, Jul 1994. I couldn't find a soft c …

To get 80 bit security for a Hash function, you need a hash with output bitlength 160 bits due to the birthday problem and collision resistance. Note that $160=5\times 32.$ So, the 80 bits was conven …

Chinese Standards: Identity Based Encryption: SM9 is a Chinese national cryptography standard for Identity Based Cryptography issued by the Chinese State Cryptographic Authority in March 2016 includin …

The modern term is interleaving, i.e., read in by row, read out by column. Let the plaintext be $[x(0),\ldots,x(mn-1)]$ where $m$ is the number of rows and $n$ is the number of columns, with padding i …

Excerpt from Simon Singh's book which talks about this Alternative History of Public Key Crypto is below. …

Lamport suggested the use of hash chaining in 1981 in Password Authentication with Insecure Communication, Communications of the ACM 24.11 (November 1981), pp 770-772. He cites 3 prior papers: Diff …

Konheim has a recent book, "Hashing in Computer Science" which focuses on the mathematics and history of non cryptographic hash functions but considers post 1973 cryptographic hash functions only. … Gustavus Simmons worked on authentication codes at Sandia Labs for many years, I looked up for some history in his book but there isn't anything pre 1970 for cryptographic checksums. …

Great question! I had read this years ago, and a quick look confirmed the inspiration: From Steven Levy's Crypto, a book on the modern development of civilian cryptography prime time “Here's somet …

In any cipher system the key is required to be generated by a uniformly random process, and be equidistributed, each bit equally likely to be $0$ vs $1$ as well as independent of other bits. Specifica …

Yes, Virginia/Virgil there was a world before bitcoin: There has long been real-world reasons for desiring batch verification, protecting privacy in a group, etc. Here is part of a 2008 publication av …