Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Annals of Computer Science and Information Systems

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: multivariate cryptography

Sortuj według:

Ogranicz wyniki do:

On D(n; q) quotients of large girth and hidden homomorphism based cryptographic protocols

Ustymenko Vasyl, Klisowski Michał

Annals of Computer Science and Information Systems

2022

Vol. 32

199--206

Noncommutative cryptography is based on applications of algebraic structures like noncommutative groups,semigroups, and noncommutative rings. Its intersection withMultivariate cryptography contains studies of cryptographicapplications of subsemigroups and subgroups of affine Cremona semigroups defined over finite commutative rings. Efficientlycomputed homomorphisms between stable subsemigroups of affine Cremona semigroups can be used in tame homomorphisms protocols schemes and their inverse versions. The implementationscheme with the sequence of subgroups of affine Cremona group that defines the projective limit was already suggested. We present the implementation of another scheme that uses two projective limits which define two different infinite groups and the homomorphism between them. The security of the corresponding algorithm is based on complexity of the decomposition problem for an element of affine Cremona semigroup into a product of given generators. These algorithms may be used in postquantum technologies.

On computations with Double Schubert Automaton and stable maps of multivariate cryptography

Ustymenko Vasyl

Annals of Computer Science and Information Systems

2021

Vol. 26

123--130

The families of bijective transformations Gn of affine space Kn over general commutative ring K of increasing order with the property of stability will be constructed. Stability means that maximal degree of elements of cyclic subgroup generated by the transformation of degree d is bounded by d. In the case K-Fq these transformations of Kn can be of an exponential order. We introduce large groups formed by quadratic transformations and numerical encryption algorithm protected by secure protocol of Noncommutative Cryptography. The construction of transformations is presented in terms of walks on Double Schubert Graphs.

Expanding graphs of the Extremal Graph Theory and expanded platforms of post quantum cryptography

Ustimenko Vasyl, Romańczuk-Polubiec Urszula, Wróblewska Aneta

Annals of Computer Science and Information Systems

2019

Vol. 19

41--46

Explicit constructions in Extremal Graph Theory give appropriate lower bounds for Turan type problems. In the case of prohibited cycles, the explicit constructions can be used for various problems of Information Security. We observe recent applications of algebraic constructions of regular graphs of large girth and graphs with large cycle indicator to Coding Theory and Cryptography. In particular, we present a new multivariate platforms of postquantum Non-commutative Cryptography defined in graph theoretical terms.