1 |
David Kahn 1967. The Codebreakers. New York: Macmillan.
|
2 |
W. J. Hall 1969. The Gromark Cipher. The Cryptogram 35(2): 25.
|
3 |
Bryant Tuckerman 1970. A Study of the Vigenère-Vernam Single
and Multiloop Enciphering Sysytems. IBM Research Report RC-2879.
|
4 |
Carl H. Meyer, and Tuchman, Walter L. 1972. Pseudorandom
Codes can be Cracked. Electronic Design 23: 74-76.
|
5 |
James Reeds 1977. "Cracking" a Random Number Generator.
Cryptologia 1(1): 20-26.
|
6 |
Vera S. Pless 1977. Encryption Schemes for Computer
Confidentiality. IEEE Transactions on Computers 26: 1133-6.
|
7 |
Names withheld 1978. Encryption Challenge. Cryptologia
2(2): 168-171.
|
8 |
Frank Rubin 1978. Computer Methods for Decrypting Random
Stream Ciphers. Cryptologia 2(3): 215-231.
|
9 |
Frank Rubin 1979. Solving a Cipher Based on Multiple Random
Number Streams. Cryptologia 3(3): 155-7.
|
10 |
Frank Rubin 1981. Decrypting a Stream Cipher Based on J-K
Flip-flops. Cryptologia 5(1): 51-57.
|
11 |
Frank Rubin 1987. Foiling an Exhaustive Key-Search Attack.
Cryptologia 11(2): 102-7.
|
12 |
John M. Carroll and Lynda Robbins 1987. The Automated
Cryptanalysis of Polyalphabetic Ciphers. Cryptologia 11(4):
193-205.
|
13 |
Deane R. Blackman 1989. The Gromark Cipher, and Some
Relatives. Cryptologia 13(3): 273-282.
|
14 |
Ross J. Anderson 1991. Tree Functions and Cipher Systems.
Cryptologia 15(3): 194-202.
|