Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sivakumar, T.
- Pseudo Random Number Generation Using Eye Brightness Response
Abstract Views :213 |
PDF Views:3
Authors
T. Sivakumar
1,
T. Anusha
2
Affiliations
1 Department of Computer Science and Engineering, Dr. Mahalingam College of Engineering and Technology, IN
2 Department of Computer Science and Engineering, PSG College of Technology, IN
1 Department of Computer Science and Engineering, Dr. Mahalingam College of Engineering and Technology, IN
2 Department of Computer Science and Engineering, PSG College of Technology, IN
Source
ICTACT Journal on Communication Technology, Vol 9, No 2 (2018), Pagination: 1776-1778Abstract
Random numbers play an important and primary role in the use of Cryptography techniques in real time applications. The cryptographic techniques can be easily compromised if the key can be easily guessed. Therefore it is important that the keys are in random and unpredictable in nature. The operating system uses the random numbers to mask passwords and to offer salt and session identifiers. This paper introduces a new software based pseudo random number generation method based on the eye brightness response formula. This function provides a significant change in sensation for minimum required change in signal intensity. The randomness tests are performed to confirm the randomness of the generated random numbers.Keywords
Cryptography, Pseudo Random Number, Eye Brightness Response, Randomness Test.References
- Kurt Seifried, “Kurt Seifried Information Security”, Available at: https://seifried.org/security/.
- Kinga Marton, Alin Suciu and Iosif Ignat, “Randomness in Digital Cryptography A Survey”, Romanian Journal of Information Science and Technology, Vol. 13, No. 3, pp. 219-240, 2010.
- C.E. Shannon, “A Mathematical Theory of Communication”, Bell System Technical Journal, Vol. 27, pp. 623-656, 1948.
- J. Kelsey, “Entropy and Entropy Sources in x9.82”, Available at: https://pdfs.semanticscholar.org/presentation/e762/977134551a72edf19d8be13fef075de97b38.pdf.
- J. Von Neumann, “Various Techniques used in Connection with Random Digits”, National Bureau of Standards, Applied Mathematics Series, Vol. 12, pp. 36-38, 1951.
- M. Blum, “Independent Unbiased Coin Flips from a Correlated biased Source- a Finite State Markov Chain”, Combinatorica, Vol. 6, No. 2, pp. 97-108, 1986.
- Z. Gutterman B. Pinkas and T. Reinman, “Analysis of the Linux Random Number Generator”, Proceedings of IEEE Symposium on Security and Privacy, pp. 21-24, 2006.
- A. Seznec and N. Sendrier N., “Hardware Volatile Entropy Gathering and Expansion: Generating Unpredictable Random Number at User Level”, Research Report, Department of Computer Science, INRIA, 2002
- Kinga Marton, Alin Suciu, Christian Sacarea and Octavian Cret, “Generation and Testing of Random Numbers for Cryptographic Applications”, Proceedings of the Romanian Academy, Series A, Vol. 13, No. 3, pp. 368-377, 2012.
- Eye Intensity Response, Available at: http://www.telescopeoptics.net/eye_intensity_response.htm, Accessed on 2016.
- T. Sivakumar and R. Venkatesan, “Image Encryption Method based on Pixel Shuffling and Random Key Stream”, International Journal of Computer and Information Technology, Vol. 3, No. 6, pp. 1468-1476, 2014.
- T. Sivakumar and R. Venkatesan, “A New Image Encryption Method Based on Knight’s Travel Path and True Random Number”, Journal of Information Science and Engineering, Vol. 32, No. 1, pp. 133-152, 2016.
- William Stallings, “Cryptography and Network Security-Principles and Practice”, Pearson Education, 2015.
- Andrew Rukhin et al., “A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications”, National Institute of Standards and Technology, pp. 1-131, 2001.