{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:28:17Z","timestamp":1777444097303,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642364235","type":"print"},{"value":"9783642364242","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36424-2_23","type":"book-chapter","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T10:56:45Z","timestamp":1360580205000},"page":"268-279","source":"Crossref","is-referenced-by-count":2,"title":["Arithmetic Unit for Computations in GF(p) with the Left-Shifting Multiplicative Inverse Algorithm"],"prefix":"10.1007","author":[{"given":"Josef","family":"Hlav\u00e1\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00f3bert","family":"L\u00f3rencz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Bernal, A.: Conception et Etude d\u2019une Architecture Numerique de Haute Performance pour le Calcul de la Fonction Exponentielle Modulaire. PhD thesis, Institut National Polytechnique de Grenoble (1999)"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M. Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Designs, Codes and Cryptography\u00a039(2), 189\u2013206 (2006)","journal-title":"Designs, Codes and Cryptography"},{"issue":"5-6","key":"23_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.micpro.2004.03.006","volume":"28","author":"A. Daly","year":"2004","unstructured":"Daly, A., Marmane, W., Kerins, T., Popovici, E.: An FPGA Implementation of a GF(p) ALU for Encryption Processors. Microprocessors and Microsystems\u00a028(5-6), 253\u2013260 (2004)","journal-title":"Microprocessors and Microsystems"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Meurice de Dormale, G., Bulens, P., Quisquater, J.-J.: An Improved Montgomery Modular Inversion Targeted for Efficient Implementation on FPGA. In: International Conference on Field-Programmable Technology, FPT 2004, pp. 441\u2013444 (2004)","DOI":"10.1109\/FPT.2004.1393320"},{"key":"23_CR5","unstructured":"Gutub, A.: New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n). PhD Thesis, Department of Electrical & Computer Engineering, Oregon State University (2002)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/ES\/2006\/32192","volume":"32192:2006","author":"L. Hars","year":"2006","unstructured":"Hars, L.: Modular Inverse Algorithms without Multiplications. EURASIP Journal on Embedded Systems\u00a032192:2006, 1\u201313 (2006)","journal-title":"EURASIP Journal on Embedded Systems"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Hitchcock, Y., Dawson, E., Clark, A., Montague, P.: Implementing an Efficient Elliptic Curve Cryptosystem over GF(p) on a Smart Card. In: Proc. of 10th Computational Techniques and Applications Conference, CTAC 2001. ANZIAM J., vol.\u00a044, pp. C354\u2013C377 (2003)","DOI":"10.21914\/anziamj.v44i0.686"},{"key":"23_CR8","unstructured":"Hlav\u00e1\u010d, J.: Hardware Implementation of Algorithms for Computations in Finite Fields. PhD thesis, Czech Technical University in Prague (2010)"},{"key":"23_CR9","unstructured":"Hlav\u00e1\u010d, J., L\u00f3rencz, R.: Improved Hardware Architecture for Computing the Modular Inverse using AMI. In: International Conference on Computer, Communication and Control Technologies, CCCT 2003 and ISAS 2003, vol.\u00a0III, pp. 255\u2013260 (2003)"},{"key":"23_CR10","unstructured":"IEEE Computer Society: IEEE Standard Specifications for Public-Key Cryptography. Document No. IEEE 1363-2000 (2000) ISBN: 0-7381-1956-3"},{"issue":"8","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"B.S. Kaliski Jr.","year":"1995","unstructured":"Kaliski Jr., B.S.: The Montgomery Inverse and Its Applications. IEEE Trans. on Computers\u00a044(8), 1064\u20131065 (1995)","journal-title":"IEEE Trans. on Computers"},{"key":"23_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley (1998)"},{"key":"23_CR13","unstructured":"L\u00f3rencz, R.: Method for Generating the Multiplicative Inverse in a Finite Field GF(p). U.S. Patent No. 7574469 (2009)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-36400-5_6","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"R. L\u00f3rencz","year":"2003","unstructured":"L\u00f3rencz, R.: New Algorithm for Classical Modular Inverse. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 57\u201370. Springer, Heidelberg (2003)"},{"issue":"170","key":"23_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular Multiplication Without Trial Division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"issue":"4","key":"23_CR16","first-page":"351","volume":"11","author":"M. Morh\u00e1\u010d","year":"1992","unstructured":"Morh\u00e1\u010d, M., L\u00f3rencz, R.: Modular System for Solving Linear Equations Exactly, I. Architecture and Numerical Algorithms. Computers and Artificial Intelligence\u00a011(4), 351\u2013361 (1992)","journal-title":"Computers and Artificial Intelligence"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-36400-5_36","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"J. Wolkerstorfer","year":"2003","unstructured":"Wolkerstorfer, J.: Dual-Field Arithmetic Unit for GF(p) and GF(2 m ). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 500\u2013514. Springer, Heidelberg (2003)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Yan, X.: Modified Modular Inversion Algorithm for VLSI Implementation. In: 7th International Conference on ASIC \u2013 ASICON 2007, pp. 90\u201393 (2007)","DOI":"10.1109\/ICASIC.2007.4415574"}],"container-title":["Lecture Notes in Computer Science","Architecture of Computing Systems \u2013 ARCS 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36424-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T20:34:37Z","timestamp":1745958877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36424-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642364235","9783642364242"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36424-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}