{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T15:10:09Z","timestamp":1743865809654,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":72,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296932"},{"type":"electronic","value":"9783642296949"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-29694-9_11","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T16:49:27Z","timestamp":1343321367000},"page":"257-285","source":"Crossref","is-referenced-by-count":9,"title":["On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines"],"prefix":"10.1007","author":[{"given":"Vasyl","family":"Ustimenko","sequence":"first","affiliation":[]},{"given":"Urszula","family":"Roma\u0144czuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.4153\/CJM-1966-109-8","volume":"18","author":"C.T. Benson","year":"1966","unstructured":"Benson, C.T.: Minimal regular graphs of girth eight and twelve. Canadien Journal of Mathematics\u00a0(18), 1091\u20131094 (1966)","journal-title":"Canadien Journal of Mathematics"},{"key":"11_CR2","first-page":"5","volume":"36","author":"F. Bien","year":"1989","unstructured":"Bien, F.: Constructions of telephone networks by group representations. Notices Amer. Mah. Soc.\u00a036, 5\u201322 (1989)","journal-title":"Notices Amer. Mah. Soc."},{"key":"11_CR3","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. University Press, Cambridge (1993)","edition":"2"},{"key":"11_CR4","first-page":"73","volume":"25C","author":"N.L. Biggs","year":"1988","unstructured":"Biggs, N.L.: Graphs with large girth. Ars Combinatoria\u00a025C, 73\u201380 (1988)","journal-title":"Ars Combinatoria"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/0095-8956(90)90026-V","volume":"49","author":"N.L. Biggs","year":"1990","unstructured":"Biggs, N.L., Boshier, A.G.: Note on the Girth of Ramanujan Graphs. Journal of Combinatorial Theory, Series B\u00a049, 190\u2013194 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"11_CR6","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J.A. Bondy","year":"1974","unstructured":"Bondy, J.A., Simonovits, M.: Cycles of even length in graphs. J. Combin. Theory, Ser. B\u00a016, 87\u2013105 (1974)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"11_CR8","first-page":"81","volume":"2","author":"I. Boudeliouua","year":"2011","unstructured":"Boudeliouua, I., AlRaissi, M., Touzene, A., Ustimenko, V.: Performance of Algebraic Graphs Based Stream-Ciphers Using Large Finite Fields. Annalles UMCS Informatica AI X1\u00a02, 81\u201393 (2011)","journal-title":"Annalles UMCS Informatica AI X1"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance regular graphs","author":"A. Brower","year":"1989","unstructured":"Brower, A., Cohen, A., Nuemaier, A.: Distance regular graphs. Springer, Berlin (1989)"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W.G. Brown","year":"1966","unstructured":"Brown, W.G.: On graphs that do not contain Thomsen graph. Canad. Math. Bull.\u00a09(3), 281\u2013285 (1966)","journal-title":"Canad. Math. Bull."},{"issue":"6","key":"11_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. on Info. Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. on Info. Theory"},{"key":"11_CR12","first-page":"215","volume":"1","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., R\u2019enyi, A., S\u2019oc, V.T.: On a problem of graph theory. Studia. Sci. Math. Hungar.\u00a01, 215\u2013235 (1966)","journal-title":"Studia. Sci. Math. Hungar."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P. Erd\u0151s","year":"1982","unstructured":"Erd\u0151s, P., Simonovits, M.: Compactness results in extremal graph theory. Combinatorica\u00a02(3), 275\u2013288 (1982)","journal-title":"Combinatorica"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579343","volume":"3","author":"W. Faudree","year":"1983","unstructured":"Faudree, W., Simonovits, M.: On a class of degenerate extremal graph problems. Combinatorica\u00a03(1), 83\u201393 (1983)","journal-title":"Combinatorica"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Hoory, S., Linial, M., Wigderson, A.: Expander graphs and their applications. Bulletin (New Series) of AMS\u00a043(4), 439\u2013461","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511807077"},{"key":"11_CR17","unstructured":"Guinand, P., Lodge, J.: Tanner Type Codes Arising from Large Girth Graphs. In: Proceedings of the 1997 Canadian Workshop on Information Theory (CWIT 1997), Toronto, Ontario, Canada, June 3-6, pp. 5\u20137 (1997)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Guinand, P., Lodge, J.: Graph Theoretic Construction of Generalized Product Codes. In: Proceedings of the 1997 IEEE International Symposium on Information Theory (ISIT 1997), Ulm, Germany, June 29-July 4, p. 111 (1997)","DOI":"10.1109\/ISIT.1997.613026"},{"issue":"10","key":"11_CR19","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 Transactions on Information Theory\u00a050(10), 2378\u20132388 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR20","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, U., Ustimenko, V.: On the implementation of cubic public keys based on new family of algebraic graphs. Annales UMCS Informatica AI XI\u00a02, 127\u2013141 (2011)","journal-title":"Annales UMCS Informatica AI XI"},{"key":"11_CR21","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, p. 13. Beijing (2011)","DOI":"10.1109\/IMCSIT.2010.5679687"},{"key":"11_CR22","unstructured":"Klisowski, M., Ustimenko, V.: On the comparison of implementations of multivariate cryptosystems based on different families of graphs with large cycle matroid (to appear)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Algebraic aspects of cryptography, Algorithms and Computation in Mathematics, vol.\u00a03. Springer (1998)","DOI":"10.1007\/978-3-662-03642-6"},{"issue":"2(54)","key":"11_CR24","doi-asserted-by":"crossref","first-page":"347","DOI":"10.5488\/CMP.11.2.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.\u00a011(2(54)), 347\u2013360 (2008)","journal-title":"Condens. Matter Phys."},{"key":"11_CR25","unstructured":"Klisowski, M., Ustimenko, V.: On the public keys based on the extremal graphs and digraphs. In: International Multiconference on Computer Science and Informational Technology, CANA Proceedings, Wisla, Poland (October 2010)"},{"key":"11_CR26","unstructured":"Kotorowicz, J.S., Ustimenko, V., Roma\u0144czuk, U.: On the implementation of stream ciphers based on a new family of algebraic graphs. In: Proceedings of the Conference CANA, FedSCIS, pp. 485\u2013490. IEEE Computer Society Press"},{"key":"11_CR27","unstructured":"Kotorowicz S., Ustimenko, V.: On the comparison of mixing properties of stream ciphers based on graphs D(n, q) and A(n, q) (to appear)"},{"key":"11_CR28","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. Europ. J. of Combinatorics\u00a014, 445\u2013460 (1993)","journal-title":"Europ. J. of Combinatorics"},{"key":"11_CR29","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.\u00a060, 275\u2013284 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR30","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.: New Series of Dense Graphs of High Girth. Bull (New Series) of AMS\u00a032(1), 73\u201379 (1995)","journal-title":"Bull (New Series) of AMS"},{"key":"11_CR31","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0012-365X(98)00258-1","volume":"197\/198","author":"F. Lazebnik","year":"1999","unstructured":"Lazebnik, F., Ustimenko, V.A., Woldar, A.J.: Polarities and 2k-cycle-free graphs. Discrete Mathematics\u00a0197\/198, 503\u2013513 (1999)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"11_CR32","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/jctb.1994.1020","volume":"60","author":"F. Lazebnik","year":"1994","unstructured":"Lazebnik, F., Ustimenko, V.A., Woldar, A.J.: Properties of certain families of 2k-cycle free graphs. J. Combin. Theory, Ser. B\u00a060(2), 293\u2013298 (1994)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"2","key":"11_CR33","first-page":"62","volume":"115","author":"A. Lubotsky","year":"1989","unstructured":"Lubotsky, A., Philips, R., Sarnak, P.: Ramanujan graphs. J. Comb. Theory.\u00a0115(2), 62\u201389 (1989)","journal-title":"J. Comb. Theory."},{"key":"11_CR34","unstructured":"Margulis G.: Explicit group-theoretical constructions of combinatorial schemes and their application to desighn of expanders and concentrators. Probl. Peredachi Informatsii. 24(1), 51\u201360; English translation publ. Journal of Problems of Information Transmission, 39\u201346 (1988)"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"G.A. Margulis","year":"1982","unstructured":"Margulis, G.A.: Explicit construction of graphs without short cycles and low density codes. Combinatorica\u00a02, 71\u201378 (1982)","journal-title":"Combinatorica"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"264","DOI":"10.2307\/2369797","volume":"18","author":"E.H. Moore","year":"1886","unstructured":"Moore, E.H.: Tactical Memoranda. Amer. J. Math.\u00a018, 264\u2013303 (1886)","journal-title":"Amer. J. Math."},{"key":"11_CR37","volume-title":"Graph theory","author":"R. Ore","year":"1971","unstructured":"Ore, R.: Graph theory. Wiley, London (1971)"},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2478\/v10065-011-0003-x","volume":"2","author":"M. Polak","year":"2011","unstructured":"Polak, M., Ustimenko, V.: On LDPC Codes corresponding to affine parts of generalized polygons. Annalles UMCS Informatica AI X1\u00a02, 143\u2013150 (2011)","journal-title":"Annalles UMCS Informatica AI X1"},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"11","DOI":"10.2478\/v10065-011-0038-z","volume":"4","author":"U. Roma\u0144uczk","year":"2011","unstructured":"Roma\u0144uczk, U., Ustimenko, V.: On the key exchange with new cubical maps based on graphs. Annales UMCS Informatica AI XI\u00a04, 11\u201319 (2011)","journal-title":"Annales UMCS Informatica AI XI"},{"issue":"4","key":"11_CR40","first-page":"203","volume":"4","author":"U. Roma\u0144uczk","year":"2010","unstructured":"Roma\u0144uczk, U., Ustimenko, V.: On the key exchange with matrices of large order and graph based nonlinear maps. Albanian Journal of Mathematics, Special Issue, Application of Computer Algebra\u00a04(4), 203\u2013211 (2010)","journal-title":"Albanian Journal of Mathematics, Special Issue, Application of Computer Algebra"},{"key":"11_CR41","unstructured":"Roma\u0144uczk U., Ustimenko V.: On families of large cycle matroids, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree (to appear)"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Shaska, T., Huffman, W.C., Joener, D., Ustimenko, V. (eds.): Advances in Coding Theory and Crytography (Series on Coding Theory and Cryptology). World Scientific Publishing Company (2007)","DOI":"10.1142\/6464"},{"issue":"3","key":"11_CR43","first-page":"249","volume":"2","author":"T. Shaska","year":"2008","unstructured":"Shaska T., Ustimenko V.: On some applications of graph theory to cryptography and turbocoding. Albanian J. Math. 2(3), 249\u2013255 (2008); Proceedings of the NATO Advanced Studies Institute: \u201dNew challenges in digital communications\u201d","journal-title":"Albanian J. Math."},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Shaska, T., Ustimenko, V.: On the homogeneous algebraic graphs of large girth and their applications. Linear Algebra Appl.\u00a0430(7), 1826\u20131837 (2009); Special Issue in Honor of Thomas J. Laffey","DOI":"10.1016\/j.laa.2008.08.023"},{"key":"11_CR45","first-page":"161","volume-title":"Selected Topics in Graph Theory 2","author":"M. Simonovits","year":"1983","unstructured":"Simonovits, M.: Extremal graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory 2, vol.\u00a0(2), pp. 161\u2013200. Academic Press, London (1983)"},{"key":"11_CR46","unstructured":"Ustimenko, V.: Random walks on graphs and Cryptography, Extended Abstracts, AMS Meeting, Loisville (March 1998)"},{"key":"11_CR47","unstructured":"Ustimenko, V.: Coordinatisation of Trees and their Quotients. The \u201dVoronoj\u2019s Impact on Modern Science\u201d, Kiev, Institute of Mathematics, vol.\u00a02, pp. 125\u2013152 (1998)"},{"key":"11_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45624-4_29","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"V. Ustimenko","year":"2001","unstructured":"Ustimenko, V.: CRYPTIM: Graphs as Tools for Symmetric Encryption. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol.\u00a02227, pp. 278\u2013287. Springer, Heidelberg (2001)"},{"issue":"2","key":"11_CR49","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1020686216463","volume":"74","author":"V. Ustimenko","year":"2002","unstructured":"Ustimenko, V.: Graphs with Special Arcs and Cryptography. Acta Applicandae Mathematicae\u00a074(2), 117\u2013153 (2002)","journal-title":"Acta Applicandae Mathematicae"},{"issue":"3","key":"11_CR50","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/s10958-007-0453-2","volume":"140","author":"V. Ustimenko","year":"2007","unstructured":"Ustimenko, V.: Linguistic Dynamical Systems, Graphs of Large Girth and Cryptography. Journal of Mathematical Sciences\u00a0140(3), 412\u2013434 (2007)","journal-title":"Journal of Mathematical Sciences"},{"key":"11_CR51","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.\u00a010, 51\u201365 (2004)","journal-title":"J. Algebra Discrete Math."},{"key":"11_CR52","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 and Cryptology, vol.\u00a03, pp. 181\u2013200 (2007)","DOI":"10.1142\/9789812772022_0012"},{"key":"11_CR53","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.\u00a01(4) (2007); Special issue on algebra and computational algebraic geometry","DOI":"10.51286\/albjm\/1199265923"},{"key":"#cr-split#-11_CR54.1","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On the graph based cryptography and symbolic computations. Serdica Journal of Computing (2007)","DOI":"10.55630\/sjc.2007.1.131-156"},{"key":"#cr-split#-11_CR54.2","unstructured":"Proceedings of International Conference on Application of Computer Algebra, ACA 2006, Varna, vol. (1) (2006)"},{"issue":"1","key":"11_CR55","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.\u00a03(1), 25\u201333 (2009)","journal-title":"Albanian J. Math."},{"key":"11_CR56","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.\u00a024, pp. 256\u2013281. IOS Press (July 2009)","DOI":"10.3233\/978-1-60750-019-3-256"},{"key":"11_CR57","unstructured":"Ustimenko, V.: On the K-theory of graph based dynamical systems and its applications. Dopovidi of the National Ukrainian Academy of Sci. (to appear)"},{"key":"11_CR58","unstructured":"Ustimenko, V.: On Extremal Graph Theory and Symbolic Computations. Dopovidi of the National Ukrainian Acad. Sci. (to appear)"},{"key":"#cr-split#-11_CR59.1","unstructured":"Ustimenko, V.: On optimization problems for graphs and security of digital communications. In: International Conference on Discrete Mathematics, Algebra and their Applications, October 19-22 (2009)"},{"key":"#cr-split#-11_CR59.2","unstructured":"Proceedings of the Institute of Mathematics, Belarussian Acad. Sci. (3), 12 (2010)"},{"key":"11_CR60","unstructured":"Ustimenko, V.: Algebraic graphs and security of digital communications, 151 p. Institute of Computer Science, University of Maria Curie Sklodowska, Lublin (2011); Supported by European Social Foundation, available at the UMCS web"},{"key":"11_CR61","doi-asserted-by":"crossref","unstructured":"Ustimenko, V., Wr\u00f3blewska, A.: On the key exchange with nonlinear polynomial maps of degree 4. Albanian Journal of Mathematics, Special Issue, Applications of Computer Algebra\u00a04(4) (December 2010)","DOI":"10.51286\/albjm\/1292431792"},{"key":"11_CR62","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2478\/v10065-011-0014-7","volume":"2","author":"V. Ustimenko","year":"2011","unstructured":"Ustimenko, V., Wr\u00f3blewska, A.: On the key expansion of D(n;K)-based cryptographical algorithm. Annales UMCS Informatica AI XI\u00a02, 95\u2013111 (2011)","journal-title":"Annales UMCS Informatica AI XI"},{"key":"11_CR63","unstructured":"Ustimenko V., Wr\u00f3blewska A.: On the key exchange with nonlinear polynomial maps of stable degree (to appear)"},{"issue":"3","key":"11_CR64","doi-asserted-by":"crossref","first-page":"229","DOI":"10.51286\/albjm\/1229509644","volume":"2","author":"A. Wr\u00f3blewska","year":"2008","unstructured":"Wr\u00f3blewska, A.: On some applications of graph based public key. Albanian J. Math.\u00a02(3), 229\u2013234 (2008); Proceedings of the NATO Advanced Studies Institute: \u201dNew challenges in digital communications\u201d","journal-title":"Albanian J. Math."},{"key":"11_CR65","doi-asserted-by":"crossref","unstructured":"Futorny, V., Ustimenko, V.: On Small World Semiplanes with Generalised Schubert Cells. Acta Applicandae Mathematicae\u00a0(4) (2007)","DOI":"10.1007\/s10440-007-9144-8"},{"key":"11_CR66","unstructured":"Ustimenko, V., Kotorowicz, J.: On the properties of Stream Ciphers Based on Extremal Directed graphs. In: Chen, R.E. (ed.) Cryptography Research Perspectives. Nova Publishers (2008)"},{"issue":"4","key":"11_CR67","first-page":"81","volume":"25","author":"V. Ustimenko","year":"1991","unstructured":"Ustimenko, V.: Small Schubert cells as subsets in Lie algebras. Functional Analysis and Applications\u00a025(4), 81\u201383 (1991)","journal-title":"Functional Analysis and Applications"},{"key":"11_CR68","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1005919327201","volume":"52","author":"V. Ustimenko","year":"1998","unstructured":"Ustimenko, V.: On the Varieties of Parabolic Subgroups, their Generalizations and Combinatorial Applications. Acta Applicandae Mathematicae\u00a052, 223\u2013238 (1998)","journal-title":"Acta Applicandae Mathematicae"},{"issue":"3","key":"11_CR69","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01057020","volume":"42","author":"V. Ustimenko","year":"1990","unstructured":"Ustimenko, V.: Linear interpretations for flag geometries of Chevalley groups. Ukr. Math. J.\u00a042(3), 383\u2013387 (1990)","journal-title":"Ukr. Math. J."},{"key":"11_CR70","unstructured":"Ustimenko, V., Roma\u0144czuk, U.: On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography"}],"container-title":["Studies in Computational Intelligence","Artificial Intelligence, Evolutionary Computing and Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29694-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T14:31:52Z","timestamp":1743863512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29694-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642296932","9783642296949"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29694-9_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}