1,195 Hits in 3.2 sec

New Class of Pseudorandom D-sequences to Generate Cryptographic Keys [article]

B. Prashanth Reddy
2015 arXiv   pre-print
This article proposes the use of pseudorandom decimal sequences that have gone through an additional random mapping for the design of cryptographic keys.  ...  We show that the resulting pseudorandom sequences have excellent autocorrelation properties. Such a method can be extended to inverse prime expansions to any base.  ...  the property that is essential in generating cryptographic keys.  ... 
arXiv:1507.00712v1 fatcat:xsdyxbpuubgulhvvunvdbetkle

NOCAS : A Nonlinear Cellular Automata Based Stream Cipher

Sandip Karmakar, Dipanwita Roy Chowdhury
2011 Discrete Mathematics & Theoretical Computer Science  
However, a number of attacks are mounted on these type of ciphers. Cellular Automata (CA) has recently been chosen as a suitable structure for crypto-primitives.  ...  It is designed to produce $\mathrm{2^{128}}$ random keystream bits and initialization phase is made faster 4 times than that of Grain-128. We also analyze the cryptographic strength of this cipher.  ...  Hybrid Nonlinear CA In [KMC10] , a number of cellular automata have been synthesized and their cryptographic properties have been studied.  ... 
doi:10.46298/dmtcs.2970 fatcat:qzqatfyxkbg57lxdfucfsk3gn4

Heuristic Search of (Semi-)Bent Functions based on Cellular Automata [article]

Luca Mariot, Martina Saletta, Alberto Leporati, Luca Manzoni
2021 arXiv   pre-print
An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions: given a known function with a good cryptographic profile, the aim  ...  is to extend it to a (usually larger) function possessing analogous properties.  ...  the relevance of a cryptographic property for Boolean functions in a CA-based pseudorandom generator model.  ... 
arXiv:2111.13248v1 fatcat:5geqlgjhwjd2deaopvi6gfifwa

Page 5920 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
(J-TOK YTE-IN; Meguro); Kurosawa, Kaoru (J-IBAR-CI; Hitachi Non-cryptographic primitive for pseudorandom permutation.  ...  This is the first example in which a non-cryptographic primitive is substituted to construct the minimum round super-pseudorandom permutation.  ... 

On the Cryptographic Measures and Chaotic Dynamical Complexity Measures

Hanping Hu, LingFeng Liu
2020 Zenodo  
Moreover, a method is presented to guarantee the complexity of chaos-based pseudorandom sequence due to this relationship. This is important to the development of chaos-based cryptography.  ...  The relationship between cryptographic measures and chaotic dynamical complexity measures is studied in this paper, including linear complexity and measure entropy, nonlinear complexity and source entropy  ...  Chaotic system is regarded as an important pseudorandom source in the design of pseudorandom number generators.  ... 
doi:10.5281/zenodo.3957468 fatcat:zjt7hk4hsneg7m7wweh426htwi

Page 1379 of Mathematical Reviews Vol. , Issue 97B [page]

1997 Mathematical Reviews  
About half of the text is devoted to the proof that any one-way function can be used to construct a pseudorandom generator.  ...  In the paper under review the authors study properties and con- structions of nonlinear, balanced functions and construct highly nonlinear balanced functions by using concatenating, splitting, modifying  ... 

Stationary Randomness of Three Types of Six Random Sequences on Variant Maps [chapter]

Jeffrey Zheng, Yamin Luo, Zhefei Li, Chris Zheng
2018 Variant Construction from Theoretical Foundation to Applications  
Various random streams have different stationary properties. It is necessary to use statistical probability and time series to evaluate quality of stationary randomness.  ...  From a measuring viewpoint, all six samples are showing distinguished stationary randomness properties.  ...  Thanks to the Key Laboratory of Quantum Information, USTC, CAS and the ANU Quantum Random Numbers Server for quantum cryptographic sequences.  ... 
doi:10.1007/978-981-13-2282-2_8 fatcat:4bxgezescrhjvngbja6a4fhcve

On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers
О количестве неподходящих булевых функций в фильтрующих и комбинирующих моделях потоковых шифров

T. A. Bonich, M. A. Panferov, N. N. Tokareva
2020 Prikladnaya diskretnaya matematika Prilozhenie  
The paper is devoted to the construction of IND-CCA2-secure modification of the McEliece cryptosystem in the standard model. The modification uses S-repetition  ...  We analyze periodic properties of pseudorandom sequences produced by filter and combiner generators equipped with nonlinear Boolean functions.  ...  For cryptographic purposes, we are interested in generation of pseudorandom sequences of the maximal possible period.  ... 
doi:10.17223/2226308x/13/23 fatcat:cd5vriinvreszptnldzvd3mkwq

HCAHF: A New Family of CA-based Hash Functions

Anas Sadak, Fatima Ezzahra, Bouchra Echandouri, Charifa Hanin, Fouzia Omary
2019 International Journal of Advanced Computer Science and Applications  
The results of the tests and the properties of the CA used demonstrate the good statistical and cryptographic properties of the hash function.  ...  Cellular automata (CA) are a class of Boolean functions that exhibit good cryptographic properties and display a chaotic behavior. In this article, a new hash function based on CA is proposed.  ...  . 3) Salt: In the last step of the preprocessing phase, a salt value salt is computed using a pseudorandom number generator.  ... 
doi:10.14569/ijacsa.2019.0101267 fatcat:cxwfuikf65fsjlbzxqunofcluu

