{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:24:52Z","timestamp":1763724292238,"version":"3.37.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084930"},{"type":"electronic","value":"9783319084947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08494-7_8","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:50:00Z","timestamp":1404571800000},"page":"95-110","source":"Crossref","is-referenced-by-count":3,"title":["Constructive Reversible Logic Synthesis for Boolean Functions with Special Properties"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Chattopadhyay","sequence":"first","affiliation":[]},{"given":"Soumajit","family":"Majumder","sequence":"additional","affiliation":[]},{"given":"Chander","family":"Chandak","sequence":"additional","affiliation":[]},{"given":"Nahian","family":"Chowdhury","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abdessaied, N., Soeken, M., Thomsen, M.K., Drechsler, R.: Upper bounds for reversible circuits based on Young subgroups. Information Processing Letters\u00a0114(6), 282\u2013286 (2014) ISSN 0020-0190, http:\/\/dx.doi.org\/10.1016\/j.ipl.2014.01.003","DOI":"10.1016\/j.ipl.2014.01.003"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"6","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical Reversibility of Computation. IBM Journal of Research and Development\u00a06, 525\u2013532 (1973)","journal-title":"IBM Journal of Research and Development"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e9rut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R., Lutz, E.: Experimental verification of Landauer\u2019s principle linking information and thermodynamics. Nature, 187\u2013189 (March 2012)","DOI":"10.1038\/nature10872"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Beth, T., R\u00f6tteler, M.: Quantum algorithms: Applicable Algebra and Quantum physics. In: Quantum Information, pp. 96\u2013150. Springer (2001)","DOI":"10.1007\/3-540-44678-8_4"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes. In: Crama, Y., Hammer, P. (eds.) Boolean Methods and Models, pp. 257\u2013397. Cambridge University Press (2010), http:\/\/www.math.univ-paris13.fr\/~carlet\/pubs.html","DOI":"10.1017\/CBO9780511780448.011"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0034850","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"S. Chee","year":"1996","unstructured":"Chee, S., Lee, S., Lee, D., Sung, S.H.: On the Correlation Immune Functions and Their Nonlinearity. In: Kim, K.-C., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 232\u2013243. Springer, Heidelberg (1996)"},{"key":"8_CR7","unstructured":"Chakrabory, K., Maitra, S.: Quantum algorithm to check Resiliency of a Boolean function. In: International Workshop on Coding and Cryptography (2013)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Deb, A., Das, D.K., Rahaman, H., Bhattacharya, B.B., Wille, R., Drechsler, R.: Reversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure. In: Workshop on Reversible Computation, pp. 182\u2013195 (2013)","DOI":"10.1007\/978-3-642-38986-3_15"},{"key":"8_CR9","unstructured":"Dillon, J.F.: Elementary Hadamard Difference Set, PhD Dissertation, University of Maryland, College Park, MD (1974)"},{"issue":"11","key":"8_CR10","first-page":"2317","volume":"25","author":"P. Gupta","year":"2006","unstructured":"Gupta, P., Agrawal, A., Jha, N.K.: An Algorithm for Synthesis of Reversible Logic Circuits. IEEE TCAD\u00a025(11), 2317\u20132330 (2006)","journal-title":"IEEE TCAD"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R. Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM Journal of Research and Development\u00a05, 183\u2013191 (1961)","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.dam.2005.03.014","volume":"154","author":"S. Maitra","year":"2006","unstructured":"Maitra, S., Pasalic, E.: A Maiorana\u2013McFarland type Construction for Resilient Boolean functions on n variables (n even) with nonlinearity. Discrete Applied Mathematics\u00a0154(2), 357\u2013369 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR13","unstructured":"Maslov, D.: Reversible Benchmarks (2014), http:\/\/webhome.cs.uvic.ca\/~dmaslov (last accessed March 2014)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Maslov, D., Mathew, J., Cheung, D., Pradhan, D.K.: An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2 m ) a . In: Quantum Information & Computation, pp. 610\u2013621 (2009)","DOI":"10.26421\/QIC9.7-8-4"},{"issue":"5","key":"8_CR15","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1049\/ip-cds:20045213","volume":"153","author":"D. Maslov","year":"2006","unstructured":"Maslov, D.: Efficient reversible and quantum implementations of symmetric Boolean functions. IEE Proceedings of Circuits, Devices and Systems\u00a0153(5), 467\u2013472 (2006)","journal-title":"IEE Proceedings of Circuits, Devices and Systems"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D. Maslov","year":"2008","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M., Negrevergne, C.: Quantum Circuit Simplification and Level Compaction. IEEE TCAD\u00a027(3), 436\u2013444 (2008), doi:10.1109\/TCAD.2007.911334","journal-title":"IEEE TCAD"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-47555-9_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"M. Matsui","year":"1993","unstructured":"Matsui, M., Yamagishi, A.: A new method for known plaintext attack of FEAL cipher. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 81\u201391. Springer, Heidelberg (1993)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A Transformation Based Algorithm for Reversible Logic Synthesis. In: Proceedings of DAC, pp. 318\u2013323 (2003)","DOI":"10.1145\/775832.775915"},{"key":"8_CR19","unstructured":"Moraga, C., Hadjam, F.Z.: On Double gates for Reversible Computing Circuits. In: Proceedings of International Workshop on Boolean Problems (2012)"},{"key":"8_CR20","unstructured":"Nayeem, N.M., Rice, J.E.: Improved ESOP-based Synthesis of Reversible Logic. In: Proceedings of the Reed-Muller Workshop (2011)"},{"issue":"3","key":"8_CR21","doi-asserted-by":"crossref","first-page":"282","DOI":"10.26421\/QIC8.3-4-4","volume":"8","author":"K.N. Patel","year":"2008","unstructured":"Patel, K.N., Markov, I.L., Hayes, J.P.: Optimal synthesis of linear reversible circuits. Quantum Information & Computation\u00a08(3), 282\u2013294 (2008)","journal-title":"Quantum Information & Computation"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S1571-0653(04)00167-2","volume":"6","author":"E. Pasalic","year":"2001","unstructured":"Pasalic, E., Maitra, S., Johansson, T., Sarkar, P.: New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity. Electronic Notes in Discrete Mathematics\u00a06, 158\u2013167 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"8_CR23","unstructured":"Perkowski, M., Kerntopf, P., Buller, A., Chrzanowska-Jeske, M., Mischenko, A., Song, X., Al-Rabadi, A., Jozwiak, L., Coppola, A., Massey, B.: Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits. In: Proceedings of IWLS, pp. 90\u201395 (2001)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Pieprzyk, J., Finkelstein, G.: Towards Effective Nonlinear Cryptosystem Design. In: Proceedings of IEEE Computers and Digital Techniques, vol.\u00a0135(6), pp. 143\u20137062 (November 1988) ISSN:0143-7062","DOI":"10.1049\/ip-e.1988.0044"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-46877-3_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"B. Preneel","year":"1991","unstructured":"Preneel, B., Van Leekwijck, W., Van Linden, L., Govaerts, R., Vandewalle, J.: Propagation characteristics of Boolean functions. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 161\u2013173. Springer, Heidelberg (1991)"},{"key":"8_CR26","unstructured":"Saeedi, M., Markov, I.L.: Synthesis and Optimization of Reversible Circuits - A Survey. CoRR abs\/1110.2574 (2011), http:\/\/arxiv.org\/abs\/1110.2574"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/3-540-45539-6_35","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P. Sarkar","year":"2000","unstructured":"Sarkar, P., Maitra, S.: Construction of nonlinear Boolean functions with important cryptographic properties. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 485\u2013506. Springer, Heidelberg (2000)"},{"key":"8_CR28","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: A toolkit for reversible circuit design. In: Workshop on Reversible Computation, pp. 69\u201372 (2010)"},{"key":"8_CR29","unstructured":"Szyprowski, M., Kerntopf, P.: Reducing Quantum Cost of Pairs of Multi-Control Toffoli Gates. In: International Workshop on Boolean Problems (2012)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Szyprowski, M., Kerntopf, P.: Low Quantum Cost Realization of Generalized Peres and Toffoli Gates with Multiple-Control Signals. In: 13th IEEE International Conference on Nanotechnology, pp. 802\u2013807 (2013)","DOI":"10.1109\/NANO.2013.6721034"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-45473-X_6","volume-title":"Fast Software Encryption","author":"Y.V. Tarannikov","year":"2002","unstructured":"Tarannikov, Y.V.: New Constructions of Resilient Boolean Functions with Maximal Nonlinearity. In: Matsui, M. (ed.) FSE 2001. LNCS, vol.\u00a02355, p. 66. Springer, Heidelberg (2002)"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: BDD-based Synthesis of Reversible Logic for Large Functions. In: Proceedings of DAC, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"issue":"2","key":"8_CR33","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1049\/ip-e.1989.0017","volume":"136","author":"R. Yarlagadda","year":"1989","unstructured":"Yarlagadda, R., Hershey, J.E.: Analysis and synthesis of bent sequences. IEEE Proceedings on Computers and Digital Techniques\u00a0136(2), 112\u2013123 (1989)","journal-title":"IEEE Proceedings on Computers and Digital Techniques"},{"key":"8_CR34","unstructured":"Younes, A.: Synthesis and Optimization of Reversible Circuits for Homogeneous Boolean Functions. arXiv:0710.0664 [quant-ph] (2007)"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, F., Hu, Y., Ma, H., Xie, M.: Constructions of Maiorana-McFarland\u2019s Bent Functions of Prescribed Degree. In: International Conference on Computational Intelligence and Security (CIS), pp. 315\u2013319 (2010)","DOI":"10.1109\/CIS.2010.157"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08494-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T14:49:32Z","timestamp":1649602172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08494-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084930","9783319084947"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08494-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}