Géza Horváth

dblp:59/5061 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0008-4156-9873ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 since 2021
YearPublicationVenuePosition
2023 Simple chain automaton random number generator for IoT devices
abstract
Abstract Random numbers are very important in many fields of computer science. Generating high-quality random numbers using only basic arithmetic operations is challenging, especially for devices with limited hardware capabilities, such as Internet of Things (IoT) devices. In this paper, we present a novel pseudorandom number generator, the simple chain automaton random number generator (SCARNG), based on compositions of abstract automata. The main advantage of the presented algorithm is its simple structure that can be implemented easily for very low computing capacity IoT systems, FPGAs or GPU hardware. The generated random numbers demonstrate promising statistical behavior and satisfy the NIST statistical suite requirements, highlighting the potential of the SCARNG for practical applications.
Pál Dömösi, Géza Horváth, Norbert Tihanyi
Acta Informatica2
2009 On the Shyr-Yu theorem
Pál Dömösi, Géza Horváth, Laurent Vuillon
Theor. Comput. Sci.2
2006 Alternative proof of the Lyndon-Schützenberger Theorem
Pál Dömösi, Géza Horváth
Theor. Comput. Sci.2