{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:35:22Z","timestamp":1764981322456,"version":"3.46.0"},"reference-count":19,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    A multiplexer generator is a device that accepts two or more inputs and based on some logic sends one of them as output. In a special case when inputs to a multiplexer generator are\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2021-0027_eq_001.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msup>\n                            <m:mrow>\n                              <m:mn>2<\/m:mn>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>k<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msup>\n                        <\/m:math>\n                        <jats:tex-math>{2}^{k}<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    bits and one of them is selected according to the value of a\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2021-0027_eq_002.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi>k<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>k<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -bit number, a multiplexer generator can be regarded as a Boolean function in\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2021-0027_eq_003.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msup>\n                            <m:mrow>\n                              <m:mn>2<\/m:mn>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>k<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msup>\n                          <m:mo>+<\/m:mo>\n                          <m:mi>k<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>{2}^{k}+k<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    variables. We call this generator a multiplexer Boolean function. Boolean functions serve as combiners and filters in cryptographic designs. The study of their cryptographic strength attracts the cryptographer because of the extremely simple and cost effective of their design. The study of algebraic attacks on multiplexer generators is another major concern to judging the suitability for its use in cryptographic designs. In this article, we calculate the algebraic immunity of the multiplexer Boolean function, which is not an obvious task in the case of a Boolean function like a multiplexer generator.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2021-0027","type":"journal-article","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T06:22:30Z","timestamp":1657866150000},"page":"198-204","source":"Crossref","is-referenced-by-count":0,"title":["On the algebraic immunity of multiplexer Boolean functions"],"prefix":"10.1515","volume":"16","author":[{"given":"Prasanna R.","family":"Mishra","sequence":"first","affiliation":[{"name":"SAG, DRDO, Metcalfe House , Delhi 110054 , India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashi Kant","family":"Pandey","sequence":"additional","affiliation":[{"name":"Department of Mathematics, MSI, GGSIP University , Delhi 110058 , India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2022,7,15]]},"reference":[{"key":"2025120600292535303_j_jmc-2021-0027_ref_001","unstructured":"Horowitz P, Hill W. The art of electronics. 2nd edition. Cambridge University Press; 1980, (1989)."},{"key":"2025120600292535303_j_jmc-2021-0027_ref_002","doi-asserted-by":"crossref","unstructured":"Cusick TW, Stanica P. Cryptographic Boolean functions and applications. Amsterdam: Elsevier\/Academic Press; 2009.","DOI":"10.1016\/B978-0-12-374890-4.00009-4"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_003","unstructured":"Carlet C. Vectorial Boolean functions for cryptography. http:\/\/www.math.univ-paris13.fr\/ carlet\/chap-vectorial-fcts-corr.pdf."},{"key":"2025120600292535303_j_jmc-2021-0027_ref_004","doi-asserted-by":"crossref","unstructured":"Rothaus OS. On \u201cbent\u201d functions. J Combinatorial Theory Ser A. 1976;20(3):300\u20135.","DOI":"10.1016\/0097-3165(76)90024-8"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_005","doi-asserted-by":"crossref","unstructured":"Carlet C, Dobbertin H, Leander G. Normal extensions of bent functions. IEEE Trans Inform Theory. 2004;50(11):2880\u20135.","DOI":"10.1109\/TIT.2004.836681"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_006","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107 M, Gangopadhyay S, Paul G, Imai H. Generic cryptographic weakness of k-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128. Period Math Hungar. 2012;65(2):205\u201327.","DOI":"10.1007\/s10998-012-4631-8"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_007","doi-asserted-by":"crossref","unstructured":"Meier W, Pasalic E, Carlet C, Algebraic attacks and decomposition of Boolean functions. In: Advances in cryptology\u2013EUROCRYPT 2004, Lecture Notes in Computer Science. Vol. 3027. Berlin: Springer; 2004. p. 474\u201391.","DOI":"10.1007\/978-3-540-24676-3_28"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_008","doi-asserted-by":"crossref","unstructured":"Courtois NT, Meier W. Algebraic attacks on stream ciphers with linear feedback. In: Advances in cryptology\u2013EUROCRYPT 2003. Lecture Notes in Computer Science. Vol. 2656. Berlin: Springer; 2003. p. 345\u201359.","DOI":"10.1007\/3-540-39200-9_21"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_009","doi-asserted-by":"crossref","unstructured":"Goli\u0107 JDj, Morgari G. Optimal correlation attack on the multiplexer generator. Inform Process Lett. 2009;109(15):838\u201341.","DOI":"10.1016\/j.ipl.2009.04.009"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_010","unstructured":"Sulaiman HA, Othman MA, Othman MF, AbdRahim Y, Pee NC. Advanced Computer and Communication Engineering Technology: Proceedings of ICOCOE 2015, eBook ISBN 978-3-319-24584-3, Lecture Notes in Electrical Engineering. Vol. 362; 2016."},{"key":"2025120600292535303_j_jmc-2021-0027_ref_011","doi-asserted-by":"crossref","unstructured":"Carlet C, Dalai DK, Gupta KC, Maitra S. Algebraic immunity for cryptographically significant Boolean functions: analysis and construction. IEEE Trans Inform Theory. 2006;52(7):3105\u201321.","DOI":"10.1109\/TIT.2006.876253"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_012","doi-asserted-by":"crossref","unstructured":"Nyberg K. Perfect nonlinear S-boxes. In: Advances in cryptology\u2013EUROCRYPT \u201991 (Brighton, 1991), Lecture Notes in Computer Science. Vol. 547. Berlin: Springer: 1991. p. 378\u201386.","DOI":"10.1007\/3-540-46416-6_32"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_013","doi-asserted-by":"crossref","unstructured":"Nyberg K. On the construction of highly nonlinear permutations. In: Advances in cryptology-EUROCRYPT \u201992 (Balatonf\u00fcred, 1992), Lecture Notes in Computer Science. Vol. 658. Berlin: Springer; 1992. p. 92\u20138.","DOI":"10.1007\/3-540-47555-9_8"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_014","doi-asserted-by":"crossref","unstructured":"Beelen P, Leander G. A new construction of highly nonlinear S-boxes. Cryptogr Commun. 2012;4(1):65\u201377.","DOI":"10.1007\/s12095-011-0052-4"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_015","doi-asserted-by":"crossref","unstructured":"Kavut S, Y\u00fccel MD. Generalized rotation symmetric and dihedral symmetric Boolean functions-9 variable Boolean functions with nonlinearity 242. In: Applied algebra, algebraic algorithms and error-correcting codes, Lecture Notes in Computer Science. Vol. 4851. Berlin: Springer; 2007. p. 321\u20139.","DOI":"10.1007\/978-3-540-77224-8_37"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_016","doi-asserted-by":"crossref","unstructured":"Pasalic E. A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation. Cryptogr Commun. 2012;4(1):25\u201345.","DOI":"10.1007\/s12095-011-0057-z"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_017","doi-asserted-by":"crossref","unstructured":"Zhang X-M, Zheng Y. Cryptographically resilient functions. IEEE Trans Inform Theory. 1997;43(5):1740\u20137.","DOI":"10.1109\/18.623184"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_018","doi-asserted-by":"crossref","unstructured":"Wang Q, Carlet C, Stanica P, Tan CH. Cryptographic properties of the hidden weighted bit function. Discrete Appl Math. 2014;174:1\u201310.","DOI":"10.1016\/j.dam.2014.01.010"},{"key":"2025120600292535303_j_jmc-2021-0027_ref_019","doi-asserted-by":"crossref","unstructured":"Carlet C, Feng K. An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Advances in cryptology-ASIACRYPT 2008, Lecture Notes in Computer Science. Vol. 5350. Berlin: Springer; 2008. p. 425\u201340.","DOI":"10.1007\/978-3-540-89255-7_26"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2021-0027\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2021-0027\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:30:23Z","timestamp":1764981023000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2021-0027\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":19,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,2,10]]},"published-print":{"date-parts":[[2022,2,10]]}},"alternative-id":["10.1515\/jmc-2021-0027"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2021-0027","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}