{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T23:00:41Z","timestamp":1769641241544,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540772712","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77272-9_12","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:56:55Z","timestamp":1196942215000},"page":"185-203","source":"Crossref","is-referenced-by-count":51,"title":["New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures"],"prefix":"10.1007","author":[{"given":"Onur","family":"Ac\u0131i\u00e7mez","sequence":"first","affiliation":[]},{"given":"Shay","family":"Gueron","sequence":"additional","affiliation":[]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/11967668_15","volume-title":"CT-RSA 2007","author":"O. Ac\u0131i\u00e7mez","year":"2006","unstructured":"Ac\u0131i\u00e7mez, O., Ko\u00e7, \u00c7.K., Seifert, J.-P.: Predicting Secret Keys via Branch Prediction. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 225\u2013242. Springer, Heidelberg (2006)"},{"key":"12_CR2","unstructured":"Ac\u0131i\u00e7mez, O., Ko\u00e7, \u00c7.K., Seifert, J.-P.: On The Power of Simple Branch Prediction Analysis. In: ASIACCS 2007. ACM Symposium on Information, Computer and Communications Security (to appear, 2007)"},{"key":"12_CR3","unstructured":"Ac\u0131i\u00e7mez, O., Ko\u00e7, \u00c7.K., Seifert, J.-P.: On The Power of Simple Branch Prediction Analysis. Cryptology ePrint Archive, Report 2006\/351 (October 2006)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11967668_18","volume-title":"CT-RSA 2007","author":"O. Ac\u0131i\u00e7mez","year":"2006","unstructured":"Ac\u0131i\u00e7mez, O., Schindler, W., Ko\u00e7, \u00c7.K.: Cache Based Remote Timing Attack on the AES. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 271\u2013286. Springer, Heidelberg (2006)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/1102120.1102140","volume-title":"Proceedings of the 12 th ACM Conference on Computer and Communications Security","author":"O. Ac\u0131i\u00e7mez","year":"2005","unstructured":"Ac\u0131i\u00e7mez, O., Schindler, W., Ko\u00e7, \u00c7.K.: Improving Brumley and Boneh Timing Attack on Unprotected SSL Implementations. In: Meadows, C., Syverson, P. (eds.) Proceedings of the 12 th ACM Conference on Computer and Communications Security, pp. 139\u2013146. ACM Press, New York (2005)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ac\u0131i\u00e7mez, O., Seifert, J.-P., Ko\u00e7, \u00c7.K.: Predicting Secret Keys via Branch Prediction. Cryptology ePrint Archive, Report 2006\/288 (August 2006)","DOI":"10.1007\/11967668_15"},{"key":"12_CR7","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES. Technical Report, 37 pages (April 2005), Available at: http:\/\/cr.yp.to\/antiforgery\/cachetiming-20050414.pdf"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CRYPTO 1998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"12_CR9","unstructured":"Brumley, D., Boneh, D.: Remote Timing Attacks are Practical. In: Proceedings of the 12 th Usenix Security Symposium, pp. 1\u201314 (2003)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/RISP.1992.213271","volume-title":"Proceedings of IEEE Symposium on Security and Privacy","author":"W.M. Hu","year":"1992","unstructured":"Hu, W.M.: Lattice scheduling and covert channels. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 52\u201361. IEEE Press, Los Alamitos (1992)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-36400-5_5","volume-title":"CHES 2002","author":"S. Gueron","year":"2003","unstructured":"Gueron, S.: Enhanced Montgomery Multiplication. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 46\u201356. Springer, Heidelberg (2003)"},{"key":"12_CR12","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, New York (1997)"},{"key":"12_CR13","unstructured":"Neve, M., Seifert, J.-P.: Advances on Access-driven Cache Attacks on AES. In: SAC 2006. Selected Areas of Cryptography (2006)"},{"key":"12_CR14","unstructured":"Neve, M.: Cache-based Vulnerabilities and SPAM Analysis. Ph.D. Thesis, Applied Science, UCL (July 2006)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11605805_1","volume-title":"CT-RSA 2006","author":"D.A. Osvik","year":"2006","unstructured":"Osvik, D.A., Shamir, A., Tromer, E.: Cache Attacks and Countermeasures: The Case of AES. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"12_CR16","unstructured":"OpenSSL: the open-source toolkit for ssl \/ tls"},{"key":"12_CR17","unstructured":"OpenSSL (Changelog) Changes between 0.9.8f and 0.9.9, http:\/\/www.openssl.org\/news\/changelog.html"},{"key":"12_CR18","unstructured":"Percival, C.: Cache missing for fun and profit. In: BSDCan 2005, Ottawa (2005), Available at: http:\/\/www.daemonology.net\/hyperthreading-considered-harmful\/"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-40974-8_20","volume-title":"Cryptography and Coding","author":"W. Schindler","year":"2003","unstructured":"Schindler, W., Walter, C.D.: More Detail for a Combined Timing and Power Attack against Implementations of RSA. In: Paterson, K.G. (ed.) Cryptography and Coding. LNCS, vol.\u00a02898, pp. 245\u2013263. Springer, Heidelberg (2003)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"C.D. Walter","year":"2001","unstructured":"Walter, C.D.: Montgomery exponentiation needs no final subtractions. Electronics Letters\u00a035, 1831\u20131832 (2001)","journal-title":"Electronics Letters"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77272-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:06:53Z","timestamp":1619521613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77272-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772712"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77272-9_12","relation":{},"subject":[]}}