| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 281 | Simplified dual prime video motion estimation | US753963 | 1996-12-04 | US5905542A | 1999-05-18 | Elliot N. Linzer |
| Methods and apparatus for performing dual prime motion estimation on video fields or frames of a video signal. A 16.times.16 motion estimator generates a same-parity match vector M.sub.-- SP and an opposite-parity match vector M.sub.-- OP for a current macroblock of a current field using a reference macroblock from each of a previous same-parity and opposite-parity field. A dual prime motion estimator receives the M.sub.-- SP and M.sub.-- OP match vectors for the current macroblock, and generates a base motion vector MV and a delta motion vector DMV for the current macroblock. In a first embodiment, the dual prime motion estimator generates MV and DMV by setting MV equal to M.sub.-- SP and then selecting DMV such that the opposite-parity vector OPV to be computed by a decoder is as close as possible to M.sub.-- OP. In a second embodiment, OPV is set equal to M.sub.-- OP and MV and DMV are selected such that MV is as close as possible to the same-parity match vector M.sub.-- SP. In a third embodiment, the dual prime motion estimator uses error measurements between the current macroblock and the same-parity and opposite-parity macroblocks to determine whether the techniques of the first embodiment or the second embodiment should be applied to the current macroblock. | ||||||
| 282 | 一种简单安全的群元数乘和幂运算的计算方法及系统(G5b7＝)摘[(要ba ) ‑群1]G元，数其乘中的h、计b、算a为方[法1,：n‑第1一]内方的保第存一有方G的h＝整[数ha秘‑1]密G，，G为阶为素数n的加法群中的元；当第一方需要计算Gk＝[k]G时，其中k为[1,n‑1]内的第一方的保密整数，第一方计算c＝b(ak‑h)，将c、Gb提交给第二方；第二方计算Gc＝[c]Gb；某一方计存算有Gghk＝＝gG^c(+hGa‑h1即)，为gb[＝k]gG^(。b群a)元‑1幂，其运中算h的、b计、a算为方[1法,n：‑第1]一内方的保第一方的整数秘密，g为阶为素数n的乘法群中的元；当第一方需要计算gk＝g^k时，其中k为[1,n‑1]内的第一方的保密整数，c＝b(ak‑h)，将c、gb提交给第二方；第二方计算gc＝gb^c；某一方gk＝gcgh即为g^k。 | CN202111049012.X | 2021-09-08 | CN113867687A | 2021-12-31 | 龙毅宏 |
| 群元数乘的计算方法：第一方保存有Gh＝[ha‑1]G，Gb＝[(ba)‑1]G，其中h、b、a为[1,n‑1]内的第一方的整数秘密，G为阶为素数n的加法群中的元；当第一方需要计算Gk＝[k]G时，其中k为[1,n‑1]内的第一方的保密整数，第一方计算c＝b(ak‑h)，将c、Gb提交给第二方；第二方计算Gc＝[c]Gb；某一方计算Gk＝Gc+Gh即为[k]G。群元幂运算的计算方法：第一方保存有gh＝g^(ha‑1)，gb＝g^(ba)‑1，其中h、b、a为[1,n‑1]内的第一方的整数秘密，g为阶为素数n的乘法群中的元；当第一方需要计算gk＝g^k时，其中k为[1,n‑1]内的第一方的保密整数，c＝b(ak‑h)，将c、gb提交给第二方；第二方计算gc＝gb^c；某一方gk＝gcgh即为g^k。 | ||||||
| 283 | Method of and apparatus for deriving prime numbers, as well as record medium having program for executing prime number deriving method recorded thereon | US09392779 | 1999-09-09 | US06578057B1 | 2003-06-10 | Hironobu Hori |
| On the basis of a high degree of theory, prime numbers are derived through effective processing and steps so as to achieve a remarkable reduction in the processing time taken for the derivation. With respect to an arbitrary prime number rank entered, (1) numerical values are added in sequence to a prime number of the anterior rank to calculate prime number candidates of the next rank; (2) the thus calculated prime number candidate is divided by known prime numbers to verify whether it is a prime number or not; and (3) processing for reducing the verification time is iterated when the thus calculated prime number candidate is larger than a certain value, to thereby derive prime numbers until the entered rank is reached. | ||||||
| 284 | Fixed-coefficient variable prime length recursive discrete Fourier transform system | US13557451 | 2012-07-25 | US08924452B2 | 2014-12-30 | Sheau-Fang Lei; Shin-Chi Lai; Chuan-An Chang |
| A fixed-coefficient variable prime length recursive discrete Fourier transform system includes a pre-processing device, a real-part computation device, an imaginary-part computation device and a post-processing device. The pre-processing device receives N digital input signals and performs order permutation operation to generate first and second temporal signals, wherein N is a prime number. The real-part computation device receives the real part of the first and second temporal signals and performs discrete cosine/sine transform to generate third and fourth temporal signals. The imaginary-part computation device receives the imaginary part of the first and second temporal signals and performs discrete cosine/sine transform to generate fifth and sixth temporal signals. The post-processing device receives the third, fourth, fifth and sixth temporal signals to perform order permutation and addition operations for generating N digital output signals, wherein the N digital output signals are the discrete Fourier transform of the N digital signals. | ||||||
| 285 | Fast scalar multiplication for elliptic curve cryptosystems over prime fields | US12190539 | 2008-08-12 | US08369517B2 | 2013-02-05 | Alexandre Venelli; Francois Dassance |
| Fast scalar multiplication operations are disclosed for use in an elliptic curve cryptographic system The operations use binary representations of a secret key and points on an elliptic curve defined over a prime field expressed in a coordinate system (e.g., Jacobian coordinates). The operations can be based on a modified Montgomery ladder that uses modified Meloni addition formulas. The operations can be more efficient than a double-and-add operation, and can be more resistant to side-channel attacks by hackers. | ||||||
| 286 | RAID 6 disk array with prime number minus one disks | US10607381 | 2003-06-26 | US07103716B1 | 2006-09-05 | Sanjeeb Nanda |
| A RAID 6 architecture including a disk array having a prime number minus 1 disks. A method of providing multiple disk fault tolerance in an N−column×R−row logical representation of a set of data elements, wherein N represents the number of disks in the array and R is equivalent to N/2, includes assigning each strip containing data to at least two different parity groups so that each strip containing data in a respective column is assigned to parity groups different than other strips containing data in the column. The method also includes calculating, for each parity group, a parity value corresponding to all of the strips assigned to the parity group. The method further includes storing each of the parity values in strips of different columns, so that none of the strips containing data in a column are assigned to a parity group for which the parity value for the parity group is stored in the column. | ||||||
| 287 | Method for generating a random prime number within a predetermined interval | US10236942 | 2002-09-09 | US20040049526A1 | 2004-03-11 | Marc Joye; Pascal Paillier |
| A random prime number is generated within a predetermined interval by precalculating and storing a single value that functions as a universal parameter for generating prime numbers of any desired size. The value, null, is chosen as a product of k prime numbers. A number a is also chosen such that is co-prime with null. Once the values for null and a have been determined they can be stored and used for all subsequent iterations of the prime number generating algorithm. To generate a prime number, a random number x is chosen with uniform distribution, and a candidate prime number within the predetermined interval is calculated on the basis of the random number. This candidate is tested for primality, and returned as the result if it is prime. If the candidate is not prime, the random number x is multiplied by a, and used to generate a new candidate. This procedure is repeated, until the candidate is prime. Since a single value, namely null, needs to be precalculated, economies of storage are achieved. In addition, the interval of interest is approximated with a higher degree of resolution. Moreover, it is possible to utilize the same value of null for a number of different intervals. | ||||||
| 288 | Using prime numbers to manage partitioning in a cluster of nodes of computers | US11936809 | 2007-11-08 | US08645525B2 | 2014-02-04 | Adrian James Preston |
| For managing partitioning in a cluster of nodes, each node is assigned a prime number for use in determining which partition should be activated following partitioning of the cluster. The cluster is monitored for partitioning. If partitioning is detected, a partition value is calculated from the product of the prime numbers assigned to each node in each partition. A node is activated only if it is within the partition having the greatest partition value. | ||||||
| 289 | Method, system and apparatus for generating self-validating prime numbers | US09114024 | 1998-07-10 | US06307938B1 | 2001-10-23 | Stephen M. Matyas, Jr.; Allen Roginsky |
| A method, system and apparatus for generating primes (p and q) for use in cryptography from secret random numbers and an initialization value whereby the initial secret random numbers are encoded into the generated primes. This eliminates the need to retain the initial secret random numbers for auditing purposes. The initialization value may also be generated from information readily available, if so desired, resulting in additional entropy without the requirement of storing additional information. | ||||||
| 290 | Computer and method for high speed prime factor transform | US706222 | 1985-02-27 | US4604721A | 1986-08-05 | Joseph H. Gray |
| A special purpose computer and method of computation for performing an N-length discrete Fourier transform (DFT) using a sum and difference conjugate prime factor transform. The transform length N is selected as equal to the product of L mutually prime factors N.sub.1, N.sub.2, . . . , N.sub.1, . . . , N.sub.L. For each one of the L mutually prime factors N.sub.i, an N.sub.i -length DFT is performed. Each N.sub.i -length DFT transform is performed using a data processing element called a kernel. Each kernel includes one or more memory elements for reordering data and a computational element. The computational element includes adder circuit means for forming the sum term, SUM(n).sub.i equal to the quantity x(n.sub.i)+x(N.sub.i -n.sub.i) and the difference term, DIFF(n.sub.i) equal to x(n.sub.i)-x(N.sub.i -n.sub.i). | ||||||
| 291 | Reduction of memory usage for prime number storage by using a table of differences between a closed form numerical function and prime numbers which bounds a prime numeral between two index values | US11511611 | 2006-08-28 | US07711666B1 | 2010-05-04 | Richard Crandall; Sam Noble |
| Embodiments of prime indexing and/or other related operations are disclosed. | ||||||
| 292 | Method and apparatus for calculating a multiplicative inverse of an element of a prime field | US10040050 | 2001-10-25 | US07191333B1 | 2007-03-13 | Mahesh S. Maddury; Kenneth J. Tomei |
| Techniques for implementing a digital signature algorithm in electronic computer hardware include computing the multiplicative inverse of a particular integer modulo a prime modulus by computing a first quantity modulo the prime modulus. The first quantity substantially equals, modulo the prime modulus, the particular integer raised to a power of a second quantity. The second quantity is two less than the prime modulus. The techniques allow an integrated circuit block to compute a modulo multiplicative inverse, such as for signing and verifying digital signatures, using existing blocks of circuitry that consume considerably less area on a chip, and incur fewer developmental costs, than an implementation of an algorithm conventionally used in software. | ||||||
| 293 | Method for generating a random prime number within a predetermined interval | US10236942 | 2002-09-09 | US07149763B2 | 2006-12-12 | Marc Joye; Pascal Paillier |
| A random prime number is generated within a predetermined interval by precalculating and storing a single value that functions as a universal parameter for generating prime numbers of any desired size. The value, π, is chosen as a product of k prime numbers. A number a is also chosen such that is co-prime with π. Once the values for π and a have been determined they can be stored and used for all subsequent iterations of the prime number generating algorithm. To generate a prime number, a random number x is chosen with uniform distribution, and a candidate prime number within the predetermined interval is calculated on the basis of the random number. This candidate is tested for primality, and returned as the result if it is prime. If the candidate is not prime, the random number x is multiplied by a, and used to generate a new candidate. This procedure is repeated, until the candidate is prime. Since a single value, namely π, needs to be precalculated, economies of storage are achieved. In addition, the interval of interest is approximated with a higher degree of resolution. Moreover, it is possible to utilize the same value of π for a number of different intervals. | ||||||
| 294 | RSA Public-key data encryption system having large random prime number generating microprocessor or the like | US216435 | 1980-12-15 | US4351982A | 1982-09-28 | William J. Miller; Nick G. Trbovich |
| A public-key data encryption system employing RSA public-key data encryption including a message encrypter capable of encrypting messages using a non-secret encryption key, a transmitter-receiver coupled to the message encrypter which transmits or receives an encrypted message to or from a remote location, the transmitter-receiver also being coupled to a decrypter capable of decrypting a received encrypted message using a decryption key which is a secret input to the decrypter, and an encryption-decryption key generator, including a microprocessor or other large-scale integrated circuit or circuits formed to generate a sequence of prime numbers beginning with a selected known prime number having a length relatively short with respect to the desired length of the last in the sequence of prime numbers, and which is constructed to form the sequence of prime numbers in the form hP+1 where P is the preceding prime number in the sequence, and to test hP+1 for primality by first determining if hP+1 has a GCD of 1 with x, wherein x is a composite number consisting of the product of all known prime numbers less than or equal to a pre-selected known prime number and if the GCD is not equal to 1, incrementing h to form a new hP+1 to be tested for a GCD equal to 1, and when a GCD is found to be 1, performing the primality tests to determine whether 2.sup.hP .ident.1 [mod (hP+1)] and 2.sup.h .notident.1 [mod (hP+1)], and if either 2.sup.hP .notident.1 [mod (hP+1)] or 2.sup.h .ident.1 [mod (hP+1)] further incrementing h and so on until a prime is found in this manner and then determining if the length of the prime number is of or greater than the desired length. If the hP+1 which has been determined to be prime is not of the desired length, hP+1 is placed in the sequence of prime numbers and a new h selected to be used to find the next prime number in the sequence in accordance with the above described procedure by forming a new hP+1 in which P is the previously determined prime number in the sequence of prime numbers. When a prime number in the sequence of prime numbers is found which is of the desired length it is input into the encryption-decryption key generator for generating the RSA public-key encryption and decryption keys. | ||||||
| 295 | 畫素、畫素陣列與包含其之影像感測器、及驅動畫素陣列之方法 | TW100115209 | 2011-04-29 | TWI474475B | 2015-02-21 | 朴成炯; PARK, SEONG HYUNG |
| 296 | Information security device, prime number generation device, and prime number generation method | EP04013183.1 | 2002-04-16 | EP1465366B1 | 2007-06-13 | Futa, Yuichi; Ono, Takatoshi; Ohmori, Motoji |
| 297 | PROCEDE DE GENERATION RAPIDE D'UN NOMBRE ALEATOIRE NON DIVISIBLE PAR UN ENSEMBLE PREDETERMINE DE NOMBRES PREMIERS | EP05825311.3 | 2005-12-20 | EP1832034A2 | 2007-09-12 | JOYE, Marc; PAILLIER, Pascal |
| 298 | Information security device, prime number generation device, and prime number generation method | EP02008580.9 | 2002-04-16 | EP1251654B1 | 2006-06-14 | Futa, Yuichi; Ono, Takatoshi; Ohmori, Motoji |
| 299 | Information security device, prime number generation device, and prime number generation method | EP04013183.1 | 2002-04-16 | EP1465366A1 | 2004-10-06 | Futa, Yuichi; Ono, Takatoshi; Ohmori, Motoji |
An information security device receives an input of prime q, and generates prime N that is larger than prime q. In the information security device, a partial information setting unit generates number u such that 2×u×q+1≠0 mod Li (i=1, 2, ... , n). A random number generating unit generates random number R'. A judgement target generating unit generates R=u+L1×L2×...×Ln×R' and N=2×R×q+1, using number u and random number R'. A primality judging unit judges the primality of number N, using numbers N and R generated by the judgement target generating unit. |
||||||
| 300 | Information security device, prime number generation device, and prime number generation method | EP02008580.9 | 2002-04-16 | EP1251654A2 | 2002-10-23 | Futa, Yuichi; Ono, Takatoshi; Ohmori, Motoji |
An information security device receives an input of prime q, and generates prime N that is larger than prime q. In the information security device, a partial information setting unit generates number u such that 2×u×q+1≠0 mod Li (i=1, 2, ... , n). A random number generating unit generates random number R'. A judgement target generating unit generates R=u+L1×L2×...×Ln×R' and N=2×R×q+1, using number u and random number R'. A primality judging unit judges the primality of number N, using numbers N and R generated by the judgement target generating unit. |
||||||
QQ群二维码
意见反馈
意见反馈