View More View Less
  • 1 NAS, Ukraine
Restricted access

Purchase article

USD  $25.00

1 year subscription (Individual Only)

USD  $800.00

New multivariate cryptosystems are introduced. Sequences f(n) of bijective polynomial transformations of bijective multivariate transformations of affine spaces Kn, n = 2, 3, ... , where K is a finite commutative ring with special properties, are used for the constructions of cryptosystems. On axiomatic level, the concept of a family of multivariate maps with invertible decomposition is proposed. Such decomposition is used as private key in a public key infrastructure. Requirements of polynomiality of degree and density allow to estimate the complexity of encryption procedure for a public user. The concepts of stable family and family of increasing order are motivated by studies of discrete logarithm problem in Cremona group. Statement on the existence of families of multivariate maps of polynomial degree and polynomial density with the invertible decomposition is formulated. We observe known explicit constructions of special families of multivariate maps. They correspond to explicit constructions of families of nonlinear algebraic graphs of increasing girth which appeared in Extremal Graph Theory. The families are generated by pseudorandom walks on graphs. This fact ensures the existence of invertible decomposition; a certain girth property guarantees the increase of order for the family of multivariate maps, good expansion properties of families of graphs lead to good mixing properties of graph based private key algorithms. We describe the general schemes of cryptographic applications of such families (public key infrastructure, symbolic Diffie—Hellman protocol, functional versions of El Gamal algorithm).

  • [1]

    Ding J. , Gower, J. E. and Schmidt, D. S., Multivariate Public Key Cryptosystems, 260. Springer, Advances in Information Security, v. 25, (2006).

    • Search Google Scholar
    • Export Citation
  • [2]

    Bollobás, B., Extremal Graph Theory, Academic Press, London, 1978.

  • [3]

    Erdős, P., Rényi, A. and T. Sós, V., On a problem of graph theory, Studia. Sci. Math. Hungar., 1 (1966), 215235.

  • [4]

    Erdős, P. and Simonovits, M., Compactness results in extremal graph theory, Combinatorica, 2 (3), 275288 (1982).

  • [5]

    Simonovits, M., Extermal Graph Theory, in: Selected Topics in Graph Theory, 2, edited by L. W. Beineke and R. J. Wilson, Academic Press, London, pp. 161200 (1983).

    • Search Google Scholar
    • Export Citation
  • [6]

    Ustimenko, V., Coordinatisation of Trees and their Quotients, in: Voronoj’s Impact on Modern Science, Kiev, Institute of Mathematics, vol. 2, 125152 (1998).

    • Search Google Scholar
    • Export Citation
  • [7]

    Ustimenko, V., CRYPTIM: Graphs as Tools for Symmetric Encryption, Lecture Notes in Computer Science, Springer, v. 2227, 278287 (2001).

    • Search Google Scholar
    • Export Citation
  • [8]

    Ustimenko, V., Maximality of affine group and hidden graph cryptosystems, J. Algebra Discrete Math., No 1, P. 133150 (2005).

  • [9]

    Wróblewska, A., On some properties of graph based public keys, Albanian Journal of Mathematics, Volume 2, Number 3, 2008, 229234, NATO AdvancedStudies Institute: “New challenges in digital communications”.

    • Search Google Scholar
    • Export Citation
  • [10]

    Ustimenko, Vasyl and Wróblewska, Aneta, On some algebraic aspects of data security in cloud computing, Proceedings of International conference Applications of Computer Algebra, Malaga, p. 144147 (2013).

    • Search Google Scholar
    • Export Citation
  • [11]

    Romańczuk, U. and Ustimenko, V., On regular forests given in terms of algebraic geometry, new families of expanding graphs with large girth and new multivariate cryptographical algorithms, Proceedings of International conference Applications of Computer Algebra, Malaga, p. 135139 (2013).

    • Search Google Scholar
    • Export Citation
  • [12]

    Margulis, G., Explicit group-theoretical constructions of combinatorial schemes and their application to desighn of expanders and concentrators, Probl.Peredachi Informatsii., 24, N1, 5160. English translation publ. Journal ofProblems of Information transmission, 3946 (1988).

    • Search Google Scholar
    • Export Citation
  • [13]

    Lubotsky, A., Philips, R. and Sarnak, P., Ramanujan graphs, J. Comb. Theory, 115, N 2 (1989), 6289.

  • [14]

    Lazebnik, F., Ustimenko, V. A. and Woldar, A. J., A New Series of Dense Graphs of High Girth, Bull (New Series) of AMS, v. 32, N1 (1995), 7379.

    • Search Google Scholar
    • Export Citation
  • [15]

    Guinand, P. and Lodge, J., Tanner type codes arising from large girth graphs, Canadian Workshop on Information Theory CWIT ’97, Toronto, Ontario, Canada, 57 (June 36 1997).

    • Search Google Scholar
    • Export Citation
  • [16]

    MacKay, D. and Postol, M., Weakness of Margulis and Ramanujan–Margulis Low Dencity Parity Check Codes, Electronic Notes in Theoretical ComputerScience, 74 (2003), 8 pp.

    • Search Google Scholar
    • Export Citation
  • [17]

    Ustimenko, V., On some optimisation problems for graphs and multivariate cryptography (in Russian), in: Topics in Graph Theory: A tribute to A. A. and T. E. Zykova on the ocassion of A. A. Zykov birthday, pp. 1525, 2013, www.math.uiuc.edu/kostochka.

    • Search Google Scholar
    • Export Citation
  • [18]

    Ustimenko, V. A., On extremal graph theory and symbolic computations, Dopovidi National Academy of Sci of Ukraine, N2 (2013), 4249 (in Russian).

    • Search Google Scholar
    • Export Citation
  • [19]

    Polak, M. and Ustimenko, V. A., On LDPC Codes Corresponding to Infinite Family of Graphs A(n,K), Proceedings of the Federated Conference on Computer Science and Information Systems (FedCSIS), CANA, Wroclaw, pp. 1123 (September, 2012).

    • Search Google Scholar
    • Export Citation
  • [20]

    Ustimenko, V., On the extremal graph theory for directed graphs and its cryptographical applications, in: T. Shaska, W. C. Huffman, D. Joener and V. Ustimenko, Advances in Coding Theory and Cryptography, Series on Coding andCryptology, vol. 3, 181200 (2007).

    • Search Google Scholar
    • Export Citation
  • [21]

    Kotorowicz, J. and Ustimenko, V., On the implementation of cryptoalgorithms based on algebraic graphs over some commutative rings, Condenced Matters Physics, Special Issue: Proceedings of the international conferences “Infiniteparticle systems, Complex systems theory and its application”, KazimerzDolny, Poland, 2006, 11 (no. 2(54)) 347360 (2008).

    • Search Google Scholar
    • Export Citation
  • [22]

    Ustimenko, V. A. and Romańczuk, U., On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines, in: Artificial Intelligence, Evolutionary Computing andMetaheuristics, In the footsteps of Alan Turing Series: Studies in Computational Intelligence, Vol. 427, Springer, 257285 (January, 2013).

    • Search Google Scholar
    • Export Citation
  • [23]

    Ustimenko, V. A. and Romańczuk, U., On Dynamical Systems of Large Girth or Cycle Indicator and their applications to Multivariate Cryptography, in: ArtificialIntelligence, Evolutionary Computing and Metaheuristics, In the footsteps of Alan Turing Series: Studies in Computational Intelligence, Volume 427, 257285 (January 2013).

    • Search Google Scholar
    • Export Citation
  • [24]

    Klisowski, M. and Ustimenko, V. A., On the Comparison of Cryptographical Properties of Two Different Families of Graphs with Large Cycle Indicator, Mathematics in Computer Science, Volume 6, Number 2, Pages 181198(2012).

    • Search Google Scholar
    • Export Citation
  • [25]

    Ustimenko, V. A., On the cryptographical properties of extreme algebraic graphs, in: Algebraic Aspects of Digital Communications, IOS Press (Lectures of Advanced NATO Institute, NATO Science for Peace and Security Series-D: Information and Communication Security, Volume 24, 296 pp (July 2009).

    • Search Google Scholar
    • Export Citation
  • [26]

    Ustimenko, V., On Multivariate Cryptosystems Based on Computable Maps with Invertible Decompositions, Annales of UMCS, Informatica, volume 14, Specialissue Proceedings of International Conference Cryptography and Security Systems, pp. 718 (2014).

    • Search Google Scholar
    • Export Citation
  • [27]

    Ustimenko, V. A., On multivariate cryptosystem based on maps with logarithmically invertible decomposition corresponding to walk on graph, FedSCIS 2014 Proceedings (to appear as regular paper).

    • Search Google Scholar
    • Export Citation
  • [28]

    Ustimenko, V. A. and Wróblewska, A., On new examples of families of multivariate maps and their cryptographical applications, Proceedings of the Conferenceon Security Systems, Lublin, Annales of UMCS (to appear) (2014).

    • Search Google Scholar
    • Export Citation
  • [29]

    Romańczuk-Polubec, U. and Ustimenko, V. A., On multivariate maps based on polynomially compressed maps with invertible decomposition, Proceedings of the Conference on Security Systems, 2014, Lublin, in: Cryptography and SecuritySystems, Third International Conference, CSS 2014, Lublin, Poland, September 22–24 (2014). Proceedings, Communications in Computer and Information Science, 448, p. 2337.

    • Search Google Scholar
    • Export Citation
  • [30]

    Polak, M. and Ustimenko, V., On LDPC codes based on families of expanding graphs of increasing girth without edge transitive automorphism Groups, Proceedings of the Third International Conference CSS 2014, Lublin, Poland, September 2224, 2014, Communications in Computer and Information Science, 448, p. 2337.

    • Search Google Scholar
    • Export Citation
  • [31]

    Morgenstern, M., Existence and explicit constructions of q + 1-regular Ramanujan graphs for every prime power q, Journal of Combinatorial Theory, Ser. B, (62), no 1 (1994), 4462.

    • Search Google Scholar
    • Export Citation
  • [32]

    Lazebnik, F., Ustimenko, V. A. and Woldar, A. J., Polarities and 2k-cycle-free graphs, Discrete Mathematics, 197/198 (1999), 503513.

    • Search Google Scholar
    • Export Citation
  • [33]

    Romańczuk-Polubiec, U. and Ustimenko, V., On two windows multivariatecryptosystem depending on random parameters, Algebra and Discrete Mathematics, volume 19, N1, pp. 101129 (2015).

    • Search Google Scholar
    • Export Citation
  • [34]

    Klisowski, M., Improvement of the security of cryptographic multivariate algorithms based on algebraic graph theory, PhD Thesis, Chenstohowa, 112 pp(March, 2014).

    • Search Google Scholar
    • Export Citation

Editors in Chief

Gábor SIMONYI (Rényi Institute of Mathematics)
András STIPSICZ (Rényi Institute of Mathematics)
Géza TÓTH (Rényi Institute of Mathematics) 

Managing Editor

Gábor SÁGI (Rényi Institute of Mathematics)

Editorial Board

  • Imre BÁRÁNY (Rényi Institute of Mathematics)
  • Károly BÖRÖCZKY (Rényi Institute of Mathematics and Central European University)
  • Péter CSIKVÁRI (ELTE, Budapest) 
  • Joshua GREENE (Boston College)
  • Penny HAXELL (University of Waterloo)
  • Andreas HOLMSEN (Korea Advanced Institute of Science and Technology)
  • Ron HOLZMAN (Technion, Haifa)
  • Satoru IWATA (University of Tokyo)
  • Tibor JORDÁN (ELTE, Budapest)
  • Roy MESHULAM (Technion, Haifa)
  • Frédéric MEUNIER (École des Ponts ParisTech)
  • Márton NASZÓDI (ELTE, Budapest)
  • Eran NEVO (Hebrew University of Jerusalem)
  • János PACH (Rényi Institute of Mathematics)
  • Péter Pál PACH (BME, Budapest)
  • Andrew SUK (University of California, San Diego)
  • Zoltán SZABÓ (Princeton University)
  • Martin TANCER (Charles University, Prague)
  • Gábor TARDOS (Rényi Institute of Mathematics)
  • Paul WOLLAN (University of Rome "La Sapienza")

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA
Gábor Sági
Address: P.O. Box 127, H–1364 Budapest, Hungary
Phone: (36 1) 483 8344 ---- Fax: (36 1) 483 8333
E-mail: smh.studia@renyi.mta.hu

Indexing and Abstracting Services:

  • CompuMath Citation Index
  • Essential Science Indicators
  • Mathematical Reviews
  • Science Citation Index Expanded (SciSearch)
  • SCOPUS
  • Zentralblatt MATH
2020  
Total Cites 536
WoS
Journal
Impact Factor
0,855
Rank by Mathematics 189/330 (Q3)
Impact Factor  
Impact Factor 0,826
without
Journal Self Cites
5 Year 1,703
Impact Factor
Journal  0,68
Citation Indicator  
Rank by Journal  Mathematics 230/470 (Q2)
Citation Indicator   
Citable 32
Items
Total 32
Articles
Total 0
Reviews
Scimago 24
H-index
Scimago 0,307
Journal Rank
Scimago Mathematics (miscellaneous) Q3
Quartile Score  
Scopus 139/130=1,1
Scite Score  
Scopus General Mathematics 204/378 (Q3)
Scite Score Rank  
Scopus 1,069
SNIP  
Days from  85
submission  
to acceptance  
Days from  123
acceptance  
to publication  
Acceptance 16%
Rate

2019  
Total Cites
WoS
463
Impact Factor 0,468
Impact Factor
without
Journal Self Cites
0,468
5 Year
Impact Factor
0,413
Immediacy
Index
0,135
Citable
Items
37
Total
Articles
37
Total
Reviews
0
Cited
Half-Life
21,4
Citing
Half-Life
15,5
Eigenfactor
Score
0,00039
Article Influence
Score
0,196
% Articles
in
Citable Items
100,00
Normalized
Eigenfactor
0,04841
Average
IF
Percentile
13,117
Scimago
H-index
23
Scimago
Journal Rank
0,234
Scopus
Scite Score
76/104=0,7
Scopus
Scite Score Rank
General Mathematics 247/368 (Q3)
Scopus
SNIP
0,671
Acceptance
Rate
14%

 

Studia Scientiarum Mathematicarum Hungarica
Publication Model Hybrid
Submission Fee none
Article Processing Charge 900 EUR/article
Printed Color Illustrations 40 EUR (or 10 000 HUF) + VAT / piece
Regional discounts on country of the funding agency World Bank Lower-middle-income economies: 50%
World Bank Low-income economies: 100%
Further Discounts Editorial Board / Advisory Board members: 50%
Corresponding authors, affiliated to an EISZ member institution subscribing to the journal package of Akadémiai Kiadó: 100%
Subscription fee 2021 Online subsscription: 672 EUR / 840 USD
Print + online subscription: 760 EUR / 948 USD
Subscription fee 2022

Online subsscription: 688 EUR / 860 USD
Print + online subscription: 776 EUR / 970 USD

Subscription Information Online subscribers are entitled access to all back issues published by Akadémiai Kiadó for each title for the duration of the subscription, as well as Online First content for the subscribed content.
Purchase per Title Individual articles are sold on the displayed price.

Studia Scientiarum Mathematicarum Hungarica
Language English
French
German
Size B5
Year of
Foundation
1966
Publication
Programme
2021 Volume 58
Volumes
per Year
1
Issues
per Year
4
Founder Magyar Tudományos Akadémia  
Founder's
Address
H-1051 Budapest, Hungary, Széchenyi István tér 9.
Publisher Akadémiai Kiadó
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 0081-6906 (Print)
ISSN 1588-2896 (Online)