{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:39:46Z","timestamp":1775014786274,"version":"3.50.1"},"reference-count":12,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1134\/s0361768807020053","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:36:33Z","timestamp":1175787393000},"page":"80-86","source":"Crossref","is-referenced-by-count":3,"title":["Cunningham numbers in modular arithmetic"],"prefix":"10.1134","volume":"33","author":[{"given":"E. V.","family":"Zima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M.","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","reference":[{"key":"2005_CR1","unstructured":"Knuth, D.E., The Art of Computer Programming, vol. 2."},{"key":"2005_CR2","volume-title":"3rd Ed. Contemporary Mathematics Series","author":"J. Brillhart","year":"2002","unstructured":"Brillhart, J., Lehmer, D.H., Selfridge, J.L., Tuckerman, B., and Wagstaff, S.S., Jr., Factorizations of b\n                  \n                    n\n                   + 1, b = 2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers, 3rd Ed. Contemporary Mathematics Series, vol. 22, Providence: Am. Math. Soc., 2002."},{"key":"2005_CR3","unstructured":"Wagstaff, S., The Cunningham Project, http:\/\/www.cerias.purdue.edu\/homes\/ssw\/cun\/index.html."},{"issue":"4","key":"2005_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.2307\/2324525","volume":"97","author":"J.J. Cade","year":"1990","unstructured":"Cade, J.J., Kee-Wai, Lau, Pedersen, A., and Lossers, O.P., Problem E3288. Problems and Solutions, The Am. Math. Monthly, 1990, vol. 97, no. 4, pp. 344\u2013345.","journal-title":"The Am. Math. Monthly"},{"key":"2005_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21850-2","volume-title":"17 Lectures on Fermat Numbers: From Number Theory to Geometry","author":"M. K\u0159\u00ed\u017eek","year":"2001","unstructured":"K\u0159\u00ed\u017eek, M., Luca, F., and Somer, L., 17 Lectures on Fermat Numbers: From Number Theory to Geometry. New York: Springer, 2001."},{"key":"2005_CR6","volume-title":"Generalized Mersenne Numbers","author":"J.A. Solinas","year":"1999","unstructured":"Solinas, J.A., Generalized Mersenne Numbers. Waterloo: Faculty of Mathematics, Univ. of Waterloo, 1999."},{"key":"2005_CR7","unstructured":"Bernstein, D.J., Want Fast Bit Set\/Extract, Message to GMP Discussions List \u2329gmp-discuss@swox.com\u232a. April 17, 2002."},{"key":"2005_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/b102438","volume-title":"Algorithms for Computer Algebra","author":"K.O. Geddes","year":"1992","unstructured":"Geddes, K.O., Czapor, S.R., and Labahn, G., Algorithms for Computer Algebra (6th printing), Boston: Kluwer, 1992.","edition":"6th printing"},{"key":"2005_CR9","unstructured":"GNU MP 4.1, http:\/\/www.swox.com\/gmp\/manual\/."},{"key":"2005_CR10","unstructured":"Stewart, A. and Zima, E., Base-2 Cunningham Numbers in Modular Arithmetic, Technical Report, Wilfrid Laurier Univ., January 2006."},{"key":"2005_CR11","unstructured":"Szabo, N.S. and Tanaka, R.I., Residue Arithmetic and Its Applications to Computer Technology, McGraw-Hill, 1967."},{"issue":"170","key":"2005_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L., Modular Multiplication Without Trial Division, Math. Computation, 1985, vol. 44, no. 170, pp. 519\u2013521.","journal-title":"Math. Computation"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768807020053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768807020053","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768807020053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768807020053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:21:58Z","timestamp":1775010118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768807020053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["2005"],"URL":"https:\/\/doi.org\/10.1134\/s0361768807020053","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}