{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:10:11Z","timestamp":1773414611993,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T00:00:00Z","timestamp":1395964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,3,28]]},"DOI":"10.1145\/2638404.2737600","type":"proceedings-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T16:07:44Z","timestamp":1456157264000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Cryptanalysis of the Quasigroup Block Cipher"],"prefix":"10.1145","author":[{"given":"Matthew","family":"Battey","sequence":"first","affiliation":[{"name":"Computer Science Department, University of Nebraska at Omaha"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Parakh","sequence":"additional","affiliation":[{"name":"Nebraska University Center for Information, University of Nebraska at Omaha"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2012.6289294"},{"key":"e_1_3_2_1_2_1","volume-title":"A quasigroup based random number generator for resource constrained environments. IACR Cryptology ePrint Archive","author":"Battey M.","year":"2012","unstructured":"M. Battey and A. Parakh . A quasigroup based random number generator for resource constrained environments. IACR Cryptology ePrint Archive , 2012 :471, 2012. M. Battey and A. Parakh. A quasigroup based random number generator for resource constrained environments. IACR Cryptology ePrint Archive, 2012:471, 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-012-0959-x"},{"key":"e_1_3_2_1_4_1","volume-title":"Information Theory, and Error-Correction","author":"Bruen A. A.","year":"2011","unstructured":"A. A. Bruen and M. A. Forcinito . Cryptography , Information Theory, and Error-Correction . John Wiley & amp; Sons, 2011 . A. A. Bruen and M. A. Forcinito. Cryptography, Information Theory, and Error-Correction. John Wiley & Sons, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/0161-110291890885"},{"key":"e_1_3_2_1_6_1","first-page":"386","volume-title":"EUROCRYPT","author":"Matsui M.","year":"1993","unstructured":"M. Matsui . Linear cryptoanalysis method for des cipher . In EUROCRYPT , pages 386 - 397 , 1993 . M. Matsui. Linear cryptoanalysis method for des cipher. In EUROCRYPT, pages 386-397, 1993."},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Sciences, Advances in Cryptology, proceedings of EUROCRYPT'92","first-page":"81","volume-title":"A new emthod for known plaintext attack of feal cipher","author":"Matsui M.","year":"1992","unstructured":"M. Matsui and A. Yamagishi . A new emthod for known plaintext attack of feal cipher . In Lecture Notes in Computer Sciences, Advances in Cryptology, proceedings of EUROCRYPT'92 , pages 81 - 91 , 1992 . M. Matsui and A. Yamagishi. A new emthod for known plaintext attack of feal cipher. In Lecture Notes in Computer Sciences, Advances in Cryptology, proceedings of EUROCRYPT'92, pages 81-91, 1992."},{"key":"e_1_3_2_1_8_1","volume-title":"On the number of latin squares. Annals of Combinatorics, 9(DOI 10.1007\/s00026-005-0261-7):335-344","author":"McKay B. D.","year":"2005","unstructured":"B. D. McKay and I. M. Wanless . On the number of latin squares. Annals of Combinatorics, 9(DOI 10.1007\/s00026-005-0261-7):335-344 , 2005 . B. D. McKay and I. M. Wanless. On the number of latin squares. Annals of Combinatorics, 9(DOI 10.1007\/s00026-005-0261-7):335-344, 2005."},{"key":"e_1_3_2_1_9_1","volume-title":"April","author":"NIST.","year":"2010","unstructured":"NIST. A statistical test suite for the validation of random number generators and pseudo random number generators for cryptographic applications (fips 800-22) , April 2010 . NIST. A statistical test suite for the validation of random number generators and pseudo random number generators for cryptographic applications (fips 800-22), April 2010."},{"key":"e_1_3_2_1_10_1","volume-title":"A Course in Combinatorics","author":"van Lint J. H.","year":"1992","unstructured":"J. H. van Lint and R. M. Wilson . A Course in Combinatorics . Cambridge University Press , 1992 . J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992."}],"event":{"name":"ACM SE '14: ACM Southeast Regional Conference 2014","location":"Kennesaw Georgia","acronym":"ACM SE '14"},"container-title":["Proceedings of the 2014 ACM Southeast Regional Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2638404.2737600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2638404.2737600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:13Z","timestamp":1750278373000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2638404.2737600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,28]]},"references-count":10,"alternative-id":["10.1145\/2638404.2737600","10.1145\/2638404"],"URL":"https:\/\/doi.org\/10.1145\/2638404.2737600","relation":{},"subject":[],"published":{"date-parts":[[2014,3,28]]},"assertion":[{"value":"2014-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}