{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:01:49Z","timestamp":1648994509610},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T00:00:00Z","timestamp":1547424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P3-0384"],"award-info":[{"award-number":["P3-0384"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P3-0384 and research project J1-9108"],"award-info":[{"award-number":["P3-0384 and research project J1-9108"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"name":"InnoRenew CoE project under the Horizon2020 Widespread-Teaming program and the Republic of Slovenia","award":["739574"],"award-info":[{"award-number":["739574"]}]},{"name":"InnoRenew CoE project under the Horizon2020 Widespread-Teaming program and the Republic of Slovenia","award":["739574"],"award-info":[{"award-number":["739574"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12095-019-0351-8","type":"journal-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T14:33:00Z","timestamp":1547476380000},"page":"1079-1102","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An iterative method for linear decomposition of index generating functions"],"prefix":"10.1007","volume":"11","author":[{"given":"S.","family":"Hod\u017ei\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Pasalic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Chattopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,14]]},"reference":[{"key":"351_CR1","doi-asserted-by":"crossref","unstructured":"Astola, J., Astola, P., Stankovi\u0107, R., Tabus, I.: An algebraic approach to reducing the number of variables of incompletely defined discrete functions. In: 46th International Symposium on Multiple-Valued Logic, pp. 107\u2013112 (2016)","DOI":"10.1109\/ISMVL.2016.18"},{"key":"351_CR2","doi-asserted-by":"crossref","unstructured":"Astola, J., Astola, P., Stankovi\u0107, R., Tabus, I.: Index generation functions based on linear and polynomial transformations. In: 46th International Symposium on Multiple-Valued Logic, pp. 102\u2013106 (2016)","DOI":"10.1109\/ISMVL.2016.20"},{"key":"351_CR3","unstructured":"Bhattacharyya, A., Indyk, P., Woodruff, D.P., Xie, N.: The complexity of linear dependence problems in vector spaces. Innovations Comput. Sci., 496\u2013508. ISBN 978-7-302-24517-9 (2011)"},{"key":"351_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511852008","volume-title":"Boolean Functions: Theory, Algorithms, and Applications. Encyclopedia of Mathematics and its Applications","author":"Y Crama","year":"2011","unstructured":"Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2011)"},{"key":"351_CR5","doi-asserted-by":"crossref","unstructured":"Een, N., Sorensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, SAT 2003, vol. 2919, pp 502\u2013518. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"351_CR6","volume-title":"Spectral Logic and Its Applications for the Design of Digital Devices","author":"MG Karpovsky","year":"2007","unstructured":"Karpovsky, M.G., Stankovic, R.S., Astola, J.T.: Spectral Logic and Its Applications for the Design of Digital Devices. Wiley, Hoboken (2007)"},{"key":"351_CR7","doi-asserted-by":"crossref","unstructured":"Kolomeec, N., Pavlov, A.: Bent functions on the minimal distance. IEEE Region 8, SIBIRCON, Irkutsk Listvyanka, Russia (2010)","DOI":"10.1109\/SIBIRCON.2010.5555328"},{"key":"351_CR8","doi-asserted-by":"crossref","unstructured":"Lechner, R.J.: Harmonic analysis of switching functions. Recent Developments in Switching Theory, New York, Edited by: Amar Mukhopadhyay, pp. 121\u2013228 (1971)","DOI":"10.1016\/B978-0-12-509850-2.50010-5"},{"key":"351_CR9","doi-asserted-by":"crossref","unstructured":"Luba, T., Borowik, G., Jankowski, C.: Gate-based decomposition of index generation functions. Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments, vol. 10031 (2016)","DOI":"10.1117\/12.2248754"},{"issue":"3","key":"351_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF00190802","volume":"2","author":"C Mitchell","year":"1990","unstructured":"Mitchell, C.: Enumerating Boolean functions of cryptographic significance. J. Cryptol. 2(3), 155\u2013170 (1990)","journal-title":"J. Cryptol."},{"key":"351_CR11","doi-asserted-by":"crossref","unstructured":"Nagayama, S., Sasao, T., Butler, J.T.: An efficient heuristic for linear decomposition of index generation functions. In: 46nd International Symposium on Multiple-Valued Logic, pp. 96\u2013101. Japan (2016)","DOI":"10.1109\/ISMVL.2016.52"},{"issue":"8","key":"351_CR12","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1587\/transinf.2016LOP0013","volume":"E100.D","author":"S Nagayama","year":"2017","unstructured":"Nagayama, S., Sasao, T., Butler, J.T.: A balanced decision tree based heuristic for linear decomposition of index generation functions. IEICE Trans. Inf. Syst. E100.D (8), 1583\u20131591 (2017)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"4","key":"351_CR13","first-page":"610","volume":"123","author":"EI Ne\u010diporuk","year":"1958","unstructured":"Ne\u010diporuk, E.I.: Network synthesis by using linear transformation of variables. Dokladi Akademii Nauk SSSR 123(4), 610\u2013612 (1958)","journal-title":"Dokladi Akademii Nauk SSSR"},{"issue":"3","key":"351_CR14","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/JSSC.2005.864128","volume":"41","author":"K Pagiamtzis","year":"2006","unstructured":"Pagiamtzis, K., Sheikholeslami, A.: Content-addressable memory (CAM) circuits and architectures: A tutorial and survey. IEEE J. Solid State Circuits 41(3), 712\u2013727 (2006)","journal-title":"IEEE J. Solid State Circuits"},{"issue":"3\u20134","key":"351_CR15","first-page":"235","volume":"23","author":"T Sasao","year":"2014","unstructured":"Sasao, T.: Index generation functions: tutorial. J. Multiple-Valued Logic Soft Comput. 23(3\u20134), 235\u2013263 (2014)","journal-title":"J. Multiple-Valued Logic Soft Comput."},{"key":"351_CR16","doi-asserted-by":"crossref","unstructured":"Sasao, T.: Multiple-valued input index generation functions: optimization by linear transformation. In: 42nd International Symposium on Multiple-Valued Logic, pp. 185\u2013190. Canada (2012)","DOI":"10.1109\/ISMVL.2012.21"},{"key":"351_CR17","doi-asserted-by":"crossref","unstructured":"Sasao, T.: A reduction method for the number of variables to represent index generation functions: s-Min method. In: 45nd International Symposium on Multiple-Valued Logic, pp. 164\u2013169. Canada (2015)","DOI":"10.1109\/ISMVL.2015.40"},{"key":"351_CR18","doi-asserted-by":"crossref","unstructured":"Sasao, T.: Index generation functions: theory and applications. In: International Symposium on Communications and Information Technologies, pp. 585\u2013590. Japan (2010)","DOI":"10.1109\/ISCIT.2010.5665057"},{"key":"351_CR19","unstructured":"Sasao, T.: Linear transformations for variable reduction. ReedMuller Workshop (2011)"},{"key":"351_CR20","doi-asserted-by":"crossref","unstructured":"Sasao, T.: On the numbers of variables to represent multi-valued incompletely specified functions. In: 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools. France (2010)","DOI":"10.1109\/DSD.2010.9"},{"key":"351_CR21","unstructured":"Sasao, T.: On the numbers of variables to represent sparse logic functions. In: IEEE\/ACM International Conference on Computer-Aided Design, pp. 45\u201351. San Jose, USA (2008)"},{"key":"351_CR22","doi-asserted-by":"crossref","unstructured":"Sasao, T.: Index generation functions: recent developments. In: 41st IEEE International Symposium on Multiple-Valued Logic, pp. 235\u2013263. Finland (2011)","DOI":"10.1109\/ISMVL.2011.17"},{"key":"351_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8104-2","volume-title":"Memory-Based Logic Synthesis","author":"T Sasao","year":"2011","unstructured":"Sasao, T.: Memory-Based Logic Synthesis. Springer-Verlag, New York (2011)"},{"key":"351_CR24","doi-asserted-by":"crossref","unstructured":"Sasao, T.: Linear decomposition of index generation functions. In: 17th Asia and South Pacific Design Automation Conference, pp. 781\u2013788 (2012)","DOI":"10.1109\/ASPDAC.2012.6165060"},{"key":"351_CR25","doi-asserted-by":"crossref","unstructured":"Sasao, T.: Index generation functions: Minimization methods. In: 47th International Symposium on Multiple-Valued Logic, pp. 197\u2013206 (2017)","DOI":"10.1109\/ISMVL.2017.22"},{"key":"351_CR26","doi-asserted-by":"crossref","unstructured":"Sasao, T.: An application of autocorrelation functions to find linear decompositions for incompletely specified index generation functions. In: 43rd International Symposium on Multiple-Valued Logic, pp. 96\u2013102 (2013)","DOI":"10.1109\/ISMVL.2013.12"},{"issue":"1","key":"351_CR27","first-page":"105","volume":"28","author":"T Sasao","year":"2017","unstructured":"Sasao, T.: A linear decomposition of index generation functions: optimization using autocorrelation functions. J. Multiple-Valued Logic Soft Comput. 28(1), 105\u2013127 (2017)","journal-title":"J. Multiple-Valued Logic Soft Comput."},{"key":"351_CR28","unstructured":"Sasao, T., Fumishi, I., Iguch, Y.: A method to minimize variables for incompletely specified index generation functions using a SAT solver. In: International Workshop on Logic and Synthesis, Mountain View, pp. 161\u2013167 (2015)"},{"key":"351_CR29","doi-asserted-by":"crossref","unstructured":"Sasao, T., Nakamura, T., Matsuura, M.: Representation of incompletely specified index generation functions using minimal number of compound variables. In: 12th Euromicro Conference on Digital System Design \/ Architectures, Methods and Tools, pp 765\u2013772 (2009)","DOI":"10.1109\/DSD.2009.214"},{"key":"351_CR30","unstructured":"Sasao, T., Matsuura, M., Nakahara, H.: A realization of Index generation functions using modules of uniform sizes. In: International Workshop on Logic and Synthesis, pp. 201\u2013208. California (2010)"},{"issue":"12","key":"351_CR31","doi-asserted-by":"publisher","first-page":"2427","DOI":"10.1587\/transfun.E97.A.2427","volume":"E97.A","author":"T Sasao","year":"2014","unstructured":"Sasao, T., Urano, Y., Iguchi, Y.: A method to find linear decompositions for incompletely specified index generation functions using difference matrix. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E97.A(12), 2427\u20132433 (2014)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"351_CR32","doi-asserted-by":"crossref","unstructured":"Sasao, T., Urano, Y., Iguchi, Y.: A lower bound on the number of variables to represent incompletely specified index generation functions. In: 44th International Symposium on Multiple-Valued Logic, pp. 7\u201312. Germany (2014)","DOI":"10.1109\/ISMVL.2014.10"},{"key":"351_CR33","doi-asserted-by":"crossref","unstructured":"Abboud, A., Lewi, K., Williams, R.: Losing weight by gaining edges. In: 22th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 8737, pp. 1\u201312. Poland (2014)","DOI":"10.1007\/978-3-662-44777-2_1"},{"key":"351_CR34","doi-asserted-by":"crossref","unstructured":"Simovici, D.A., Zimand, M., Pletea, D.: Several remarks on index generation functions. In: 42nd IEEE International Symposium on Multiple-Valued Logic, pp. 179\u2013184. Canada (2012)","DOI":"10.1109\/ISMVL.2012.17"},{"key":"351_CR35","unstructured":"Stankovi\u0107, M., Stankovi\u0107, R.: Variable reduction of index generating functions in Walsh-Hadamard domain. In: Proceedings Reed-Muller Workshop, pp. 80\u201385. Japan (2013)"},{"key":"351_CR36","volume-title":": An Introduction to Computer Logic (Prentice-Hall computer applications in electrical engineering series)","author":"H Troy Nagle","year":"1975","unstructured":"Troy Nagle, H., Carroll, B.D., David Irwin, J.: : An Introduction to Computer Logic (Prentice-Hall computer applications in electrical engineering series), 1st edn. Prentice-Hall, Englewood Cliffs (1975)","edition":"1st edn"},{"issue":"8","key":"351_CR37","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/43.31549","volume":"8","author":"D Varma","year":"1989","unstructured":"Varma, D., Trachtenberg, E.: Design automation tools for efficient implementation of logic functions by decomposition. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(8), 901\u2013916 (1989)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"351_CR38","doi-asserted-by":"crossref","unstructured":"Wu, C.-K., Feng, D.: Boolean functions and their applications in cryptography. Advances in Computer Science and Technology (2016)","DOI":"10.1007\/978-3-662-48865-2"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-0351-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-0351-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-0351-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T00:17:35Z","timestamp":1578961055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-0351-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,14]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-0351-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,14]]},"assertion":[{"value":"17 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}