- Tytuł:
- The average time complexity of probabilistic algorithms for finding generators in finite cyclic groups
- Autorzy:
-
Adamski, T.
Nowakowski, W. - Powiązania:
- https://bibliotekanauki.pl/articles/202161.pdf
- Data publikacji:
- 2015
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
probabilistic algorithm
average time complexity
group generator
cyclic groups
primitive roots
primitive polynomials
algorytm probabilistyczny
generator grupy
grupy cykliczne
wielomian - Opis:
- Generators of finite cyclic groups play important role in many cryptographic algorithms like public key ciphers, digital signatures, entity identification and key agreement algorithms. The above kinds of cryptographic algorithms are crucial for all secure communication in computer networks and secure information processing (in particular in mobile services, banking and electronic administration). In the paper, proofs of correctness of two probabilistic algorithms (for finding generators of finite cyclic groups and primitive roots) are given along with assessment of their average time computational complexity.
- Źródło:
-
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 4; 989-996
0239-7528 - Pojawia się w:
- Bulletin of the Polish Academy of Sciences. Technical Sciences
- Dostawca treści:
- Biblioteka Nauki
Artykuł