Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Ustimenko, V." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition
    Autorzy:
    Ustimenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/106324.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    multivariate map
    invertible decomposition
    public key infrastructure
    Opis:
    Let K be a commutative ring and K^n be a space over K of dimension n. We introduce the concept of a family of multivariate maps f(n) of K^n into itself with invertible decomposition.If f(n) is computable in polynomial time then it can be used as the public rule and the invertible decomposition provides a private key in f(n) based public key infrastructure. Requirementsof polynomial ity of degree and density for f(n) allow to estimate the complexity of encryption procedurefor a public user. The concepts of a stable family and a family of increasing order are motivatedby the studies of discrete logarithm problem in the Cremona group. The statement on the existenceof families of multivariate maps of polynomial degree and polynomial density of increasing order with the invertible decomposition is proved. The proof is supported by explicite construction which canbe used as a new cryptosystem. The presented multivariate encryption maps are induced by special walks in the algebraically dened extremal graphs A(n;K) and D(n;K) of increasing girth.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2014, 14, 1; 7-17
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes
    Autorzy:
    Polak, M.
    Ustimenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/106138.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    Ramanujan graphs
    LDPC codes
    Opis:
    Expander graphs are highly connected sparse finite graphs. The property of being an expander seems significant in many of these mathematical, computational and physical contexts. For practical applications it is very important to construct expander and Ramanujan graphs with given regularity and order. In general, constructions of the best expander graphs with a given regularity and order is no easy task. In this paper we present algorithms for generation of Ramanujan graphs and other expanders. We describe properties of obtained graphs in comparison to previously known results. We present a method to obtain a new examples of irregular LDPC codes based on described graphs and we briefly describe properties of this codes.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2015, 15, 2; 14-21
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
    Autorzy:
    Romańczuk, U.
    Ustimenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/106152.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    cryptographic algorithm
    encryption map
    automorphism group
    Boolean ring
    Opis:
    The family of algebraic graphs A(n;K) defined over the finite commutative ring K were used for the design of different multivariate cryptographical algorithms (private and public keys, key exchange protocols). The encryption map corresponds to a special walk on this graph. We expand the class of encryption maps via the use of an automorphism group of A(n;K). In the case of characteristic 2 the encryption transformation is a Boolean map. We change finite field for the commutative ring of characteristic 2 and consider some modifications of algorithm which allow to hide a ground commutative ring.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 3; 89-106
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    LDPC codes based on algebraic graphs
    Autorzy:
    Polak, M.
    Ustimenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/106289.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    algebraic graph
    LDPC codes
    MAP decoder
    Opis:
    In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic graphs. The graphs considered in this article come from the infinite incidence structure. We describe how to construct these codes, choose the parameters and present several simulations, done by using the MAP decoder. We describe how error correcting properties are dependent on the graph structure. We compare our results with the currently used codes, obtained by Guinand and Lodge [1] from the family of graphs D(k; q), which were constructed by Ustimenko and Lazebnik [2].
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 3; 107-119
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
    Autorzy:
    Ustimenko, V.
    Wroblewska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/106218.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    discrete logarithm
    cryptographic algorithm
    cryptography
    public key cryptography
    Opis:
    Let K be a finite commutative ring and f = f(n) a bijective polynomial map f(n) of the Cartesian power K^n onto itself of a small degree c and of a large order. Let f^y be a multiple composition of f with itself in the group of all polynomial automorphisms, of free module K^n. The discrete logarithm problem with the pseudorandom base f(n) (solvef^y = b for y) is a hard task if n is sufficiently large. We will use families of algebraic graphs defined over K and corresponding dynamical systems for the explicit constructions of such maps f(n) of a large order with c = 2 such that all nonidentical powers f^y are quadratic polynomial maps. The above mentioned result is used in the cryptographical algorithms based on the maps f(n) – in the symbolic key exchange protocols and public keys algorithms.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 3; 65-74
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
    Autorzy:
    Ustimenko, V.
    Wroblewska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/106224.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    key exchange
    polynomial mapping
    stable degree
    Opis:
    We say that the sequence gn, n≥3, n→∞ of polynomial transformation bijective mapsof free module Kgn over commutative ring K is a sequence of stable degree if the order of gn is growing with n and the degree of each nonidentical polynomial map of kind gkn is an independent constant c. Transformation b = τgnkτ−1, where τ is the affine bijection, n is large and k is relatively small, can be used as a base of group theoretical Diffie-Hellman key exchange algorithm for the Cremona group C(Kn) of all regular automorphisms of Kn. The specific feature of this method is that the order of the base may be unknown for the adversary because of the complexity of its computation. The exchange can be implemented by tools of Computer Algebra (symbolic computations). The adversary can not use the degree of right handside in bx = d to evaluate unknown x in this form for the discrete logarithm problem. In the paper we introduce the explicit constructions of sequences of elements of stable degree for the cases c = 3 and c = n+2/4 for each commutative ring K containing at least 3 regular elements and discuss the implementation of related key exchange and multivariate map algorithms.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2013, 13, 1; 63-80
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications
    Autorzy:
    Wróblewska, A.
    Ustimenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/106283.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    multivariate map
    cryptographical application
    stable element
    invertible decomposition
    Opis:
    Let K be a general finite commutative ring. We refer to a family gn, n = 1, 2, . . . of bijective polynomial multivariate maps of Kn as a family with invertible decomposition gn = gn1 gn2 . . . g gnk, such that the knowledge of the composition of gni allows computation of gni for O(ns) (s > 0) elementary steps. A polynomial map g is stable if all non-identical elements of kind gt, t > 0 are of the same degree. We construct a new family of stable elements with invertible decomposition. This is the first construction of the family of maps based on walks on the bipartite algebraic graphs defined over K, which are not edge transitive. We describe the application of the above mentioned construction for the development of stream ciphers, public key algorithms and key exchange protocols. The absence of edge transitive group essentially complicates cryptanalysis.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2014, 14, 1; 19-36
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies