{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:40:27Z","timestamp":1737621627449,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772712"},{"type":"electronic","value":"9783540772729"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77272-9_19","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:56:55Z","timestamp":1196942215000},"page":"313-335","source":"Crossref","is-referenced-by-count":3,"title":["Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic"],"prefix":"10.1007","author":[{"given":"Reza Rezaeian","family":"Farashahi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Algebraic Numbers and Algebraic Functions","author":"E. Artin","year":"1967","unstructured":"Artin, E.: Algebraic Numbers and Algebraic Functions. Gordon and Breach, New York (1967)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-28632-5_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"R.M. Avanzi","year":"2004","unstructured":"Avanzi, R.M.: Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 148\u2013162. Springer, Heidelberg (2004)"},{"issue":"177","key":"19_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2307\/2007876","volume":"48","author":"D. Cantor","year":"1987","unstructured":"Cantor, D.: Computing in the Jacobian of a Hyperelliptic Curve. Mathematics of Computation\u00a048(177), 95\u2013101 (1987)","journal-title":"Mathematics of Computation"},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526084","volume-title":"Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2","author":"J.W.S. Cassels","year":"1996","unstructured":"Cassels, J.W.S., Flynn, E.V.: Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2. Cambridge University Press, Cambridge (1996)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11745853_27","volume-title":"Public Key Cryptography - PKC 2006","author":"O. Chevassut","year":"2006","unstructured":"Chevassut, O., Fouque, P., Gaudry, P., Pointcheval, D.: The Twist-Augmented Technique for Key Exchange. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 410\u2013426. Springer, Heidelberg (2006)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, Chapman & Hall\/CRC, New York (2006)","DOI":"10.1201\/9781420034981"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-540-24847-7_11","volume-title":"ANTS 2004","author":"S. Duquesne","year":"2004","unstructured":"Duquesne, S.: Montgomery Scalar Multiplication for Genus 2 Curves. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 153\u2013168. Springer, Heidelberg (2004)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-73074-3_17","volume-title":"WAIFI 2007","author":"R.R. Farashahi","year":"2007","unstructured":"Farashahi, R.R., Pellikaan, R.: The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic. In: WAIFI 2007. LNCS, vol.\u00a04547, pp. 219\u2013236. Springer, Heidelberg (2007)"},{"key":"19_CR9","unstructured":"Farashahi, R.R., Pellikaan, R., Sidorenko, A.: Extractors for Binary Elliptic Curves. In: WCC 2007. Workshop on Coding and Cryptography, pp. 127\u2013136 (2007)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3419","DOI":"10.1007\/3-540-45539-6_2","volume-title":"EUROCRYPT 2000","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P.: An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 3419\u20133448. Springer, Heidelberg (2000)"},{"key":"19_CR11","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on Theta functions, Cryptology ePrint Archive, Report 2005\/314 (2005), http:\/\/eprint.iacr.org\/"},{"key":"19_CR12","unstructured":"G\u00fcrel, N.: Extracting bits from coordinates of a point of an elliptic curve, Cryptology ePrint Archive, Report 2005\/324 (2005), http:\/\/eprint.iacr.org\/"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/18.841170","volume":"46","author":"A. Juels","year":"2000","unstructured":"Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to turn loaded dice into fair coins. IEEE Transactions on Information Theory\u00a046(3), 911\u2013921 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-47721-7_7","volume-title":"Advances in Cryptology\u2013Crypto 1986","author":"B.S. Kaliski","year":"1987","unstructured":"Kaliski, B.S.: A Pseudo-Random Bit Generator Based on Elliptic Logarithms. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 84\u2013103. Springer, Heidelberg (1987)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystem. J. of Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J. of Cryptology"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","first-page":"307","volume-title":"ANTS 2004","author":"T. Lange","year":"2004","unstructured":"Lange, T.: Montgomery Addition for Genus Two Curves. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 307\u2013309. Springer, Heidelberg (2004)"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00200-004-0154-8","volume":"15","author":"T. Lange","year":"2005","unstructured":"Lange, T.: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. aaecc\u00a015(1), 295\u2013328 (2005)","journal-title":"aaecc"},{"key":"19_CR18","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1994","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton University Press, USA (1994)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Mumford, D.: Tata Lectures on Theta II. In: Progress in Mathematics, vol.\u00a043 (1984)","DOI":"10.1007\/978-1-4899-2843-6"},{"key":"19_CR20","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/PL00003818","volume":"12","author":"N.P. Smart","year":"1999","unstructured":"Smart, N.P., Siksek, S.: A Fast Diffie-Hellman Protocol in Genus 2. Journal of Cryptology\u00a012, 67\u201373 (1999)","journal-title":"Journal of Cryptology"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting Randomness from Samplable Distributions. In: IEEE Symposium on Foundations of Computer Science, pp. 32\u201342 (2000)","DOI":"10.1109\/SFCS.2000.892063"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:13:35Z","timestamp":1737620015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77272-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540772712","9783540772729"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77272-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}