Temat: key - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Energy-aware key management in mobile wireless sensor networks
Autorzy:: He, X.
Szalachowski, P.
Kotulski, Z.
Fotiou, N.
Marias, G. F.
Polyzos, G. C.
Meer de, H.
Powiązania:: https://bibliotekanauki.pl/articles/106190.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:: wireless sensor networks
Diffie-Hellman key agreement
key management
Opis:: Wireless sensor networks have received wide attention recently across the indoor and outdoor applications. On the other hand, more and more application scenarios require sensor nodes to be mobile, which imposes new technological challenges for security. Key management is the core for secure data communications among the resource-constrained sensor nodes. In this paper, based on the Group Diffie-Hellman key agreement protocols and the energy level of each node in the network, we propose Energy Aware Group Diffie-Hellman key management protocol for mobile wireless sensor networks. The simulation results show that the proposed key management protocol provide significant improvement in maximizing the lifetime of networks.
Źródło:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 4; 83-96
1732-1360
2083-3628
Pojawia się w:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

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 g_n, n≥3, n→∞ of polynomial transformation bijective mapsof free module Kgⁿ over commutative ring K is a sequence of stable degree if the order of g_n is growing with n and the degree of each nonidentical polynomial map of kind g^k_n is an independent constant c. Transformation b = τg_n^kτ−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(Kⁿ) of all regular automorphisms of Kⁿ. 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 b^x = 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ł

Zmień widok

na półce

Skocz do pozycji: 3.

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ł

Zmień widok

na półce

Skocz do pozycji: 4.

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ł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Stereoscopic video chroma key processing using NVIDIA CUDA
Autorzy:: Sagan, J.
Powiązania:: https://bibliotekanauki.pl/articles/106272.pdf
Data publikacji:: 2013
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:: NVIDIA CUDA
chroma key processing
GPU
CPU
stereoscopic images
Opis:: In this paper, I use the NVIDIA CUDA technology to perform the chroma key algorithm on stereoscopic images. NVIDIA CUDA allows to process parallel algorithms on GPU. Input data are stereoscopic images with the monochromatic background and the destination background image. Output data is the combination of inputs by using the chroma key. I compare the algorithm efficiency between the GPU and CPU execution.
Źródło:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2013, 13, 1; 81-87
1732-1360
2083-3628
Pojawia się w:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "key" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język