Symmetric and Asymmetric Encryption

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Symmetric and Asymmetric Encryption

Full text

Pdf (2.23 MB)

Source

ACM Computing Surveys (CSUR) archive
Volume 11 , Issue 4 (December 1979) table of contents

Pages: 305 - 330

Year of Publication: 1979

ISSN:0360-0300

Author

Gustavus J. Simmons

Sandia Laboratories, Albuquerque, New Mexico

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 37, Downloads (12 Months): 216, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/356789.356793 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ACME23	Acme commodtty and phrase code, Acme Code Co., San Francisco, CahL, 1923.
	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.
	ALBE41	ALBERT, A. A "Some mathematmal aspects of cryptography," presented at the AMS 382nd Meeting, Manhattan, Kans., Nov 22, 1941.
	BERL68	BERLEKAMP, E. R. Algebraw coding theory, McGraw-Hill, New York, 1968.
	BRAN79	BRANSTAD, D. "Hellman's data does not support hm conclusion," IEEE Spectrum 16, 7 (July 1979), 41
	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-123
	BRIG77	BRIGHT, H. S. "Cryptanalytic attack and defense, ciphertext-only, knownplamtext, chosen-plaintext," Cryptologm 1, 4 (Oct 1977), 366-370.
	DAVI79	DAVIDA, G. I. "Hellman's scheme breaks DES in its basic form," IEEE Spectrum 16, 7 (July 1979), 39.
	DEAV77	DEAVOURS, C. A. "Omcity points In cryptanalysm," Cryptologm 1, 1 (Jan 1977), 46-68
	DIFF76	DIFFIE, W, AND HELLMAN, M E. "New dLrections m cryptography," IEEE Trans Inform. Theory IT-22, 6 (Nov. 1976), 644- 654.
	DIFF77	DIFFIE, W., AND HELLMAN, M. E "Exhaustlve cryptanalysts of the NBS data encryptlon standard," Computer 10, 6 (June 1977), 74-84.
	EVAN74	Arthur Evans, Jr. , Edwin Weiss, A user authentication scheme not requiring secrecy in the computer, Communications of the ACM, v.17 n.8, p.437-442, Aug. 1974 [doi>10.1145/361082.361087]
	FEIS73	FEISTEL, H. "Cryptography and computer privacy," Scl. Am. 228, 5 (May 1973), 15-23.
	GAIN56	H. F. Gaines, Cryptanalysis a Study of Ciphers and Their Solutions, Dover Publications, Incorporated, 1939
	GAIT77	GAIT, J "A new nonlinear pseudorandora number generator," IEEE Trans Softw Eng. SE-3, 5 (Sept. 1977), 359-363
	GARD77	GARDNER, M. Mathematical games (section), Sct. Am. 237, 2 (Aug 1977), 120-124.
	GEFF73	GEFFE, P.R. "How to protect data with ciphers that are really hard to break," Electronws 46, 1 (Jan. 4, 1973), 99-101.
	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.
	GOLO67	Solomon W. Golomb , Soloman Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, 1981
	HART64	HART, G L The Beale papers, Roanoke Public Library, Roanoke, Va, 1964
	HELL78	HELLMAN, M. E "An overvmw of pubhc-key cryptography," IEEE Trans. Commun COM-16, 6 (Nov. 1978), 24-32.
	HELL79a	HELLMAN, M.E. "DES will be totally insecure within ten years," IEEE Spectrum 16, 7 (July 1979), 32-39.
	HELL79b	HELLMAN, M. E "The mathematms of public-key cryptography," Sct. Am. 241, 3 (Aug. 1979), 146-157.
	HERL78	HERLESTAM, T. "Critical remarks on some public-key cryptosystems," BIT 18 (1978), 493-496
	HILL29	HILL, L. S "Cryptography in an algebrmc alphabet," Am. Math. Monthly 36 (June-July 1929), 306-312.
	HILL31	HILL, L. S. "Concerning certain hnear transformation apparatus of cryptography," Am Math. Monthly 38 (March 1931), 135-154.
	HOFF77	HOFFMAN, L. J. Modern methods for computer securtty and prwacy, Prentme- Hall, Englewood Cliffs, N j., 1977
	HORO74	Ellis Horowitz , Sartaj Sahni, Computing Partitions with Applications to the Knapsack Problem, Journal of the ACM (JACM), v.21 n.2, p.277-292, April 1974 [doi>10.1145/321812.321823]
	KAHN66	KAHN, D. "Modern cryptology," Sct Am. 215 (July 1966), 38-46
	KAHN67	KAHN, D. The codebreakers, the story of secret writing, MacMillan, New York, 1967
	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.
	KULL76	KULLBACK, S Statistical methods m cryptanalysis, Aegean Park Press, Laguna Hills, Calif, 1976.
	LEMP79	Abraham Lempel, Cryptology in Transition, ACM Computing Surveys (CSUR), v.11 n.4, p.285-303, Dec. 1979 [doi>10.1145/356789.356792]
	LIPT78	LIPTON, S M., AND MATYAS, S. M "Making the digital slgnature legal--and safeguarded," Data Commun. 7, 2 (Feb 1978), 41-52.
	MACW77	MACWILLIAMS, F j., AND SLOANE, N. J. A. The Theory of error-correcting codes, Vols. I and II, North-Holland, New York, 1977.
	MART73	James Marting, Security, Accuracy, and Privacy in Computer Systems, Prentice Hall PTR, Upper Saddle River, NJ, 1973
	MASS69	MASSEY, J. L "Shlft-regmter synthesm and BCH decoding," IEEE Trans. Inform. Theory IT=15, 1 (Jan. 1969), 122- 127.
	MERK78a	Ralph C. Merkle, Secure communications over insecure channels, Communications of the ACM, v.21 n.4, p.294-299, April 1978 [doi>10.1145/359460.359473]
	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.
	MEYE72	MEYER, C, AND TUCHMAN, W. "Pseudo-random codes can be cracked," Electron Des. 23 (1972), 74-76.
	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.
	NEED78	Roger M. Needham , Michael D. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, v.21 n.12, p.993-999, Dec. 1978 [doi>10.1145/359657.359659]
	PETE72	PETERSON, W. W., AND WELDON, E. J Error correctmg codes, 2nd ed., MIT Press, Cambridge, Mass, 1972
	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- I10
	PURD74	George B. Purdy, A high security log-in procedure, Communications of the ACM, v.17 n.8, p.442-445, Aug. 1974 [doi>10.1145/361082.361089]
	RABI79	M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION, Massachusetts Institute of Technology, Cambridge, MA, 1979
	RIVE78	R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
	ROBE75	ROBERTS, R.W. Encryption algorithm{ for computer data encryption," (NBS) Fed. Reg. 40, 52 (March 17, 1975), 12134- 12139
	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.
	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.
	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.
	SHAN48	SHANNON, C. E "A mathematical theory of communication," Bell Syst. Tech. J. 27 (July 1948), 379-423; (Oct. 1948), 623-656.
	SHAN49	SHANNON, C.E. "Communication theory of secrecy systems," Bell Syst. Tech. J. 28 (Oct. 1949), 656-715.
	SHAP78	SHAPL~.'~, D. "The new unbreakable codes--will they put NSA out of buslnessg,'' The Washington Post, Outlook, sec BI, July 9, 1978
	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.
	SIMM79	SIMMONS, G.J. "Cryptology the mathematics of secure communicatmn," Math. Intell. 1, 4 (Jan 1979), 233-246
	SUGA79	SUGARMAN, R "On foihng computer crime," IEEE Spectrum 16, 7 (July 1979), 31-32.
	TAUS65	TAUSWORTHE, R. C "Random numbers generated by hnear recurrence modulo two," Math Comput. 19 (1965), 201-209
	TUCH79	TUCHMAN, W "Hellman presents no shortcut solutmns to the DES," IEEE Spectrum 16, 7 (July 1979), 40-41.
	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.
	VERN26	VERNAM, G. S. "Cipher printing telegraph systems for secret wire and racho telegraphm communications," J AIEE 45 (Feb. 1926), 109-115.
	WILK68	M. V. Wilkes, Time Sharing Computer Systems, Elsevier Science Inc., New York, NY, 1975
	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.
	WILL79b	WILLIAMS, H. C. A modtfwatmn of the RSA pubhc-key encryptmn procedure, Rep. 92, U. of Mamtoba Dep of Comput. Sci., 1979.
	ZIER68	ZIERLER, N., AND BRILLHART, J, "On primitive trinomials (rood 2)," Inform. Control 13 (1968), 541-554.
	ZIER69	ZIERLER, N., AND BRILLHART, J. "On prtmltlve trinomlals (rood 2, II)," Inform. Control 14 (1969), 566-569.

CITED BY 8

	Thomas Y. C. Woo , Simon S. Lam, Authentication for Distributed Systems, Computer, v.25 n.1, p.39-52, January 1992
	Selim G. Akl , Peter D. Taylor, Cryptographic solution to a problem of access control in a hierarchy, ACM Transactions on Computer Systems (TOCS), v.1 n.3, p.239-248, August 1983
	Dorothy E. Denning , Peter J. Denning, Data Security, ACM Computing Surveys (CSUR), v.11 n.3, p.227-249, Sept. 1979
	Bruce Jay Collings , G. Barry Hembree, Initializing generalized feedback shift register pseudorandom number generators, Journal of the ACM (JACM), v.33 n.4, p.706-711, Oct. 1986
	Jörg Rothe, Some facets of complexity theory and cryptography: A five-lecture tutorial, ACM Computing Surveys (CSUR), v.34 n.4, p.504-549, December 2002
	Gerald J. Popek , Charles S. Kline, Encryption and Secure Computer Networks, ACM Computing Surveys (CSUR), v.11 n.4, p.331-356, Dec. 1979
	Mikko T. Siponen , Harri Oinas-Kukkonen, A review of information security issues and respective research contributions, ACM SIGMIS Database, v.38 n.1, February 2007
	A. R. Prieto , J. G. Tomas, A model to order the encryption algorithms according to their quality, ACM SIGCOMM Computer Communication Review, v.17 n.3, p.30-47, July/Aug. 1987