{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:10:02Z","timestamp":1746144602110,"version":"3.40.4"},"publisher-location":"New Delhi","reference-count":54,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132217701"},{"type":"electronic","value":"9788132217718"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1771-8_70","type":"book-chapter","created":{"date-parts":[[2014,3,3]],"date-time":"2014-03-03T23:19:35Z","timestamp":1393888775000},"page":"805-819","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cryptanalytic Attacks and Countermeasures on RSA"],"prefix":"10.1007","author":[{"given":"Manish Kant","family":"Dubey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram","family":"Ratan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neelam","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod Kumar","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3\/4), 379\u2013423\/623\u2013656 (1948)","key":"70_CR1","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"70_CR2","volume-title":"An Introduction to Cryptography","author":"RA Mollin","year":"2010","unstructured":"Mollin, R.A.: An Introduction to Cryptography. Chapman & Hall, CRC Press (2010)"},{"issue":"6","key":"70_CR3","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffe","year":"1976","unstructured":"Diffe, W., Hellman, M.: New directions in cryptography. Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"Trans. Inf. Theory"},{"unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and receipts in trapdoor Knapsacks. In: International Symposium on Information Theory, Cornell University, Ithaca, New York (1977)","key":"70_CR4"},{"issue":"2","key":"70_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"unstructured":"Ellis, J.H.: The History of Non-secret Encryption. GCHQ-CESG Publication, London (1987)","key":"70_CR6"},{"unstructured":"Lenstra, A.K., James, P.H., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Ron was wrong, Whit is right. http:\/\/eprint.iacr.org\/2012\/064 (2012)","key":"70_CR7"},{"issue":"1","key":"70_CR8","first-page":"80","volume":"1","author":"H. Ali","year":"2004","unstructured":"Ali, H., Al-Salami, M.: Timing attack prospect for RSA cryptanalysis using genetic algorithm technique. Int. Arab J. Inf. Tech. 1(1), 80\u201384 (2004)","journal-title":"Int. Arab J. Inf. Tech."},{"doi-asserted-by":"crossref","unstructured":"Qiao, G., Lam, K.-Y.: RSA signature algorithm for microcontroller implementation. In: Proceedings of CARDIS\u201998, LNCS, vol. 1820, pp. 353\u2013356 (1998)","key":"70_CR9","DOI":"10.1007\/10721064_32"},{"doi-asserted-by":"crossref","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Proceedings of ASIACRYPT\u201906, LNCS, vol. 4284, pp. 267\u2013282 (2006)","key":"70_CR10","DOI":"10.1007\/11935230_18"},{"issue":"2","key":"70_CR11","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices Amer. Math. Soc. 46(2), 203\u2013213 (1999)","journal-title":"Notices Amer. Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"Jevons, W.S.: The Principles of Science: A Treatise on Logic and Scientific Method. Macmillan & Co., London (1874)","key":"70_CR12","DOI":"10.5962\/bhl.title.31805"},{"unstructured":"Crandall, R., Pomerance, C.: Prime Numbers: A Computational Perspective. 2nd edn. Springer-Verlag, New York (2005)","key":"70_CR13"},{"doi-asserted-by":"crossref","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Proceedings of ASIACRYPT\u201907, LNCS, vol. 4833, pp. 1\u201312 (2007)","key":"70_CR14","DOI":"10.1007\/978-3-540-76900-2_1"},{"doi-asserted-by":"crossref","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thome, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A.,te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. Advances in Cryptology, LNCS, vol. 6223, pp. 333\u2013350 (2010)","key":"70_CR15","DOI":"10.1007\/978-3-642-14623-7_18"},{"unstructured":"Bai, S., Thome, E. Zimmermann, P.: Factorisation of RSA-704 with CADO-NFS. crypto-eprint archive, 369 (2012)","key":"70_CR16"},{"doi-asserted-by":"crossref","unstructured":"Shamir, A. : Factoring large numbers with the TWINKLE device. CHES\u201999, LNCS, vol. 1717, pp. 2\u201312 (1999)","key":"70_CR17","DOI":"10.1007\/3-540-48059-5_2"},{"doi-asserted-by":"crossref","unstructured":"Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device. CRYPTO\u201903, LNCS, vol. 2729, pp. 1\u201326 (2003)","key":"70_CR18","DOI":"10.1007\/978-3-540-45146-4_1"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. EUROCRYPT\u201994, LNCS, vol. 950, pp. 92\u2013111 (1995)","key":"70_CR19","DOI":"10.1007\/BFb0053428"},{"issue":"3","key":"70_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"H Wiener","year":"1990","unstructured":"Wiener, H.: Cryptanalysis of short RSA secret exponents. Trans. Inf. Theory 36(3), 553\u2013558 (1990)","journal-title":"Trans. Inf. Theory"},{"issue":"4","key":"70_CR21","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N 0.292. Trans. Inf. Theory 46(4), 1339\u20131349 (2000)","journal-title":"292. Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Contini, S.,Wang, H., Pieprzyk, J.: Converse results to the Wiener attack on RSA. PKC\u201905, LNCS, vol. 3386, pp. 184\u2013198 (2005)","key":"70_CR22","DOI":"10.1007\/978-3-540-30580-4_13"},{"doi-asserted-by":"crossref","unstructured":"Jochemsz, E., May, A.: A polynomial time attack on RSA with private CRT-exponents smaller than N 0.73. Advances in Cryptology, LNCS, vol. 4622, pp. 395\u2013411 (2007)","key":"70_CR23","DOI":"10.1007\/978-3-540-74143-5_22"},{"doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D., May, A.: New attacks on RSA with small secret CRT-exponents. PKC\u201906, LNCS, vol. 3958, pp. 1\u201313 (2006)","key":"70_CR24","DOI":"10.1007\/11745853_1"},{"doi-asserted-by":"crossref","unstructured":"Nitaj, A.: A new attack on RSA and CRT-RSA. AFRICACRYPT\u201912, LNCS, vol. 7374, pp. 221\u2013233 (2012)","key":"70_CR25","DOI":"10.1007\/978-3-642-31410-0_14"},{"doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a small fraction of the private key bits. ASIACRYPT\u201998, LNCS, vol. 1514, pp. 25\u201334 (1998)","key":"70_CR26","DOI":"10.1007\/3-540-49649-1_3"},{"doi-asserted-by":"crossref","unstructured":"Blomer, J., May, A.: New partial key exposure attacks on RSA. CRYPTO\u201903, LNCS, vol. 2729, pp. 27\u201343 (2003)","key":"70_CR27","DOI":"10.1007\/978-3-540-45146-4_2"},{"doi-asserted-by":"crossref","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. EUROCRYPT\u201905, LNCS, vol. 3494, pp. 371\u2013386 (2005)","key":"70_CR28","DOI":"10.1007\/11426639_22"},{"doi-asserted-by":"crossref","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer equations revisited. EUROCRYPT\u201904, LNCS, vol. 3027, pp. 492\u2013505 (2004)","key":"70_CR29","DOI":"10.1007\/978-3-540-24676-3_29"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, S., Gupta, S., Maitra, S.:Partial key exposure attack on RSAC improvements for limited lattice dimensions. INDOCRYPT\u201910, LNCS, vol. 6498, pp. 2\u201316 (2010)","key":"70_CR30","DOI":"10.1007\/978-3-642-17401-8_2"},{"doi-asserted-by":"crossref","unstructured":"Joye, M., Lepoint, T.: Partial key exposure on RSA with private exponents larger than N. ISPEC\u201912, LNCS, vol. 7232, pp. 369\u2013380 (2012)","key":"70_CR31","DOI":"10.1007\/978-3-642-29101-2_25"},{"doi-asserted-by":"crossref","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. ASIACRYPT\u201906. LNCS, vol. 4284, pp. 267\u2013282 (2006)","key":"70_CR32","DOI":"10.1007\/11935230_18"},{"doi-asserted-by":"crossref","unstructured":"Howgrave, N., Graham: Finding small roots of univariate modular equations revisited. A cryptography and coding, LNCS, vol. 1355, pp. 131\u2013142 (1997)","key":"70_CR33","DOI":"10.1007\/BFb0024458"},{"unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. PhD thesis, University of Paderborn (2003)","key":"70_CR34"},{"key":"70_CR35","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J Hastad","year":"1988","unstructured":"Hastad, J.: Solving simultaneous modular equations of low degree. SIAM J. Comput. 17, 336\u2013341 (1988)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Bortz, A., Boneh, D., Nangy, P.: Exposing private information by timing web applications. In: Proceedings of the 16th International World Wide Web. Conference, Banff, Alberta, pp. 8\u201312 (2007)","key":"70_CR36","DOI":"10.1145\/1242572.1242656"},{"doi-asserted-by":"crossref","unstructured":"May, A., Ritzenhofen, M.: Solving systems of modular equations in one variable: how many RSA-encrypted messages does Eve need to know? PKC\u201908, LNCS, vol. 2146, pp. 37\u201346 (2008)","key":"70_CR37","DOI":"10.1007\/978-3-540-78440-1_3"},{"unstructured":"Franklin, M.K., Reiter, M.K.: A linear protocol failure for RSA with exponent three. Crypto\u201995 Rump Session (1995)","key":"70_CR38"},{"doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Franklin, M., Patarin, J., Reiter, M.: Low-exponent RSA with related messages. EUROCRYPT\u201996, LNCS, vol. 1070, pp. 1\u20139 (1996)","key":"70_CR39","DOI":"10.1007\/3-540-68339-9_1"},{"doi-asserted-by":"crossref","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R. J.: On the importance of checking cryptographic protocols for faults. EUROCRYPT\u201997, LNCS, vol. 1233, pp. 37\u201351 (1997)","key":"70_CR40","DOI":"10.1007\/3-540-69053-0_4"},{"unstructured":"Shamir, A.: Method and apparatus for protecting public key schemes from timing and fault attacks. U.S. Patent Number 5, 991,415 (1999)","key":"70_CR41"},{"unstructured":"Joye, M., Pailler, P., Yen, S.-M.: Secure evaluation of modular functions. In: International Workshop on Cryptology and Network Security, pp.227\u2013229 (2001)","key":"70_CR42"},{"doi-asserted-by":"crossref","unstructured":"Biham, E., Carmeli, Y., Shamir, A.: Bug attacks. CRYPTO\u201908, LNCS, vol. 5157, pp. 221\u2013240 (2008)","key":"70_CR43","DOI":"10.1007\/978-3-540-85174-5_13"},{"doi-asserted-by":"crossref","unstructured":"Pellegrini, A., Bertacco, V., Austin, T.: Fault based attack of RSA authentication. In: Proceedings of the Conference on Design, Automation and Test, pp. 855\u2013860 (2010)","key":"70_CR44","DOI":"10.1109\/DATE.2010.5456933"},{"doi-asserted-by":"crossref","unstructured":"Kocher, P.:Timing attacks on implementations of Diffe-Hellman, RSA, DSS and other systems. CRYPTO\u201996, LNCS, vol. 1109, pp. 104\u2013113 (1996)","key":"70_CR45","DOI":"10.1007\/3-540-68697-5_9"},{"doi-asserted-by":"crossref","unstructured":"Schindler, W.: A timing attack against RSA with the Chinese remainder theorem. CHES\u20192000, LNCS, vol. 1965, pp. 110\u2013125 (2000)","key":"70_CR46","DOI":"10.1007\/3-540-44499-8_8"},{"unstructured":"Brumley, D., Boneh, D.: Remote timing attacks are practical. In: Proceedings of the 12th Usenix Security Symposium, pp. 1-14 (2003)","key":"70_CR47"},{"doi-asserted-by":"crossref","unstructured":"Kocher, P., Jae, J., Jun, B.: Differential power analysis. CYRPTO\u201999, LNCS, vol. 1666, pp. 388\u2013397 (1999)","key":"70_CR48","DOI":"10.1007\/3-540-48405-1_25"},{"doi-asserted-by":"crossref","unstructured":"Finke, T., Gebhardt, M., Schindler, W.: New side-channel attack on RSA prime generation. CHES\u201909, LNCS, vol. 5747, pp. 141\u2013155 (2009)","key":"70_CR49","DOI":"10.1007\/978-3-642-04138-9_11"},{"doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS#1. CRYPTO\u201998, LNCS, vol. 1462, pp.1\u201312 (1998)","key":"70_CR50","DOI":"10.1007\/BFb0055716"},{"unstructured":"Bleichenbacher, D.: Forging some RSA signature on pencil and paper. Rump Session, CRYPTO\u201906 (2006)","key":"70_CR51"},{"key":"70_CR52","first-page":"122","volume":"16","author":"T Izu","year":"2008","unstructured":"Izu, T., Shimoyama, T., Takenaka, M.: Extending Bleichenbacher\u2019s forgery attack. J. Inf. Process. 16, 122\u2013129 (2008)","journal-title":"J. Inf. Process."},{"doi-asserted-by":"crossref","unstructured":"Jager, T., Schinzel, S., Somorovsky, J.: Bleichenbacher\u2019s attack strikes again: breaking PKCS# 1 v1.5 in XML encryption? ESORICS\u201912, LNCS, vol. 7459, pp.752\u2013769 (2012)","key":"70_CR53","DOI":"10.1007\/978-3-642-33167-1_43"},{"doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. FOCS\u201994, pp. 124\u2013134 (1994)","key":"70_CR54","DOI":"10.1109\/SFCS.1994.365700"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1771-8_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T23:51:28Z","timestamp":1746143488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1771-8_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132217701","9788132217718"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1771-8_70","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"4 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}