random number
Noise-resisting ciphering based on a chaotic multi-stream pseudo-random number generator
... pseudo-random number generator: several co-generated se- quences can be used at different steps of the ciphering process, since they present the strong property of being ...the number of possible ...
7
On-Line Monitoring of Random Number Generators for Embedded Security
... the number of hardware applications requiring RNGs is continuously increasing, specially in embedded circuits ...True Random Number Generator (TRNG) and a Pseudo Random Number Generator ...
5
Modeling, design and characterization of delay-chains based true random number generator
... : Random numbers are required in numerous applications namely in cryptogra- phy where randomness is used in security ...of Random Number Generators (RNG) : The Pseudo RNG (PRNG) which have a ...
181
Quantifying Studies of (Pseudo) Random Number Generation for Cryptography
... a random number generator which produces sequences from parameters that we cannot ...the random number generator of the Netscape browser used for the Secure Sockets Layer (SSL) ...of ...
190
Random number generation with multiple streams for sequential and parallel computing
... for random number generation in CUDA, which is a C-type programming toolkit for NVIDIA ...maximum number of streams is ...RNG. Random numbers can be generated and consumed either on the host ...
15
Deterministic parallel random-number generation for dynamic-multithreading platforms
... allel random-number generator called DOTMIX that compresses the pedigree and then “RC6-mixes” the ...serial random-number gener- ...of random numbers — such as a maximal- ...
13
Methodology for the Fault Analysis and Evaluation of True Random Number Generators
... Received: date / Accepted: date Abstract True Random Number Generators have many uses, in particular they play a key role in security applications and cryptographic algorithms. Our interest lies in the ...
16
Contactless Electromagnetic Active Attack on Ring Oscillator Based True Random Number Generator
... True random number generators (TRNGs) are essential in data security hard- ...generate random streams of bits used in cryp- tographic systems as confidential keys or random masks, to ...
17
On-the-Fly Evaluation of FPGA-Based True Random Number Generator
... ‡ Dept. of Electrical and Computer Engeneering Universit´e Laval, Qu´ebec, Canada sebasroy@gel.ulaval.ca Abstract— Many embedded security chips require a high- quality digital True Random Number Generator ...
7
New alternate ring-coupled map for multi-random number generation
... 4 Conclusion Classical and emergent applications (chaotic encryp- tion, global warming, multi-agent competition) re- quire efficient PRNG generating independent and multi-random sequences. A new alternate ring- ...
8
Mathematical chaotic circuits: an efficient tool for shaping numerous architectures of mixed chaotic/peudo random number generators
... Alongside to electronic circuits, the new theory of mathematical circuits allows many new applications in chaotic cryptography, genetic algorithms in optimization and in control [30], etc. Due to the versatility of the ...
17
NEW ALTERNATE LOZI FUNCTION FOR RANDOM NUMBER GENERATION
... France lozi@unice.fr Introduction The accelerated development of modern data transactions applications such as telecommunications requires encoding techniques with higher standards of security. Classically, these ...
3
Chaotic Pseudo Random Number Generators via Ultra Weak Coupling of Chaotic Maps and Double Threshold Sampling Sequences
... University of Le Havre, France, June 29- July 02, 2009. Abstract—Generation of random or pseudorandom numbers, nowadays, is a key feature of industrial mathematics. Pseudorandom or chaotic numbers are used in ...
6
Pseudo-Random Number Generation on GP-GPU
... these random streams produced on GP-GPU? And more importantly: how can we ensure that they are independent? These two main problems led us to think about design guidelines that will hopefully help developers to ...
16
Blockers for the stability number and the chromatic number
... Theorem 3.2 For every fixed d ≥ 1, Stability d-blocker is polynomial-time solvable in split graphs. Proof: Let G be a split graph with clique K and stable set S. We assume without loss of generality that |V (S)| = ...
16
Neurophilosophy of Number
... precise number symbols does not obliterate the continuous representation of ...the number sense qualifies as a biologically determined category of ...of number; and that this representation has a ...
27
Bridges and random truncations of random matrices
... of random unitary matrices is not involved in the proofs, except via the invariance in law by permutation of rows and columns (which is the core of Proposition ...
18
Enumerating number fields
... ness of the multisymmetric map of Ellenberg and Venkatesh. It is sometimes conjectured that N n ( H) ∼ c n H for n ⩾ 2 where c n does not depend on H. This is known for 2 ⩽ n ⩽ 5 according to work by Davenport and ...
10
Grundy number on P4-classes
... Grundy number on fat extended P 4 -laden graphs From now, let G = (V, E) be a fat-extended P 4 -laden graph and T (G) its modular decompo- sition ...Grundy number of the leaves of T (G) is equal to one and ...
6
Random matrices and the Potts model on random graphs
... The uniqueness provides the convergence whereas the study of this solution shows that it expands as a generating series in the enumeration of some planar maps. 2. Loop models In this last lecture we show how matrix ...
34