A high security log-in procedure

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A high security log-in procedure

Full text

Pdf (372 KB)

Source

Communications of the ACM archive
Volume 17 , Issue 8 (August 1974) table of contents

Pages: 442 - 445

Year of Publication: 1974

ISSN:0001-0782

Author

George B. Purdy

Univ. of Illinois at Urbana-Champaign, Urbana

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 46, Citation Count: 21

Additional Information:

abstract 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/361082.361089 What is a DOI?

ABSTRACT

The protection of time sharing systems from unauthorized users is often achieved by the use of passwords. By using one-way ciphers to code the passwords, the risks involved with storing the passwords in the computer can be avoided. We discuss the selection of a suitable one-way cipher and suggest that for this purpose polynomials over a prime modulus are superior to one-way ciphers derived from Shannon codes.

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.

	1	M. V. Wilkes, Time Sharing Computer Systems, Elsevier Science Inc., New York, NY, 1975
	2	Shannon, C.E. Communication theory of secrecy systems. Bell System Tech. J. 27, (1949), 656-69.
	3	Purdy, George B. Security of one-way ciphers. To be published.
	4	Hardy, G.H., and Wright, E.M. An Introduction to the Theory of Numbers. 4th ed., Oxford Press, New York, 1960.
	5	Knuth, Donald E. Art of Computer Programmhlg, Vol. 11. Addison Wesley, Reading, Mass., 1969.
	6	Zimmer, Horst G. Computational Problems, Methods, and Resuits in Algebraic Number Theory. Vol. 262 of Lecture Notes in Mathematics. Springer-Verlag, New York, 1972, Ch. 2.
	7	Berlekamp, E.R. Factoring polynomials over large finite fields. Mathematics of Computation 24, 111 (July 1970), 713-35.
	8	Purdy, George B. Division-free iterative schemes for polynomial root finding. To be published.

CITED BY 21

	C. Leung, Some Open Problems In Cryptography, Proceedings of the 1978 annual conference, p.471-475, December 04-06, 1978, Washington, D.C., United States
	Gregory R. Andrews, Partitions and principles for secure operating systems, Proceedings of the 1975 annual conference, p.177-180, January 1975
	H. D. Knoble , C. Forney, Jr. , F. S. Bader, An Efficient One-Way Enciphering Algorithm, ACM Transactions on Mathematical Software (TOMS), v.5 n.1, p.97-107, March 1979
	Robert P. Trueblood , H. Rex Hartson , Johannes J. Martin, MULTISAFE—a modular multiprocessing approach to secure database management, ACM Transactions on Database Systems (TODS), v.8 n.3, p.382-409, Sept. 1983
	R. S. Sandhu, On some cryptographic solutions for access control in a tree hierarchy, Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, p.405-410, December 1987, Dallas, Texas, United States
	ACM Forum: ACM name change, Communications of the ACM, v.19 n.12, p.705, Dec. 1976
	R. Impagliazzo , S. Rudich, Limits on the provable consequences of one-way permutations, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.44-61, May 14-17, 1989, Seattle, Washington, United States
	Chun-I Fan , Chin-Laung Lei, An unlinkably divisible and intention attachable ticket scheme for runoff elections, Journal of Network and Computer Applications, v.25 n.2, p.93-107, April 2002
	Cheng-Chi Lee , Min-Shiang Hwang , Li-Hua Li, A new key authentication scheme based on discrete logarithms, Applied Mathematics and Computation, v.139 n.2-3, p.343-349, 15 July 2003
	Jason Gait, Easy entry: the password encryption problem, ACM SIGOPS Operating Systems Review, v.12 n.3, p.54-60, July 1978
	H. Rex Hartson , David K. Hsiao, Full protection specifications in the semantic model for database protection languages, Proceedings of the annual conference, p.90-95, October 20-22, 1976, Houston, Texas, United States
	C. H. Meyer , S. M. Matyas, Some cryptographic principles of authentication in electronic funds transfer systems, ACM SIGCOMM Computer Communication Review, v.11 n.4, p.73-88, October 1981
	Gustavus J. Simmons, Symmetric and Asymmetric Encryption, ACM Computing Surveys (CSUR), v.11 n.4, p.305-330, Dec. 1979
	David Lipton, Logical authentication method, ACM SIGSAC Review, v.4 n.2, p.9-20, Spring 1986
	I-En Liao , Cheng-Chi Lee , Min-Shiang Hwang, A password authentication scheme over insecure networks, Journal of Computer and System Sciences, v.72 n.4, p.727-740, June 2006
	Y. G. Desmedt, Fighting entity authentication frauds by combining different technologies, BT Technology Journal, v.23 n.4, p.65-70, October 2005
	Marc Joye , Sung-Ming Yen, ID-based secret-key cryptography, ACM SIGOPS Operating Systems Review, v.32 n.4, p.33-39, Oct. 1998
	Norman R. Nielsen, Computers, security, and the audit function, Proceedings of the May 19-22, 1975, national computer conference and exposition, May 19-22, 1975, Anaheim, California
	Charles R. Young, A security policy for a profile-oriented operating system, Proceedings of the May 4-7, 1981, national computer conference, May 04-07, 1981, Chicago, Illinois
	Helen M. Wood, The use of passwords for controlling access to remote computer systems and services, Proceedings of the June 13-16, 1977, national computer conference, June 13-16, 1977, Dallas, Texas
	Whitfield Diffie , Martin E. Hellman, Multiuser cryptographic techniques, Proceedings of the June 7-10, 1976, national computer conference and exposition, June 07-10, 1976, New York, New York