Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

1 2011

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: analog graph

Sortuj według:

Ogranicz wyniki do:

Performance of algebraic graphs based stream-ciphers using large finite fields

Touzene A., Ustimenko V., AlRaissi M., Boudeliou I.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

2011

Vol. 11, no. 2

81--93

Algebraic graphs D(n, q) and their analog graphs D(n, K), where K is a finite commutative ring were used successfully in Coding Theory (as Tanner graphs for the construction of LDPC codes and turbo-codes) and in Cryptography (stream-ciphers, public-keys and tools for the key-exchange protocols. Many properties of cryptography algorithms largely depend on the choice of finite field Fq or commutative ring K. For practical implementations the most convenient fields are F and rings modulo Z modulo 2m. In this paper the reader can find the first results about the comparison of D(n, 2m) based stream-ciphers for m = 8, 16, 32 implemented in C++. They show that performance (speed) of algorithms gets better when m is increased.