Machine generation of cryptographic keys by non-linear processes similar to processes normally associated with encryption of data

An expanding-amorphous-process keystream generator for recursively producing

• from a base key having a multiplicity of binary bits
• in accordance with a partition index that serves to specify how an amorphous bitstream is to be formed from the base key,
• which partition index is itself decomposed during its use by a parameter called a partition descriptor,
• an amorphous keystream having binary bits of number greatly beyond those needed before cyclic behavior commences, the expanding-amorphous-process keystream generator comprising:
• 1) source registers for providing three quantities that are input to the keystream generation process, the source registers including
• 1.1) a base key source register for providing a base key having a multiplicity of binary bits,
• 1.2) an initial partition index source register for providing an initial partition index, the initial partition index serving to specify how an amorphous bitstream is to be formed from a base key, and
• 1.3) a partition descriptor source register for providing a partition descriptor, the partition descriptor serving to parameterize the decomposition of partition indexes;
• 2) process intermediary-result registers including
• 2.1) a base key register for storing the base key,
• 2.2) a partition descriptor register for storing the partition descriptor,
• 2.3) a partition index register for storing a current partition index commencing with the initial partition index,
• 2.4) a plurality of element descriptor registers each for storing a quantity called an element descriptor, each element descriptor elsewhere serving to parameterize a dividing of the base key into a data portion called an element, the collective element descriptors collectively serving to substantially define how a partition is to be performed on the base key to produce a plurality of elements therefrom,
• 2.5) a plurality of current-and-master holdback-register pairs, one register pair corresponding to each of the plurality of elements, each for holding a quantity called multiplexing information, the collective multiplexing information elsewhere serving to control the multiplexing of data from a the plurality of elements during formation of an amorphous stream, and
• 2.6) a plurality of emission-fragment-and-emission-count register pairs, one register pair corresponding to each element, each pair for holding a quantity called an emission fragment and also another data quantity called an emission count, these emission fragments and emission counts elsewhere serving to control the multiplexing of data from a corresponding element during the formation of the amorphous stream;
• 3) a partition extractor circuit means, receiving a current partition index from the partition index register and the partition descriptor from the partition descriptor register, for decomposing the current partition index in accordance with the partition descriptor into (i) a plurality of initial element descriptors for storage by the plurality of element descriptor registers, (ii) a plurality of multiplexing information for storage by the plurality of current-and-master holdback-register pairs, (iii) initial element chaining information for storage and use within a holdback multiplexer, and (iv) current element information for storage and use within the holdback multiplexer;
• 4) an emission generator circuit, receiving the base key from the base key register means and successive element descriptors from successive ones of plurality of element descriptor registers, for transforming each element descriptor into the emission fragments and the emission counts which are stored by the plurality of by emission-fragment-and-emission-count register pairs, and for storing a plurality of modified element descriptors back into the plurality of element descriptor registers, the emission generator means operating to
• choose bits from among the bits of the base key in accordance with each element descriptor, and
• selectively substitute bits in accordance with the same element descriptor;
• 5) a holdback multiplexer, receiving the emission fragments from the plurality of emission-fragment-and-emission-count register pairs plus multiplexing information from the current-and-master holdback-register pairs plus initial element chaining information and current element information from the partition extractor, for forming an amorphous stream by selecting bits from the emission fragments where each selection is subject to suspension for a given element cycle based on the multiplexing information;
• 6) a stream router means, receiving the amorphous stream from the holdback multiplexer,
• for passing an initial portion of the amorphous stream to the partition index register means, and
• for outputting a remainder of the amorphous stream as the keystream fragment;
• and
• 7) a control means including
• 7.1) an initialization cycle means serving to load the base key storage register means, the partition descriptor register means, and the partition index register means with their corresponding initial quantities respectively from the base key source register means, the partition descriptor source register means, and the initial partition index source register means,
• 7.2) a partition extraction cycle means serving to load the plurality of element descriptor register means, the holdback-register pairs, and the link registers internal to the holdback multiplexer means with quantities derived by the partition extractor means from its decomposition of the current partition index received from the partition index register means, and
• 7.3) a holdback multiplexer cycle control means for controlling the holdback multiplexer to generate the amorphous stream;
• wherein feedback is provided through a next partition index which permits another partition and hence another amorphous stream to be formed;
• wherein a plurality of keystream fragments result;
• wherein a concatenation of successive keystream fragments is defined as the keystream.

