{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:32:51Z","timestamp":1725514371325},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540721598"},{"type":"electronic","value":"9783540721635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72163-5_21","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T09:27:19Z","timestamp":1181035639000},"page":"269-283","source":"Crossref","is-referenced-by-count":0,"title":["Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Cryptosystems"],"prefix":"10.1007","author":[{"given":"Pradeep Kumar","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Pinakpani","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","year":"2005","key":"21_CR1","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"key":"21_CR2","volume-title":"Embedded Cryptographic Hardware: Design and Security","author":"G. Bertoni","year":"2004","unstructured":"Bertoni, G., et al.: Hyperelliptic Curve Cryptosystem: What is the Best Parallel Hardware Architecture? In: Nedjah, N. (ed.) Embedded Cryptographic Hardware: Design and Security, Nova Science Publishers, New York (2004)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2307\/2007876","volume":"48","author":"D.G. Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in the Jacobian of a Hyperelliptic curve. Mathematics of Computation\u00a048, 95\u2013101 (1987)","journal-title":"Mathematics of Computation"},{"key":"21_CR4","unstructured":"A compendium of NP-optimization problems, \n                    \n                      http:\/\/www.nada.kth.se\/~viggo\/problemlist\/compendium.html"},{"key":"21_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H.\u00a0Freeman, San Francisco (1979)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/10722028_18","volume-title":"Algorithmic Number Theory","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P., Harley, R.: Counting Points on Hyperelliptic Curves over Finite Fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 297\u2013312. Springer, Heidelberg (2000)"},{"key":"21_CR7","unstructured":"Harley, R.: Fast Arithmetic on Genus 2 Curves (2000), available at \n                    \n                      http:\/\/cristal.inria.fr\/~harley\/hyper\n                    \n                    \n                   2000"},{"key":"21_CR8","first-page":"726","volume-title":"Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science","author":"P. Klein","year":"1990","unstructured":"Klein, P., et al.: Approximation through multicommodity flow. In: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 726\u2013737. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystems. Journal of Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"Journal of Cryptology"},{"key":"21_CR10","unstructured":"Lange, T.: Efficient Arithmetic on Genus 2 Curves over Finite Fields via Explicit Formulae. Cryptology ePrint Archive, Report 2002\/121 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"21_CR11","unstructured":"Lange, T.: Inversion-free Arithmetic on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002\/147 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"21_CR12","unstructured":"Lange, T.: Weighted Coordinates on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002\/153 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"issue":"5","key":"21_CR13","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. Applicable Algebra in Engineering, Communication and Computing\u00a015(5), 295\u2013328 (2005)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-30564-4_12","volume-title":"Selected Areas in Cryptography","author":"T. Lange","year":"2004","unstructured":"Lange, T., Stevens, M.: Efficient Doubling on Genus 2 Curves over Binary Fields. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 170\u2013181. Springer, Heidelberg (2004)"},{"key":"21_CR15","unstructured":"Menezes, A., Wu, Y., Zuccherato, R.: An Elementary Introduction to Hyperelliptic Curves. Technical Report CORR 96-19, University of Waterloo, Canada. (1996), Available at \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca"},{"key":"21_CR16","unstructured":"Mishra, P.K., Pal, P., Sarkar, P.: Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Crytosystems. Cryptology ePrint Archive, Report 2006\/204 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/204"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","first-page":"91","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"P.K. Mishra","year":"2003","unstructured":"Mishra, P.K., Sarkar, P.: Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves (Extended Abstract). In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 91\u2013111. Springer, Heidelberg (2003), Full version available at Cryptology ePrint Archive, Report 2003\/180 \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Pelzl, J., Wollinger, T., Paar, C.: High Performance Arithmetic for Hyperelliptic Curve Cryptosystems of Genus Two. In: International Conference on Information Technology: Coding and Computing - ITCC, Las Vegas, USA (2004)","DOI":"10.1109\/ITCC.2004.1286706"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R. Sethi","year":"1975","unstructured":"Sethi, R.: Complete register allocation problems. SIAM Journal of Computing\u00a04, 226\u2013248 (1975)","journal-title":"SIAM Journal of Computing"},{"key":"21_CR20","unstructured":"Spallek, A.M.: Kurven vom Geschletch 2 und ihre Anwendung in Public-Key-Kryptosystemen. PhD Thesis, Universit\u00e4t Gesamthochschule, Essen (1994)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72163-5_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:29:21Z","timestamp":1605763761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72163-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540721598","9783540721635"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72163-5_21","relation":{},"subject":[]}}