По вашему запросу найдено документов: 3699
Страница 1 из 370
О генерической сложности проблемы дискретного логарифмаOn generic complexity of the discrete logarithm problem
Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic systemWe present an efficient algorithm to compute a discrete logarithm in a finite nilpotent group
Трехразрядный вариант алгоритма «baby-step giant-step» в проблеме дискретного логарифмирования.
In addition to Shanks’ «baby-step giant step» algorithm of finding discrete logarithms the authors
suggest a
The complication of discrete logarithms in fields of characteristic 2The complication of discrete logarithms in fields of characteristic 2
On the comparison of methods for asymmetric execution of cryptographic primitives and protocols in the context of using small parameters and short keys of keys due to the small size of these keys, as well as methods for solving problems of discrete logarithm
An improvement of cryptographic schemes based on the conjugacy search problem. The Diffie — Hellman protocol, based on the discrete logarithm problem, which is generally difficult to solve
Discrete pseudo-differential operators and boundary value problems in a half-space and a coneWe consider a certain class of discrete pseudo-differential operators and related equations in a
Super-efficient robust estimation in Lévy continuous time regression models from discrete data the condition that the observations are accessi-ble only at discrete time moments. In this paper, based
On Direct and Inverse Problems of Logarithmic Potential With Finite Number of Parameters for solving inverse problems of logarithmic potential and that of A. V. Tsirul’skii’s method for solving
Страница 1 из 370
Фасеты
Партнеры
Индексация
