EP2000900A3

Extending a repetition period of a random sequence

Abstract

A method is provided for extending a sequence repetition period of a random number generator in systems based on the availability of random sequences. The method includes performing RNS arithmetic operations to express a random number in a sequence as RNS residue values. Each generated random number has a value between zero and n!-1. The method also includes converting each of the RNS residue values to a relatively prime base number system so that each of the RNS residue values includes at least one digit. The method further includes generating an arbitrary permutation ordering of output sequence numbers using a select combination of digits associated with each of the RNS residue values. The arbitrary permutation ordering is applied to a cyclic structure having n elements. Each of the n elements has an associated output sequence number.

Term

1.7 yearsto projected expiry

Projected expiry 21 May 2028, counted from filing; an application has no term until it is granted.

  1. Priority
  2. Filed
  3. Published
  4. Today
  5. Projected expiry

Every citation, both ways

Citations
DocumentRelationOfficeCategoryCited duringRelevant claims
WO2006110954A1CitesWorld Intellectual Property Organization (WIPO)XSearch report1-10
DE MATTEIS A ET AL: "Pseudorandom permutation", JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, AMSTERDAM, NL, vol. 142, no. 2, 15 May 2002 (2002-05-15), pages 367 - 375, XP007906923, ISSN: 0377-0427Non-patentSearch report
KNUTH D E: "THE ART OF COMPUTER PROGRAMMING, THIRD EDITION", SEMINUMERICAL ALGORITHMS, vol. 2, 1 February 2005 (2005-02-01), pages 142-146,284 - 292, XP002511903Non-patentSearch report