Parallel generator of q-unit pseudorandom sequences based on arithmetic polynoms
- 1 Ph.D. (Eng.), Branch of the Military Academy of Communications, Krasnodar, Russia
- 2,5 Branch of the Military Academy of Communications, Krasnodar, Russia
- 3 Ph.D. (Eng.), Associate Professor, Branch of the Military Academy of Communications, Krasnodar, Russia
- 4 Dr.Sc. (Eng.), Professor, Branch of the Military Academy of Communications, Krasnodar, Russia
Abstract
A parallel algorithm for generating q-valued pseudorandom sequences based presentation systems generating recurrent logical formulas. In contrast to the known methods, the proposed approach offers receive fragments pseudorandom sequences by computing a recursive arithmetic formula. The achieved results can be widely used in the implementation of advanced high-performance cryptographic information security, as well as secure radio systems with spread spectrum signals. The developed algorithm can be used in advanced high-performance tools of information protection.
How to cite
Самойленко Д.В., Диченко С.А., Елисеев Н.И., Финько О.А., Меретуков К.С. Параллельный генератор q-значных псевдослучайных последовательностей на арифметических полиномах // Нейрокомпьютеры: разработка, применение. 2014. № 9. С. 73–77.
References
- Shnaer B. Prakticheskaya kriptografiya. M.: Vil'yams. 2005. 424 s.
- Varakin L.Ye. Sistemy svyazi s shumopodobnymi signalami. M.: Radio i svyaz'. 1985. 384 s.
- Lidl R., Niderrayter G. Konechnye polya: V 2-kh t. T. 2. Per. s angl. M.: Mir. 1988. 822 s.
- Alekseev A.I., Sheremet'ev A.G., Tuzov G.I., Glazov B.I. Teoriya i primenenie psevdosluchaynykh signalov. M.: Nauka. 1969. 366 s.
- Malyugin V.D. Realizatsiya bulevykh funktsiy arifmeticheskimi polinomami //Avtomatika i telemekhanika. 1982. № 4. S. 84−93.
- Malyugin V.D. Realizatsiya kortezhey bulevykh funktsiy posredstvom lineynykh arifmeticheskikh polinomov // Avtomatika i telemekhanika. 1984. № 2. S. 114−122.
- Galushkin A.I., Yevdokimov A.O., Lavrinenko A.V., Lavrinenko I.A, Chervyakov N.I. Primenenie iskusstvennykh neyronnykh setey i sistemy ostatochnykh klassov v kriptografii. M.: FIZMATLIT. 2012. 280 s.
- Dichenko S.A., Vishnevskiy A.K., Fin'ko O.A. Realizatsiya dvoichnykh psevdosluchaynykh posledovatel'nostey lineynymi chislovymi polinomami // Izvestiya YuFU. Tekhnicheskie nauki. 2011. № 12. S.130−140.
- Dichenko S.A., Fin'ko O.A. Bezopasnye generatory psevdosluchaynykh lineynykh posledovatel'nostey na arifmeticheskikh polinomakh dlya zashchishchennykh sistem svyazi // Nelineynyy mir. 2013. № 9. T. 11. S. 632−647.
- Dichenko S.A., Yeliseev N.I., Fin'ko O.A. Kontrol' oshibok funktsionirovaniya generatorov dvoichnykh PSP, realizovannykh na arifmeticheskikh polinomakh // Nauchno-tekhnicheskie vedomosti SPbGPU. Informatika. Telekommunikatsii. Upravlenie. 2013. T. 176. № 4. S. 142-149.
- Faradzhev R.G. Lineynye posledovatel'nostnye mashiny. M.: Sovetskoe radio. 1975. 248s.
- Aslanova N.Kh., Faradzhev R.G. Ob arifmeticheskom predstavlenii funktsiymnogoznachnoy logiki i parallel'nom algoritme nakhozhdeniya takogo predstavleniya // Avtomatika i telemekhanika. 1992. № 2. S. 120−131.
- Fin'ko O.A. Modulyarnye formy sistem k-znachnykh funktsiy algebry logiki // Avtomatika i telemekhanika. 2005. № 7. S. 66-86.
- Kukharev G.A., Shmerko V.P., Zaytseva Ye.N. Algoritmy i sistolicheskie protsessory mnogoznachnykh dannykh. Minsk: Nauka i tekhnika. 1990. 296 s.
- Fin'ko O.A. Modulyarnaya arifmetika parallel'nykh logicheskikh vychisleniy. M.: IPU RAN. 2003. 224 s.