1,720,986 research outputs found
Deep Learning Based Fuzzy Extractor for Generating Strong Keys from Biometric Face Images
No full textThe Design of Boolean Functions by Modified Hill Climbing Method
No full textWith cryptographic investigations, the design of Boolean functions is a wide area. The Boolean functions play important role in the construction of a symmetric cryptosystem. In this paper the modified hill climbing method is considered. Using hill climbing techniques, the method allows modifying bent functions used to design balanced, highly non-linear Boolean functions with high algebraic degree and low autocorrelation. The experimental results of constructing the cryptographically strong Boolean functions are presented. © 2009 IEEE
Experimental Studies Of The Modern Symmetric Stream Ciphers
No full textThe paper is a continuation of numerous studies of a candidate for encryption national standard of Ukraine, the Strumok new symmetric stream cipher. The result of a study is compare the most famous algorithms of stream cipher, which were presented at various contests, such as eSTREAM, NESSIE and the AES symmetric block cipher in mode of stream about usage CPU time for transformation of one octet data
Periodic Properties of Cryptographically Strong Pseudorandom Sequences
No full text'Provable' strength generators of pseudo-random sequences have been considered in this paper, whose cryptanalysis problem reduces to solving a well-known and extremely complex mathematical problem related to the NP-complex class. In particular, the generators Blum-Blum-Shub, Rivest-Shamir-Adleman, Dual Elliptic Curve Deterministic Random Bit Generator and Pseudo-Random Generator Provably as Secure as Syndrome Decoding are considered. The periodic properties of generated pseudorandom sequences are investigated. It is shown that the considered generators do not allow forming sequences of the maximum period. In addition, for each generator there are initial states (weak keys), leading to catastrophically small lengths of the periods of generated sequences
Residual classes based mathematical model of the computer system's reliability
No full textIt is also known, and it is practically shown that the use of a unposition number system in residual classes (RNS) allows you to drastically increase the speed of the computer system (CS). There are various approaches and difficulties regarding to the assessment of the reliability of the CS in RNS. So, the existing options of mathematical models do not always satisfy a comprehensive assessment of the reliability of the CS in RNS. The variant of mathematical model of reliability of CS, that functions in RNS, is considered in the article, based on the use of a mathematical model of structural sliding backup in the case of a loaded mode of operation of the backup elements, which is used in the positional binary number system (PBNS). A calculation and comparative security of the trooped computing structure (TCS) analysis was carried out in PBNS with an ideal majority element and the CS in RNS with an ideal reliability machine. The results of analysis showed the following. At the initial stage of the functioning of computational systems, reliability, by probability of trouble-free operation, the CS in RNS with two control bases above the reliability of the trooked positional computing structure, widely used in the PDS and with a smaller addition of an additional equipment insertion. It supposes the effective use of RNS for the increase of reliability of CS and computing devices on the initial stage of their functioning. For example, for the increase of reliability the practical use of unposition code structures is possible in RNS in the side digital calculable complexes of ballistic rockets and in the computing devices of pilotless aircrafts of brief action
New Code Based Fuzzy Extractor for Biometric Cryptography
No full textIn this paper methods of forming cryptographic keys from biometric images using fuzzy extractors are considered. A new scheme of a fuzzy extractor based on the McEIiece cryptosystem is proposed. It is shown that the new design of the fuzzy extractor allows forming cryptographic passwords from biometric images even without the use of non-secret helper string. When using helper string, the proportion of corrected distortions of biometric images increases significantly. In addition, the proposed design relates to a class of post-quantum information security methods, i.e. it is expected to be safely used even for solving cryptanalysis problems with universal quantum computers
Heuristic Methods of Hill Climbing of Cryptographic Boolean Functions
No full textIn this article, heuristic methods of hill climbing for cryptographic Boolean functions satisfying the required properties of balance, nonlinearity, autocorrelation, and other stability indicators are considered. A technique for estimating the computational efficiency of gradient search methods is proposed, based on the construction of selective (empirical) distribution functions characterizing the probability of the formation of Boolean functions with indices of stability not lower than required. As an indicator of computational efficiency, an average number of attempts is proposed to be performed using a heuristic method to form a cryptographic Boolean function with the required properties. Comparative assessments of the effectiveness of the heuristic methods are considered
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
