# US 8,788,552 B2 · Deterministic random number generator for cryptography and digital watermarking > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,788,552 B2 - Document ID: US8788552B2 - Status: Granted - Kind: B2 - Application number: 12/319,886 - Filed: 2009-01-12 - Published: 2009-07-30 - Granted: 2014-07-22 - Earliest claimed: 2008-01-25 - Assignees: Tata Consultancy Services Limited - Applicants: Natarajan Vijayarangan; Rao Chalamala Srinivasa - Inventors: Natarajan Vijayarangan; Rao Chalamala Srinivasa - Web page: https://patentgrep.com/patent/US8788552B2 ## CPC - G06F 7/582: {Pseudo-random number generators} - G06F 7/584: {using finite field arithmetic, e.g. using a linear feedback shift register} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A deterministic random number generator includes a number series generator adapted to generate an infinite Pi series, a summation generator adapted to generate a partial sum of said infinite Pi series, a computer adapted to compute a finite sequence from said partial sum of infinite Pi series, a shuffler adapted to shuffle said computed finite sequence to obtain a shuffled sequence, a masker adapted to mask said shuffled sequence to obtain a masked sequence, a non-linear function processor adapted to process said masked sequence to obtain a non-linear processed sequence, and a linear feedback shift register adapted to receive and shift bits of said non-linear processed sequence in a pre-determined manner to obtain a deterministic random number and a method for generating a deterministic random number for cryptography and watermarking. ## Claims ### Claim 1 A deterministic random number generator comprising: number series generator adapted to generate an infinite Pi series; a summation generator adapted to generate a partial sum of said infinite Pi series; a computer adapted to compute a finite sequence from said partial sum of infinite Pi series; a shuffler adapted to shuffle said computed finite sequence, using a shuffling seed mechanism having a first pre-defined primitive polynomial seed operator and a second pre-defined prime number seed operator, to obtain a shuffled sequence; a one-way masker adapted to apply a one-way masking function to said shuffled sequence to obtain a masked sequence; a non-linear function processor adapted to irreversibly process said masked sequence to obtain a non-linear processed sequence so that said masked sequence and said non-linear processed sequence cannot be correlated; and a linear feedback shift register adapted to receive and shift bits of said non-linear processed sequence in a pre-determined manner to obtain a deterministic random number. ### Claim 2 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said number series generator is a Leibniz Pi series generator. ### Claim 3 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said number series generator is a Ramanujan Pi series generator. ### Claim 4 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said computer includes a selector to extract a finite sequence. ### Claim 5 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said non-linear function processor includes a pre-defined seed operator. ### Claim 6 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said non-linear function processor includes a pre-defined seed operator selected from a group of seed operators consisting of prime numbers, user-defined values, and polynomial functions. ### Claim 7 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said linear feedback shift register includes a pre-defined seed operator. ### Claim 8 (depends on 1) The deterministic random number generator as claimed in claim 1, wherein said linear feedback shift register includes a pre-defined seed operator which is a primitive polynomial. ### Claim 9 A method for generating a deterministic random number for cryptography and watermarking, said method comprising the steps of: generating an infinite Pi series; computing a partial sum of said infinite Pi series; computing a finite sequence from said partial sum of infinite Pi series; shuffling said computed finite sequence, using a shuffling seed mechanism having a first pre-defined primitive polynomial seed operator and a second pre-defined prime number seed operator, to obtain a shuffled sequence; applying a one-way masking function to said shuffled sequence to obtain a masked sequence; irreversibly processing said masked sequence to obtain a non-linear processed sequence so that said masked sequence and said non-linear processed sequence cannot be correlated; and shifting bits of said non-linear processed sequence in a pre-defined manner to obtain a deterministic random number. ### Claim 10 (depends on 9) The method as claimed in claim 9, wherein said step of generating an infinite Pi series includes the step of generating a Leibniz Pi series. ### Claim 11 (depends on 9) The method as claimed in claim 9, wherein said step of generating an infinite Pi series includes the step of generating a Ramanujan Pi series. ### Claim 12 (depends on 9) The method as claimed in claim 9, wherein said step of computing a finite sequence from said partial sum of infinite Pi series includes the step of selecting said finite sequence. ### Claim 13 (depends on 9) The method as claimed in claim 9, wherein said step of masking said shuffled sequence to obtain a masked sequence includes the step of one-way masking. ### Claim 14 (depends on 9) The method as claimed in claim 9, wherein said step of irreversibly processing said masked sequence to obtain a non-linear processed sequence includes the step of non-linear processing in accordance with a pre-defined seed operator. ### Claim 15 (depends on 1) The deterministic random number generator of claim 1, wherein the one-way masking function comprises at least one of a discrete logarithm function and an integer factorization function. ### Claim 16 (depends on 9) The method of claim 9, wherein the one-way masking function comprises at least one of a discrete logarithm function and an integer factorization function.