pseudorandom number
A new Deductive Method with Intelligence Using Pseudorandom Number for Solving Coin-Weighing Puzzles: Review of Inductive and Deductive Methods
... random number plays a key role in generating ...use pseudorandom number instead of true physical random ...a pseudorandom number ...the pseudorandom number seed must be ...
13
The Linux Pseudorandom Number Generator Revisited
... The Linux pseudorandom number generator (PRNG) is a PRNG with entropy inputs which is widely used in many security related applications and protocols. This PRNG is written as an open source code which is ...
23
Efficient Hardware Implementations of the Warbler Pseudorandom Number Generator
... In this paper, we have presented hardware implementations of Warbler in CMOS 65nm and CMOS 130nm ASICs. We proposed an architecture that takes advantage of standard registers without chip- enable signals. In addition, we ...
13
Asymmetric key encryption based on pseudorandom number generators Alhussain Amanie Hasn
... A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG), is an algorithm for generating a sequence of numbers that approximates the properties of random numbers ...
6
Twining Technique To Minimize Collinearity In Cryptographically Secure Pseudorandom Number Generator
... Each round of encryption in AES has four sub processes namely SubBytes, ShiftRows, MixColumns and AddRoundKey to create cipher text from plaintext. To make available the single key for all rounds, the key is processed ...
5
Encryption and Decryption Using Genetic Algorithm Operations and Pseudorandom Number
... Pseudo random numbers are deterministically generated numbers which appears to be random. Various arithmetic approaches are used to generating pseudo-random numbers have been suggested, considered, and used on computers ...
5
Using Information Theory Approach to Randomness Testing
... The outline of the paper is as follows. In Section 2 the general method for construction randomness testing algorithms basing on lossless data com- pressors is described. Two new tests for randomness, which are based on ...
20
Two-faced processes and existence of RNG with proven properties
... Random and pseudorandom number generators (RNG and PRNG) are used for many purposes including cryptographic, modeling and simulation applications. For such applications a generated bit sequence should mimic ...
14
Improving Middle Square Method RNG Using Chaotic Map
... a pseudorandom number generator (PRNG) based on the combination of chaotic logistic map and Middle Square Method, the chaotic system iterated independently starting from initial condi- tions could help to ...
5
Privacy Access Control audit ability for Medical Data Stored in Cloud
... from pseudorandom number engenderer for unlink ability, a congruous indexing technique for maintaining confidential keyword predicated probe which obnubilates both surfing and data access patterns ...
7
Analysis of Cryptography and Pseudorandom Numbers
... As security is one of the major concerns for everyone. Secrecy is required by everyone for secure data communication. For that pseudorandom numbers plays an important role in such conditions. They can be used as ...
5
A Secure Group Communication and Rekeying using Rabin’s Squaring Trapdoor Function in Multicasting
... When a member wants to join the group, the member sends a message to the server asking for its permission to join the group. The Server authenticates the member and gives it an individual key through a secure channel. ...
7
Design of Pseudorandom Pattern Generator for MIHST
... The proposed method describe about the generation of patterns using PRESTO Pre selected toggling level and testing the device for each pattern generated by using microprocessor Hardware [r] ...
8
Adaptively Secure Constrained Pseudorandom Functions
... Our solution is constructed from two recently emerged primitives: an adaptively secure Attribute-Based Encryption (ABE) [SW05] for circuits and Universal Samplers as introduced by Hofheinz et al. [HJK + 16]. Both ...
15
Publicly Evaluable Pseudorandom Functions and Their Applications
... Theorem 8.1. If the iO is indistinguishably secure, PRG is a secure pseudorandom generator, and PPRF is selective pseudorandom, then the PEPRFs are adaptive weak pseudorandom. Proof. The proof ...
38
Constrained Pseudorandom Functions: Verifiable and Delegatable
... Our circuits will be a five tuple f = (n, q, A, B, GateType). We let n be the number of inputs and q be the number of gates. We define inputs = [n], Wires = [n + q] and Gates = [n + q]\[n]. The wire n + q ...
18
Key-Homomorphic Constrained Pseudorandom Functions
... Second, a single ciphertext c = m⊕F (k, x) for a known m reveals F(k, x) = c ⊕m. This is a problem because the security game for CPFRs only guarantees that F (k, x) is pseudorandom if the adversary was given ...
30
On the Correlation Intractability of Obfuscated Pseudorandom Functions
... the number of y’s that stand in the relation with x is at most a negligible fraction of the ratio between the size of the range and the size of the domain of functions in the ...
27
On the Concrete Security of Goldreichs Pseudorandom Generator
... ciphers, pseudorandom generators, and pseudorandom functions) has been motivated by ef- ficiency considerations (memory consumption, hardware compatibility, ease of ...the number of its AND ...Local ...
40
Hash Tables with Pseudorandom Global Order
... However the proposed hash table is in a global or- der, made up of small patches that are ordered inter- nally and with respect to each other. This means probe positions can be interpolated from the keys at the up- per ...
6