Apparatus and method for cyclic redundancy check
US-2016371142-A1 · Dec 22, 2016 · US
Secured pseudo-random number generator
US2018246701A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2018246701-A1 |
| Application number | US-201815973557-A |
| Country | US |
| Kind code | A1 |
| Filing date | May 8, 2018 |
| Priority date | Oct 10, 2016 |
| Publication date | Aug 30, 2018 |
| Grant date | — |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
The present invention provides a method of generating a sequence of pseudo-random numbers which are difficult to predict. The method includes: (i) generating a plurality of candidate pseudo-random numbers by a respectively corresponding plurality of (differently structured) linear feedback shift registers; (ii) generating a “selector number” from one or more additional linear feedback shift registers; and (iii) selecting a candidate number from the plurality of candidate numbers, based on the “selection number” to produce a selected pseudo-random number for output.
First claim
Opening claim text (preview).
1 . A computer program product comprising a computer readable storage medium having stored thereon program instructions programmed to perform: receiving, by a selector, a plurality of pseudo-random numbers (PRNs) including a first pseudo-random number (PRN), a second PRN, and a third PRN; selecting, from the plurality of PRNs, a selected PRN, based at least in part upon the first PRN; and outputting the selected PRN; wherein: the plurality of PRNs are generated by a corresponding plurality of pseudorandom number generators (PRNGs) respectively including a first PRNG, a second PRNG, and a third PRNG, feedback configurations of the first PRNG, the second PRNG and the third PRNG are mutually unique, the second PRNG is a Fibonacci linear feedback shift register (LFSR), the third PRNG is a Galois LFSR, a full PRN generated by a PRNG of the plurality of PRNGs, the full PRN having a length of n bits, is partitioned into two or more PRNs having respective lengths of less than n bits, and a PRNG of the plurality of PRNGs is provided with a different seed each time a random number is generated by the PRNG.
Assignees
Inventors
Classifications
Patent family
Related publications grouped by family.
External sources
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US2018246701A1 cover?
- The present invention provides a method of generating a sequence of pseudo-random numbers which are difficult to predict. The method includes: (i) generating a plurality of candidate pseudo-random numbers by a respectively corresponding plurality of (differently structured) linear feedback shift registers; (ii) generating a “selector number” from one or more additional linear feedback shift reg…
- Who is the assignee on this patent?
- IBM
- What technology area does this patent fall under?
- Primary CPC classification G06F7/584. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Thu Aug 30 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).