A New Scheme for Pseudo Random Numbers Generator Based on Secret Splitting
Abdulameer K. Husain1, Ayman A. Rahim A. Rahman2
1Abdulameer K. Husain, his PhD in Computer Science, Computer Security, Presently Working as Assoc. Prof., in Jerash University –Jordan.
2Ayman A. Rahim A. Rahman, his PhD in Computer Information System, Presently Working as Asst. Prof., in Jerash Uiversity – Jordan.
Manuscript received on January 02, 2014. | Revised Manuscript received on January 04, 2014. | Manuscript published on January 05, 2014. | PP: 64-68 | Volume-4 Issue-6, January 2014. | Retrieval Number: F2463014615/2015©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper presents a secure scheme for generating a pseudo random numbers. The scheme is based on secret splitting of a piece of secure information which is used as a seed to the generator. In this scheme the procedure of splitting the secure information is performed according to a specified weight in such a way that each segment of the information piece takes a special weight depending on the priority of each part of the random number sequence. Another important concept used in this method is the agreement strategy applied to the secure information. By comparison of this scheme with other methods of generating pseudo random generation, it is found that there are a secure complex relationships among the elements of the random number sequences which are difficult to be discovered by most active attacks.
Keywords: Pseudo-Random, secret splitting, Cryptography, Secrecy, agreement.