CFA: A New Family of Hybrid CA-Based PRNGs

Fatima Ezzahra Ziani, Anas Sadak, Charifa Hanin, Bouchra Echandouri, Fouzia Omary, Mamoun Alazab
2021 Security and Communication Networks  
In this article, a new Pseudorandom Number Generator (PRNG) construction is proposed. It is based on cellular automata (CAs) and comprises other cryptographic primitives organized as blocks.  ...  Then, the security analysis and the statistical properties for this specific instance of the scheme are presented.  ...  Conflicts of Interest e authors declare that there are no conflicts of interest regarding the publication of this paper.  ... 
doi:10.1155/2021/6640052 fatcat:3n3mwxxpanbbbfsz2vlfs4evdy

Constructing Digitized Chaotic Time Series with a Guaranteed Enhanced Period

Chuanfu Wang, Qun Ding
2019 Complexity  
sequence generator for information encryption.  ...  We analyze the ways that perturbation sources are introduced in parameters and variables and prove that the period of digitized chaotic time series generated by a digitized logistic map is improved efficiently  ...  Acknowledgments is work is supported financially by the National Natural Science Foundation of China (No. 61571181).  ... 
doi:10.1155/2019/5942121 fatcat:c23xjsbcujdcfnnogdneldshge

Beyond Statistical Analysis in Chaos-Based CSPRNG Design

John Prakash Arockiasamy, Lydia Elizabeth Benjamin, Rhymend Uthariaraj Vaidyanathan, Vincenzo Conti
2021 Security and Communication Networks  
The design of cryptographically secure pseudorandom number generator (CSPRNG) producing unpredictable pseudorandom sequences robustly and credibly has been a nontrivial task.  ...  The proposed pseudorandom number generator is proven using rigorous security analysis as that of modern cryptography and tested using the standard statistical testing suites.  ...  hash algorithm, and pseudorandom bits obtained from a pseudorandom number generator.  ... 
doi:10.1155/2021/5597720 fatcat:5d6cqufapbbzledsh3kpoxrmvi

Lamar: A New Pseudorandom Number Generator Evolved by Means of Genetic Programming [chapter]

Carlos Lamenca-Martinez, Julio Cesar Hernandez-Castro, Juan M. Estevez-Tapiador, Arturo Ribagorda
2006 Lecture Notes in Computer Science  
Pseudorandom number generation is a key component of many Computer Science algorithms, including mathematical modeling, stochastic processes, Monte Carlo simulations, and most cryptographic primitives  ...  To date, multiple approaches that use Evolutionary Computation (EC) techniques have been proposed for designing useful Pseudorandom Number Generators (PRNGs) for certain non-cryptographic applications.  ...  Introduction There are two types of random number generators: True Random Number Generators (TRNGs), also known as Random Number Generators (RNGs), that get their randomness from natural sources; and Pseudorandom  ... 
doi:10.1007/11844297_86 fatcat:geup5i53tvc2bdt3c6ndcaybrm

Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application [chapter]

A. Fúster-Sabater, P. Caballero-Gil, O. Delgado-Mohatar
2009 Lecture Notes in Computer Science  
The method here developed can be considered as a first selective criterium for acceptance/rejection of this type of generators of cryptographic application.  ...  An easy method of checking balancedness degree as well as run quantification in sequences obtained from LFSR-based keystream generators has been developed.  ...  The pseudorandom output sequence is a periodic sequence generated as the image of a nonlinear Boolean function in the LFSR stages.  ... 
doi:10.1007/978-3-642-01970-8_61 fatcat:luyzf64prbcs7pc7b2nnejghle

A Pseudorandom Number Generator Based on Time-Variant Recursion of Accumulators

Victor R. Gonzalez-Diaz, Fabio Pareschi, Gianluca Setti, Franco Maloberti
2011 IEEE Transactions on Circuits and Systems - II - Express Briefs  
This brief presents a pseudorandom number generator that requires very low resources from the hardware design point of view.  ...  The generated pseudorandom sequences pass all tests at both the level-one and level-two approaches. Index Terms-Pseudorandom number generator (PRNG), statistical tests, time variant.  ...  Opposed to true-random number generators [2] that are based on some intrinsically random natural phenomenon, pseudorandom number generators (PRNGs) [3] , [4] are numerical algorithms that, starting  ... 
doi:10.1109/tcsii.2011.2161165 fatcat:vzlof3cl6zhaxdvmig6bodebju
« Previous Showing results 1 — 15 out of 1,195 results