Comic actor Danny Kaye received patent D166,807 for the co-design of "Blowout Toy or the Like". It's similar to one of those toys that unravels when you blow into at a birthday party except Kaye's has three blowouts going in different directions, not just one.
Make the Most of Our Site
See this month's Top Inventors and Most Cited Patents.
Stay on top of the latest innovations by subscribing to an RSS feed.
Registered users: Manage your profile.
| Number | Title | Issue Date |
| 8090757 | Circuit and method for performing multiple modulo mathematic operations A multi-function modulo processor architecture is capable of performing multiple modulo mathematic operations. The modulo processor includes a pipeline processing portion that iteratively computes a running partial modulo product using the operands of a modulo mathe... | 01/03/2012 |
| 8073891 | Method for implementing montgomery modular multiplication and device therefore Device for implementing modular multiplication, characterized in that it comprises at least one computation cell comprising a multiplier-adder comprising p pipelined logic-register pairs, receiving several digits to be added together and multiplied, at least two out... | 12/06/2011 |
| 8055696 | Modular multiplication method, modular multiplier and cryptosystem having the same Provided are a modular multiplication method with an improved arithmetic operation, a modular multiplier and a cryptograph calculating system having the modular multiplier. The modular multiplication method comprises performing a first arithmetic operation including... | 11/08/2011 |
| 8024392 | Computational method, system, and apparatus A method, system, and apparatus for performing computations. In a method, arguments X and K are loaded into session memory, and X mod P and X mod Q are computed to give, respectively, XP and XQ. XP and XQ are expone... | 09/20/2011 |
| 8024391 | Modular multiplication method with precomputation using one known operand A modular multiplication method implemented in an electronic digital processing system takes advantage of the case where one of the operands W is known in advance or used multiple times with different second operands V to speed calculation. The operands V and W and ... | 09/20/2011 |
| 7966361 | Single-cycle modulus operation Several different approaches to performing the modulus operation are presented. In one, a method of performing the modulus operation upon a dividend and a divisor within a limited range is discussed. The method involves storing a reference value, receiving a dividen... | 06/21/2011 |
| 7912886 | Configurable exponent FIFO The present disclosure provides a system and method for performing modular exponentiation. The method includes loading a first word of a vector from memory into a first register and subsequently loading the first word from the first register to a second register. Th... | 03/22/2011 |
| 7904498 | Modular multiplication processing apparatus A modular multiplication processing apparatus is provided that can process modular multiplication of data exceeding a bit length which a coprocessor can process, by using the coprocessor based upon Montgomery multiplication In the modular multiplication processing a... | 03/08/2011 |
| 7849125 | Efficient computation of the modulo operation based on divisor (2-1) A system and method for computing A mod (2n−1), where A is an m bit quantity, where n is a positive integer, where m is greater than or equal to n. The quantity A may be partitioned into a plurality of sections, each being at most n bits long. The value... | 12/07/2010 |
| 7831650 | Method for modular multiplication In a method for modular multiplication using a multiplication look-ahead process for computing a multiplication shift value and a reduction look-ahead process for computing a reduction shift value, a modulus is first transformed into a transformed modulus that is gr... | 11/09/2010 |
| 7805479 | Scalable, faster method and apparatus for montgomery multiplication Montgomery multiplication can be computed quickly by using carry save adders and parallel multipliers. We present an enhanced technique for very fast Montgomery multiplication that can be used for RSA calculations. This invention utilizes a scalable bit word impleme... | 09/28/2010 |
| 7805478 | Montgomery modular multiplier In a Montgomery multiplier, a modulus product generator may select a modulus product from a plurality of selectable n-bit modulus numbers M, a given modulus number M being formed from a currently input extended chunk of bits among the n-bit modulus numbers. A partia... | 09/28/2010 |
| 7739323 | Systems, methods and computer program products for providing a combined moduli-9 and 3 residue generator Systems, methods and computer program products for providing a combined moduli-9 and 3 residue generator. The methods include receiving a number in binary coded decimal (BCD) or binary format. A modulus-9 residue of the number is calculated. The modulus-9 residue th... | 06/15/2010 |
| 7693926 | Modular multiplication acceleration circuit and method for data encryption/decryption A system to process multiplier X and multiplicand Y may include multiplication of a least-significant bit of X and a least-significant w bits of Y to generate a least-significant w bits of product Z. The system may further include determination of whether a least-si... | 04/06/2010 |
| 7693925 | Multiplicand shifting in a linear systolic array modular multiplier Embodiments of apparatuses and methods for multiplicand shifting in a linear systolic array modular multiplier are disclosed. In one embodiment, an apparatus includes two processing elements of a linear systolic array. One processing element includes multiplication ... | 04/06/2010 |
| 7685221 | Efficient remainder calculation for even divisors In general, in one aspect, the invention features a circuit, method, and computer-readable media for calculating xmody, wherein x and y are binary numbers, and wherein y is an even number. The circuit comprises a power of two calculator adapted to receive signals re... | 03/23/2010 |
| 7664809 | Method and device for calculating modulo operations A method for calculating a modulo operation a mod p uses a table (1) containing the values n*p for n=1, 2, . . . . In this case, a and p are positive integers where a mod p=a−n*p. An integral hypothesis nH is calculated for the unknown value n... | 02/16/2010 |
| 7664810 | Microprocessor apparatus and method for modular exponentiation A technique is provided for performing modular multiplication. In one embodiment, an apparatus in a microprocessor is provided for accomplishing modular multiplication operations. The apparatus includes translation logic and execution logic. The translation logic re... | 02/16/2010 |
| 7647367 | Apparatus and method for calculating a multiplication An apparatus for calculating a modular multiplication includes an examiner for examining digits of the multiplier with a lookahead algorithm to obtain a multiplication shift value. In addition, a determinator and intermediate-result shift value are provided which de... | 01/12/2010 |
| 7580966 | Method and device for reducing the time required to perform a product, multiplication and modular exponentiation calculation using the Montgomery method The invention relates to a method for speeding up the time required to perform a Montgomery product calculation by applying the High-Radix Montgomery method on computing hardware. A loop of operations is performed consisting in repeating successive operations, i.e.:... | 08/25/2009 |
| 7558817 | Apparatus and method for calculating a result of a modular multiplication Apparatus for calculating a result of a modular multiplication of a first operand and a second operand with regard to a modulus, each having a length of 2 n bits, the operands and the modulus are split into sub-operands of half the length and are fed to controller c... | 07/07/2009 |
| 7543011 | Montgomery modular multiplier and method thereof using carry save addition A method of reducing power consumption and/or enhancing computation speed in the modulus multiplication operation of a Montgomery modulus multiplication module. A coding scheme reduces the need for an adder or memory element for obtaining multiple modulus values, an... | 06/02/2009 |
| 7539718 | Method and apparatus for performing Montgomery multiplications An arrangement is provided for performing Montgomery multiplications. A Montgomery multiplication comprises a plurality of iterations of basic operations (e.g., carry-save additions), and is performed by a Montgomery multiplication engine (MME). Basic operations in ... | 05/26/2009 |
| 7536429 | Multiplier with look up tables A method of performing modular multiplication of integers X and Y to produce a result R, where R=X.Y mod N, in a multiplication engine. X is fragmented into a first plurality of words xn each having a first predetermined number of bits, k and Y is fragmented into a ... | 05/19/2009 |
| 7523151 | Method and apparatus for performing computations using residue arithmetic The subject invention pertains to a method and apparatus for performing computations using residue arithmetic. The subject method and apparatus can utilize logic gates for performing calculations such as multiplication by a constant, computing a number theoretic log... | 04/21/2009 |
| 7519643 | Montgomery multiplier for RSA security module A Montgomery multiplier for providing security of information used in smart cards from hacking by a differential power analysis attack by minimizing power consumption difference by the input data. More particularly, the Montgomery multiplier applies an asynchronous ... | 04/14/2009 |
| 7506015 | Generation of a remainder from division of a first polynomial by a second polynomial Generation a remainder from a division of a first polynomial by a second polynomial having a variable width. One or more embodiments include a first sub-circuit, a first adder, a second sub-circuit, and a second adder. The first sub-circuit is adapted to generate a ... | 03/17/2009 |
| 7493356 | Device and method for cryptoprocessor A device for converting a term comprising a product of a first operand and a second operand into a representation having an integer quotient regarding a modulus and a remainder, the integer quotient being defined by T/N, T being the term and N being the modulus, and... | 02/17/2009 |
| 7472154 | Multiplication remainder calculator In a circuit which adds a partial product {Σ(Aj*B)*2^j (j=0, . . . , m−1)} to a provisional remainder u by using a value of inferior m bits (m is an integer not less than 2) of a number to be multiplied A and a multiplier factor B, there is provided a multiplicat... | 12/30/2008 |
| 7461115 | Modular multiplier Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular... | 12/02/2008 |
| 7440990 | Methods of factoring and modular arithmetic A method of factoring numbers in a non-binary computation scheme and more particularly, a method of factoring numbers utilizing a digital multistate phase change material. The method includes providing energy in an amount characteristic of the number to be factored ... | 10/21/2008 |
| 7373463 | Antifraud method and circuit for an integrated circuit register containing data obtained from secret quantities An integrated circuit and an antifraud method implementing at least one operation involving at least one secret quantity, and functionally including upstream and downstream of the operator at least one source register and at least one destination register, respectiv... | 05/13/2008 |
| 7366299 | Method for encrypting and decrypting data using derivative equations and factors A data cryptographer encrypts and decrypts character data of any given length using derivative equations and factors. The use of factors and derivative equations introduces the randomness required for effective encryption without the use of complex mathematics. A se... | 04/29/2008 |
| 7363335 | Modular arithmetic apparatus and method selecting a base in the residue number system A modular arithmetic apparatus has a plurality of base parameter sets in read only memories. A base selection unit in the modular arithmetic apparatus selects one of the base parameters sets according to an input modulus p. A plurality of operation units 30, ... | 04/22/2008 |
| 7353364 | Apparatus and method for sharing a functional unit execution resource among a plurality of functional units An apparatus and method for sharing a functional unit. In one embodiment, a processor may include instruction fetch logic configured to issue instructions, and a first functional unit configured to execute instructions issued from the instruction fetch logic and to ... | 04/01/2008 |
| 7343389 | Apparatus and method for SIMD modular multiplication An apparatus and method for single instruction multiple data (SIMD) modular multiplication are described. In one embodiment, the method includes selection of modular multiplication method available from an operating environment. Once the multiplication method is sel... | 03/11/2008 |
| 7337203 | Exponent calculation apparatus and method, and program An exponent calculation apparatus calculates xe based on input two integers x and e. A pre-calculation module pre-calculates x^{l_i} for each of candidate exponents {l_i} (0≦i≦L−1) stored in a candidate exponents storing unit, the number of the cand... | 02/26/2008 |
| 7321916 | Methods and apparatus for extracting integer remainders Methods and apparatus for determining a remainder value are disclosed. The methods and apparatus extract a residuary subset bitfield value from a binary value that is calculated using a scaled approximate reciprocal value that is associated with a compound exponent ... | 01/22/2008 |
| 7319750 | Digital circuit apparatus and method for accelerating preliminary operations for cryptographic processing A digital circuit apparatus and method for cryptographic data processing includes steps and means for determining a first modulus having up to a first number of binary digits. A large integer is received which has up to a second number of binary digits that is great... | 01/15/2008 |
| 7320015 | Circuit and method for performing multiple modulo mathematic operations A multi-function modulo processor architecture is capable of performing multiple modulo mathematic operations. The modulo processor includes a pipeline processing portion that iteratively computes a running partial modulo product using the operands of a modulo mathe... | 01/15/2008 |