{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T19:40:23Z","timestamp":1713382823990},"reference-count":17,"publisher":"Maria Curie-Sklodowska University","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"DOI":"10.2478\/v10065-011-0012-9","type":"journal-article","created":{"date-parts":[[2012,1,14]],"date-time":"2012-01-14T19:52:38Z","timestamp":1326570758000},"source":"Crossref","is-referenced-by-count":1,"title":["Performance of algebraic graphs based stream-ciphers using large finite fields"],"prefix":"10.17951","volume":"11","author":[{"given":"Abderezak","family":"Touzene","sequence":"first","affiliation":[]},{"given":"Vasyl","family":"Ustimenko","sequence":"additional","affiliation":[]},{"given":"Marwa","family":"AlRaissi","sequence":"additional","affiliation":[]},{"given":"Imene","family":"Boudelioua","sequence":"additional","affiliation":[]}],"member":"7349","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/dimacs\/010\/07","article-title":"Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size","volume":"10","author":"F. Lazebnik","year":"1993","journal-title":"DIMACS series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"10","key":"2","first-page":"2378","article-title":"Explicit construction of families of LDPC codes with no 4-cycles, Information Theory","volume":"50","author":"J. Kim","year":"2004","journal-title":"IEEE Transactions"},{"key":"3","first-page":"228","volume-title":"Voronoi's impact on modern science","author":"V. Ustimenko","year":"1998"},{"key":"4","first-page":"347","article-title":"On the implementation of cryptoalgorithms based on algebraic graphs over some commutative rings, Condenced Matters Physics","volume":"11","author":"J. Kotorowicz","year":"2008"},{"key":"5","first-page":"57","volume-title":"CRYPTALL-a System to Encrypt All types of Data","author":"V. Ustimenko","year":"2004"},{"issue":"4","key":"6","first-page":"12","article-title":"Graph Based Private Key Crypto System, International Journal on Computer Research","volume":"13","author":"A. Touzene","year":"2006","journal-title":"Nova Science Publisher"},{"key":"7","article-title":"On the public keys based on the extremal graphs and digraphs","author":"M. Klisowski","year":"2010"},{"issue":"3","key":"8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.51286\/albjm\/1229509644","article-title":"On some properties of graph based public keys","volume":"2","author":"A. Wr\u00f3blewska","year":"2008","journal-title":"Albanian Journal of Mathematics"},{"key":"9","first-page":"151","volume-title":"Algebraic graphs and security of digital communications","author":"V. Ustimenko","year":"2011"},{"key":"10","first-page":"278","volume-title":"Lecture Notes in Computer Science","volume":"2227","author":"V. Ustimenko","year":"2002"},{"key":"11","first-page":"117","article-title":"Graphs with special arcs and Cryptography","author":"V. Ustimenko","year":"1974","journal-title":"Acta Applicandae Mathematicae"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8592-7","volume-title":"A Course in Number Theory and Cryptography","author":"N. Koblitz","year":"1994"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic Aspects of Cryptograph","author":"N. Koblitz","year":"1998"},{"issue":"7","key":"14","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/12.863045","article-title":"Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems","volume":"49","author":"M. Hasan","year":"2000","journal-title":"IEEE Trans. Comp."},{"key":"15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0195-6698(02)00119-1","article-title":"Extremal properties of regular and affine generalized polygons as tactical configurations","volume":"24","author":"V. Ustimenko","year":"2003","journal-title":"Europ. J. Com."},{"key":"16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"Note on two problems in connection with graphs","volume":"1","author":"E. Dijkstra","year":"1959","journal-title":"Num. Math."},{"key":"17","unstructured":"Plank J. (n.d.), Fast Galois Field Arithmetic Library in C\/C++. Retrieved October 28 (2009), from The University of Tennessee, College of Art and Science: <a target=\"_blank\" href='http:\/\/www.cs.utk.edu\/plank\/plank\/papers\/CS-07-593'>http:\/\/www.cs.utk.edu\/plank\/plank\/papers\/CS-07-593<\/a>"}],"container-title":["Annales UMCS, Informatica"],"original-title":[],"link":[{"URL":"https:\/\/journals.umcs.pl\/ai\/article\/download\/3312\/2506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T18:44:24Z","timestamp":1713379464000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.umcs.pl\/ai\/article\/view\/3312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":17,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/v10065-011-0012-9","relation":{},"ISSN":["2083-3628","1732-1360"],"issn-type":[{"value":"2083-3628","type":"electronic"},{"value":"1732-1360","type":"print"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}