Gustavus J. Simmons
- ACME23 Acme commodtty and phrase code, Acme Code Co., San Francisco, CahL, 1923.Google Scholar
- ADLE78 ADLEMAN, L. M, AND RIVEST, R L "The use of pubhc-key cryptography m commumcatlon system design," IEEE Trans Commun. COM-16, 6 (Nov 1978), 20-23.Google Scholar
- ALBE41 ALBERT, A. A "Some mathematmal aspects of cryptography," presented at the AMS 382nd Meeting, Manhattan, Kans., Nov 22, 1941.Google Scholar
- BERL68 BERLEKAMP, E. R. Algebraw coding theory, McGraw-Hill, New York, 1968.Google Scholar
- BRAN79 BRANSTAD, D. "Hellman's data does not support hm conclusion," IEEE Spectrum 16, 7 (July 1979), 41Google Scholar
- BRIG76 BRIGHT, H S, AND ENISON, R L. "Cryptography using modular software elements," m Proc AFIPS 1976 NCC, Vol. 45, AFIPS Press, Arhngton, Va, pp 113-123Google Scholar
- BRIG77 BRIGHT, H. S. "Cryptanalytic attack and defense, ciphertext-only, knownplamtext, chosen-plaintext," Cryptologm 1, 4 (Oct 1977), 366-370.Google Scholar
- DAVI79 DAVIDA, G. I. "Hellman's scheme breaks DES in its basic form," IEEE Spectrum 16, 7 (July 1979), 39.Google Scholar
- DEAV77 DEAVOURS, C. A. "Omcity points In cryptanalysm," Cryptologm 1, 1 (Jan 1977), 46-68Google Scholar
- DIFF76 DIFFIE, W, AND HELLMAN, M E. "New dLrections m cryptography," IEEE Trans Inform. Theory IT-22, 6 (Nov. 1976), 644- 654.Google Scholar
- DIFF77 DIFFIE, W., AND HELLMAN, M. E "Exhaustlve cryptanalysts of the NBS data encryptlon standard," Computer 10, 6 (June 1977), 74-84.Google Scholar
- EVAN74 EVANS, A, JR., AND KANTROWITZ, W. "A user authentication scheme not requmng secrecy in the computer," Commun ACM 17, 8 (Aug. 1974), 437-442. Google Scholar
- FEIS73 FEISTEL, H. "Cryptography and computer privacy," Scl. Am. 228, 5 (May 1973), 15-23.Google Scholar
- GAIN56 GAINES, H.F. Cryptanalys~s" a study of ctphers and their solutmn, Dover, New York, 1956. Google Scholar
- GAIT77 GAIT, J "A new nonlinear pseudorandora number generator," IEEE Trans Softw Eng. SE-3, 5 (Sept. 1977), 359-363Google Scholar
- GARD77 GARDNER, M. Mathematical games (section), Sct. Am. 237, 2 (Aug 1977), 120-124.Google Scholar
- GEFF73 GEFFE, P.R. "How to protect data with ciphers that are really hard to break," Electronws 46, 1 (Jan. 4, 1973), 99-101.Google Scholar
- GILB74 GILBERT, E. N., MACWILLIAMS, F J., AND SLOANE, N. J. A "Codes which detect deception," Bell Syst Tech. J. 53, 3 (March 1974), 405-423.Google Scholar
- GOLO67 GOLOMB, S W. Shtft register sequences, Holden-Day, San Francisco, Calif., 1967. Google Scholar
- HART64 HART, G L The Beale papers, Roanoke Public Library, Roanoke, Va, 1964Google Scholar
- HELL78 HELLMAN, M. E "An overvmw of pubhc-key cryptography," IEEE Trans. Commun COM-16, 6 (Nov. 1978), 24-32.Google Scholar
- HELL79a HELLMAN, M.E. "DES will be totally insecure within ten years," IEEE Spectrum 16, 7 (July 1979), 32-39.Google Scholar
- HELL79b HELLMAN, M. E "The mathematms of public-key cryptography," Sct. Am. 241, 3 (Aug. 1979), 146-157.Google Scholar
- HERL78 HERLESTAM, T. "Critical remarks on some public-key cryptosystems," BIT 18 (1978), 493-496Google Scholar
- HILL29 HILL, L. S "Cryptography in an algebrmc alphabet," Am. Math. Monthly 36 (June-July 1929), 306-312.Google Scholar
- HILL31 HILL, L. S. "Concerning certain hnear transformation apparatus of cryptography," Am Math. Monthly 38 (March 1931), 135-154.Google Scholar
- HOFF77 HOFFMAN, L. J. Modern methods for computer securtty and prwacy, Prentme- Hall, Englewood Cliffs, N j., 1977Google Scholar
- HORO74 HOROWITZ, E., AND SAHNI, S. "Computing partitmns w~th apphcatmns to the knapsack problem," J. ACM 21, 2 (April 1974), 277-292 Google Scholar
- KAHN66 KAHN, D. "Modern cryptology," Sct Am. 215 (July 1966), 38-46Google Scholar
- KAHN67 KAHN, D. The codebreakers, the story of secret writing, MacMillan, New York, 1967Google Scholar
- KARP72 KARP, R.M. "Reducibility among combinatorlal problems," in Complemty of computer computations, R. E Mdler and J. W Thatcher (Eds.), Plenum Press, New York, 1972, pp. 85-104.Google Scholar
- KULL76 KULLBACK, S Statistical methods m cryptanalysis, Aegean Park Press, Laguna Hills, Calif, 1976.Google Scholar
- LEMP79 LEMPEL, A "Cryptology m transmon" a survey," Comput. Surv. 11, 4 (Dec. 1979), 285-3O4. Google Scholar
- LIPT78 LIPTON, S M., AND MATYAS, S. M "Making the digital slgnature legal--and safeguarded," Data Commun. 7, 2 (Feb 1978), 41-52.Google Scholar
- MACW77 MACWILLIAMS, F j., AND SLOANE, N. J. A. The Theory of error-correcting codes, Vols. I and II, North-Holland, New York, 1977.Google Scholar
- MART73 MARTIN, J. Securtty, accuracy and privacy m computing systems, Prentice- Hall, Englewood Cliffs, N J., 1973. Google Scholar
- MASS69 MASSEY, J. L "Shlft-regmter synthesm and BCH decoding," IEEE Trans. Inform. Theory IT=15, 1 (Jan. 1969), 122- 127.Google Scholar
- MERK78a MERKLE, R C. "Secure communications over insecure channels," Commun. ACM 21, 4 (April 1978), 294-299. Google Scholar
- MERK78b MERKLE, R. C, AND HELLMAN, M. E "Hiding reformation and signatures in trapdoor knapsacks," IEEE Trans. inform Theory IT-24, 5 (Sept. 1978), 525- 530.Google Scholar
- MEYE72 MEYER, C, AND TUCHMAN, W. "Pseudo-random codes can be cracked," Electron Des. 23 (1972), 74-76.Google Scholar
- MORR77 MORRIS, R., SLOANE, N. J A., AND WY- NER, A. D "Assessment of the National Bureau of Standards proposed federal Data Encryptlon Standard," Cryptologla 1, 3 (July 1977), 281--291.Google Scholar
- NEED78 NEEDHAM, R. M., AND SCHROEDER, M. D. "Using encryptlon for authentication m large networks of computers," Commun. ACM 21, 12 (Dec. 1978), 993-999 Google Scholar
- PETE72 PETERSON, W. W., AND WELDON, E. J Error correctmg codes, 2nd ed., MIT Press, Cambridge, Mass, 1972Google Scholar
- POHL78 POHLIG, S C, AND HELLMAN, M E. "An improved algorithm for computing logarithms over GF(p) and its cryptographm slgmficance," IEEE Trans Inform Theory IT-24, 1 (Jan 1978), 106- I10Google Scholar
- PURD74 PURDY, G. B "A high security log-m procedure," Commun. ACM 17, 8 (Aug 1974), 442-445. Google Scholar
- RABI79 RARIN, M. O. D~g~tal~zed stgnatures and pubhc-key functmns as retractable as factor~zatton, Tech Rep MIT/LCS/ TR-212, MIT Lab Comput Scl., Cambridge, Mass, Jan 1979. Google Scholar
- RIVE78 RIVEST, R., SHAMIR, A., AND ADLEMAN, L. "A method for obtaining digital signatures and pubhc-key cryptosystems," Commun ACM 21, 2 (Feb 1978), 120- 126. Google Scholar
- ROBE75 ROBERTS, R.W. Encryption algorithm{ for computer data encryption," (NBS) Fed. Reg. 40, 52 (March 17, 1975), 12134- 12139Google Scholar
- SCHR79 SCHROEPPEL, R., AND SHAMIR, A. "A T.S2 -- O(2") Ume/space tradeoff for certain NP-complete problems," to appear as MIT Lab. Comput Sci Rep.Google Scholar
- SHAM78 SHAMIR, A., AN}) ZIPPEL, R. E On the security of the Merkle-Hellman cryptographw scheme, Tech. Rep. MIT/LCS/ TM-119, MIT Lab. Comput. Sci., Cambridge, Mass., Dec. 1978.Google Scholar
- SHAM79 SHAMIR, A., RIVEST, R. L., AND ADLE- MAN, L. M. Mental poker, Tech. Rep. MIT/LCS/TM-125, MIT Lab. Comput. Scl., Cambridge, Mass., Feb. 1979.Google Scholar
- SHAN48 SHANNON, C. E "A mathematical theory of communication," Bell Syst. Tech. J. 27 (July 1948), 379-423; (Oct. 1948), 623-656.Google Scholar
- SHAN49 SHANNON, C.E. "Communication theory of secrecy systems," Bell Syst. Tech. J. 28 (Oct. 1949), 656-715.Google Scholar
- SHAP78 SHAPL~.'~, D. "The new unbreakable codes--will they put NSA out of buslnessg,'' The Washington Post, Outlook, sec BI, July 9, 1978Google Scholar
- SIMM77 SIMMONS, G. J, AND NOaRIS, M. J. "Prehmmary comments on the M I.T. public-key cryptosystem," Cryptologta 1, 4 (Oct. 1977), 406-414.Google Scholar
- SIMM79 SIMMONS, G.J. "Cryptology the mathematics of secure communicatmn," Math. Intell. 1, 4 (Jan 1979), 233-246Google Scholar
- SUGA79 SUGARMAN, R "On foihng computer crime," IEEE Spectrum 16, 7 (July 1979), 31-32.Google Scholar
- TAUS65 TAUSWORTHE, R. C "Random numbers generated by hnear recurrence modulo two," Math Comput. 19 (1965), 201-209Google Scholar
- TUCH79 TUCHMAN, W "Hellman presents no shortcut solutmns to the DES," IEEE Spectrum 16, 7 (July 1979), 40-41.Google Scholar
- TUCK70 TUCKERMAN, B. A study of the Vlgendre-Vernam stngle and multtple loop enctpherzng systems, Rep. RC-2879 (#13538), IBM T. J. Watson Res. Ctr., Yorktown Heights, N.Y., May 14, 1970.Google Scholar
- VERN26 VERNAM, G. S. "Cipher printing telegraph systems for secret wire and racho telegraphm communications," J AIEE 45 (Feb. 1926), 109-115.Google Scholar
- WILK68 WILKES, M. V Time-sharing computer systems, Amemcan Elsevier, New York, 1968 Google Scholar
- WILL79a WILLIAMS, H. C., AND SCHMID, B. Some remarks concerning the M.LT. pubhckey cryptosystem, Rep. 91, U. of Manitoba Dep. of Comput Sci., May 22, 1979.Google Scholar
- WILL79b WILLIAMS, H. C. A modtfwatmn of the RSA pubhc-key encryptmn procedure, Rep. 92, U. of Mamtoba Dep of Comput. Sci., 1979.Google Scholar
- ZIER68 ZIERLER, N., AND BRILLHART, J, "On primitive trinomials (rood 2)," Inform. Control 13 (1968), 541-554.Google Scholar
- ZIER69 ZIERLER, N., AND BRILLHART, J. "On prtmltlve trinomlals (rood 2, II)," Inform. Control 14 (1969), 566-569.Google Scholar
Recommendations
Secure Integration of Asymmetric and Symmetric Encryption Schemes
This paper presents a generic conversion from weak asymmetric and symmetric encryption schemes to an asymmetric encryption scheme that is chosen-ciphertext secure in the random oracle model. Our conversion is the first generic transformation from an ...
Shorter identity-based encryption via asymmetric pairings
We present efficient identity-based encryption (IBE) under the symmetric external Diffie---Hellman (SXDH) assumption in bilinear groups; our scheme also achieves anonymity. In our IBE scheme, all parameters have constant numbers of group elements, and ...
Comments