Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
p185_mysterious Solution to Hackers

p185_mysterious Solution to Hackers

Ratings: (0)|Views: 18 |Likes:
Published by jnanesh582

More info:

Published by: jnanesh582 on Feb 02, 2009
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as DOC or read online from Scribd
See more
See less


APaper OnMysterious Solution To Hackers:Random Number Generators 
A.Chandrasekhar(I B.TECH, CSE)
Good cryptography requires good random numbers. Almost all cryptography protocolsrequire the generation and use of secret values that must be unknown to attackers. A RNG for cryptography applications should appear to computationally bounded adversaries to be close as possible to a perfect RNG. Most “random” number sources actually utilize a pseudo randomgenerator (PRNG). PRNGs use deterministic processes to generate a series of outputs from aninitial seed state. Because the output is purely a function of seed data, the actual entropy of beoutput can never exceed the entropy of the seed. It can, however, be computationally infeasibleto distinguish PRNG from a perfect RNG.This paper evaluates the hardware based random number generator (RNG) for use incryptography application. The paper simulates the fastest and efficient algorithm towards therandom number generator and the function generating 50% time different values.
Random numbers refers to” a sequence of independent numbers with a specifieddistribution and a specified probability of falling in any given range of value”. As a result, the idealrandom number generator will provide a stream of uniformly distributed, non-deterministic,independent bits over an infinite data set. The mathematical evaluation of randomness is difficult, itis possible to use statistical analysis on sample data sets to detect characteristics that point to“non_randomness”.Random number generation can be divided into two categories:
True random number generation:
With true random number generation the next randomnumber generated is not known, and the sequence of random numbers cannot be generated.
Pseudo random number generation:
With pseudorandom number generation a sequence of random numbers is generated using a known algorithm, and the exact same sequence can beregenerated.For software based systems, it is very desirable to use a pseudorandom number generator to be able to test the software system with a repeatable set of random numbers, soone can re_run a test to the exact same random numbers being used. Also with a pseudorandom number generator that has been formally evaluated, one can be sure of the resultingof sequence numbers.
Security Enhancement By RNGs
The strength of the security mechanism like encryption algorithm is directly proportional to the randomness of the numbers it uses. While many available solutions usecryptically strong algorithms, they start from random seed that are not truly random andunpredictable.Cryptographic applications demand a high level of randomness to maintain the neededlevel of confidentiality and security.The increased randomness of RNG produces random numbers that can increase the strengthof the three major elements of cryptography:
Random numbers are used to authenticate client systems that want access protect information stored on a server.
Random numbers play a critical role in generating cryptographic keys usedfor encrypting and/or decrypting data and thus ensuring that an unauthorized person whointercepts a transaction won’t be able to extract meaningful information.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->