{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T20:51:50Z","timestamp":1779223910257,"version":"3.51.4"},"reference-count":69,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019045","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T23:53:48Z","timestamp":1561161228000},"page":"779-843","source":"Crossref","is-referenced-by-count":32,"title":["Cryptographically significant mds matrices over finite fields: A brief survey and some generalized results"],"prefix":"10.3934","volume":"13","author":[{"given":"Kishan Chand","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit Kumar","family":"Pandey","sequence":"additional","affiliation":[{"name":"Ashoka University, Sonepat, Haryana, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indranil Ghosh","family":"Ray","sequence":"additional","affiliation":[{"name":"School of Engineering and Mathematical Sciences, City University London, London EC1V 0HB, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanta","family":"Samanta","sequence":"additional","affiliation":[{"name":"Applied Statistics Unit, Indian Statistical Institute, 203, B.T. Road, Kolkata-700108, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019045-1","doi-asserted-by":"crossref","unstructured":"

D. Augot and M. Finiasz, Exhaustive search for small dimension recursive MDS diffusion layers or block ciphers and hash functions, In Proc. of the 2013 IEEE International Symposium on Information Theory<\/i>, IEEE, 2013, 1551\u20131555.<\/p>","DOI":"10.1109\/ISIT.2013.6620487"},{"key":"key-10.3934\/amc.2019045-2","doi-asserted-by":"crossref","unstructured":"

D. Augot and M. Finiasz, Direct construction of recursive mds diffusion layers using shortened BCH codes, In FSE 2014<\/i>, LNCS, Springer, 8540<\/b> (2015), 3\u201317, Also available http:\/\/eprint.iacr.org\/2014\/566.pdf<\/a>.<\/p>","DOI":"10.1007\/978-3-662-46706-0_1"},{"key":"key-10.3934\/amc.2019045-3","unstructured":"

P. S. L. M. Barreto and V. Rijmen, The Khazad Legacy-Level Block Cipher, Submission to the NESSIE<\/i> Project, 2000. Available at https:\/\/www.cosic.esat.kuleuven.be\/nessie\/workshop\/submissions.html<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019045-4","unstructured":"

P. S. L. M. Barreto and V. Rijmen, The Anubis block cipher, Submission to the NESSIE<\/i> Project, 2000. Available at https:\/\/www.cosic.esat.kuleuven.be\/nessie\/workshop\/submissions.html<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019045-5","unstructured":"

P. S. L. M. Barreto and V. Rijmen, The Whirlpool hashing function, In Proceedings of the 1st NESSIE<\/i> Workshop, 15 pages, 2000. Available at https:\/\/www.cosic.esat.kuleuven.be\/nessie\/workshop\/submissions.html<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019045-6","doi-asserted-by":"crossref","unstructured":"

C. Beierle, T. Kranz and G. Leander, Lightweight multiplication in $GF(2^n)$ with applications to MDS matrices, Advances in cryptology\u2013CRYPTO 2016. Part I<\/i>, 625\u2013653, Lecture Notes in Comput. Sci., 9814, Springer, Berlin, 2016.<\/p>","DOI":"10.1007\/978-3-662-53018-4_23"},{"key":"key-10.3934\/amc.2019045-7","doi-asserted-by":"crossref","unstructured":"

T. P. Berger, Construction of recursive MDS diffusion layers from gabidulin codes, In INDOCRYPT 2013<\/i>, LNCS, Springer, 8250<\/b> (2013), 274\u2013285.<\/p>","DOI":"10.1007\/978-3-319-03515-4_18"},{"key":"key-10.3934\/amc.2019045-8","unstructured":"

T. P. Berger and A. Ourivski, Construction of new MDS codes from Gabidulin codes, In Proceedings of ACCT 2009<\/i>, Kranevo, Bulgaria, 40\u201347, June, 2004.<\/p>"},{"key":"key-10.3934\/amc.2019045-9","doi-asserted-by":"crossref","unstructured":"

W. Bosma, J. Cannon and C. Playoust, The magma algebra system I: The user language, J. Symbolic Comput<\/i>, 24<\/b> (1997), 235\u2013265, Computational algebra and number theory (London, 1993).<\/p>","DOI":"10.1006\/jsco.1996.0125"},{"key":"key-10.3934\/amc.2019045-10","doi-asserted-by":"crossref","unstructured":"

G. Castagnoli, J. L. Massey, P. A. Schoeller and N. von Seeman, On repeated-root cyclic codes, In IEEE Transactions on Inform. Theory<\/i>, 37<\/b> (1991), 337\u2013342.<\/p>","DOI":"10.1109\/18.75249"},{"key":"key-10.3934\/amc.2019045-11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0520-3"},{"key":"key-10.3934\/amc.2019045-12","doi-asserted-by":"crossref","unstructured":"

J. Choy, H. Yap, K. Khoo, J. Guo, T. Peyrin, A. Poschmann and C. H. Tan, SPN-hash: Improving the provable resistance against differential collision attacks, Progress in cryptology\u2013AFRICACRYPT 2012<\/i>, 270\u2013286, Lecture Notes in Comput. Sci., 7374, Springer, Heidelberg, 2012.<\/p>","DOI":"10.1007\/978-3-642-31410-0_17"},{"key":"key-10.3934\/amc.2019045-13","doi-asserted-by":"crossref","unstructured":"

T. Cui, C. Jin and Z. Kong, On compact cauchy matrices for substitution-permutation networks, In IEEE Transactions on Computers<\/i>, 64<\/b> (2015), 2098\u20132102.<\/p>","DOI":"10.1109\/TC.2014.2346180"},{"key":"key-10.3934\/amc.2019045-14","doi-asserted-by":"crossref","unstructured":"

J. Daemen, L. R. Knudsen and V. Rijmen, The block cipher SQUARE, In 4th Fast Software Encryption<\/i> Workshop, LNCS, 1267<\/b> (1997), 149\u2013165, Springer-Verlag.<\/p>","DOI":"10.1007\/BFb0052343"},{"key":"key-10.3934\/amc.2019045-15","doi-asserted-by":"crossref","unstructured":"

J. Daemen and V. Rijmen, The Design of Rijndael: AES - The Advanced Encryption Standard<\/i>, Springer-Verlag, 2002.<\/p>","DOI":"10.1007\/978-3-662-04722-4_1"},{"key":"key-10.3934\/amc.2019045-16","unstructured":"

G. D. Filho, P. Barreto and V. Rijmen, The Maelstrom-0 Hash Function, In Proceedings of the 6th Brazilian Symposium on Information and Computer Systems Security, 2006.<\/p>"},{"key":"key-10.3934\/amc.2019045-17","unstructured":"

P. Gauravaram, L. R. Knudsen, K. Matusiewicz, F. Mendel, C. Rechberger, M. Schlaffer and S. Thomsen, Gr$\\phi$stl a SHA-3 Candidate, Submission to NIST, 2008, Available at http:\/\/www.groestl.info\/<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019045-18","doi-asserted-by":"crossref","unstructured":"

R. M. Gray, Toeplitz and Circulant Matrices: A Review<\/i> Foundations and Trends in Communications and Information Theory, NOW, 2005.<\/p>","DOI":"10.1561\/9781933019680"},{"key":"key-10.3934\/amc.2019045-19","doi-asserted-by":"crossref","unstructured":"

J. Guo, T. Peyrin and A. Poschmann, The PHOTON family of lightweight hash functions, In CRYPTO<\/i>, Springer, 2011<\/b> (2011), 222\u2013239.<\/p>","DOI":"10.1007\/978-3-642-22792-9_13"},{"key":"key-10.3934\/amc.2019045-20","doi-asserted-by":"crossref","unstructured":"

J. Guo, T. Peyrin, A. Poshmann and M. J. B. Robshaw, The LED block cipher, In CHES 2011<\/i>, LNCS, 6917<\/b> (2011), 326\u2013341, Springer.<\/p>","DOI":"10.1007\/978-3-642-23951-9_22"},{"key":"key-10.3934\/amc.2019045-21","doi-asserted-by":"crossref","unstructured":"

K. C. Gupta and I. G. Ray, On constructions of involutory MDS matrices, Progress in cryptology\u2013AFRICACRYPT 2013<\/i>, 7918<\/b> (2013), 43\u201360.<\/p>","DOI":"10.1007\/978-3-642-38553-7_3"},{"key":"key-10.3934\/amc.2019045-22","doi-asserted-by":"crossref","unstructured":"

K. C. Gupta and I. G. Ray, On constructions of MDS matrices from companion matrices for lightweight cryptography, In CD-ARES 2013 Workshops: MoCrySEn<\/i>, Springer, 8128<\/b> (2013), 29\u201343.<\/p>","DOI":"10.1007\/978-3-642-40588-4_3"},{"key":"key-10.3934\/amc.2019045-23","doi-asserted-by":"crossref","unstructured":"

K. C. Gupta and I. G. Ray, On constructions of circulant MDS matrices for lightweight cryptography, In ISPEC 2014<\/i>, Springer, 2014, 564\u2013576.<\/p>","DOI":"10.1007\/978-3-319-06320-1_41"},{"key":"key-10.3934\/amc.2019045-24","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-014-0116-3"},{"key":"key-10.3934\/amc.2019045-25","unstructured":"

K. C. Gupta, S. K. Pandey and A. Venkateswarlu, Towards a general construction of recursive MDS diffusion layers, In WCC2015<\/i>, https:\/\/hal.inria.fr\/hal-01276436<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019045-26","doi-asserted-by":"crossref","unstructured":"

K. C. Gupta, S. K. Pandey and A. Venkateswarlu, On the direct construction of recursiveMDS matrices, In Des. Codes Crypto<\/i>., 82<\/b> (2017), 77\u201394.<\/p>","DOI":"10.1007\/s10623-016-0233-4"},{"key":"key-10.3934\/amc.2019045-27","doi-asserted-by":"crossref","unstructured":"

K. C. Gupta, S. K. Pandey and A. Venkateswarlu, Towards a general construction of recursiveMDS diffusion layers, In Des. Codes Crypto<\/i>., 82<\/b> (2017), 179\u2013195.<\/p>","DOI":"10.1007\/s10623-016-0261-0"},{"key":"key-10.3934\/amc.2019045-28","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0582-2"},{"key":"key-10.3934\/amc.2019045-29","doi-asserted-by":"crossref","unstructured":"

H. Han and H. Zhang, The research on the maximum branch number of P-permutations, 2010 2nd International Workshop on Intelligent Systems and Applications<\/i>, Wuhan, 2010, 1\u20134.<\/p>","DOI":"10.1109\/IWISA.2010.5473354"},{"key":"key-10.3934\/amc.2019045-30","doi-asserted-by":"crossref","unstructured":"

H. M. Heys and S. E. Tavares, The design of substitution-permutation networks resistant to differential and linear cryptanalysis, Proceedings of 2nd ACM Conference on Computer and Communications Security<\/i>, Fairfax, Virginia, 1994, 148\u2013155.<\/p>","DOI":"10.1145\/191177.191206"},{"key":"key-10.3934\/amc.2019045-31","doi-asserted-by":"publisher","DOI":"10.1109\/12.464391"},{"key":"key-10.3934\/amc.2019045-32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02254789"},{"key":"key-10.3934\/amc.2019045-33","doi-asserted-by":"crossref","unstructured":"

J. W. P. Hirschfeld, The main conjecture for MDS codes, Cryptography and Coding (Cirencester, 1995)<\/i>,, Lecture Notes in Comput. Sci., 1025<\/b> (1995), 44\u201352.<\/p>","DOI":"10.1007\/3-540-60693-9_7"},{"key":"key-10.3934\/amc.2019045-34","doi-asserted-by":"crossref","unstructured":"

P. Junod and S. Vaudenay, Perfect diffusion primitives for block ciphers building efficient MDS matrices, Selected Areas in Cryptography<\/i>, 84\u201399, Lecture Notes in Comput. Sci., 3357, Springer, Berlin, 2005.<\/p>","DOI":"10.1007\/978-3-540-30564-4_6"},{"key":"key-10.3934\/amc.2019045-35","doi-asserted-by":"crossref","unstructured":"

P. Junod and S. Vaudenay, FOX: A new family of block ciphers, Selected Areas in Cryptography<\/i>, 114\u2013129, Lecture Notes in Comput. Sci., 3357, Springer, Berlin, 2005.<\/p>","DOI":"10.1007\/978-3-540-30564-4_8"},{"key":"key-10.3934\/amc.2019045-36","doi-asserted-by":"crossref","unstructured":"

P. Junod and M. Macchetti, Revisiting the IDEA philosophy, International Workshop on Fast Software Encryption, FSE 2009: Fast Software Encryption<\/i>, Lecture Notes in Computer Science, 5665<\/b> (2009), 277\u2013295.<\/p>","DOI":"10.1007\/978-3-642-03317-9_17"},{"key":"key-10.3934\/amc.2019045-37","doi-asserted-by":"crossref","unstructured":"

K. Khoo, T. Peyrin, A. Y. Poschmann and H. Yap, FOAM: Searching for hardware-optimal SPN structures and components with a fair comparison, In Lejla Batina and Matthew Robshaw, editors, Cryptographic Hardware and Embedded Systems-CHES 2014<\/i>, volume 8731 of Lecture Notes in Computer Science, pages 433\u2013450. Springer Berlin Heidelberg, 2014.<\/p>","DOI":"10.1007\/978-3-662-44709-3_24"},{"key":"key-10.3934\/amc.2019045-38","doi-asserted-by":"crossref","unstructured":"

N. Kolokotronis, K. Limniotis and N. Kalouptsidis, Factorization of determinants over finitefields and application in stream ciphers, In Cryptogr. Commun<\/i>., 1<\/b> (2009), 175\u2013205.<\/p>","DOI":"10.1007\/s12095-008-0005-8"},{"key":"key-10.3934\/amc.2019045-39","doi-asserted-by":"publisher","DOI":"10.1090\/noti804"},{"key":"key-10.3934\/amc.2019045-40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24633-6_11"},{"key":"key-10.3934\/amc.2019045-41","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.833807"},{"key":"key-10.3934\/amc.2019045-42","doi-asserted-by":"crossref","unstructured":"

R. Lidl and H. Niederreiter, Finite Fields<\/i>, Cambridge University Press, Cambridge, 2ndedition, 1997.<\/p>","DOI":"10.1017\/CBO9780511525926"},{"key":"key-10.3934\/amc.2019045-43","doi-asserted-by":"publisher","DOI":"10.1109\/18.75250"},{"key":"key-10.3934\/amc.2019045-44","doi-asserted-by":"crossref","unstructured":"

M. Liu and S. M. Sim, Lightweight MDS generalized circulant matrices, International Conference on Fast Software Encryption<\/i>, Lecture Notes in Computer Science, 9783<\/b> (2016), 101\u2013120. Springer, Berlin, Heidelberg.<\/p>","DOI":"10.1007\/978-3-662-52993-5_6"},{"key":"key-10.3934\/amc.2019045-45","unstructured":"

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes<\/i>, North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977.<\/p>"},{"key":"key-10.3934\/amc.2019045-46","doi-asserted-by":"crossref","unstructured":"

F. Mattoussi, V. Roca and B. Sayadi, Complexity comparison of the use of Vandermonde versus Hankel matrices to build systematic MDS Reed-Solomon codes, 2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Cesme, 2012, 344\u2013348.<\/p>","DOI":"10.1109\/SPAWC.2012.6292924"},{"key":"key-10.3934\/amc.2019045-47"},{"key":"key-10.3934\/amc.2019045-48","doi-asserted-by":"crossref","unstructured":"

M. K. Pehlivano\u01e7lu, M. T. Sakalli, S. Akleylek, N. Duru and V. Rijmen, Generalisation ofHadamard matrix to generate involutory MDS matrices for lightweight cryptography, In IETInformation Security<\/i>, 12<\/b> (2018), 348\u2013355.<\/p>","DOI":"10.1049\/iet-ifs.2017.0156"},{"key":"key-10.3934\/amc.2019045-49","unstructured":"

A. R. Rao and P. Bhimasankaram, Linear Algebra<\/i>, Second Edition, Hindustan Book Agency.<\/p>"},{"key":"key-10.3934\/amc.2019045-50","doi-asserted-by":"crossref","unstructured":"

V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers and E. D. Win, The cipher SHARK, In 3rd Fast Software Encryption Workshop<\/i>, LNCS, 1039<\/b> (1996), 99\u2013111, Springer-Verlag.<\/p>","DOI":"10.1007\/3-540-60865-6_47"},{"key":"key-10.3934\/amc.2019045-51","doi-asserted-by":"crossref","unstructured":"

R. M. Roth and G. Seroussi, On generator matrices of MDS codes, In IEEE Transactions onInformation Theory<\/i>, 31<\/b> (1985), 826\u2013830.<\/p>","DOI":"10.1109\/TIT.1985.1057113"},{"key":"key-10.3934\/amc.2019045-52","doi-asserted-by":"crossref","unstructured":"

R. M. Roth and A. Lempel, On MDS codes via Cauchy matrices, In IEEE Transactions onInformation Theory<\/i>, 35<\/b> (1989), 1314\u20131319.<\/p>","DOI":"10.1109\/18.45291"},{"key":"key-10.3934\/amc.2019045-53","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9578-x"},{"key":"key-10.3934\/amc.2019045-54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34047-5_22"},{"key":"key-10.3934\/amc.2019045-55"},{"key":"key-10.3934\/amc.2019045-56","doi-asserted-by":"crossref","unstructured":"

S. Sarkar and H. Syed, Analysis of toeplitz MDS matrices, ACISP 2017<\/i>, LNCS, 10343<\/b> (2017), 3\u201318.<\/p>","DOI":"10.1007\/978-3-319-59870-3_1"},{"key":"key-10.3934\/amc.2019045-57","unstructured":"

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall and N. Ferguson, Twofish: A 128-bit block cipher, In the first AES Candidate Conference. National Institute for Standards and Technology, 1998.<\/p>"},{"key":"key-10.3934\/amc.2019045-58","unstructured":"

B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall and N. Ferguson, The Twofish encryption algorithm, Wiley, 1999.<\/p>"},{"key":"key-10.3934\/amc.2019045-59","doi-asserted-by":"crossref","unstructured":"

C. Schnorr and S. Vaudenay, Black box cryptanalysis of hash networks based on multipermutations, Advances in cryptology\u2013EUROCRYPT '94 (Perugia)<\/i>, Proceedings, LNCS, Springer-Verlag, 950<\/b> (1995), 47\u201357.<\/p>","DOI":"10.1007\/BFb0053423"},{"key":"key-10.3934\/amc.2019045-60","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"key-10.3934\/amc.2019045-61","unstructured":"

T. Shirai and K. Shibutani, On the diffusion matrix employed in the Whirlpool hashing function, NESSIE<\/i> public report, 2003. Available at https:\/\/www.cosic.esat.kuleuven.be\/nessie\/reports\/phase2\/whirlpool-20030311.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019045-62","doi-asserted-by":"crossref","unstructured":"

T. Shirai, K. Shibutani, T. Akishita, S. Moriai and T. Iwata, The 128-Bit blockcipher CLEFIA (Extended Abstract), Fnternational Workshop on Fast Software Encryption<\/i>, Lecture Notes in Computer Science, 4593<\/b> (2017), 181\u2013195, Springer, Berlin, Heidelberg<\/p>","DOI":"10.1007\/978-3-540-74619-5_12"},{"key":"key-10.3934\/amc.2019045-63","doi-asserted-by":"crossref","unstructured":"

S. M. Sim, K. Khoo, F. Oggier and T. Peyrin, Lightweight MDS Involution Matrices, FSE 2015: Fast Software Encryption<\/i>, Lecture Notes in Computer Science, 9054<\/b> (2015), 471\u2013493. Springer, Berlin, Heidelberg.<\/p>","DOI":"10.1007\/978-3-662-48116-5_23"},{"key":"key-10.3934\/amc.2019045-64","doi-asserted-by":"crossref","unstructured":"

D. Toh, J. Teo, K. Khoo and S. Sim, Lightweight MDS Serial-Type Matrices with Minimal Fixed XOR Count, In AFRICACRYPT 2018<\/i>, LNCS, 10831<\/b> (2018), 51\u201371.<\/p>","DOI":"10.1007\/978-3-319-89339-6_4"},{"key":"key-10.3934\/amc.2019045-65","doi-asserted-by":"crossref","unstructured":"

S. Vaudenay, On the need for multipermutations: Cryptanalysis of MD4 and SAFER, Fast Software Encryption<\/i>, Proceedings, LNCS, 108<\/b> (1995), 286\u2013297. Springer-Verlag, 1995.<\/p>","DOI":"10.1007\/3-540-60590-8_22"},{"key":"key-10.3934\/amc.2019045-66","doi-asserted-by":"crossref","unstructured":"

D. Watanabe, S. Furuya, H. Yoshida, K. Takaragi and B. Preneel, A new keystream generator MUGI, FSE 2002: Fast Software Encryption<\/i>, Springer Berlin\/Heidelberg, 2365<\/b> (2002), 179\u2013194.<\/p>","DOI":"10.1007\/3-540-45661-9_14"},{"key":"key-10.3934\/amc.2019045-67","doi-asserted-by":"crossref","unstructured":"

S. Wu, M. Wang and W. Wu, Recursive diffusion layers for (lightweight) block ciphers and hash functions, SAC 2012: Selected Areas in Cryptography<\/i>, LNCS, Springer-Verlag Berlin Heidelberg, 7707<\/b> (2013), 355\u2013371.<\/p>","DOI":"10.1007\/978-3-642-35999-6_23"},{"key":"key-10.3934\/amc.2019045-68","unstructured":"

A. M. Youssef, S. E. Tavares and H. M. Heys, A New Class of Substitution Permutation Networks, Workshop on Selected Areas in Cryptography<\/i>, SAC '96, Workshop Record, (1996), 132\u2013147.<\/p>"},{"key":"key-10.3934\/amc.2019045-69","unstructured":"

A. M. Youssef, S. Mister and S. E. Tavares, On the Design of Linear Transformations for Substitution Permutation Encryption Networks, In Workshop On Selected Areas in Cryptography<\/i>, SAC, 97<\/b> (1997), 40\u201348.<\/p>"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:09:22Z","timestamp":1772791762000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019045","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}