Appeal No. 2002-0121
Application No. 09/023,672
random number values (see bottom of page 8 of the answer).
We disagree. While Hirsch does generate a key value, it
appears that Hirsch is describing the generation of a single
modified value from a single 32-bit value by employing a
scrambler which includes an array having a number of multibit
container locations for storing a unique sequence of random
numbers. We find absolutely nothing in Hirsch, nor has the
examiner convincingly pointed to anything within Hirsch’s
disclosure, relating to a plurality of generators for generating
cryptographic key splits from seed data, as required by the
instant claims. It might be said that Hirsch generates a
pseudorandom sequence from a seed, but there is nothing to
indicate that Hirsch generates a plurality of cryptographic key
splits from seed data.
In our view, it is unreasonable for the examiner to treat
each individual bit of Hirsch’s 32-bit input value as a key
split, as there is no apparent reason for making such an
interpretation. Even so, if we read the examiner’s rationale
correctly, the examiner appears to be saying that not only is
each individual bit of Hirsch’s 32-bit input value to be
considered a claimed key split generator, but the claimed seed
data from which the key splits are generated is also to be
-4–
Page: Previous 1 2 3 4 5 6 Next
Last modified: November 3, 2007