{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:15Z","timestamp":1759637775471},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265474"},{"type":"electronic","value":"9783540316848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506157_24","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T18:04:36Z","timestamp":1285524276000},"page":"280-292","source":"Crossref","is-referenced-by-count":29,"title":["Tunable Balancing of RSA"],"prefix":"10.1007","author":[{"given":"Steven D.","family":"Galbraith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Heneghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James F.","family":"McKee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 1\u201311. Springer, Heidelberg (1999)"},{"issue":"1","key":"24_CR2","first-page":"1","volume":"5","author":"D. Boneh","year":"2002","unstructured":"Boneh, D., Shacham, H.: Fast variants of RSA. CryptoBytes\u00a05(1), 1\u20139 (2002)","journal-title":"CryptoBytes"},{"key":"24_CR3","unstructured":"Ciet, M., Koeune, F., Laguillaumie, F., Quisquater, J.-J.: Short private exponent attacks on fast variants of RSA, Louvain technical report CG-2003\/4 (2003)"},{"key":"24_CR4","unstructured":"Collins, T., Hopkins, D., Langford, S., Sabin, M.: Public key cryptographic apparatus and method. US Patent (1997)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations and low exponent RSA vulnerabilities. J. Crypt.\u00a010, 233\u2013260 (1997)","journal-title":"J. Crypt."},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44670-2_3","volume-title":"Cryptography and Lattices","author":"D. Coppersmith","year":"2001","unstructured":"Coppersmith, D.: Finding small solutions to small degree polynomials. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 20\u201331. Springer, Heidelberg (2001)"},{"key":"24_CR7","first-page":"101","volume":"29","author":"A. Dujella","year":"2004","unstructured":"Dujella, A.: Continued fractions and RSA with small secret exponent. Tatra Mt. Math. Publ.\u00a029, 101\u2013112 (2004)","journal-title":"Tatra Mt. Math. Publ."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44448-3_2","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"G. Durfee","year":"2000","unstructured":"Durfee, G., Nguyen, P.: Cryptanalysis of the RSA scheme with short secret exponent from Asiacrypt 1999. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 14\u201329. Springer, Heidelberg (2000)"},{"key":"24_CR9","unstructured":"Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers, 5th edn., Oxford (1979)"},{"key":"24_CR10","unstructured":"Heneghan, C.: Ph.D. thesis (in preparation)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-36492-7_25","volume-title":"Selected Areas in Cryptography","author":"M.J. Hinek","year":"2003","unstructured":"Hinek, M.J., Low, M.K., Teske, E.: On some attacks on multi-prime RSA. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 385\u2013404. Springer, Heidelberg (2003)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Cryptography and Coding","author":"N.A. Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.A.: Finding small solutions of univariate modular equations revisited. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"24_CR13","unstructured":"Lim, C.H., Lee, P.J.: Sparse RSA secret keys and their generation. In: Proc. of 3rd Annual Workshop on Selected Areas in Cryptography (SAC 1996), pp. 117\u2013131 (1996)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45708-9_16","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. May","year":"2002","unstructured":"May, A.: Cryptanalysis of unbalanced RSA with small CRT-exponent. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 242\u2013256. Springer, Heidelberg (2002)"},{"key":"24_CR15","unstructured":"Paix\u00e3o, C.A.M.: An efficient variant of the RSA cryptosystem (2003) (preprint)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/10721064_32","volume-title":"Smart Card. Research and Applications","author":"G. Qiao","year":"2000","unstructured":"Qiao, G., Lam, K.-Y.: RSA signature algorithm for microcontroller implementation. In: Quisquater, J.-J., Schneier, B. (eds.) CARDIS 1998. LNCS, vol.\u00a01820, pp. 353\u2013356. Springer, Heidelberg (2000)"},{"issue":"237","key":"24_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D. Stinson","year":"2001","unstructured":"Stinson, D.: Some baby-step-giant-step algorithms for the low Hamming weight discrete logarithm problem. Math. Comp.\u00a071(237), 379\u2013391 (2001)","journal-title":"Math. Comp."},{"key":"24_CR18","unstructured":"Sun, H.-M., Wu, M.-E.: An Approach Towards Rebalanced RSA-CRT with Short Public Exponent, Cryptology ePrint Archive, 2005\/053"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-30580-4_14","volume-title":"Public Key Cryptography - PKC 2005","author":"H.-M. Sun","year":"2005","unstructured":"Sun, H.-M., Yang, C.-T.: RSA with balanced short exponents and its application to entity authentication. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 199\u2013215. Springer, Heidelberg (2005)"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-48000-6_13","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"H.-M. Sun","year":"1999","unstructured":"Sun, H.-M., Yang, W.-C., Laih, C.-S.: On the design of RSA with short secret exponent. In: Lam, K.Y., et al. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 150\u2013164. Springer, Heidelberg (1999)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo p\n                    k\n                  q. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 318\u2013326. Springer, Heidelberg (1998)"},{"key":"24_CR22","unstructured":"Turk, J.W.M.: Fast arithmetic operations on numbers and polynomials. In: Lenstra Jr., H.W., Tijdeman, R. (eds.) Computational methods in number theory, Part 1, Mathematical Centre Tracts 154, Amsterdam (1984)"},{"key":"24_CR23","first-page":"425","volume":"8","author":"E.R. Verheul","year":"1997","unstructured":"Verheul, E.R., van Tilborg, H.C.A.: Cryptanalysis of \u2018less short\u2019 RSA secret exponents, Applicable Algebra in Engineering. Communication and Computing\u00a08, 425\u2013435 (1997)","journal-title":"Communication and Computing"},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M. Wiener","year":"1990","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Th.\u00a036, 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Th."},{"key":"24_CR25","unstructured":"Wu, M.-E.: A Study of RSA with Small CRT-Exponent, Thesis of Master Degree, Department of Applied Mathematics, National Chiao Tung University, Taiwan (June 2004)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11506157_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:43:56Z","timestamp":1619505836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506157_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265474","9783540316848"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11506157_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}