1,720,963 research outputs found
Discrete signals with special correlation properties
No full textThe methods of synthesis of discrete signals are analyzed with the special cross-correlation properties: m- sequences, signals of Legendre, Barker, Paley-Plotkin, Gold, small and large set of Kasami. Comparative researches of properties of the formed discrete signals are conducted. Separate direction develops in development of methods of forming of discrete signals, that is based on the use of algebraic and structural properties of circular shifts of group codes. It is shown that offered approach allows forming the great numbers of discrete sequences, ensemble and cross-correlation properties of that are set by the properties of the corresponding group controlled from distance, structural and cyclic
NIST PQC: Code-based CryptoSystems*
No full textThe code-based schemes, which were submitted to the contest of post-quantum crypto algorithms NIST PQC, are studied in this work. The general characteristics of the algorithms are explored and basic properties and parameters are estimated. A comparative analysis of the electronic digital signature schemes, public-key cryptosystems and key encapsulation schemes are carried out according to the criteria of speed and length of the main cryptographic parameters
Soft decoding based on ordered subsets of verification equations of turbo-productive codes
No full textMethods of soft decoding of cascade code constructions based on the schemes-products of linear block codes (Turbo Product Codes) are considered. An approach is being developed based on the iterative exchange of soft solutions between block codes constituting a cascade design. It is shown that a sequential execution of procedures for the formation of ordered subsets of test equations and the logarithms estimation of a likelihood ratio allows decoding of turbo-productive codes according to the criterion of minimizing the erroneous reception of code symbols
Soft decoding based on ordered subsets of verification equations of turbo-productive codes
No full textMethods of soft decoding of cascade code constructions based on the schemes-products of linear block codes (Turbo Product Codes) are considered. An approach is being developed based on the iterative exchange of soft solutions between block codes constituting a cascade design. It is shown that a sequential execution of procedures for the formation of ordered subsets of test equations and the logarithms estimation of a likelihood ratio allows decoding of turbo-productive codes according to the criterion of minimizing the erroneous reception of code symbols
NIST PQC: Code-based CryptoSystems*
No full textThe paper presents results of the experimental study of the k-dimensionality of the LILI-128 cipher Boolean function, which demonstrated the potential for the execution of a statistical attack based on near-proximity of the Boolean functions with algebraically degenerate functions
The decentralized voting model using the hyperledger platform paper
No full textIt is presented theoretical statements about decentralized systems technology, blockchain networks, their structure as well as main functioning principles, structure and material about Hyperledger platform. It is examined Hyperledger services architecture, spheres of use and such important aspects as smart-contracts and their application, as well as advantages of using this platform. It is also modelled and explained the algorithm and schematic diagram of voting network built with Hyperledger platform
Soft decoding method for turbo-productive codes
No full textA decoding algorithm for cascade code constructions with iterative exchange of soft solutions is proposed. The developed algorithm is based on the sequential execution of procedures for the formation of ordered subsets of test equations and the evaluation of logarithms of the likelihood ratio, and allows decoding cascade code structures according to the criterion of minimizing the error reception of code symbols in a finite number of steps
Heuristic methods of gradient search for the cryptographic boolean functions
No full textHeuristic methods of gradient search of the cryptographic Boolean functions that satisfy the required properties of balance, nonlinearity, autocorrelation, and other stability indicators are considered. The proposed method of gradient descent is investigated, in particular, estimates of nonlinearity and correlation immunity of the synthesized Boolean functions are given. A method for evaluating the computational efficiency of gradient search methods is proposed, based on the construction of sample (empirical) distribution functions, which characterize the probability of the formation of the Boolean functions with persistence indicators not lower than those required. As an indicator of computational efficiency, we propose the average number of attempts that need to be performed using the heuristic method to form a cryptographic Boolean function with the required properties. It is shown that the proposed gradient descent method allows the formation of cryptographic functions with the required durability indicators in fewer steps. The results of investigations of the cryptographic properties of the formed Boolean functions in comparison with the best known assessments are given
Construction of cascade codes in the frequency domain
No full textThe mathematical apparatus of the multidimensional discrete Fourier transform over finite fields is considered. Methods for the description of linear block codes in the frequency domain are investigated. It is shown that, in contrast to iterative codes (code-products), cascade codes in the general case cannot be described in the frequency domain in terms of multidimensional spectra. Analytic expressions are obtained that establish a one-to-one functional correspondence between the spectrum of a sequence over a finite field and the spectra of the corresponding words obtained by limiting this word to a subfield. A general solution of the problem of representation of cascade codes in the frequency domain is obtained, which allows constructing in the frequency domain using computationally efficient algorithms of encoding and decoding, and the derived analytic dependences of components of multidimensional spectra
Evaluation of Algebraic Immunity of modern block ciphers
No full textThe methods for computing of Algebraic Immunity of cryptographic Boolean functions and non-linear substitutions (substitutions) blocks of symmetric ciphers are explored. The results of a comparative analysis of the Algebraic Immunity of nonlinear blocks of symmetric ciphers are denoted
- …
