Abstract
The paper is devoted to the implementations of the public key algorithms based on simple algebraic graphs A(n, K) and D(n, K) defined over the same finite commutative ring K. If K is a finite field both families are families of graphs with large cycle indicator. In fact, the family D(n, F q ) is a family of graphs of large girth (f.g.l.g.) with c = 1, their connected components CD(n, F q ) form the f.g.l.g. with the speed of growth 4/3. Family A(n, q), char F q ≠ 2 is a family of connected graphs with large cycle indicator with the largest possible speed of growth. The computer simulation demonstrates the advantage (better density which is the number of monomial expressions) of public rules derived from A(n, q) in comparison with symbolic algorithm based on graphs D(n, q).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bien F.: Constructions of telephone networks by group representations. Notices Am. Math. Soc. 3, 5–22 (1989)
Bollobás B.: Extremal Graph Theory. Academic Press, London (1978)
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)
Dieudonné, J.: La géométrie des groupes classiques, Ergebnisse der Mathematik und ihrer Grenzgebiete (N.F.), Heft 5. Springer, Berlin (1970)
Chistov A.L.: An improvement of the complexity bound for solving systems of polynomial equations. Zapisky nauchnych seminarov POMI 390, 299–306 (2011)
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)
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 ‘97), Ulm, June 29–July 4 (1997)
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–2388 (2004)
Klisowski M., Romańczuk M., Ustimenko V.: On the implementation of cubic public keys based on new family of algebraic graphs. Annales UMCS Informatica AI XI 2, 127–141 (2011)
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–308 (2010)
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–149 (2011)
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)
Klisowski, M., Ustimenko, V.: On the implementation of multivariate cryptosystem over the boolean ring Annalles UMCS Informatica (to appear)
Koblitz, N.: Algebraic aspects of cryptography. In: Algorithms and Computation in Mathematics, vol. 3. Springer, Berlin (1998)
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–360 (2008)
Kotorowicz, J.S., Ustimenko, V., Romańczuk, U.: On the implementation of stream ciphers based on a new family of algebraic graphs, pp. 485–490. In: Proceedings of the Conference CANA, FedSCIS, IEEE Computer Society Press (2012)
Lazebnik F., Ustimenko V.A.: New Examples of graphs without small cycles and of large size. Eur. J. Combin. 14, 445–460 (1993)
Lazebnik F., Ustimenko V.: Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Appl. Math. 60, 275–284 (1995)
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–79 (1995)
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)
Ore R.: Graph Theory. Wiley, London (1971)
Romańczuk U., Ustimenko V.: On the key exchange with new cubical maps based on graphs. Annales UMCS Informatica AI XI 4, 11–19 (2011)
Shaska, T., Ustimenko, V.: On some applications of graph theory to cryptography and turbocoding. Albanian J. Math., vol. 2, no. 3, pp. 249–255. In: Proceedings of the NATO Advanced Studies Institute: New challenges in digital communications’ (2008)
Shaska, T., Ustimenko, V.: On the homogeneous algebraic graphs of large girth and their applications, Linear Algebra Appl. 430, no. 7, 1826–1837, Special Issue in Honor of Thomas J. Laffey (2009)
Simonovits M.: Extremal graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 2, pp. 161–200. Academic Press, London (1983)
Touzene, A., Ustimenko, V.: Graph Based Private Key Crypto System. Int. J. Comput. Res. Nova Science Publisher 13(4) (2006)
Ustimenko, V.: Random Walks on Graphs and Cryptography, Extended abstracts, AMS Meeting, Loisville, March (1998)
Ustimenko, V.: Coordinatisation of Trees and their Quotients. In: Voronoi’s Impact on Modern Science, vol. 2, pp. 125–152. Kiev, Institute of Mathematics (1998)
Ustimenko, V.: CRYPTIM: Graphs as Tools for Symmetric Encryption, vol. 2227, pp. 278–287. Lecture Notes in Computer Science. Springer, Berlin (2001)
Ustimenko V.A.: Graphs with special arcs and cryptography. Acta Applicandae Mathematicae 71(2), 117–153 (2002)
Ustimenko V.: Maximality of affine group and hidden graph cryptosystems. J. Algebra Discrete Math. 10, 51–65 (2004)
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)
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–199. World Scientific, New Jersey (2007)
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)
Ustimenko V.A.: Linguistic dynamical systems, graphs of large girth and cryptography. J. Math. Sci. Springer 140(3), 412–434 (2007)
Ustimenko V.: Algebraic groups and small world graphs of high girth. Albanian J. Math. 3(1), 25–33 (2009)
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–281. IOS Press, July (2009)
Ustimenko, V.: On extremal graph theory and symbolic computations. Dopovidi Ukr. Acad. Sci. (to appear)
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–141. Nova Science Publishers, New York, April (2009)
Ustimenko, V., Romańczuk, 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)
Ustimenko, V., Romańczuk, 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)
Wróblewska, A.: On some applications of graph based public key, Albanian J. Math., vol. 2, no. 3, pp. 229–234. In: Proceedings of the NATO Advanced Studies Institute: New Challenges in Digital Communications (2008)
Open Access
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Klisowski, M., Ustimenko, V. On the Comparison of Cryptographical Properties of Two Different Families of Graphs with Large Cycle Indicator. Math.Comput.Sci. 6, 181–198 (2012). https://doi.org/10.1007/s11786-012-0121-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-012-0121-x
Keywords
- Algebraic multivariate cryptography
- Graph algorithms
- Density of polynomial multivariate maps of small degree