A contracting amorphous process keystream generator comprising:

• 1) a random number generator means for providing a random number stream, which random number stream will be amorphously compressed to form a keystream;
• 2) an XOR means, receiving the random number stream from the generator means, for performing modulo-2 addition on bit pairs derived from the random number stream in accordance with XOR bit values to form a plurality of data bits;
• 3) a segmented shift register means, receiving the plurality of data bits from the XOR means, for storing these data bits, for deleting a plurality of bit values at given addresses by process of shifting the data bits beyond a specified delete point address to recover a bit address being deleted, and for inserting a plurality of datum bits from the XOR means at specified insert addresses by first shifting the bits at and beyond an insert point to make room for a datum bit to be inserted;
• 4) a permuting means, receiving the random number stream from the generator means, for generating random permutations by forming a plurality of permuted indexes from the random number stream in accordance with a permutation selector;
• 5) a contraction controller means for forming the keystream, the contraction controller including
• 5.1) parsing means, receiving the random number stream from the random number generator means, for decomposing the random number stream into (i) a plurality of bit pairs sent to the XOR means as the XOR bit values, (ii) a permutation selector sent to the permuting means, (iii) a plurality of deletors sent to the segmented shift register means, each deletor serving as an deletion point address therein, and (iv) a plurality of creators sent to the segmented shift register means, each creator serving as an insert address therein, the number of creators being the same as the number of deletors;
• 5.2) filling means for storing a plurality of datum bits received from the XOR means in the segmented shift register means at addresses that are selected by the plurality of permuted indexes received from the permuting means;
• 5.3) deletion means for deleting a plurality of bits from the segmented shift register in accordance with deletors received from the parsing means, each deletor successively selects one bit to be deleted;
• 5.4) creation means for inserting a plurality of datum bits from the XOR means into the segmented shift register means in accordance with creators received from the parsing means, each creator successively selecting an address at which a datum bit is inserted;
• wherein, upon completion of operations, the contents of the segmented shift register means forms a keystream fragment;
• wherein decomposition of additional random numbers results in a plurality of keystream fragments;
• wherein a concatenation of successive keystream fragments is defined as the keystream.

A state machine keystream generator comprising:

