Temat: stream ciphers - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Generating quasigroups for cryptographic applications
Autorzy:: Kościelny, Cz.
Powiązania:: https://bibliotekanauki.pl/articles/908515.pdf
Data publikacji:: 2002
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: informatyka
quasigroups
latin squares
stream ciphers
cryptography
Opis:: A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the ciphertext. From the practical viewpoint, the most important quasigroups are of order 256, suitable for a fast software encryption of messages written down in the universal ASCII code. That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2002, 12, 4; 559-569
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Using SAT Solvers to Finding Short Cycles in Cryptographic Algorithms
Autorzy:: Dudzic, Władysław
Kanciak, Krzysztof
Powiązania:: https://bibliotekanauki.pl/articles/226471.pdf
Data publikacji:: 2020
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: NLFSR
short cycles
stream ciphers
Trivium
Bivium
Grain-80
Grain-128
Opis:: A desirable property of iterated cryptographic algorithms, such as stream ciphers or pseudo-random generators, is the lack of short cycles. Many of the previously mentioned algorithms are based on the use of linear feedback shift registers (LFSR) and nonlinear feedback shift registers (NLFSR) and their combination. It is currently known how to construct LFSR to generate a bit sequence with a maximum period, but there is no such knowledge in the case of NLFSR. The latter would be useful in cryptography application (to have a few taps and relatively low algebraic degree). In this article, we propose a simple method based on the generation of algebraic equations to describe iterated cryptographic algorithms and find their solutions using an SAT solver to exclude short cycles in algorithms such as stream ciphers or nonlinear feedback shift register (NLFSR). Thanks to the use of AIG graphs, it is also possible to fully automate our algorithm, and the results of its operation are comparable to the results obtained by manual generation of equations. We present also the results of experiments in which we successfully found short cycles in the NLFSRs used in Grain-80, Grain-128 and Grain-128a stream ciphers and also in stream ciphers Bivium and Trivium (without constants used in the initialization step).
Źródło:: International Journal of Electronics and Telecommunications; 2020, 66, 3; 443-448
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Phase-shift Fault Analysis of Grain v1
Autorzy:: Hromada, V.
Pethö, T.
Powiązania:: https://bibliotekanauki.pl/articles/226344.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: stream ciphers
Grain v1
fault analysis
phase-shift attack
desynchronization attack
Opis:: This paper deals with the phase-shift fault analysis of stream cipher Grain v1. We assume that the attacker is able to desynchronize the linear and nonlinear registers of the cipher during the keystream generation phase by either forcing one of the registers to clock one more time, while the other register is not clocked, or by preventing one of the registers from clocking, while the other register is clocked. Using this technique, we are able to obtain the full inner state of the cipher in reasonable time (under 12 hours on a single PC) by using 150 bits of unfaulted keystream, 600 bits of faulted keystreams and by correctly guessing 28 bits of the linear register.
Źródło:: International Journal of Electronics and Telecommunications; 2018, 64, 2; 131-136
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: A Quasigroup-Based Public-Key Cryptosystem
Autorzy:: Kościelny, Cz.
Mullen, G. L.
Powiązania:: https://bibliotekanauki.pl/articles/908276.pdf
Data publikacji:: 1999
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: quasi-grupy
kwadrat łaciński
kryptografia
szyfr strumieniowy
quasigroups
latin squares
cryptography
stream ciphers
Opis:: A public-key cryptosystem, using generalized quasigroup-based streamciphers is presented. It is shown that such a cryptosystem allows one to transmit securely both a cryptogram and a secret portion of the enciphering key using the same insecure channel. The system is illustrated by means of a simple, but non-trivial, example.
Źródło:: International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 955-963
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "stream ciphers" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język