{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:05:00Z","timestamp":1742925900242,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540895978"},{"type":"electronic","value":"9783540895985"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89598-5_1","type":"book-chapter","created":{"date-parts":[[2008,11,22]],"date-time":"2008-11-22T03:40:04Z","timestamp":1227325204000},"page":"1-19","source":"Crossref","is-referenced-by-count":0,"title":["On Generating Elements of Orders Dividing p 2k \u00b1p k \u2009+\u20091"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Grze\u015bkowiak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, K., Saxena, N.: Primes is P. Ann. of Math.\u00a0160, 781\u2013793 (2004)","journal-title":"Ann. of Math."},{"key":"1_CR2","series-title":"Efficient Algorithms","volume-title":"Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. Efficient Algorithms, vol.\u00a0I. MIT Press, Cambridge (1996)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1090\/S0025-5718-1962-0148632-7","volume":"16","author":"P.T. Bateman","year":"1962","unstructured":"Bateman, P.T., Horn, R.A.: A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers. Math. Comp.\u00a016, 119\u2013132 (1962)","journal-title":"Math. Comp."},{"key":"1_CR4","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (1995)"},{"key":"1_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5927-3","volume-title":"Multiplicative Number Theory","author":"H. Davenport","year":"1980","unstructured":"Davenport, H.: Multiplicative Number Theory. Springer, New York (1980)"},{"issue":"7","key":"1_CR6","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1109\/18.796413","volume":"45","author":"G. Gong","year":"1999","unstructured":"Gong, G., Harn, L.: Public-Key Cryptosystems Based on Cubic Finite Field Extension. IEEE IT\u00a045(7), 2601\u20132605 (1999)","journal-title":"IEEE IT"},{"key":"1_CR7","unstructured":"Gong, G., Harn, L.: A New Approach on Public-key Distribution. ChinaCRYPT, pp. 50\u201355 (1998)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Cryptography and Coding: 8th International Conference Cirencester","author":"K. Giuliani","year":"2002","unstructured":"Giuliani, K., Gong, G.: Generating Large Instances of the Gong-Harn Cryptosytem. In: Proceedings of Cryptography and Coding: 8th International Conference Cirencester. LNCS, vol.\u00a02261. Springer, Heidelberg (2002)"},{"key":"1_CR9","unstructured":"Giuliani, K., Gong, G.: Analogues to the Gong-Harn and XTR Cryptosystem. Combinatorics and Optimization Research Report CORR 2003-34, University of Waterloo (2003)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1017\/S0305004100054657","volume":"83","author":"D.R. Heath-Brown","year":"1978","unstructured":"Heath-Brown, D.R.: Almost-primes in Arithmetic Progression and Short Intervals. Proc. London Proc. Cambridge Phil. Soc.\u00a083, 357\u2013375 (1978)","journal-title":"Proc. London Proc. Cambridge Phil. Soc."},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1112\/plms\/s3-64.2.265","volume":"64","author":"D.R. Heath-Brown","year":"1992","unstructured":"Heath-Brown, D.R.: Zero-free Regions for Dirichlet L-Functions and the Least Prime in an Arithmetic Progressions. Proc. London Math. Soc.\u00a064(3), 265\u2013338 (1992)","journal-title":"Proc. London Math. Soc."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.4064\/aa-24-5-435-459","volume":"24","author":"H. Iwaniec","year":"1974","unstructured":"Iwaniec, H.: Primes Represented by Quadratic Polynomials in Two Variables. Acta Arith.\u00a024, 435\u2013459 (1974)","journal-title":"Acta Arith."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verhuel, E.R.: The XTR Public Key System. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-44586-2_6","volume-title":"Proceedings of 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Fast Irreducibility and Subgroup Membership Testing in XTR. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 73\u201386. Springer, Heidelberg (2001)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"M\u00fcller, S.: On the Computation of Cube Roots Modulo p. In: High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams. Fields Institute Communications Series, vol.\u00a041 (2004)","DOI":"10.1090\/fic\/041\/23"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic Algorithm for Testing Primality. J. Number Theory\u00a012, 128\u2013138 (1980)","journal-title":"J. Number Theory"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-24847-7_2","volume-title":"Algorithmic Number Theory","author":"K. Rubin","year":"2004","unstructured":"Rubin, K., Silverberg, A.: Using Primitive Subgrups to Do More with Fewer Bits. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 18\u201341. Springer, Heidelberg (2004)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-45146-4_21","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"K. Rubin","year":"2003","unstructured":"Rubin, K., Silverberg, A.: Torus-based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 349\u2013365. Springer, Heidelberg (2003)"},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.4064\/aa-4-3-185-208","volume":"4","author":"A. Schinzel","year":"1956","unstructured":"Schinzel, A., Sierpi\u0144ski, W.: Sur Certaines Hypoth\u00e8ses Concernant Les Nombres Premiers. Acta Arith.\u00a04, 185\u2013208 (1956)","journal-title":"Acta Arith."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1090\/S0025-5718-1979-0528061-7","volume":"33","author":"S. Wagstaff","year":"1979","unstructured":"Wagstaff, S.: Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus. Math. Comp.\u00a033, 1073\u20131080 (1979)","journal-title":"Math. Comp."},{"key":"1_CR21","first-page":"475","volume":"61","author":"K. Williams","year":"1993","unstructured":"Williams, K., Hardy, K.: A Refinement of H. C. Williams\u2019 qth Root Algorithm. Math. Comp.\u00a061, 475\u2013483 (1993)","journal-title":"Math. Comp."},{"key":"1_CR22","unstructured":"http:\/\/www.cdc.informatik.tu-darmstadt.de\/TI\/LiDIA\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89598-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T22:49:24Z","timestamp":1551653364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89598-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540895978","9783540895985"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89598-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}