• 1) a source of a key in the form of a machine index and a state variable;
• 2) a process intermediary-result register means including
• 2.1) a machine register means for storing a machine index, the machine index serving to parameterize a transition and output function of the state machine,
• 2.2) a state register means for storing a state variable, the state variable serving to further parameterize the transition and output function during each transition,
• 2.3) a dependency table means for storing pseudo random bits, filled at the start of each transition, which parameterize a state transition,
• 2.4) a garbage index means for storing a garbage index which specifies how a state transition is to proceed, a garbage index comprises the various fields of (i) a global dependency index, (ii) a plurality of packed function indexes, (iii) a nibble perm selector, (iv) an accumulation index, (v) a permutation selector, (vi) a state emitter index, and (vii) an output emitter index,
• 2.5) a function table means for storing a plurality of function values,
• 2.6) a sum table means for storing a plurality of sum elements,
• 2.7) an accumulator multiplicand register means for storing a plurality of accumulation elements;
• and
• 3) a process state transition computational means including
• 3.1) a random generator means for forming random numbers, in accordance with a seeding value received from the machine register means and state register means, for storage in the dependency table means,
• 3.2) a streaming CEM means for coarse encoder multiplication of a multiplicand and a multiplier stream specified by a starting address within the dependency table means to form a product value, the streaming CEM means including
• 3.2.1) a streamer means for forming a multiplier stream from a starting address which selects a bit in the dependency table means, the multiplier stream consisting of a selected bit and those bits immediately following, cyclically addressed,
• 3. 2.2) a parsing means for forming a plurality of position value and XOR datum bit pairs from the multiplier stream,
• 3.2.3) an XOR means for forming a product bit by modulo-2 addition of a XOR datum bit with a bit in the multiplicand selected by the corresponding position value, and
• 3.2.4) an accumulation means for concatenating the plurality of product bits to form a product value;
• 3.3) an unpacker means for expanding a packed function index received from the garbage index means into a function index, the expansion is in accordance with a global dependency index also received from the garbage index means with each resulting function index sent to an evaluator means;
• 3.4) the evaluator means for transforming a function index received from the unpacker means into a function value for storage in the function table means;
• 3.5) a permuting unit means for transforming function values received from the function table into sum elements for storage in the sum table, the permuting unit means including
• 3.5.1) an ordering means for providing a permutated ordering of the function values in accordance with a permutation selector received from the garbage index means,
• 3.5.2) a permuting-unit decomposition means for decomposing a nibble perm selector received from the garbage index means into a plurality of nib selectors, each nib selector corresponding to a pair of permutated function values taken consecutively,
• 3.5.3) a permutation means for resolving a nib selectors received from the permuting-unit decomposition means into a permutation, the permutation being applied to the nibbles of the corresponding function values pair to form a sum element;
• 3.6) a collecting unit means for transforming sum elements received from the sum table means into accumulation elements for storage in the accumulator multiplicand register means, the collecting unit means including
• 3. 6.1) a collecting-unit decomposition means for decomposing an accumulation index received from the garbage index means into a plurality of collector indexes, each collector index corresponding to a pair of sum elements, a pairing being formed with consecutive sum elements, and
• 3.6.2) a combining operation means for forming an accumulation element by using a collector index received from the collecting-unit decomposition means to select a combining operation, from a plurality of functions comprised of ADD and SUB and XOR and NEG, with the selected combining operation applied to the corresponding sum element pair;
• 4) a bus switch means for routing multiplicands to the streaming CEM means, and product values from the streaming CEM means;
• 5) a transition controller means for providing a keystream fragment and a next state value, the transition controller means including
• 5.1) a dependency initialization means for storing the random numbers from the random generator means into the dependency table means, wherein the random generator means is seeded with values received from the machine register means and state register means,
• 5.2) a garbage initialization means for storing the product value from the streaming CEM means into the garbage index means, wherein the starting address received by the streaming CEM means is zero and the multiplicand received by the streaming CEM means is the concatenation of the machine register means and state register means routed through the bus switch means,
• 5.3) a garbage parsing means for decomposing the garbage index means into its component fields,
• 5.4) an unpacking means for successively transmitting to the evaluator means a plurality of function indexes formed by the unpacker means,
• 5.5) an evaluation means for successively transmitting to the function table means a plurality of function values formed by the evaluator means,
• 5.6) a summation means for successively transmitting to the sum table means a plurality of sum elements formed by the permuting unit means,
• 5.7) a collection means for successively transmitting to the accumulator multiplicand register means a plurality of accumulation elements formed through by the collect unit means,
• 5.8) a next state means for storing the product value from the streaming CEM means as a next state variable into the state register means, wherein the starting address received by the streaming CEM means is the state emitter index from the garbage index means, and wherein the multiplicand received by the streaming CEM means is the contents of the accumulator multiplicand register means routed through the bus switch means, and
• 5.9) an output means for transmitting the product value from the streaming CEM means as a keystream fragment, wherein the starting address received by the streaming CEM means is the output emitter index from the garbage index means, and wherein the multiplicand received by the streaming CEM means is the contents of the accumulator multiplicand register means routed through the bus switch means;
• wherein a state transition permits the process to continue;
• wherein a plurality of keystream fragments result;
• wherein a concatenation of successive keystream fragments is defined as the keystream.

A state machine for generating an extended-length cryptographic key by non-linear processes, the machine comprising:

• 1) a state transition means for transforming a state variable into an keystream fragment and a next state variable in accordance with a directive called a machine index, the state transition means including
• 1.1) a dependency formation means for generating a plurality of random bits from the machine index and state variable, the dependency bits serving as dependent parameters for subsequent operations;
• 1.2) a garbage index formation means for deriving from the machine index, state variable, and dependency bits a garbage index;
• 1.3) a parsing means for decomposing the garbage index into a plurality of fields which provide for a transition function and an output function;
• 1.4) a field expansion means for exploding certain fields;
• 1.5) evaluation means, interpreting the fields of the transition and output functions as directives, for forming operands and selectively performing operations thereon, the selected operations on the formed operands producing intermediary results which are used as operands for additional operations to be selected with additional fields, this evaluation process terminating after a predetermined number of levels into a final result;
• wherein a state transition permits the process to continue;
• wherein a plurality of keystream fragments result;
• wherein a concatenation of successive keystream fragments is defined as the keystream.