{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:52:48Z","timestamp":1764996768890},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01398010","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T19:56:49Z","timestamp":1112471809000},"page":"117-131","source":"Crossref","is-referenced-by-count":18,"title":["A public-key cryptosystem utilizing cyclotomic fields"],"prefix":"10.1007","volume":"6","author":[{"given":"Renate","family":"Scheidler","sequence":"first","affiliation":[]},{"given":"Hugh C.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"No. 191","key":"CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E. Bach","year":"1990","unstructured":"E. Bach, Explicit bounds for primality testing and related problems,Math. Comp., Vol. 55, No. 191 (1990) pp. 355?380.","journal-title":"Math. Comp."},{"issue":"No. 1","key":"CR2","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0022-314X(87)90092-8","volume":"26","author":"J. Buchmann","year":"1987","unstructured":"J. Buchmann, On the computation of units and class numbers by a generalization of Lagrange's algorithm,J. Number Theory, Vol. 26, No. 1 (1987) pp. 8?30.","journal-title":"J. Number Theory"},{"issue":"No. 177","key":"CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1090\/S0025-5718-1987-0866098-3","volume":"48","author":"J. Buchmann","year":"1987","unstructured":"J. Buchmann and H. C. Williams, On principal ideal testing in totally complex quartic fields and the determination of certain cyclotomic constants,Math. Comp., Vol. 48, No. 177 (1987) pp. 55?66.","journal-title":"Math. Comp."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0747-7171(87)80049-4","volume":"4","author":"J. Buchmann","year":"1987","unstructured":"J. Buchmann and H. C. Williams, On principal ideal testing in algebraic number fields.J. Symb. Comp., Vol. 4 (1987) pp. 11?19.","journal-title":"J. Symb. Comp."},{"key":"CR5","volume-title":"Collected Papers","author":"E. E. Kummer","year":"1975","unstructured":"E. E. Kummer,Collected Papers, Vol. 1, Springer, Berlin (1975)."},{"key":"CR6","volume-title":"Vorlesungen \u00fcber Zahlentheorie","author":"E. Landau","year":"1969","unstructured":"E. Landau,Vorlesungen \u00fcber Zahlentheorie, Chelsea, New York (1969)."},{"issue":"No. 10","key":"CR7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1112\/jlms\/s2-10.4.457","volume":"2","author":"H. W. Lenstra Jr.","year":"1975","unstructured":"H. W. Lenstra, Jr., Euclid's algorithm in cyclotomic fields,J. Lond. Math. Soc. Vol. 2, No. 10 (1975) pp. 457?465.","journal-title":"J. Lond. Math. Soc."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF03024378","volume":"2","author":"H. W. Lenstra Jr.","year":"1979\/80","unstructured":"H. W. Lenstra, Jr., Euclidean number fields I,Math. Intelligencer, Vol. 2 (1979\/80) pp. 6?15.","journal-title":"Math. Intelligencer"},{"issue":"No. 2","key":"CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00193566","volume":"5","author":"J. Loxton","year":"1992","unstructured":"J. Loxton, D. S. P. Khoo, G. J. Bird, and J. Seberry, A cubic residue code equivalent to factorization,J. of Cryptology, Vol. 5, No. 2 (1992) pp. 139?150.","journal-title":"J. of Cryptology"},{"key":"CR10","first-page":"248","volume":"286\/287","author":"J. M. Masley","year":"1976","unstructured":"J. M. Masley and H. L. Montgomery, Cyclotomic fields with unique factorization,J. Reine Angew. Math., Vol. 286\/287 (1976) pp. 248?256.","journal-title":"J. Reine Angew. Math."},{"key":"CR11","unstructured":"R. G. McKenzie,The Ring of Cyclotomic Integers of Modulus Thirteen Is Norm-Euclidean, Ph.D. Dissertation, Department of Mathematics, Michigan State University (1988)."},{"key":"CR12","unstructured":"M. O. Rabin, Digitized Signatures and Public-Key Functions as Intractable as Factorization, M.I.T. Lab for Computer Science, Tech. Rep. LCS\/TR-212 (1979)."},{"key":"CR13","volume-title":"Report on the Theory of Numbers","author":"H. J. S. Smith","year":"1965","unstructured":"H. J. S. Smith,Report on the Theory of Numbers, Chelsea, New York (1965)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01450916","volume":"66","author":"J. Uspensky","year":"1909","unstructured":"J. Uspensky, Note sur les nombres entiers d\u00e9pendant d'une racine cinqui\u00e8me de l'unit\u00e9,Math. Ann., Vol. 66 (1909) pp. 109?112.","journal-title":"Math. Ann."},{"issue":"No. 6","key":"CR15","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"26","author":"H. C. Williams","year":"1980","unstructured":"H. C. Williams, A modification of the RSA public-key encryption procedure,IEEE Trans. Inf. Theory, Vol. IT-26, No. 6 (1980) pp. 726?729.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"CR16","series-title":"Advances in Cryptology?CRYPTO '85 Proceedings","first-page":"358","volume-title":"An M3 public-key encryption scheme","author":"H. C. Williams","year":"1986","unstructured":"H. C. Williams, An M3 public-key encryption scheme,Advances in Cryptology?CRYPTO '85 Proceedings, Springer, Berlin (1986), pp. 358?368."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1515\/crll.1976.288.207","volume":"288","author":"K. S. Williams","year":"1976","unstructured":"K. S. Williams, Explicit forms of Kummer's complementary theorems to his law of quintic reciprocity,J. Reine Angew. Math., Vol. 288 (1976) pp. 207?210.","journal-title":"J. Reine Angew. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01398010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01398010\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01398010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T16:51:48Z","timestamp":1556815908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01398010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01398010"],"URL":"https:\/\/doi.org\/10.1007\/bf01398010","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}