{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:49Z","timestamp":1740122509537,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T00:00:00Z","timestamp":1523491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Fund of Social Development"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10623-018-0484-3","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T05:11:55Z","timestamp":1523509915000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure simultaneous bit extraction from Koblitz curves"],"prefix":"10.1007","volume":"87","author":[{"given":"Xinxin","family":"Fan","sequence":"first","affiliation":[]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6027-2548","authenticated-orcid":false,"given":"Francesco","family":"Sica","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Sidorenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"key":"484_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W Alex","year":"1988","unstructured":"Alex W., Chor B., Goldreich O., Shub M.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17, 194\u2013209 (1988).","journal-title":"SIAM J. Comput."},{"key":"484_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/11935230_9","volume-title":"Proceedings of Asiacrypt 2006","author":"R Avanzi","year":"2006","unstructured":"Avanzi R., Dimitrov V.S., Doche C., Sica F.: Extending scalar multiplication using double bases. In: Lai Xuejia, Chen Kefei (eds.) Proceedings of Asiacrypt 2006, vol. 4284, pp. 130\u2013144. Lecture Notes in Computer ScienceSpringer, Berlin (2006)."},{"key":"484_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L Blum","year":"1986","unstructured":"Blum L., Blum M., Shub M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15, 364\u2013383 (1986).","journal-title":"SIAM J. Comput."},{"key":"484_CR4","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X.: Short signatures without random oracles. In: Advances in Cryptology\u2014EUROCRYPT 2004. International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2\u20136 May 2004, Proceedings, pp. 56\u201373 (2004).","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"484_CR5","unstructured":"Boneh D., Franklin M.: Identity based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003). Extended abstract in Proceedings of Crypto \u20192001. Lecture Notes in Computer Science, vol. 2139. Springer, Berlin, pp. 213\u2013229 (2001)."},{"key":"484_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh D., Shacham H., Lynn B.: Short signatures from the Weil pairing. In: Boyd C. (ed.) Advances in Cryptology\u2014ASIACRYPT 2001, vol. 2248, pp. 514\u2013532. Lecture Notes in Computer ScienceSpringer, Berlin (2001)."},{"key":"484_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X., Hovav S.: Short group signatures. In: Advances in Cryptology\u2014CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, CA, USA, 15\u201319 August 2004, Proceedings, pp. 41\u201355 (2004).","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"484_CR8","unstructured":"Checkoway S., Fredrikson M., Niederhagen R., Everspaugh A., Green M., Lange T., Ristenpart T., Bernstein D.J., Maskiewicz J., Shacham H.: On the practical exploitability of dual EC in TLS implementations. In: Proceedings of the 23rd USENIX Conference on Security Symposium, SEC\u201914, pp. 319\u2013335. USENIX Association, Berkeley, CA, USA (2014)."},{"key":"484_CR9","doi-asserted-by":"crossref","unstructured":"Checkoway S., Maskiewicz J., Garman C., Fried J., Cohney S., Green M., Heninger N., Weinmann R.-P., Rescorla E., Shacham H.: A systematic analysis of the juniper dual EC incident. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, pp. 468\u2013479. ACM, New York, NY, USA (2016).","DOI":"10.1145\/2976749.2978395"},{"key":"484_CR10","doi-asserted-by":"crossref","unstructured":"Cheon J.H.: Security analysis of the strong Diffie\u2013Hellman problem. In: Proceedings of EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 1\u201311. Springer, Heidelberg (2006).","DOI":"10.1007\/11761679_1"},{"key":"484_CR11","doi-asserted-by":"crossref","unstructured":"Ciss A.A., Sow D.: On randomness extraction in elliptic curves. In: Proceedings of AFRICACRYPT 2011. Lecture Notes in Computer Science, vol. 6737, pp. 290\u2013297. Springer, Heidelberg (2011).","DOI":"10.1007\/978-3-642-21969-6_18"},{"issue":"10","key":"484_CR12","doi-asserted-by":"publisher","first-page":"3423","DOI":"10.1090\/S0002-9939-2011-10764-0","volume":"139","author":"V Dimitrov","year":"2011","unstructured":"Dimitrov V., Howe E.: Lower bounds on the lengths of double-base representations. Proc. Am. Math. Soc. 139(10), 3423\u20133430 (2011).","journal-title":"Proc. Am. Math. Soc."},{"issue":"22","key":"484_CR13","first-page":"1003","volume":"110","author":"V Dimitrov","year":"2010","unstructured":"Dimitrov V., Imbert L., Mishra P.K.: The double-base number system and its application to elliptic curve cryptography. Math. Comput. 110(22), 1003\u20131006 (2010).","journal-title":"Math. Comput."},{"key":"484_CR14","doi-asserted-by":"crossref","unstructured":"Doche C., Kohel D.R., Sica F.: Double-base number system for multi-scalar Multiplications. In: Joux A. (ed.) Proceedings of EUROCRYPT. Lecture Notes in Computer Science, vol. 5479, pp. 502\u2013517. Springer, Heidelberg (2009).","DOI":"10.1007\/978-3-642-01001-9_29"},{"key":"484_CR15","doi-asserted-by":"crossref","unstructured":"Farashahi R.R., Schoenmakers B., Sidorenko A.: Efficient pseudorandom generators based on the DDH assumption. In: Proceedings of PKC 2007. Lecture Notes in Computer Science, vol. 4450, pp. 426\u2013441. Springer, Heidelberg (2007).","DOI":"10.1007\/978-3-540-71677-8_28"},{"issue":"1\u20133","key":"484_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-008-9187-5","volume":"49","author":"RR Farashahi","year":"2008","unstructured":"Farashahi R.R., Pellikaan R., Sidorenko A.: Extractors for binary elliptic curves. Des. Codes Cryptogr. 49(1\u20133), 171\u2013186 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"484_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546907","volume-title":"Signal design for good correlation: for wireless communication, cryptography, and radar applications","author":"SW Golomb","year":"2005","unstructured":"Golomb S.W., Gong G.: Signal design for good correlation: for wireless communication, cryptography, and radar applications. Cambridge University Press, Cambridge (2005)."},{"key":"484_CR18","unstructured":"Gong G., Berson T.A., Stinson D.R.: Elliptic curve pseudorandom sequence generators. In: Selected Areas in Cryptography, 6th Annual International Workshop, SAC\u201999, Kingston, ON, Canada, 9\u201310 August 1999, Proceedings, pp. 34\u201348 (1999)."},{"key":"484_CR19","unstructured":"Hankerson D., Menezes A., Vanstone S.: Guide to Elliptic Curve Cryptography. Springer Professional Computing. Springer, New York (2004)."},{"key":"484_CR20","doi-asserted-by":"crossref","unstructured":"Joux A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma W. (ed.) Algorithmic Number Theory, 4th International Symposium, ANTS-IV. Lecture Notes in Computer Science, vol. 1838, pp. 385\u2013394. Springer, Berlin (2000).","DOI":"10.1007\/10722028_23"},{"issue":"177","key":"484_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987).","journal-title":"Math. Comput."},{"key":"484_CR22","unstructured":"Lidl R., Niederreiter H.: Finite fields. With a foreword. In: Cohn P.M. (ed.) Encyclopedia of Mathematics and Its Applications, vol. 20. Cambridge University Press, Cambridge (1997)."},{"issue":"1","key":"484_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10623-013-9822-7","volume":"73","author":"H Liu","year":"2014","unstructured":"Liu H.: A family of elliptic curve pseudorandom binary sequences. Des. Codes Cryptogr. 73(1), 251\u2013265 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"484_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.4064\/aa140-2-3","volume":"140","author":"H Liu","year":"2009","unstructured":"Liu H., Zhan T., Wang X.: Large families of elliptic curve pseudorandom binary sequences. Acta Arith. 140, 135\u2013144 (2009). Instytut Matematyczny PAN.","journal-title":"Acta Arith."},{"issue":"3\u20134","key":"484_CR25","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FI-2012-630","volume":"114","author":"L M\u00e9rai","year":"2012","unstructured":"M\u00e9rai L.: Remarks on pseudorandom binary sequences over elliptic curves. Fundam. Inf. 114(3\u20134), 301\u2013308 (2012).","journal-title":"Fundam. Inf."},{"issue":"2","key":"484_CR26","first-page":"59","volume":"9","author":"L M\u00e9rai","year":"2014","unstructured":"M\u00e9rai L.: On the elliptic curve power generator. Unif. Distrib. Theory 9(2), 59\u201365 (2014).","journal-title":"Unif. Distrib. Theory"},{"key":"484_CR27","doi-asserted-by":"crossref","unstructured":"M\u00e9rai L.: On pseudorandom properties of certain sequences of points on elliptic curve. In: Arithmetic of Finite Fields\u20146th International Workshop, WAIFI 2016, Ghent, Belgium, 13\u201315 July 2016, Revised Selected Papers, pp. 54\u201363 (2016).","DOI":"10.1007\/978-3-319-55227-9_4"},{"key":"484_CR28","doi-asserted-by":"crossref","unstructured":"M\u00e9rai L.: On the elliptic curve endomorphism generator. Des. Codes Cryptogr. Bd. 85, S. 121\u2013128 (2017).","DOI":"10.1007\/s10623-016-0293-5"},{"issue":"2","key":"484_CR29","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-015-0140-0","volume":"81","author":"L M\u00e9rai","year":"2016","unstructured":"M\u00e9rai L., Winterhof A.: On the linear complexity profile of some sequences derived from elliptic curves. Des. Codes Cryptogr. 81(2), 259\u2013267 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"484_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology\u2014Proceedings of CRYPTO 1985","author":"VS Miller","year":"1986","unstructured":"Miller V.S.: Use of elliptic curves in cryptography. In: Williams H.C. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 1985, vol. 218, pp. 417\u2013426. Lecture Notes in Computer ScienceSpringer, New York (1986)."},{"key":"484_CR31","unstructured":"Schoenmakers B., Sidorenko A.: Cryptanalysis of the dual elliptic curve pseudorandom generator. IACR Cryptology. ePrint Archive 2006, p. 190 (2006)."},{"key":"484_CR32","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1090\/conm\/477\/09305","volume":"9","author":"IE Shparlinski","year":"2009","unstructured":"Shparlinski I.E.: Pseudorandom number generators from elliptic curves. Contemp. Math. 9, 121\u2013141 (2009).","journal-title":"Contemp. Math."},{"key":"484_CR33","doi-asserted-by":"crossref","unstructured":"Sidorenko A., Schoenmakers B.: Concrete security of the Blum\u2013Blum\u2013Shub pseudorandom generator. In: Cryptography and Coding, 10th IMA International Conference, Cirencester, UK, 19\u201321 December 2005, Proceedings. Lecture Notes in Computer Science, vol. 3796, pp. 355\u2013375. Springer, Berlin (2005).","DOI":"10.1007\/11586821_24"},{"key":"484_CR34","unstructured":"Vazirani U.V., Vazirani V.V.: Efficient and secure pseudo-random number generation (extended abstract). In: 25th Annual Symposium on Foundations of Computer Science (FOCS), West Palm Beach, Florida, USA, 24\u201326 October 1984, pp. 458\u2013463. IEEE Computer Society, Philadelphia (1984)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0484-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0484-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0484-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T15:32:15Z","timestamp":1604158335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0484-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,12]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["484"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0484-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,4,12]]},"assertion":[{"value":"7 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}