{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:50:20Z","timestamp":1791150620617,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540432241","type":"print"},{"value":"9783540457602","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45760-7_2","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:11:12Z","timestamp":1184962272000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Observability Analysis - Detecting When Improved Cryptosystems Fail -"],"prefix":"10.1007","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quisquater","family":"Jean-Jacques","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yen","family":"Sung-Ming","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"2_CR1","unstructured":"RSA Laboratories. PKCS #1 v2.0: RSA cryptography standard, October 1, 1998. Available at http:\/\/www.rsasecurity.com\/rsalabs\/pkcs\/ ."},{"key":"2_CR2","unstructured":"RSA Laboratories. PKCS #1 v2.1: RSA cryptography standard, Draft 2, January 5, 2001. Available at http:\/\/www.rsasecurity.com\/rsalabs\/pkcs\/ ."},{"key":"2_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0028164","volume-title":"Security Protocols","author":"F. Bao","year":"1998","unstructured":"F. Bao, R. Deng, Y. Han, A. Jeng, A. D. Narasimhalu, and T.-H. Ngair. Breaking public key cryptosystems on tamper resistant devices in the presence of transient faults. In B. Christianson, B. Crispo, M. Lomas, and M. Roe, eds, Security Protocols, vol. 1361 of Lecture Notes in Computer Science, pp. 115\u2013124, Springer-Verlag, 1998."},{"key":"2_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology-EUROCRYPT\u201994","author":"M. Bellare","year":"1995","unstructured":"Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption \u2014 How to encrypt with RSA. In A. De Santis, ed., Advances in Cryptology-EUROCRYPT\u201994, vol. 950 of Lecture Notes in Computer Science, pp. 92\u2013111, Springer-Verlag, 1995."},{"key":"2_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055716","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Daniel Bleichenbacher. A chosen ciphertext attack against protocols based on the RSA encryption standard RSA PKCS #1. In H. Krawczyk, ed., Advances in Cryptology-CRYPTO\u201998, vol. 1462 of Lecture Notes in Computer Science, pp. 1\u201312, Springer-Verlag, 1998."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Daniel Bleichenbacher, Burt Kaliski, and Jessica Staddon. Recent results on PKCS #1: RSA encryption standard. RSA Laboratories\u2019 Bulletin, no. 7, June 1998.","DOI":"10.1007\/BFb0055716"},{"issue":"2","key":"2_CR7","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Dan Boneh. Twenty years of attacks on the RSA cryptosystem. Notices of the AMS, 46(2):203\u2013213, 1999.","journal-title":"Notices of the AMS"},{"key":"2_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology-EUROCRYPT\u201997","author":"D. Boneh","year":"1997","unstructured":"Dan Boneh, Richard A. DeMillo and Richard J. Lipton. On the importance of checking cryptographic protocols for faults. In W. Fumy, ed., Advances in Cryptology-EUROCRYPT\u201997, vol. 1233 of Lecture Notes in Computer Science, pp. 37\u201351, Springer-Verlag, 1997."},{"key":"2_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-44448-3_3","volume-title":"Advances in Cryptology-ASIACRYPT2000","author":"D. Boneh","year":"2000","unstructured":"Dan Boneh, Antoine Joux, and Phong Q. Nguyen. Why Textbook El Gamal and RSA encryption are insecure. In T. Okamoto, ed., Advances in Cryptology-ASIACRYPT2000, vol. 1976 of Lecture Notes in Computer Science, pp. 30\u201343, Springer-Verlag, 2000."},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Don Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology, 10(4):233\u2013260, 1997.","journal-title":"Journal of Cryptology"},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. How to enhance the security of public-key encryption at minimum cost. In H. Imai and Y. Zheng, eds., Public Key Cryptography, vol. 1560 of Lecture Notes in Computer Science, pp. 53\u201368, Springer-Verlag, 1999."},{"key":"2_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO2001","author":"E. Fujisaki","year":"2001","unstructured":"Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, and Jacques Stern. RSA-OAEP is secure under the RSA assumption. In J. Kilian, ed., Advances in Cryptology-CRYPTO2001, vol. 2139 of Lecture Notes in Computer Science, Springer-Verlag, 2001."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0020-0190(98)00160-4","volume":"68","author":"H. Gilbert","year":"1998","unstructured":"Henri Gilbert, Dipankar Gupta, Andrew Odlyzko, and Jean-Jacques Quisquater. Attacks on Shamir\u2019s \u2018RSA for paranoids\u2019. Information Processing Letters, 68:197\u2013199, 1998.","journal-title":"Information Processing Letters"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s001459900055","volume":"12","author":"M. Joye","year":"1999","unstructured":"Marc Joye, Arjen K. Lenstra, and Jean-Jacques Quisquater. Chinese remaindering cryptosystems in the presence of faults. Journal of Cryptology, 12(4):241\u2013245, 1999.","journal-title":"Journal of Cryptology"},{"key":"2_CR16","unstructured":"Marc Joye, Pascal Paillier, and Sung-Ming Yen. Secure evaluation of modular functions. In R.J. Hwang and C.K. Wu, eds., Proc. of the 2001 International Workshop on Cryptology and Network Security (CNS 2001), pp. 227\u2013229, Taipei, Taiwan, September 26\u201328, 2001."},{"key":"2_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BFb0024460","volume-title":"Cryptography and Coding","author":"M. Joye","year":"1997","unstructured":"Marc Joye, Jean-Jacques Quisquater, Feng Bao, and Robert H. Deng. RSA-type signatures in the presence of transient faults. In M. Darnell, ed., Cryptography and Coding, vol. 1355 of Lecture Notes in Computer Science, pp. 155\u2013160, Springer-Verlag, 1997."},{"key":"2_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-45353-9_16","volume-title":"Topics in Cryptology-CT-RSA 2001","author":"M. Joye","year":"2001","unstructured":"Marc Joye, Jean-Jacques Quisquater, and Moti Yung. On the power of misbehaving adversaries and security analysis of the original EPOC. In D. Naccache, ed., Topics in Cryptology-CT-RSA 2001, vol. 2020 of Lecture Notes in Computer Science, pp. 208\u2013222, Springer-Verlag, 2001."},{"key":"2_CR19","unstructured":"Burton S. Kaliski Jr. Comments on a new attack on cryptographic devices. RSA Laboratories Technical Note, October 23, 1996."},{"key":"2_CR20","unstructured":"\u00c7etin K. Ko\u00e7. RSA hardware implementation. Technical Report TR 801, RSA Laboratories, April 1996."},{"key":"2_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"P. Kocher","year":"1999","unstructured":"Paul Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In M. Wiener, editor, Advances in Cryptology-CRYPTO\u201999, vol. 1666 of Lecture Notes in Computer Science, pp. 388\u2013397, Springer-Verlag, 1999."},{"key":"2_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-44647-8_14","volume-title":"Advances in Cryptology-CRYPTO2001","author":"J. Manger","year":"2001","unstructured":"James Manger. A chosen ciphertext attack on RSA optimal asymmetric encryption padding (OAEP) as standardized in PKCS #1. In J. Kilian, ed., Advances in Cryptology-CRYPTO2001, vol. 2139 of Lecture Notes in Computer Science, pp. 230\u2013238, Springer-Verlag, 2001."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Moni Naor and Moti Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proc. of the 22nd ACM Annual Symposium on the Theory of Computing (STOC\u2019 90), pp. 427\u2013437, ACM Press, 1990.","DOI":"10.1145\/100216.100273"},{"issue":"2","key":"2_CR24","first-page":"5","volume":"1","author":"A. Odlyzko","year":"1995","unstructured":"Andrew Odlyzko. The future of integer factorization. Cryptobytes, 1(2):5\u201312, 1995.","journal-title":"Cryptobytes"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"Q. Jean-Jacques","year":"1982","unstructured":"Jean-Jacques Quisquater and Chantal Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters, 18:905\u2013907, 1982.","journal-title":"Electronics Letters"},{"key":"2_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology-CRYPTO\u201991","author":"C. Rackoff","year":"1992","unstructured":"Charles Rackoff and Daniel R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, ed., Advances in Cryptology-CRYPTO\u201991, vol. 576 of Lecture Notes in Computer Science, pp. 433\u2013444, Springer-Verlag, 1992."},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21(2):120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"issue":"2","key":"2_CR28","first-page":"1","volume":"1","author":"A. Shamir","year":"1995","unstructured":"Adi Shamir. RSA for paranoids. Cryptobytes, 1(2):1\u20134, 1995.","journal-title":"Cryptobytes"},{"key":"2_CR29","unstructured":"Adi Shamir. Patent US 5.991.415: Method and apparatus for protecting public key schemes from timing and fault attacks, 12 May 1997."},{"key":"2_CR30","unstructured":"Adi Shamir. How to check modular exponentiation. Presented at the rump session of EUROCRYPT\u201997, Konstanz, Germany, 11\u201315th May 1997."},{"key":"2_CR31","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO2001","author":"V. Shoup","year":"2001","unstructured":"Victor Shoup. OAEP reconsidered. In J. Kilian, ed., Advances in Cryptology-CRYPTO2001, vol. 2139 of Lecture Notes in Computer Science, Springer-Verlag, 2001."},{"issue":"9","key":"2_CR32","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"Y. Sung-Ming","year":"2000","unstructured":"Sung-Ming Yen and Marc Joye. Checking before output may not be enough against fault-based cryptanalysis. IEEE Transactions on Computers, 49(9):967\u2013970, 2000.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45760-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T05:51:32Z","timestamp":1629438692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45760-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432241","9783540457602"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-45760-7_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"8 February 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}