{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T04:50:19Z","timestamp":1688100619505},"reference-count":17,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T00:00:00Z","timestamp":1394150400000},"content-version":"vor","delay-in-days":65,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2014,1,31]]},"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p>Linear finite transducers underlie a series of schemes for Public Key Cryptography (PKC)\n          proposed in the 90s of the last century. The uninspiring and arid language then used,\n          condemned these works to oblivion. Although some of these schemes were afterwards shown to\n          be insecure, the promise of a new system of PKC relying on different complexity\n          assumptions is still quite exciting. The algorithms there used depend heavily on the\n          results of invertibility of linear transducers. In this paper we introduce the notion of\n          post-initial linear transducer, which is an extension of the notion of linear finite\n          transducer with memory, and for which the previous fundamental results on invertibility\n          still hold. This extension enabled us to give a new method to obtain a left inverse of any\n          invertible linear finite transducer with memory. It also plays an essencial role in the\n          necessary and sufficient condition that we give for left invertibility of linear finite\n          transducers.<\/jats:p>","DOI":"10.1051\/ita\/2014004","type":"journal-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T13:11:04Z","timestamp":1394197864000},"page":"107-125","source":"Crossref","is-referenced-by-count":2,"title":["On the invertibility of finite linear\n          transducers"],"prefix":"10.1051","volume":"48","author":[{"given":"Ivone","family":"Amorim","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Machiavelo","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2014,3,7]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/5.4442","volume":"76","author":"Diffie","year":"1988","journal-title":"Proc. IEEE"},{"key":"R2","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BF02876565","volume":"42","author":"Haiwen","year":"1999","journal-title":"Science in China, Series A"},{"key":"R3","unstructured":"N. Jacobson, Basic Algebra I. W H Freeman & Co (1985)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TC.1968.229392","volume":"C-17","author":"Massey","year":"1968","journal-title":"IEEE Trans. Comput."},{"key":"R5","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"Nerode","year":"1958","journal-title":"Proc. Amer. Math. Soc."},{"key":"R6","unstructured":"M. Newman, Integral Matrices. Academic Press (1972)."},{"key":"R7","first-page":"565","volume":"XVI","author":"Tao","year":"1973","journal-title":"Sci. Sinica"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"R. Tao, Invertibility of Linear Finite Automata Over a Ring. Automata, Languages and Programming, in vol. 317 of Lect. Notes Comput. Sci. Springer Berlin, Heidelberg (1988) 489\u2013501.","DOI":"10.1007\/3-540-19488-6_136"},{"key":"R9","unstructured":"R. Tao, Finite Automata and Application to Cryptography. Springer Publishing Company, Incorporated (2009)."},{"key":"R10","first-page":"401","volume":"8","author":"Tao","year":"1985","journal-title":"Chinese J. Comput."},{"key":"R11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1006\/jnca.1997.0057","volume":"20","author":"Tao","year":"1997","journal-title":"J. Netw. Comput. Appl."},{"key":"R12","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1007\/BF02885019","volume":"44","author":"Tao","year":"1999","journal-title":"Chinese Sci. Bull."},{"key":"R13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02943149","volume":"12","author":"Tao","year":"1997","journal-title":"J. Comput. Sci. Techn."},{"key":"R14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jsco.1995.1050","volume":"20","author":"Villard","year":"1995","journal-title":"J. Symb. Comput."},{"key":"R15","first-page":"613","volume":"39","author":"Zongduo","year":"1996","journal-title":"Sci. In China (Series A)"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"D. Zongduo, Y. Dingfeng and K.Y. Lam, Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC. Advances in Cryptology \u2013 AsiaCrypt\u201998, in vol. 1514 of Lect. Notes Comput. Sci. Edited by K. Ohta and D. Pei. Springer-Verlag (1998) 227\u2013241.","DOI":"10.1007\/3-540-49649-1_19"},{"key":"R17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02560533","volume":"13","author":"Zongduo","year":"1997","journal-title":"Acta Math. Sinica, New Ser."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T11:58:15Z","timestamp":1630670295000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":17,"journal-issue":{"issue":"1"},"alternative-id":["ita130009"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014004","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}