{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:38:02Z","timestamp":1725550682797},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289388"},{"type":"electronic","value":"9783540320661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554868_14","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:49:02Z","timestamp":1127832542000},"page":"196-209","source":"Crossref","is-referenced-by-count":4,"title":["Optimization of the MOVA Undeniable Signature Scheme"],"prefix":"10.1007","author":[{"given":"Jean","family":"Monnerat","sequence":"first","affiliation":[]},{"given":"Yvonne Anne","family":"Oswald","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013216. Springer, Heidelberg (1990)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-45077-1_11","volume-title":"Fundamentals of Computation Theory","author":"I.B. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I.B., Frandsen, G.S.: Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 109\u2013117. Springer, Heidelberg (2003)"},{"key":"14_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8489-0","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"2000","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Heidelberg (2000)"},{"key":"14_CR4","unstructured":"Garg, S.: How to optimize C\/C++ Source - Performance Programming (2002), \n                    \n                      http:\/\/bdn.borland.com\/article\/0,1410,28278,00.html"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s001450010001","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Rabin, T., Krawczyk, H.: RSA-Based Undeniable Signatures. Journal of Cryptology\u00a013(4), 397\u2013416 (2000)","journal-title":"Journal of Cryptology"},{"key":"14_CR6","unstructured":"The GNU Multiple Precision Arithmetic Library, \n                    \n                      http:\/\/www.swox.com\/gmp\/"},{"key":"14_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A Classical Introduction to Modern Number Theory","author":"K. Ireland","year":"1990","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a084. Springer, Heidelberg (1990)","edition":"2"},{"key":"14_CR8","unstructured":"Lee, M.E.: Optimization of Computer Programs in C (2001), \n                    \n                      http:\/\/vision.eng.shu.ac.uk\/bala\/c\/c\/optimisation\/l\/optimization.html"},{"key":"14_CR9","unstructured":"Lef\u00e8vre, V.: Entiers de Gauss (sujet d\u2019\u00e9tude XM\u2019) (1993), \n                    \n                      http:\/\/www.vinc17.org\/math\/index.fr.html"},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1006\/jsco.1998.0226","volume":"26","author":"S.M. Meyer","year":"1998","unstructured":"Meyer, S.M., Sorendson, J.P.: Efficient Algorithms for Computing the Jacobi Symbol. Journal of Symbolic Computation\u00a026(4), 509\u2013523 (1998)","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-24632-9_6","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Monnerat","year":"2004","unstructured":"Monnerat, J., Vaudenay, S.: Undeniable Signatures Based on Characters: How to Sign with One Bit. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 69\u201385. Springer, Heidelberg (2004)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-30539-2_25","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"J. Monnerat","year":"2004","unstructured":"Monnerat, J., Vaudenay, S.: Generic Homomorphic Undeniable Signatures. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 354\u2013371. Springer, Heidelberg (2004)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public-key Cryptosystem. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"14_CR15","unstructured":"Stinner, V.: frequence_cpu.h, frequence_cpu.c, \n                    \n                      http:\/\/www.haypocal.com\/\n                    \n                    \n                   (2003)"},{"issue":"5","key":"14_CR16","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1006\/jsco.2000.0422","volume":"30","author":"A. Weilert","year":"2000","unstructured":"Weilert, A.: (1+i)-ary GCD Computation in Z[i] is an analogue to the Binary GCD Algorithm. Journal of Symbolic Computation\u00a030(5), 605\u2013617 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/10722028_40","volume-title":"Algorithmic Number Theory","author":"A. Weilert","year":"2000","unstructured":"Weilert, A.: Asymptotically fast GCD Computation in Z[i]. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 595\u2013613. Springer, Heidelberg (2000)"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0022-314X(02)92783-6","volume":"96","author":"A. Weilert","year":"2002","unstructured":"Weilert, A.: Fast Computation of the Biquadratic Residue Symbol. Journal of Number Theory\u00a096, 133\u2013151 (2002)","journal-title":"Journal of Number Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 Mycrypt 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554868_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:07:04Z","timestamp":1619507224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554868_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289388","9783540320661"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11554868_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}