{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:02:31Z","timestamp":1772442151632,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030252823","type":"print"},{"value":"9783030252830","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25283-0_11","type":"book-chapter","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T14:02:57Z","timestamp":1563544977000},"page":"191-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Generation of 8-Bit S-Boxes Having Almost Optimal Cryptographic Properties Using Smaller 4-Bit S-Boxes and Finite Field Multiplication"],"prefix":"10.1007","author":[{"given":"Reynier Antonio","family":"de la Cruz Jim\u00e9nez","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,20]]},"reference":[{"key":"11_CR1","unstructured":"Agievich S., Afonenko A.: Exponential s-boxes. Cryptology ePrint Archive, Report 2004\/024 (2004). http:\/\/eprint.iacr.org\/2004\/024"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44983-3_4","volume-title":"Selected Areas in Cryptography","author":"K Aoki","year":"2001","unstructured":"Aoki, K., et al.: Camellia: a 128-bit block cipher suitable for multiple platforms \u2014 design and analysis. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 39\u201356. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44983-3_4"},{"key":"11_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11787006_16","volume-title":"ICALP 2006, Part II","author":"F Armknecht","year":"2006","unstructured":"Armknecht, F., Krause, M.: Constructing single and multioutput Boolean functions with maximal algebraic immunity. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 180\u2013191. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_16"},{"key":"11_CR4","unstructured":"Barreto, P., Rijmen, V.: The Khazad legacy-level block cipher. Primitive submitted to NESSIE (2000)"},{"key":"11_CR5","unstructured":"Barreto, P., Rijmen, V.: The Whirlpool hashing function. In: First open NESSIE Workshop, Leuven, Belgium, vol. 13 (2000)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., Stutz, G.: Threshold Implementations of all 3 $$\\times $$ 3 and 4 $$\\times $$ 4 S-Boxes, http:\/\/eprint.iacr.org\/2012\/300\/ (2012)","DOI":"10.1007\/978-3-642-33027-8_5"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-39887-5_21","volume-title":"Fast Software Encryption","author":"A Biryukov","year":"2003","unstructured":"Biryukov, A., De Canni\u00e8re, C.: Block ciphers and systems of quadratic equations. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 274\u2013289. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_21"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-662-49890-3_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Biryukov","year":"2016","unstructured":"Biryukov, A., Perrin, L., Udovenko, A.: Reverse-engineering the S-box of Streebog, Kuznyechik and STRIBOBr1. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 372\u2013402. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_15"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-31301-6_22","volume-title":"Selected Areas in Cryptography - SAC 2015","author":"A Canteaut","year":"2016","unstructured":"Canteaut, A., Duval, S., Leurent, G.: Construction of lightweight S-boxes using Feistel and MISTY structures. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 373\u2013393. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31301-6_22"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Vectorial Boolean functions for cryptography. Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press, New York (2010)","DOI":"10.1017\/CBO9780511780448.012"},{"key":"11_CR11","series-title":"Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes","first-page":"104","volume-title":"On the Algebraic Immunities and Higher Order Nonlinearities of Vectorial Boolean Functions","author":"C Carlet","year":"2009","unstructured":"Carlet, C.: On the Algebraic Immunities and Higher Order Nonlinearities of Vectorial Boolean Functions. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, pp. 104\u2013116. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF03037656","volume":"23","author":"JA Clark","year":"2005","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S.: The design of s-boxes by simulated annealing. New Gener. Comput. Arch. 23(3), 219\u2013231 (2005)","journal-title":"New Gener. Comput. Arch."},{"key":"11_CR13","first-page":"267","volume-title":"Lecture Notes in Computer Science","author":"Nicolas T. Courtois","year":"2002","unstructured":"Courtois, N.T., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Over defined Systems of Equations. http:\/\/eprint.iacr.org\/2002\/044\/ (2002)"},{"key":"11_CR14","unstructured":"De Canni\u00e8re, C.: Analysis and design of symmetric encryption algorithms, Ph.D. thesis (2007)"},{"key":"11_CR15","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H Freeman and Company, San Francisco (1979)"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/scientificamerican0573-15","volume":"228","author":"H Feistel","year":"1973","unstructured":"Feistel, H.: Cryptography and computer privacy. Sci. Am. 228(5), 15\u201323 (1973)","journal-title":"Sci. Am."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-39887-5_7","volume-title":"Fast Software Encryption","author":"J Fuller","year":"2003","unstructured":"Fuller, J., Millan, W.: Linear redundancy in S-boxes. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 74\u201386. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_7"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-40349-1_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"B G\u00e9rard","year":"2013","unstructured":"G\u00e9rard, B., Grosso, V., Naya-Plasencia, M., Standaert, F.-X.: Block ciphers that are easier to mask: how far can we go? In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 383\u2013399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_22"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-68339-9_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"JD Goli\u0107","year":"1996","unstructured":"Goli\u0107, J.D.: Fast low order approximation of cryptographic functions. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 268\u2013282. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_24"},{"key":"11_CR20","unstructured":"GOST R 34.12-2015 Information technology. Cryptographic protection of information. Block ciphers. Moscow, Standartinform (2015)"},{"key":"11_CR21","unstructured":"GOST R 34.11-2012 Information technology. Cryptographic protection of information. Hash function. Moscow, Standartinform (2012)"},{"key":"11_CR22","first-page":"127","volume-title":"IFIP International Federation for Information Processing","author":"Sylvain Guilley","year":"2004","unstructured":"Guilley, S., Hoogvorst, P., Pacalet, R.: Differential power analysis model and some results. In: CARDIS, pp. 127\u2013142 (2004)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Hirata, K.: The 128-bit block cipher HyRAL (hybrid randomization algorithm): common keyblock cipher. In: International Symposium on Intelligence Information Processing and Trusted Computing, pp. 9\u201314, October 2010","DOI":"10.1109\/IPTC.2010.179"},{"issue":"1","key":"11_CR24","first-page":"1","volume":"6","author":"H Isa","year":"2016","unstructured":"Isa, H., Jamil, N., Z\u2019aba, M.: Hybrid heuristic methods in constructing cryptographically strong S-boxes. Int. J. Cryptol. Res. 6(1), 1\u201315 (2016)","journal-title":"Int. J. Cryptol. Res."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-29172-7_3","volume-title":"Cryptography and Information Security in the Balkans","author":"G Ivanov","year":"2016","unstructured":"Ivanov, G., Nikolov, N., Nikova, S.: Cryptographically strong S-boxes generated by modified immune algorithm. In: Pasalic, E., Knudsen, L.R. (eds.) BalkanCryptSec 2015. LNCS, vol. 9540, pp. 31\u201342. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29172-7_3"},{"key":"11_CR26","unstructured":"Ivanov, G., Nikolov, N., Nikova, S.: Reversed genetic algorithms for generation of bijective S-Boxes with good cryptographic properties. IACR Cryptology ePrint Archive (2014), Report 2014\/801, http:\/\/eprint.iacr.org\/2014\/801.pdf"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Izbenko, Y., Kovtun, V., Kuznetsov, A.: The Design of Boolean Functions by Modified Hill Climbing Method. http:\/\/eprint.iacr.org\/2008\/111.pdf","DOI":"10.1109\/ITNG.2009.102"},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"71","DOI":"10.4213\/mvk118","volume":"5","author":"OV Kazymyrov","year":"2014","unstructured":"Kazymyrov, O.V., Kazymyrova, V.N., Oliynykov, R.V.: A method for generation of high-nonlinear S-Boxes based on gradient descent. Mat. Vopr. Kriptogr. 5(2), 71\u201378 (2014)","journal-title":"Mat. Vopr. Kriptogr."},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-60590-8_16","volume-title":"Fast Software Encryption","author":"LR Knudsen","year":"1995","unstructured":"Knudsen, L.R.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196\u2013211. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_16"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-540-24691-6_32","volume-title":"Information Security and Cryptology - ICISC 2003","author":"D Kwon","year":"2004","unstructured":"Kwon, D., et al.: New block cipher: ARIA. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 432\u2013445. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24691-6_32"},{"key":"11_CR31","unstructured":"Menyachikhin, A.: Spectral-linear and spectral-difference methods for generating cryptographically strong S-Boxes. In: Pre-proceedings of CTCrypt 2016, Yaroslavl, Russia, pp. 232\u2013252 (2016)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BFb0053732","volume-title":"Information Security and Privacy","author":"W Millan","year":"1998","unstructured":"Millan, W.: How to improve the nonlinearity of bijective S-boxes. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 181\u2013192. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053732"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-47942-0_22","volume-title":"Information and Communication Security","author":"W Millan","year":"1999","unstructured":"Millan, W., Burnett, L., Carter, G., Clark, A., Dawson, E.: Evolutionary heuristics for finding cryptographically strong S-boxes. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 263\u2013274. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-47942-0_22"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0032354","volume-title":"Cryptography: Policy and Algorithms","author":"W Millan","year":"1996","unstructured":"Millan, W.: Low order approximation of cipher functions. In: Dawson, E., Goli\u0107, J. (eds.) CPA 1995. LNCS, vol. 1029, pp. 144\u2013155. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0032354"},{"key":"11_CR35","unstructured":"NIST: Advanced Encryption Standard. Federal Information Processing Standard (FIPS) 197, November 2001"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-48285-7_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"K Nyberg","year":"1994","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55\u201364. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_6"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-44983-3_6","volume-title":"Selected Areas in Cryptography","author":"K Ohkuma","year":"2001","unstructured":"Ohkuma, K., Muratani, H., Sano, F., Kawamura, S.: The block cipher hierocrypt. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 72\u201388. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44983-3_6"},{"key":"11_CR38","unstructured":"Oliynykov R., et al.: DSTU 7624:2014. National Standard of Ukraine. Information technologies. Cryptographic data security. Symmetric block transformation algorithm. Ministry of Economical Development and Trade of Ukraine (2015)"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11502760_29","volume-title":"Fast Software Encryption","author":"E Prouff","year":"2005","unstructured":"Prouff, E.: DPA attacks and S-boxes. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 424\u2013441. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11502760_29"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Qu, L., Tan, Y., Li, C., Gong, G.: More constructions of differentially 4-uniform permutations on $$\\mathbb{F}_{2^2k}$$ . arxiv.org\/pdf\/1309.7423 (2013)","DOI":"10.1007\/s10623-014-0006-x"},{"issue":"7","key":"11_CR41","doi-asserted-by":"publisher","first-page":"4675","DOI":"10.1109\/TIT.2013.2252420","volume":"59","author":"L Qu","year":"2013","unstructured":"Qu, L., Tan, Y., Tan, C., Li, C.: Constructing differentially 4-uniform permutations over $$\\mathbb{F}_{2^{2k}}$$ via the switching method. IEEE Trans. Inform. Theory 59(7), 4675\u20134686 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-73074-3_13","volume-title":"Arithmetic of Finite Fields","author":"G Leander","year":"2007","unstructured":"Leander, G., Poschmann, A.: On the classification of 4 bit S-boxes. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 159\u2013176. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73074-3_13"},{"key":"11_CR43","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, Volume 20 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997)"},{"key":"11_CR44","unstructured":"Sage Mathematics Software (Version 7.2) (2016). http:\/\/www.sagemath.org"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Saarinen, M.J.O.: STRIBOB: Authenticated encryption from GOST R 34.11-2012 LPS permutation. In: Mathematical Aspects of Cryptography, vol. 6, no. 2, pp. 67\u201378. Steklov Mathematical Institute of Russian Academy of Sciences (2015)","DOI":"10.4213\/mvk146"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Seberry, J., Zhang, X.M., Zheng, Y.: Systematic generation of cryptographically robust S-boxes. In: Proceedings of the First ACM Conference on Computer and Communications Security, The Association for Computing Machinery, Fairfax, VA, pp. 171\u2013182 (1993)","DOI":"10.1145\/168588.168610"},{"key":"11_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-25937-4_18","volume-title":"Fast Software Encryption","author":"F-X Standaert","year":"2004","unstructured":"Standaert, F.-X., Piret, G., Rouvroy, G., Quisquater, J.-J., Legat, J.-D.: ICEBERG: an involutional cipher efficient for block encryption in reconfigurable hardware. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 279\u2013298. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_18"},{"key":"11_CR48","unstructured":"STB 34.101.31-2011 Information technologies. Information security. Cryptographic algorithms of enciphering and continuity test. Minsk, Gosstandart (2011)"},{"key":"11_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74619-5_12","volume-title":"Fast Software Encryption","author":"T Shirai","year":"2007","unstructured":"Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-bit blockcipher CLEFIA (extended abstract). In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 181\u2013195. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_12"},{"issue":"1","key":"11_CR50","first-page":"23","volume":"19","author":"P Tesa\u0159","year":"2010","unstructured":"Tesa\u0159, P.: A new method for generating high non-linearity S-boxes. Radioengineering 19(1), 23\u201326 (2010)","journal-title":"Radioengineering"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25283-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T07:47:24Z","timestamp":1664005644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25283-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030252823","9783030252830"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25283-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Havana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuba","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latincrypt.matcom.uh.cu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"iChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"contains 1 invited paper","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}