Zobrazeno 1 - 10
of 283
pro vyhledávání: '"A. A. Moldovyan"'
Publikováno v:
Информатика и автоматизация, Vol 23, Iss 4, Pp 1246-1276 (2024)
Одним из направлений разработки практичных постквантовых криптографических алгоритмов с открытым ключом является использование коне
Externí odkaz:
https://doaj.org/article/26e989707daa4d31a22000dd1e405eec
Autor:
Alexandr Moldovyan, Nikolay Moldovyan
Publikováno v:
Computer Science Journal of Moldova, Vol 32, Iss 1(94), Pp 46-60 (2024)
The central issue of the development of the multivariate public key algorithms is the design of reversible non-linear mappings of $n$-dimensional vectors over a finite field, which can be represented in a form of a set of power polynomials. For the f
Externí odkaz:
https://doaj.org/article/f9785cd1c76641e8a7e8765a393c7f3c
Publikováno v:
Mathematics, Vol 12, Iss 13, p 1970 (2024)
To eliminate the limitations of signature randomization in known algebraic algorithms with a hidden group, the security of which is based on the computational complexity of solving large systems of power equations, a method for ensuring complete rand
Externí odkaz:
https://doaj.org/article/3ddd7e6f31f445d399cda660f4d2a501
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dmitriy N. Moldovyan
Publikováno v:
Computer Science Journal of Moldova, Vol 31, Iss 1(91), Pp 111-124 (2023)
The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem. A similar design, used t
Externí odkaz:
https://doaj.org/article/c0e034fbc2014da9bfc046ccab04db9b
Publikováno v:
In Computer Standards & Interfaces August 2023 86
Autor:
A.A. Moldovyan, N.A. Moldovyan
Publikováno v:
Computer Science Journal of Moldova, Vol 30, Iss 2(89), Pp 243-258 (2022)
A new form of the hidden discrete logarithm problem, called split logarithm problem, is introduced as primitive of practical post-quantum digital signature schemes, which is characterized in using two non-permutable elements $A$ and $B$ of a finite n
Externí odkaz:
https://doaj.org/article/fb626adb7a08455ea50dba477e91e227
Publikováno v:
Proceedings of the Conference MFOI2018, July 2-6, 2018, Chisinau, pages 17-20, Moldova, 2018
We count number of groupoids of order 3 with some Bol-Moufang type identities.
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/1812.02511
Autor:
Moldovyan, Alexandr1 maa1305@yandex.ru, Moldovyan, Nikolay1 nmold@mail.ru
Publikováno v:
Computer Science Journal of Moldova. 2024, Vol. 32 Issue 1, p46-60. 15p.
Publikováno v:
In Microprocessors and Microsystems February 2021 80