Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Bulletin of the Polish Academy of Sciences. Technical Sciences

1 2015

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: generator grupy

Sortuj według:

Ogranicz wyniki do:

The average time complexity of probabilistic algorithms for finding generators in finite cyclic groups

Adamski T., Nowakowski W.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2015

Vol. 63, nr 4

989--996

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.