# US 2007/0030975 A1 · Method for accelerating the computational speed of a computer algorithm

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2007/0030975 A1
- Document ID: US20070030975A1
- Status: Published application
- Kind: A1
- Application number: 11/485,188
- Filed: 2006-07-12
- Published: 2007-02-08
- Earliest claimed: 2005-07-12
- Assignees: Cipherflux, LLC
- Inventors: Jerzy Urbanik; Krzysztof Kalita; Przemyslaw Bezeg
- Web page: https://patentgrep.com/patent/US20070030975A1

## CPC

- H04L 9/302: {involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes}
- H04L 2209/30: Compression, e.g. Merkle-Damgard construction
- Y10S 707/99942: Manipulating data structure, e.g. compression, compaction, compilation
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A new technique for accelerating the computational speed of a computer algorithm is provided. The inventive technique can be applied to an encryption algorithm, such as an RSA algorithm, for example. A method and system for effecting secure information communications utilizing an accelerated information encryption algorithm is also contemplated.

## Claims

### Claim 1

A method for accelerating the processing speed of a computer algorithm, comprising the steps of:
obtaining data to be processed by said computer algorithm;
providing a first data structure for holding at least a portion of said data;
setting an index representing a stabilization state of said first data structure to a value indicating an unstabilized state;
verifying said index setting;
obtaining at least one data element of said data; and
when said index setting indicates an unstabilized state of said first data structure, (i) inserting at least a portion of said at least one data element into said first data structure, (ii) processing said portion of said at least one data element by said computer algorithm, (iii) inserting said processed portion of said at least one data element into said first data structure, (iv) determining whether said first data structure is filled, and (a) when said first data structure is filled, setting said index to a value representing a stabilized state of said first data structure, determining if all of said data have been processed, when all of said data have been processed, adding said processed portion of said at least one data element into a second data structure and ceasing further operation, when all of said data have not been processed, adding said processed portion of said at least one data element into said second data structure and revisiting said step of obtaining at least one data element of said data, and (b) when said first data structure is not filled, determining if all of said data have been processed, when all of said data have been processed, adding said processed portion of said at least one data element into said second data structure and ceasing further operation, when all of said data have not been processed, adding said processed portion of said at least one data element into said second data structure and revisiting said step of obtaining at least one data element of said data; and
when said index setting indicates a stabilized state of said first data structure, (1) searching said first data structure for at least a portion of said at least one data element that has been processed by said computer algorithm, (2) copying said processed portion of said at least one data element from said first data structure into said second data structure, (3) determining if all of said data have been processed, and (A) when all of said data have been processed, ceasing further operation, and (B) when all of said data have not been processed, revisiting said step of obtaining at least one data element of said data.

### Claim 2 (depends on 1)

The method according to claim 1, wherein ones of said processed portion of said at least one data element are placed in said second data structure only after said first data structure is in a stabilized state.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising the steps of verifying said stabilization state of said first data structure when said index setting indicates an unstabilized state of said first data structure.

### Claim 4 (depends on 1)

The method according to claim 1, wherein said computer algorithm is an encryption algorithm, and said step of processing said portion of said at least one data element by said computer algorithm includes encrypting said portion of said at least one data element.

### Claim 5 (depends on 4)

The method according to claim 4, wherein said computer algorithm is an RSA encryption algorithm.

### Claim 6 (depends on 1)

The method according to claim 1, wherein said computer algorithm is a decryption algorithm, and said step of processing said portion of said at least one data element by said computer algorithm includes decrypting said portion of said at least one data element.

### Claim 7 (depends on 6)

The method according to claim 6, wherein said computer algorithm is an RSA decryption algorithm.

### Claim 8

A method for accelerating the processing speed of a video compression algorithm, comprising the steps of:
obtaining video data to be processed by said algorithm, said video data including at least one picture frame;
providing a first data structure for holding at least a portion of said data;
setting a first variable representing one of said at least one picture frame to a first preselected value;
setting a second variable representing a fragment of one of said at least one picture frame to a second preselected value;
assigning dimension to said at least one picture frame;
determining whether a last one of said at least one picture frame has been reached;
when said last one of said at least one picture frame has been reached, ceasing further operation; and
when said last one of said at least one picture frame has not been reached, (i) reading one of said at least one picture frame corresponding to said first variable, (ii) determining whether a fragment of said last one of said at least one picture frame has been reached, and (iii) when a fragment of said last one of said at least one picture frame has been reached, (a) incrementing said first variable and (b) revisiting said step of determining whether a last one of said at least one picture frame has been reached, and (iv) when a fragment of said last one of said at least one picture frame has not been reached, (c) reading a fragment of one of said at least one picture frame corresponding to said second variable, (d) determining whether said first data structure includes said read fragment of one of said at least one picture frame corresponding to said second variable, and (1) when said first data structure includes said read fragment, (e) assigning a value corresponding to said read fragment represented by a third variable to a second data structure, (f) writing a value of said fragment from said first data structure into said third variable, (g) incrementing said second variable, and (h) revisiting said step of determining whether a fragment of said last one of said at least one picture frame has been reached, and (2) when said first data structure does not include said read fragment, (i) assigning said read fragment to said first data structure, (j) assigning a last value from said first data structure to said third variable, (k) assigning said value corresponding to said read fragment represented by said third variable to said second data structure, (l) writing said value of said fragment from said first data structure into said third variable, (m) incrementing said second variable, and (n) revisiting said step of determining whether a fragment of said last one of said at least one picture frame has been reached.

