G. R. Blakley Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects. [Citation Graph (0, 0)][DBLP] CRYPTO, 1984, pp:314-338 [Conf]
G. R. Blakley Information Theory Without the Finiteness Assumption, II: Unfolding the DES. [Citation Graph (0, 0)][DBLP] CRYPTO, 1985, pp:282-337 [Conf]
G. R. Blakley One Time Pads Are Key Safeguarding Schemes, Not Cryptosystems Fast Key Safeguarding Schemes (Threshold Schemes) Exist. [Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 1980, pp:108-113 [Conf]
G. R. Blakley Twenty Years of Cryptography in the Open Literature. [Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 1999, pp:106-107 [Conf]
G. R. Blakley, George B. Purdy A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1981, v:24, n:1, pp:71-91 [Journal]
G. R. Blakley A Computer Algorithm for Calculating the Product AB Modulo M. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1983, v:32, n:5, pp:497-500 [Journal]