{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T19:50:41Z","timestamp":1614887441355},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[1974,8]]},"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.<\/jats:p>","DOI":"10.1145\/361082.361089","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:34:59Z","timestamp":1027769699000},"page":"442-445","source":"Crossref","is-referenced-by-count":85,"title":["A high security log-in procedure"],"prefix":"10.1145","volume":"17","author":[{"given":"George B.","family":"Purdy","sequence":"first","affiliation":[{"name":"Univ. of Illinois at Urbana-Champaign, Urbana"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_2","author":"Wilkes M.V.","year":"1968","volume-title":"American Elsevier"},{"key":"e_1_2_1_2_2","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","doi-asserted-by":"publisher"},{"key":"e_1_2_1_3_2","unstructured":"Purdy George B. Security of one-way ciphers. To be published. Purdy George B. Security of one-way ciphers. To be published."},{"key":"e_1_2_1_4_2","author":"Hardy G.H.","year":"1960","volume-title":"Oxford Press"},{"key":"e_1_2_1_5_2","author":"Knuth Donald E","year":"1969","volume-title":"Mass."},{"key":"e_1_2_1_6_2","unstructured":"Zimmer Horst G\n .\n \n \n \n Computational Problems Methods and Resuits in Algebraic Number Theory\n . Vol. \n 262\n of \n Lecture Notes in Mathematics\n . \n Springer-Verlag New York 1972 Ch. 2. 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."},{"key":"e_1_2_1_7_2","DOI":"10.1090\/S0025-5718-1970-0276200-X","doi-asserted-by":"publisher"},{"key":"e_1_2_1_8_2","unstructured":"Purdy George B. Division-free iterative schemes for polynomial root finding. To be published. Purdy George B. Division-free iterative schemes for polynomial root finding. To be published."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/361082.361089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T10:41:01Z","timestamp":1614768061000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,8]]},"references-count":8,"journal-issue":{"published-print":{"date-parts":[[1974,8]]},"issue":"8"},"alternative-id":["10.1145\/361082.361089"],"URL":"http:\/\/dx.doi.org\/10.1145\/361082.361089","relation":{"cites":[]},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":["General Computer Science"]}}