ARTICLE | doi:10.20944/preprints202208.0348.v1
Subject: Mathematics & Computer Science, Applied Mathematics Keywords: robust codes; bent-functions; spline-wavelet decomposition; error detection
Online: 18 August 2022 (11:07:32 CEST)
The paper investigates new robust code constructions based on bent functions and spline–wavelet transformation. Implementation of bent functions in codes construction increases the probability of error detection in the data channel and cryptographic devices. Meanwhile, use of spline–wavelets theory for constructing the codes gives the possibility to increase system security from the actions of an attacker. Presented constructions combines spline–wavelets functions and bent functions. Developed robust codes, compared to existing ones, have a higher parameter of maximum error masking probability. Illustrated codes are ensuring the security of transmitted information. Some of the granted constructions were implemented on FPGA.
ARTICLE | doi:10.20944/preprints202208.0016.v1
Subject: Mathematics & Computer Science, Applied Mathematics Keywords: Security; Pseudorandom Number Generation; Parallel Computing; Cellular Automata
Online: 1 August 2022 (09:21:14 CEST)
Nowadays the practice of developing algorithms to maintain the confidentiality of data shows that there is a lack of some features, such as velocity, predictability, etc. Generating pseudorandom numbers is one such problem that lies in the basement of many algorithms, even in hardware microprograms. An unreliable generator can cause cyberattacks on it, despite the security in the upper layers. At the same time, the algorithm should be fast enough to provide uninterrupted circuit work for the entire system. The paper presents a new algorithm generating pseudorandom numbers on cellular automata, which is not only fast and easy-repeating, but unpredictable enough and can be used in cryptographic systems. Using the NIST statistical test suite for random and pseudorandom number generators (PRNG), it is shown that the presented algorithm is more than three times superior to the state-of-the-art methods and algorithms in terms of ? − ?????. A high level of the presented algorithm’s parallelization allows for implementation it effectively on calculators with parallel structure. CPU-based architecture, FPGA-based architecture, CUDA- based architecture of PRNG and different PRNG implementations are presented to confirm high performance of the proposed solution.