CN106469042A - The generation method of pseudo random number and device - Google Patents
The generation method of pseudo random number and device Download PDFInfo
- Publication number
- CN106469042A CN106469042A CN201510512082.2A CN201510512082A CN106469042A CN 106469042 A CN106469042 A CN 106469042A CN 201510512082 A CN201510512082 A CN 201510512082A CN 106469042 A CN106469042 A CN 106469042A
- Authority
- CN
- China
- Prior art keywords
- random
- predetermined storage
- random factor
- factor
- storage location
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a kind of generation method of pseudo random number, and on application node in the cluster, methods described includes：Obtain from predetermined storage location and start random factor；According to the number upper limit starting random factor and this node random number to be generated, determine and stop random factor, and random factor will be stopped and write described predetermined storage location；To start random factor as initial value, the random number less than the described number upper limit is generated according to pseudo-random algorithm.By the technical scheme of the application, greatly reduce the probability that different nodes generate same random number, improve the speed of service of cluster, shorten the response time to user.
Description
Technical field
The application is related to network communication technology field, more particularly, to a kind of generation method of pseudo random number and dress
Put.
Background technology
Random number has a wide range of applications in fields such as computer software, hardware, safety.Generally make at present
Random number sequence is produced by algorithm, because computer can not possibly produce the numeral of completely random,
The random number so generating is referred to as pseudo random number.
Conventional pseudo-random algorithm to generate random number sequence using recurrence formula, that is,：Random by k-th
The factor is input in recurrence formula, obtains (k+1) individual random factor, (k+1) individual random number by
(k+1) individual random factor determines.0th random factor (is used for obtaining the 1st random number
Random factor) it is referred to as initial value.It can be seen that, when using identical initial value, identical pseudo-random algorithm
Identical random number sequence can be generated.
Need to produce the application scenario of a large amount of random passwords at short notice at some, usually by server set
Group, to complete the generation of password, runs pseudo-random algorithm by several nodes in cluster simultaneously, to meet
The password demand of high concurrent.In prior art, pseudo-random algorithm is frequently utilized that certain business dependent event is sent out
System time when raw is determining initial value.When the dense degree of the number of nodes in cluster and business increases
To a certain extent, different nodes will be occurred to use the situation of identical initial value.Using identical initial value
Node can generate series of identical random number so that the random password that generated of these nodes often because
It has been used with no effect, be equivalent to only one of which node using the node of identical initial value and generating at random
Password, reduces the speed of service of cluster, extends response time.
Content of the invention
In view of this, the application provides a kind of generation method of pseudo random number, application node in the cluster
On, methods described includes：
Obtain from predetermined storage location and start random factor；
According to the number upper limit starting random factor and this node random number to be generated, determine stop random because
Son, and the random factor described predetermined storage location of write will be stopped；
To start random factor as initial value, generated according to pseudo-random algorithm and be less than the described number upper limit
Random number.
Present invention also provides a kind of generating means of pseudo random number, on application node in the cluster, institute
State device to include：
Initial value acquiring unit, starts random factor for obtaining from predetermined storage location；
Initial-value generating unit, for according to the number starting random factor and this node random number to be generated
The upper limit, determines and stops random factor, and will stop the random factor described predetermined storage location of write；
Random number generation unit, for start random factor as initial value, giving birth to according to pseudo-random algorithm
Become the random number less than the described number upper limit.
From above technical scheme, in embodiments herein, each node in cluster is from predetermined
Storage location obtains and starts random factor, during the number upper limit recursion according to this node random number to be generated goes out
Only write predetermined storage location, as the startup random factor of next node after random factor；Each section
Point all to generate random number to start random factor for initial value, so that the use of each node is initial
Value is different from, and greatly reduces the probability that different nodes generate same random number, improves cluster
The speed of service, shorten the response time to user.
Brief description
Fig. 1 is a kind of flow chart of the generation method of pseudo random number in the embodiment of the present application；
Fig. 2 is the operational flow diagram that in cluster in the application application example, each node generates random number；
Fig. 3 is a kind of hardware structure diagram of clustered node place equipment；
Fig. 4 is a kind of building-block of logic of the generating means of pseudo random number in the embodiment of the present application.
Specific embodiment
Pseudo-random algorithm to generate random number using recurrence formula, and according to the difference of specific algorithm, recursion is public
Formula can be single order or second order or multistage.Taking second order as a example, its recurrence formula such as formula 1
Shown：
xn+2=f (xn+1, xn), n >=0 formula 1
In formula 1, xn、xn+1、xn+2For random factor.To second order recursive algorithm, x0And x1For initial value.
The random number sequence being generated is as shown in Equation 2：
rk=g (xk), k >=2 formula 2
According to the demand of concrete application scene, can be by random factor directly as random number (this being generated
When rk=xk)；Corresponding random number can also be obtained to after the conversion of random factor doing mathematicses.
Not all of recursive algorithm may serve to generate random number, is only generated with recursive algorithm
Sequence require through the check character a little statistics of unification, such as uniformity, randomness of sampling etc. meet certain
Condition, such recursive algorithm just can be used as pseudo-random algorithm.That is, pseudo-random algorithm
Started with certain initial value, recursion generates a series of random factors several times, these random factors are substantially not
The situation having repetition occurs.
So, when L random number to be generated on first node in cluster it is meant that recursion is at this
To carry out L time on node, if second node with after this node recursion at least L time gained random because
As initial value, then the initial value of second node substantially will not be identical with the initial value of first node for son.
This mode is generalized to for generating all nodes of random number in cluster, then the initial value of each node
All substantially will not be identical with the initial value of other nodes.
Based on above-mentioned thinking, embodiments herein proposes a kind of generation method of new pseudo random number,
The predetermined storage location being available for each node visit in cluster preserves initial value, predetermined from this in each node
After storage location reads initial value, carry out obtaining this node after recursive operation several times will not continue to for passing
Push the random factor of calculation, write predetermined storage location as initial value, so that other nodes use,
Thus be substantially able to ensure that each node initial value different from other nodes, to solve in prior art
The problem existing.
Cluster in the embodiment of the present application includes at least two nodes, and each node is an operation pseudorandom
Algorithm generates the unit of random number, and for example, node can be a physical server, a logical device
Program example of (as virtual machine or simulator) or an independent operating etc..The enforcement of the application
In example, the method for operation of cluster and networking structure, the species of node and communication mode etc. are not all limited.
In the embodiment of the present application, the flow process of the generation method of the pseudo random number run on each node is as schemed
Shown in 1.
Step 110, obtains from predetermined storage location and starts random factor.
In embodiments herein, predetermined storage location can be by all sections of operation pseudo-random algorithm in cluster
Point accesses, and these nodes all have the authority of read-write to the content being saved in predetermined storage location.In advance
Determining storage location can be it is also possible on the equipment outside cluster, not do on certain node in the cluster
Limit.For example,
Start random factor to be used by the nodes to as initial value, input recurrence formula to generate random number sequence.
Run on each node in cluster at the beginning of the pseudo-random algorithm of identical exponent number, the pseudo-random algorithm of different rank
Initial value number is different.The number starting random factor is identical with the exponent number of the pseudo-random algorithm running on node,
The number of the value that predetermined storage location is preserved is identical with the number of the startup random factor of each node.When
When the number starting random factor is more than one, each node is according to same order by predetermined storage location
The value preserving gives each and starts random factor.
Step 120, according to the number upper limit starting random factor and this node random number to be generated, determines
Stop random factor, and random factor will be stopped to write described predetermined storage location.
The number upper limit assuming this node random number to be generated is N (N be natural number), is depositing from predetermined
After storage space puts reading startup random factor, node, to start random factor as initial value, uses pseudo-random algorithm
In recurrence formula carry out at least K time recursion (K is not less than N), if the used pseudo-random algorithm of node
Exponent number m (m be natural number), the k-th random factor that recursion is obtained is individual to (K-m-1)
Random factor is as termination random factor.Node will stop random factor write predetermined storage location, will be pre-
Determine the original value of storage location to be updated to stop random factor.When stopping random factor more than one, often
Individual node according to same order when predetermined storage location reads and starts random factor, will stop at random
The factor writes predetermined storage location.
For example, to the pseudo-random algorithm using single order recursive algorithm, start random factor and stop random because
Son all only one of which, node, to start random factor as initial value, runs n times pseudo-random algorithm, obtains
To n-th random factor.The number upper limit due to this node random number to be generated is N, and this node will not
Again with n-th random factor come recursion (N+1) individual random factor, therefore this node can be by N
Individual random factor, as stopping random factor, is written to predetermined storage location, for other nodes as startup
Random factor uses.
In application scenes, whole cluster is needed to be generated using certain pseudo-random algorithm and is less than certain
The random number of this quantification now can will be given birth to as on each node by the random number of quantification
Become the number upper limit of random number.If whole cluster random number quantity to be generated is difficult to determine, every
On individual node, the number upper limit of random number to be generated also is difficult to determine, now can make each node according to
Generating random number, every batch generates a number of random number to batch, when a batch generate random
When number reaches this quantity, node reacquires initial value from predetermined storage location.Specifically, at every batch
Secondary is initial, and node obtains from predetermined storage location and starts random factor, and this batch volume residual is put
For this batch number upper limit；Node, to start random factor as initial value, needs to generate at random each
Run a pseudo-random algorithm during number and obtain next random factor, and this batch volume residual is subtracted one,
Until this batch volume residual is zero；When this batch volume residual is zero, node starts next batch,
Reset this batch volume residual from predetermined storage location acquisition startup random factor and with this batch number upper limit.
It should be noted that this batch number upper limit of each batch of node can identical it is also possible to different.
This batch number upper limit can be arranged in advance manually by manager, can be transported according to cluster by cluster controller
Row situation determines and notifies node, can also be automatically generated according to self-operating situation by node, the application
Embodiment do not limit.When this batch number upper limit of each batch of node may be different, node can
When this batch volume residual is zero, to obtain this batch number higher limit of next batch.
Start random factor being read by predetermined storage location from a node, to by predetermined storage location more
New is the interior during the visit of termination random factor, and other nodes may be had to wish to obtain from predetermined storage location
Initial value.In order to avoid now other nodes obtain identical initial value, node can be from predetermined storage
Before position acquisition starts random factor, predetermined storage location is locked；And random factor write will stopped
After predetermined storage location, predetermined storage location is unlocked.So, other nodes only will be pre- in this node
Determine storage location value update finish after, just can read initial value.
It should be noted that the realization of predetermined storage location is different in different concrete application scenes, if
In scene, the access mechanism of predetermined storage location has been provided for locking and unlocking function in itself, for example predetermined
Storage location is certain record in the addressable data base of each node, then be no longer necessary to predetermined storage
Position separately locks and unlocks.
Step 130, to start random factor as initial value, generates according to pseudo-random algorithm and is less than institute
State the random number of the number upper limit.
After obtaining starting random factor, when needing to generate random number, in this node random number to be generated
The number upper limit in, node run pseudo-random algorithm, gradually recursion generate random number sequence.
In the realization that each node to generate random number according to batch, this node is in random number to be generated
In this batch number upper limit, run pseudo-random algorithm and generate random number sequence.
It can be seen that, in embodiments herein, it is available for the predetermined storage location of each node visit in the cluster
Preserve the initial value running pseudo-random algorithm, the value preserving is updated after obtaining initial value by each node
For unduplicated value, so that other nodes use as initial value.So enabling to each node makes
Generate random number with different initial values, greatly reduce that different nodes generate same random numbers can
Can property, it is to avoid because the cluster speed of service that initial value repeats to lead to declines, and cluster pair can be shortened
The response time of user.
If additionally, the pseudo-random algorithm running on each node in cluster is different, or running identical
Pseudo-random algorithm but the parameter that adopted in addition to initial value is different, what whole cluster was generated is all random
For number, its statistical properties is often not so good as the random number sequence that on a node, recursion generates.And this Shen
In embodiment please, when operation identical pseudo-random algorithm on each node in cluster, and except initial
Value is outer, when the other specification of the pseudo-random algorithm that each node runs is identical, each node in whole cluster
The random number generating is equivalent to the random number sequence generating on a node, can reach good statistics
Index, improves the quality of the random number of cluster generation.
In an application example of the application, cluster includes multiple nodes, and each node is a jvm
(Java Virtual Machine, Java Virtual Machine) example.This cluster is used for the request of receive user,
User is replied to as response after generating random password.Each jvm example by linear congruent algorithm Lai
Generate random number sequence, and in addition to initial value, on each jvm example, linear congruent algorithm is adopted
Other specification is identical.
Precalculated position in the addressable data base of all jvm examples, preserves linear congruence in the cluster
The initial value of algorithm random factor.The table for storing initial value is set up in data base, a kind of possible
Structure is as shown in table 1：
| ID | Gmt_create | Gmt_modified | Seed |
| 1 | 2015/4/4 | 2015/4/4 | 0 |
Table 1
In table 1, ID is line identifier；Gmt_create is the time of origin creating this record；
Gmt_modified is the time of origin of the last modification of this record；Seed is currently preserved random
The initial value of the factor.
Each jvm example to generate random number according to batch, and each jvm example presets every batch fortune
Places number constant T, namely the number upper limit of random number that every batch can generate.
In startup optimization, on each jvm example, the value of remaining number of run variable is 0.Receive each
To user random password ask when, the operational process on each jvm example is as shown in Figure 2.
Step 201, the random password request of receive user.
Step 202, judges whether the remaining number of run of this batch is zero, if it is, execution step 203；
If not, going to step 207；
Step 203, the precalculated position from data base is read and is started random factor.Access in jvm example
During this record in data base, this record is locked by data base.
Step 204, will start random factor as initial value, and execute T sublinear congruence algorithm, will pass
The T random factor released is as termination random factor.
Step 205, will stop the precalculated position in random factor write into Databasce, updates this record.?
After record renewal is finished by jvm example, this record is unlocked by data.
Step 206, a upper random factor variable is set to startup random factor, by remaining for this batch fortune
Places number is set to T.
Step 207, draws this random factor by a upper random factor recursion, by upper one random because
Sub- variable is set to this random factor, and remaining number of run is subtracted one.
Step 208, generates random password according to the random factor that this runs gained, asks as to user
The response asked returns to user.
Corresponding with the realization of above-mentioned flow process, embodiments herein additionally provides one kind and applies on clustered node
Pseudo random number generating means.This device can be realized it is also possible to by hardware or soft by software
The mode of combination of hardware is realized.As a example implemented in software, as the device on logical meaning, it is cluster section
The CPU (Central Process Unit, central processing unit) of point place equipment is by corresponding computer journey
Sequence instruction reads and runs formation in internal memory.For hardware view, except the CPU shown in Fig. 3,
Outside internal memory and nonvolatile memory, the equipment that the generating means of pseudo random number are located generally also includes
For realizing other hardware such as board of network communicating function.
Fig. 4 show a kind of generating means of pseudo random number of the embodiment of the present application offer, applies in cluster
In node on, described device includes initial value acquiring unit, initial-value generating unit and generating random number
Unit, wherein：Initial value acquiring unit is used for obtaining startup random factor from predetermined storage location；Initially
Value signal generating unit is used for, according to the number upper limit starting random factor and this node random number to be generated, determining
Stop random factor, and random factor will be stopped to write described predetermined storage location；Random number generation unit
For to start random factor as initial value, being generated according to pseudo-random algorithm and being less than the described number upper limit
Random number.
Optionally, described initial-value generating unit specifically for：To start random factor as initial value,
Run pseudo-random algorithm described in n times, using the n-th obtaining random factor as termination random factor, and
Random factor will be stopped and write described predetermined storage location；N is in the number of this node random number to be generated
Limit.
Optionally, the described number upper limit is in this section this batch of point this batch number of random number to be generated
Limit；Described device also includes volume residual reset cell and volume residual updating block, wherein：Remainder
Amount reset cell is used for after obtaining and start random factor from predetermined storage location, by this batch volume residual
It is set to this batch number upper limit；Volume residual updating block is used for after generating each random number, incite somebody to action this
Batch volume residual subtracts one, until this batch volume residual is zero；Described initial value acquiring unit is specifically used
In：When this batch volume residual is zero, obtains this batch from predetermined storage location and start random factor.
Optionally, described device also includes locking unit and unlocking unit, wherein：Lock unit to be used for
Before predetermined storage location obtains and starts random factor, predetermined storage location is locked；Unlocking unit is used for
After stopping random factor write predetermined storage location, predetermined storage location is unlocked.
Optionally, each node in described cluster runs identical pseudo-random algorithm；In addition to initial value,
The other specification that described pseudo-random algorithm adopts is identical.
The foregoing is only the preferred embodiment of the application, not in order to limit the application, all this
Within the spirit of application and principle, any modification, equivalent substitution and improvement done etc., should be included in
Within the scope of the application protection.
In a typical configuration, computing device includes one or more processors (CPU), input/output
Interface, network interface and internal memory.
Internal memory potentially includes the volatile memory in computer-readable medium, random access memory
(RAM) and/or the form such as Nonvolatile memory, such as read only memory (ROM) or flash memory (flash RAM).
Internal memory is the example of computer-readable medium.
Computer-readable medium include permanent and non-permanent, removable and non-removable media can by appoint
What method or technique is realizing information Store.Information can be computer-readable instruction, data structure, program
Module or other data.The example of the storage medium of computer include, but are not limited to phase transition internal memory (PRAM),
Static RAM (SRAM), dynamic random access memory (DRAM), other kinds of with
Machine access memorizer (RAM), read only memory (ROM), Electrically Erasable Read Only Memory
(EEPROM), fast flash memory bank or other memory techniques, read-only optical disc read only memory (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassette tape, tape magnetic rigid disk stores or it
His magnetic storage apparatus or any other non-transmission medium, can be used for storing the letter that can be accessed by a computing device
Breath.Define according to herein, computer-readable medium does not include temporary computer readable media (transitory
Media), as data signal and the carrier wave of modulation.
Also, it should be noted term " inclusion ", "comprising" or its any other variant be intended to non-
The comprising of exclusiveness, so that include a series of process of key elements, method, commodity or equipment not only wrap
Include those key elements, but also include other key elements being not expressly set out, or also include for this process,
Method, commodity or the intrinsic key element of equipment.In the absence of more restrictions, " included by sentence
One ... " key element that limits is being it is not excluded that including the process of described key element, method, commodity or setting
Also there is other identical element in standby.
It will be understood by those skilled in the art that embodiments herein can be provided as method, system or computer journey
Sequence product.Therefore, the application can using complete hardware embodiment, complete software embodiment or combine software and
The form of the embodiment of hardware aspect.And, the application can adopt and wherein include calculating one or more
Machine usable program code computer-usable storage medium (including but not limited to disk memory, CD-ROM,
Optical memory etc.) the upper computer program implemented form.
Claims (10)
1. a kind of generation method of pseudo random number, it is characterised in that institute on application node in the cluster
The method of stating includes：
Obtain from predetermined storage location and start random factor；
According to the number upper limit starting random factor and this node random number to be generated, determine stop random because
Son, and the random factor described predetermined storage location of write will be stopped；
To start random factor as initial value, generated according to pseudo-random algorithm and be less than the described number upper limit
Random number.
2. method according to claim 1 it is characterised in that described according to start random factor and
The number upper limit of this node random number to be generated, determines and stops random factor, including：With start random because
Son as initial value, runs pseudo-random algorithm described in n times, using the n-th obtaining random factor as in
Only random factor；N is the number upper limit of this node random number to be generated.
3. method according to claim 2 is it is characterised in that the described number upper limit is this section point basis
This batch number upper limit of batch random number to be generated；
Methods described also includes：
After obtaining and start random factor from predetermined storage location, this batch volume residual is set to this batch
The number upper limit；
After generating each random number, this batch volume residual is subtracted one, until this batch volume residual
It is zero；
Described from predetermined storage location obtain the initial random factor, including：When this batch volume residual is zero
When, obtain this batch from predetermined storage location and start random factor.
4. method according to claim 1 is it is characterised in that methods described also includes：
Before obtaining and start random factor from predetermined storage location, predetermined storage location is locked；
After stopping random factor write predetermined storage location, predetermined storage location is unlocked.
5. method according to claim 1 is it is characterised in that on each node in described cluster
Run identical pseudo-random algorithm；In addition to initial value, the other specification that described pseudo-random algorithm adopts is identical.
6. a kind of generating means of pseudo random number, it is characterised in that institute on application node in the cluster
State device to include：
Initial value acquiring unit, starts random factor for obtaining from predetermined storage location；
Initial-value generating unit, for according to the number starting random factor and this node random number to be generated
The upper limit, determines and stops random factor, and will stop the random factor described predetermined storage location of write；
Random number generation unit, for start random factor as initial value, giving birth to according to pseudo-random algorithm
Become the random number less than the described number upper limit.
7. device according to claim 6 is it is characterised in that described initial-value generating unit is concrete
For：To start random factor as initial value, run pseudo-random algorithm described in n times, by obtain the
N number of random factor is as termination random factor, and will stop the random factor described predetermined storage location of write；
N is the number upper limit of this node random number to be generated.
8. device according to claim 7 is it is characterised in that the described number upper limit is this section point basis
This batch number upper limit of batch random number to be generated；
Described device also includes：
Volume residual reset cell, for, after obtaining and start random factor from predetermined storage location, inciting somebody to action this
Batch volume residual is set to this batch number upper limit；
Volume residual updating block, for, after generating each random number, this batch volume residual being subtracted
One, until this batch volume residual is zero；
Described initial value acquiring unit specifically for：When this batch volume residual is zero, from predetermined storage
This batch of position acquisition starts random factor.
9. device according to claim 6 is it is characterised in that described device also includes：
Lock unit, for before obtaining and start random factor from predetermined storage location, to predetermined storage position
Put locking；
Unlocking unit, for after stopping random factor write predetermined storage location, to predetermined storage position
Put unblock.
10. device according to claim 6 is it is characterised in that each node in described cluster
Upper operation identical pseudo-random algorithm；In addition to initial value, the other specification phase that described pseudo-random algorithm adopts
With.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510512082.2A CN106469042B (en) | 2015-08-19 | 2015-08-19 | The generation method and device of pseudo random number |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510512082.2A CN106469042B (en) | 2015-08-19 | 2015-08-19 | The generation method and device of pseudo random number |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106469042A true CN106469042A (en) | 2017-03-01 |
| CN106469042B CN106469042B (en) | 2019-05-28 |
Family
ID=58213830
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510512082.2A Active CN106469042B (en) | 2015-08-19 | 2015-08-19 | The generation method and device of pseudo random number |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106469042B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110058843A (en) * | 2019-03-27 | 2019-07-26 | 阿里巴巴集团控股有限公司 | Generation method, device and the server of pseudo random number |
| CN110765738A (en) * | 2018-07-24 | 2020-02-07 | 鸿合科技股份有限公司 | System and method for generating card number and electronic equipment |
| CN114489568A (en) * | 2021-12-28 | 2022-05-13 | 中国电信股份有限公司 | Random number generation method and device, storage medium and processor |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060224647A1 (en) * | 2005-03-30 | 2006-10-05 | Impinj, Inc. | RFID tag using updatable seed values for generating a random number |
| US20080263117A1 (en) * | 2007-04-23 | 2008-10-23 | Gregory Gordon Rose | Initial seed management for pseudorandom number generator |
| CN102063285A (en) * | 2010-12-24 | 2011-05-18 | 倍奥锐(北京)科技有限公司 | True random number generation method implemented by software |
| CN102609237A (en) * | 2011-01-06 | 2012-07-25 | 微软公司 | Scalable random number generation |
| US20130318139A1 (en) * | 2012-05-22 | 2013-11-28 | Electronics And Telecommunications Research Institute | Random number generation method and apparatus using low-power microprocessor |
-
2015
- 2015-08-19 CN CN201510512082.2A patent/CN106469042B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060224647A1 (en) * | 2005-03-30 | 2006-10-05 | Impinj, Inc. | RFID tag using updatable seed values for generating a random number |
| US20080263117A1 (en) * | 2007-04-23 | 2008-10-23 | Gregory Gordon Rose | Initial seed management for pseudorandom number generator |
| CN102063285A (en) * | 2010-12-24 | 2011-05-18 | 倍奥锐(北京)科技有限公司 | True random number generation method implemented by software |
| CN102609237A (en) * | 2011-01-06 | 2012-07-25 | 微软公司 | Scalable random number generation |
| US20130318139A1 (en) * | 2012-05-22 | 2013-11-28 | Electronics And Telecommunications Research Institute | Random number generation method and apparatus using low-power microprocessor |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110765738A (en) * | 2018-07-24 | 2020-02-07 | 鸿合科技股份有限公司 | System and method for generating card number and electronic equipment |
| CN110058843A (en) * | 2019-03-27 | 2019-07-26 | 阿里巴巴集团控股有限公司 | Generation method, device and the server of pseudo random number |
| CN110058843B (en) * | 2019-03-27 | 2023-03-03 | 创新先进技术有限公司 | Pseudo-random number generation method and device and server |
| CN114489568A (en) * | 2021-12-28 | 2022-05-13 | 中国电信股份有限公司 | Random number generation method and device, storage medium and processor |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106469042B (en) | 2019-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7664927B2 (en) | Hash tables | |
| CN107832062B (en) | Program updating method and terminal equipment | |
| CA2957674C (en) | Testing insecure computing environments using random data sets generated from characterizations of real data sets | |
| CN110022315B (en) | Weight management method, device and equipment in block chain type account book | |
| CN112771525A (en) | Obfuscation and deletion of personal data in loosely coupled distributed systems | |
| US11270227B2 (en) | Method for managing a machine learning model | |
| CN113254988B (en) | High-dimensional sensitive data privacy classified protection publishing method, system, medium and equipment | |
| CN105426373A (en) | Database synchronization method and device | |
| CN107402821A (en) | Access control method, device and the equipment of shared resource | |
| CN106469042A (en) | The generation method of pseudo random number and device | |
| CN109934712A (en) | Account checking method, account checking apparatus and electronic equipment applied to distributed system | |
| CN106897342A (en) | A kind of data verification method and equipment | |
| CN110399333A (en) | Delete method, equipment and the computer program product of snapshot | |
| CN109460406A (en) | A kind of data processing method and device | |
| CN112560114A (en) | Method and device for calling intelligent contract | |
| DE102020121075A1 (en) | Establishment and procedure for the authentication of software | |
| KR102306676B1 (en) | Method and system for generating host keys for storage devices | |
| CN110109867A (en) | Improve the method, apparatus and computer program product of on-line mode detection | |
| CN110019229B (en) | Database configuration system | |
| CN115168241B (en) | Test method and system based on combined function coverage rate | |
| CN108846009B (en) | Copy data storage method and device in ceph | |
| CN115687359A (en) | Data table partitioning method and device, storage medium and computer equipment | |
| CN112000482B (en) | Memory management method and device, electronic equipment and storage medium | |
| CN113704255A (en) | Data insertion method and device, and data verification method and device | |
| CN113434596A (en) | Method and device for generating test data of distributed database |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200922 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200922 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Patentee before: Alibaba Group Holding Ltd. |