{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T05:40:03Z","timestamp":1743831603266,"version":"3.40.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11786-012-0121-x","type":"journal-article","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T14:06:34Z","timestamp":1342879594000},"page":"181-198","source":"Crossref","is-referenced-by-count":9,"title":["On the Comparison of Cryptographical Properties of Two Different Families of Graphs with Large Cycle Indicator"],"prefix":"10.1007","volume":"6","author":[{"given":"Micha\u0142","family":"Klisowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasyl","family":"Ustimenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,22]]},"reference":[{"key":"121_CR1","first-page":"5","volume":"3","author":"F. Bien","year":"1989","unstructured":"Bien F.: Constructions of telephone networks by group representations. Notices Am. Math. Soc. 3, 5\u201322 (1989)","journal-title":"Notices Am. Math. Soc."},{"key":"121_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B.: Extremal Graph Theory. Academic Press, London (1978)"},{"issue":"2","key":"121_CR3","first-page":"8193","volume":"1","author":"I. Boudeliouua","year":"2011","unstructured":"Boudeliouua I., AlRaissi M., Touzene A., Ustimenko V.: Performance of Algebraic graphs based streamciphers using large finite fields. Annalles UMCS Informatica AI X 1(2), 8193 (2011)","journal-title":"Annalles UMCS Informatica AI X"},{"key":"121_CR4","unstructured":"Dieudonn\u00e9, J.: La g\u00e9om\u00e9trie des groupes classiques, Ergebnisse der Mathematik und ihrer Grenzgebiete (N.F.), Heft 5. Springer, Berlin (1970)"},{"key":"121_CR5","first-page":"299","volume":"390","author":"A.L. Chistov","year":"2011","unstructured":"Chistov A.L.: An improvement of the complexity bound for solving systems of polynomial equations. Zapisky nauchnych seminarov POMI 390, 299\u2013306 (2011)","journal-title":"Zapisky nauchnych seminarov POMI"},{"key":"121_CR6","unstructured":"Guinand, P., Lodge, J.: Tanner Type codes arising from large girth graphs. In: Proceedings of the 1997 Canadian Workshop on Information Theory (CWIT 97), Toronto, pp. 57 (1997)"},{"key":"121_CR7","doi-asserted-by":"crossref","unstructured":"Guinand, P., Lodge, J.: Graph theoretic construction of generalized product codes, p. 111. In: Proceedings of the 1997 IEEE International Symposium on Information Theory (ISIT \u201897), Ulm, June 29\u2013July 4 (1997)","DOI":"10.1109\/ISIT.1997.613026"},{"issue":"10","key":"121_CR8","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/TIT.2004.834760","volume":"50","author":"J.L. Kim","year":"2004","unstructured":"Kim J.L., Peled U.N., Perepelitsa I., Pless V., Friedland S.: Explicit construction of families of LDPC codes with no 4 cycles. IEEE Trans. Information Theory 50(10), 2378\u20132388 (2004)","journal-title":"IEEE Trans. Information Theory"},{"key":"121_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2478\/v10065-011-0007-6","volume":"2","author":"M. Klisowski","year":"2011","unstructured":"Klisowski M., Roma\u0144czuk M., Ustimenko V.: On the implementation of cubic public keys based on new family of algebraic graphs. Annales UMCS Informatica AI XI 2, 127\u2013141 (2011)","journal-title":"Annales UMCS Informatica AI XI"},{"key":"121_CR10","doi-asserted-by":"crossref","unstructured":"Klisowski, M., Ustimenko, V.: On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings. International Multiconference on Computer Science and Informational Technology, Wisla, Poland, CANA Proceedings, pp. 303\u2013308 (2010)","DOI":"10.1109\/IMCSIT.2010.5679687"},{"issue":"3","key":"121_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.51286\/albjm\/1317724802","volume":"5","author":"M. Klisowski","year":"2011","unstructured":"Klisowski M., Ustimenko V.: On the implementation of cubic public keys based on algebraic graphs over the finite commutative rings and their symmetries. Albanian J. Math. 5(3), 139\u2013149 (2011)","journal-title":"Albanian J. Math."},{"key":"121_CR12","doi-asserted-by":"crossref","unstructured":"Klisowski, M., Ustimenko, V.: On the implementation of cubic public keys based on algebraic graphs over the finite commutative ring and their symmetries. In: MACIS 2011: Fourth International Conference on Mathematical Aspects of Computer and Information Sciences, Beijing (2011)","DOI":"10.1109\/IMCSIT.2010.5679687"},{"key":"121_CR13","unstructured":"Klisowski, M., Ustimenko, V.: On the implementation of multivariate cryptosystem over the boolean ring Annalles UMCS Informatica (to appear)"},{"key":"121_CR14","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Algebraic aspects of cryptography. In: Algorithms and Computation in Mathematics, vol. 3. Springer, Berlin (1998)","DOI":"10.1007\/978-3-662-03642-6"},{"issue":"54","key":"121_CR15","first-page":"347","volume":"11","author":"S. Kotorowicz","year":"2008","unstructured":"Kotorowicz, S., Ustimenko, V.: On the implementation of cryptoalgorithms based on algebraic graphs over some commutative rings, Condens. Matter Phys. 11, no. 2(54), 347\u2013360 (2008)","journal-title":"Matter Phys."},{"key":"121_CR16","unstructured":"Kotorowicz, J.S., Ustimenko, V., Roma\u0144czuk, U.: On the implementation of stream ciphers based on a new family of algebraic graphs, pp. 485\u2013490. In: Proceedings of the Conference CANA, FedSCIS, IEEE Computer Society Press (2012)"},{"key":"121_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1006\/eujc.1993.1048","volume":"14","author":"F. Lazebnik","year":"1993","unstructured":"Lazebnik F., Ustimenko V.A.: New Examples of graphs without small cycles and of large size. Eur. J. Combin. 14, 445\u2013460 (1993)","journal-title":"Eur. J. Combin."},{"key":"121_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","volume":"60","author":"F. Lazebnik","year":"1995","unstructured":"Lazebnik F., Ustimenko V.: Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Appl. Math. 60, 275\u2013284 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"121_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F. Lazebnik","year":"1995","unstructured":"Lazebnik F., Ustimenko V.A., Woldar A.J.: A new series of dense graphs of high girth. Bull. Am. Math. Soc. (N.S.) 32(1), 73\u201379 (1995)","journal-title":"Bull. Am. Math. Soc. (N.S.)"},{"issue":"1","key":"121_CR20","first-page":"3946","volume":"24","author":"G. Margulis","year":"1988","unstructured":"Margulis G.: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. J. Probl. Inf. Transm. 24(1), 3946 (1988)","journal-title":"J. Probl. Inf. Transm."},{"key":"121_CR21","volume-title":"Graph Theory","author":"R. Ore","year":"1971","unstructured":"Ore R.: Graph Theory. Wiley, London (1971)"},{"key":"121_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.2478\/v10065-011-0038-z","volume":"4","author":"U. Roma\u0144czuk","year":"2011","unstructured":"Roma\u0144czuk U., Ustimenko V.: On the key exchange with new cubical maps based on graphs. Annales UMCS Informatica AI XI 4, 11\u201319 (2011)","journal-title":"Annales UMCS Informatica AI XI"},{"key":"121_CR23","doi-asserted-by":"crossref","unstructured":"Shaska, T., Ustimenko, V.: On some applications of graph theory to cryptography and turbocoding. Albanian J. Math., vol. 2, no. 3, pp. 249\u2013255. In: Proceedings of the NATO Advanced Studies Institute: New challenges in digital communications\u2019 (2008)","DOI":"10.51286\/albjm\/1228839573"},{"key":"121_CR24","doi-asserted-by":"crossref","unstructured":"Shaska, T., Ustimenko, V.: On the homogeneous algebraic graphs of large girth and their applications, Linear Algebra Appl. 430, no. 7, 1826\u20131837, Special Issue in Honor of Thomas J. Laffey (2009)","DOI":"10.1016\/j.laa.2008.08.023"},{"key":"121_CR25","unstructured":"Simonovits M.: Extremal graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 2, pp. 161\u2013200. Academic Press, London (1983)"},{"key":"121_CR26","unstructured":"Touzene, A., Ustimenko, V.: Graph Based Private Key Crypto System. Int. J. Comput. Res. Nova Science Publisher 13(4) (2006)"},{"key":"121_CR27","unstructured":"Ustimenko, V.: Random Walks on Graphs and Cryptography, Extended abstracts, AMS Meeting, Loisville, March (1998)"},{"key":"121_CR28","unstructured":"Ustimenko, V.: Coordinatisation of Trees and their Quotients. In: Voronoi\u2019s Impact on Modern Science, vol. 2, pp. 125\u2013152. Kiev, Institute of Mathematics (1998)"},{"key":"121_CR29","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: CRYPTIM: Graphs as Tools for Symmetric Encryption, vol. 2227, pp. 278\u2013287. Lecture Notes in Computer Science. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45624-4_29"},{"issue":"2","key":"121_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1020686216463","volume":"71","author":"V.A. Ustimenko","year":"2002","unstructured":"Ustimenko V.A.: Graphs with special arcs and cryptography. Acta Applicandae Mathematicae 71(2), 117\u2013153 (2002)","journal-title":"Acta Applicandae Mathematicae"},{"key":"121_CR31","first-page":"51","volume":"10","author":"V. Ustimenko","year":"2004","unstructured":"Ustimenko V.: Maximality of affine group and hidden graph cryptosystems. J. Algebra Discrete Math. 10, 51\u201365 (2004)","journal-title":"J. Algebra Discrete Math."},{"key":"121_CR32","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On the graph based cryptography and symbolic computations, Serdica J. Comput. In: Proceedings of International Conference on Application of Computer Algebra, ACA-2006, Varna, N1 (2007)","DOI":"10.55630\/sjc.2007.1.131-156"},{"key":"121_CR33","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On the extremal graph theory for directed graphs and its cryptographical applications. In: Shaska, T., Huffman, W.C., Joener, D., Ustimenko, V. (eds.) Advances in Coding Theory and Cryptography. Series on Coding Theory and Cryptology, vol. 3, pp. 181\u2013199. World Scientific, New Jersey (2007)","DOI":"10.1142\/9789812772022_0012"},{"key":"121_CR34","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On the extremal regular directed graphs without commutative diagrams and their applications in coding theory and cryptography, Albanian J. Math. 1(4) Special issue on algebra and computational algebraic geometry (2007)","DOI":"10.51286\/albjm\/1199265923"},{"issue":"3","key":"121_CR35","first-page":"412","volume":"140","author":"V.A. Ustimenko","year":"2007","unstructured":"Ustimenko V.A.: Linguistic dynamical systems, graphs of large girth and cryptography. J. Math. Sci. Springer 140(3), 412\u2013434 (2007)","journal-title":"J. Math. Sci. Springer"},{"issue":"1","key":"121_CR36","doi-asserted-by":"crossref","first-page":"25","DOI":"10.51286\/albjm\/1236885681","volume":"3","author":"V. Ustimenko","year":"2009","unstructured":"Ustimenko V.: Algebraic groups and small world graphs of high girth. Albanian J. Math. 3(1), 25\u201333 (2009)","journal-title":"Albanian J. Math."},{"key":"121_CR37","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On the cryptographical properties of extremal algebraic graphs, Algebraic Aspects of Digital Communications. In: Shaska, T., Hasimaj, E. (eds.) NATO Science for Peace and Security Series-D: Information and Communication Security, vol. 24, pp. 256\u2013281. IOS Press, July (2009)","DOI":"10.3233\/978-1-60750-019-3-256"},{"key":"121_CR38","unstructured":"Ustimenko, V.: On extremal graph theory and symbolic computations. Dopovidi Ukr. Acad. Sci. (to appear)"},{"key":"121_CR39","unstructured":"Ustimenko, V., Kotorowicz, J.: On the properties of stream ciphers based on extremal directed graphs. In: Chen, R.E. (ed.) Cryptography Research Perspective, pp. 125\u2013141. Nova Science Publishers, New York, April (2009)"},{"key":"121_CR40","doi-asserted-by":"crossref","unstructured":"Ustimenko, V., Roma\u0144czuk, U.: On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography. In: Artificial Intelligence, Evolutionary Computing and Metaheuristics, In the Footsteps of Alan Turing Series: Studies in Computational Intelligence, vol. 427. Springer, Berlin, June (2012)","DOI":"10.1007\/978-3-642-29694-9_10"},{"key":"121_CR41","doi-asserted-by":"crossref","unstructured":"Ustimenko, V., Roma\u0144czuk, U.: On extremal graph theory, explicit algebraic constructions of extremal graphs and corresponding Turing encryption machines. In: Artificial Intelligence, Evolutionary Computing and Metaheuristics, In the Footsteps of Alan Turing Series: Studies in Computational Intelligence, vol. 427. Springer, Berlin, June (2012)","DOI":"10.1007\/978-3-642-29694-9_11"},{"key":"121_CR42","doi-asserted-by":"crossref","unstructured":"Wr\u00f3blewska, A.: On some applications of graph based public key, Albanian J. Math., vol. 2, no. 3, pp. 229\u2013234. In: Proceedings of the NATO Advanced Studies Institute: New Challenges in Digital Communications (2008)","DOI":"10.51286\/albjm\/1229509644"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0121-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-012-0121-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s11786-012-0121-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0121-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T05:12:45Z","timestamp":1743829965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-012-0121-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s11786-012-0121-x","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"type":"print","value":"1661-8270"},{"type":"electronic","value":"1661-8289"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}