Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
History of cryptography and cryptanalysis. Questions that wish to ask about the history of cryptography should use this tag; if you're asking about historical ciphers you may also wish to use the classical-cipher tag.
2
votes
Who first applied hill climbing algorithms to cryptanalysis?
If one takes a loose definition of hillclimbing to mean making a sequence of small perturbations to form a sequence of incrementally improving solutions, early approaches to solving the Playfair ciphe …
1
vote
British War Office/ Military Intelligence Secret Code Use in the North Russian Allied Interv...
More detail is given in Behind the Engima - the authorised history of GCHQ Britain's secret cyber-intelligence agency. … Each codebook received a 'life history', including every message they covered, to ease damage assessment in case of compromise. …
5
votes
Encryption/Cryptographic techniques in financial documents (pre-1970s)
In the nineteenth century telegraphic communications between banks were typically secured by the case of codebooks. Here's a link to an example from the Bank of Montreal.
The Enigma machine was suppo …
2
votes
How did G.H. Hardy's work contribute to today's public-key cryptography?
log M$, which is an observation of Gauss proven by Hadamard and de la Vallée Poussin
The complexity of modular exponentiation being $(\log M)^k$ which is over 2000 years old (see Knuth vol. 2 for some history …
5
votes
Accepted
Does machine cryptography only consist of rotor machines?
I would argue that a great many cryptographic designs lie between the mechanical designs of 2 and the micro-electronic designs of 3. These designs are electronic in nature, but without the universal c …
5
votes
Accepted
Public-key authentication that is feasible by hand, before computers?
I could conceive of this in theory. If we look back to when the word "computer" referred to a job done by a human being as early as Renaissance times, computers were capable of lengthy and sophsticate …
6
votes
Accepted
What were Alan Turing and their team searching before doing KPA in the movie "The imitation ...
It's wrong to treat a Hollywood historical movie as a documentary. It's also wrong to think of Enigma as a single problem with a single solution. There were many variants of the Enigma machine which a …