### Claim 9 (depends on 8)

The method according to claim 8, wherein said video data includes at least one picture frame presenting a background and an object in motion, said first data structure holds at least a portion of said data associated with said background, and said second data structure holds at least a portion of said data associated with movement of said object relative to said background.

### Claim 10

A method for accelerating the processing speed of a video decompression algorithm, comprising the steps of:
obtaining compressed video data to be processed by said algorithm, said video data including at least one fragment of at least one picture frame;
providing a first data structure for holding at least a portion of said data;
setting a first variable representing one of said at least one fragment to a first preselected value;
assigning dimension to said at least one fragment;
determining whether a last one of said at least one fragment has been reached;
when said last one of said at least one fragment has been reached, ceasing further operation; and
when said last one of said at least one fragment has not been reached, (i) reading a value corresponding to said at least one fragment from a second data structure, (ii) assigning said read value to a second variable, (iii) reading said at least one fragment associated with said assigned second variable from said first data structure, (iv) assigning said read at least one fragment associated with said assigned second variable to a third variable, (v) displaying said at least one fragment corresponding to said third variable, (vi) incrementing said first variable, (vii) determining whether said at least one frame is filled, and (viii) when said at least one frame is filled, (a) removing content from said at least one frame, and (b) revisiting said step of determining whether a last one of said at least one fragment has been reached, and (ix) when said at least one frame is not filled, (c) revisiting said step of determining whether a last one of said at least one fragment has been reached.

### Claim 11

A method for accelerating the processing speed of an audio compression algorithm, comprising the steps of:
obtaining audio data to be processed by said algorithm, said audio data including at least one fragment;
providing a first data structure for holding at least a portion of said data;
setting a first variable representing one of said at least one fragment to a first preselected value;
assigning dimension to said at least one fragment;
determining whether a last one of said at least one fragment has been reached;
when said last one of said at least one fragment has been reached, ceasing further operation; and
when said last one of said at least one fragment has not been reached, (i) reading one of said at least one fragment corresponding to said first variable, (ii) determining whether said first data structure includes said read one of said at least one fragment corresponding to said first variable, and (iii) when said first data structure includes said read fragment, (a) assigning a value corresponding to said read fragment represented by a second variable to a second data structure, (b) writing a value of said fragment from said first data structure into said second variable, (c) incrementing said first variable, and (d) revisiting said step of determining whether a last one of said at least one fragment has been reached, and (iv) when said first data structure does not include said read fragment, (e) assigning said read fragment to said first data structure, (f) assigning a last value from said first data structure to said second variable, (g) assigning said value corresponding to said read fragment represented by said second variable to said second data structure, (h) writing said value of said fragment from said first data structure into said second variable, (i) incrementing said first variable, and (j) revisiting said step of determining whether a last one of said at least one fragment has been reached.

### Claim 12

A method for accelerating the processing speed of an audio decompression algorithm, comprising the steps of:
obtaining compressed audio data to be processed by said algorithm, said audio data including at least one fragment;
providing a first data structure for holding at least a portion of said data;
setting a first variable representing one of said at least one fragment to a first preselected value;
assigning dimension to said at least one fragment;
determining whether a last one of said at least one fragment has been reached;
when said last one of said at least one fragment has been reached, ceasing further operation; and
when said last one of said at least one fragment has not been reached, (i) reading a value corresponding to said at least one fragment from a second data structure, (ii) assigning said read value to a second variable, (iii) reading said at least one fragment associated with said assigned second variable from said first data structure, (iv) assigning said read at least one fragment associated with said assigned second variable to a third variable, (v) audibly presenting said at least one fragment corresponding to said third variable, (vi) incrementing said first variable, and (vii) revisiting said step of determining whether a last one of said at least one fragment has been reached.

### Claim 13

A method for accelerating the processing speed of an optical character recognition algorithm, comprising the steps of:
obtaining data to be processed by said algorithm, said data including at least one character fragment;
providing a first data structure for holding at least a portion of said data;
setting a first variable representing one of said at least one fragment to a first preselected value;
assigning dimension to said at least one fragment;
determining whether at least one of said at least one fragment is available to be recognized;
when said at least one of said at least one fragment is not available to be recognized, ceasing further operation; and
when said at least one of said at least one fragment is available to be recognized, (i) assigning said at least one fragment associated with said first variable to a second variable, (ii) determining whether said at least one fragment associated with said second variable is present in said first data structure, (iii) when said at least one fragment associated with said second variable is not present in said first data structure, (a) recognizing said at least one fragment associated with said second variable as a character, (b) assigning said recognized character to a third variable, (c) assigning said recognized character associated with said second variable into said first data structure in a first specified position, (d) assigning said recognized character associated with said third variable into a second data structure in a second specified position corresponding to said first specified position of said first data structure, (e) incrementing said first variable, and (f) revisiting said step of determining whether at least one of said at least one fragment is available to be recognized, and (iv) when said at least one fragment associated with said second variable is present in said first data structure, (g) assigning a position of said at least one fragment associated with said second variable in said first data structure to a fourth variable, (h) obtaining said at least one fragment associated with said fourth variable from said second data structure, (i) incrementing said first variable, and (j) revisiting said step of determining whether at least one of said at least one fragment is available to be recognized.

### Claim 14

A method for effecting a digital camera zooming function, comprising the steps of:
obtaining pixels from a zoomed digital image within the operative viewing range of a digital camera prior to a digital picture being taken;
calculating a distance required to execute a digital zoom;
effecting movement of a light-sensitive matrix of said digital camera horizontally across said image;
recording said horizontal movement on said light-sensitive matrix;
for each said horizontal movement, writing consecutive pixels presented into a data structure;
effecting movement of said light-sensitive matrix of said digital camera vertically across said image;
recording said vertical movement on said light-sensitive matrix;
for each said vertical movement, writing consecutive pixels presented into said data structure; and
generating a picture in said data structure having a resolution greater than that associated with said matrix.

### Claim 15

A computer program product comprising a computer usable medium having a computer readable program code means embodied in said medium for causing an application program to execute on a computer for accelerating the processing speed of a computer algorithm, comprising:
means for obtaining data to be processed by said computer algorithm;
a first data structure for holding at least a portion of said data;
means for setting an index representing a stabilization state of said first data structure to a value indicating an unstabilized state;
means for verifying said index setting;
means for obtaining at least one data element of said data; and
means for, when said index setting indicates an unstabilized state of said first data structure, (i) inserting at least a portion of said at least one data element into said first data structure, (ii) processing said portion of said at least one data element by said computer algorithm, (iii) inserting said processed portion of said at least one data element into said first data structure, (iv) determining whether said first data structure is filled, and (a) when said first data structure is filled, setting said index to a value representing a stabilized state of said first data structure, determining if all of said data have been processed, when all of said data have been processed, adding said processed portion of said at least one data element into a second data structure and ceasing further operation, when all of said data have not been processed, adding said processed portion of said at least one data element into said second data structure and revisiting said step of obtaining at least one data element of said data, and (b) when said first data structure is not filled, determining if all of said data have been processed, when all of said data have been processed, adding said processed portion of said at least one data element into said second data structure and ceasing further operation, when all of said data have not been processed, adding said processed portion of said at least one data element into said second data structure and revisiting said step of obtaining at least one data element of said data; and
means for, when said index setting indicates a stabilized state of said first data structure, (1) searching said first data structure for at least a portion of said at least one data element that has been processed by said computer algorithm, (2) copying said processed portion of said at least one data element from said first data structure into said second data structure, (3) determining if all of said data have been processed, and (A) when all of said data have been processed, ceasing further operation, and (B) when all of said data have not been processed, revisiting said step of obtaining at least one data element of said data.

### Claim 16

A system for accelerating the processing speed of a computer algorithm, comprising:
means for obtaining data to be processed by said computer algorithm;
a first data structure for holding at least a portion of said data;
means for setting an index representing a stabilization state of said first data structure to a value indicating an unstabilized state;
means for verifying said index setting;
means for obtaining at least one data element of said data; and
means for, when said index setting indicates an unstabilized state of said first data structure, (i) inserting at least a portion of said at least one data element into said first data structure, (ii) processing said portion of said at least one data element by said computer algorithm, (iii) inserting said processed portion of said at least one data element into said first data structure, (iv) determining whether said first data structure is filled, and (a) when said first data structure is filled, setting said index to a value representing a stabilized state of said first data structure, determining if all of said data have been processed, when all of said data have been processed, adding said processed portion of said at least one data element into a second data structure and ceasing further operation, when all of said data have not been processed, adding said processed portion of said at least one data element into said second data structure and revisiting said step of obtaining at least one data element of said data, and (b) when said first data structure is not filled, determining if all of said data have been processed, when all of said data have been processed, adding said processed portion of said at least one data element into said second data structure and ceasing further operation, when all of said data have not been processed, adding said processed portion of said at least one data element into said second data structure and revisiting said step of obtaining at least one data element of said data; and
means for, when said index setting indicates a stabilized state of said first data structure, (1) searching said first data structure for at least a portion of said at least one data element that has been processed by said computer algorithm, (2) copying said processed portion of said at least one data element from said first data structure into said second data structure, (3) determining if all of said data have been processed, and (A) when all of said data have been processed, ceasing further operation, and (B) when all of said data have not been processed, revisiting said step of obtaining at least one data element of said data.
