Patent
Hardware implementation for modular multiplication using a plurality of almost entirely identical processor elements
Chin-Long Chen,Vincenzo Condorelli,Camil Fayad +2 more
- 19 Dec 2000
26
TL;DR: In this article, the modular exponentiation function used in public key encryption and decryption systems is implemented in a standalone engine having at its core modular multiplication circuits which operate in two phases which share overlapping hardware structures.
read more
Abstract: The modular exponentiation function used in public key encryption and decryption systems is implemented in a standalone engine having at its core modular multiplication circuits which operate in two phases which share overlapping hardware structures. The partitioning of large arrays in the hardware structure, for multiplication and addition, into smaller structures results in a multiplier design comprising a series of nearly identical processing elements linked together in a chained fashion. As a result of the two-phase operation and the chaining together of partitioned processing elements, the overall structure is operable in a pipelined fashion to improve throughput and speed. The chained processing elements are constructed so as to provide a partitionable chain with separate parts for processing factors of the modulus. In this mode, the system is particularly useful for exploiting characteristics of the Chinese Remainder Theorem to perform rapid exponentiation operations. A checksum mechanism is also provided to insure accurate operation without impacting speed and without significantly increasing complexity. While the present disclosure is directed to a complex system which includes a number of features, the present application is particularly directed to the structure and linking of a plurality of almost identical processing elements.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Accelerated montgomery multiplication using plural multipliers
David M. Blaker
- 07 May 2001
TL;DR: Montgomery multipliers as mentioned in this paper modular multiply a residue multiplicand by a residue multiplier to obtain a residue product, using a scalar multiplier, a first vector multiplier and a second vector multiplier.
43
Patent
Component reduction in montgomery multiplier processing element
Michael Ruehle
- 13 Sep 2002
TL;DR: In this article, a Montgomery multiplier circuit with a chain of processing elements uses less circuit logic in each processing element by propagating an initial parameter through registers used for other purposes, such as address registers, and then looping back through the accumulation registers in the reverse direction.
33
Patent
Method and apparatus for implementing processor instructions for accelerating public-key cryptography
Sheueling Chang Shantz,Hans Eberle,Nils Gura,Lawrence Spracklen,Leonard D. Rarick +4 more
- 24 Jul 2003
TL;DR: In this article, the high order portion of the generated result is saved in an extended carry register as a next partial result for use with execution of a subsequent single arithmetic instruction, and a partial result from a previously executed single instruction is added implicitly to generate a result that represents the first number multiplied by the second number summed with the partial result.
23
Patent
Accelerated montgomery exponentiation using plural multipliers
David M. Blaker
- 07 May 2001
TL;DR: In this article, two multipliers that are serially coupled as described above are used to accelerate the Montgomery exponentiators, which can be used to increase the power of a generator to a power of an exponent.
21
Patent
Modular exponentiation calculation apparatus and modular exponentiation calculation method
Atsushi Shimbo,Hanae Ikeda +1 more
- 22 Jan 2002
TL;DR: In this paper, a modular exponentiation calculation apparatus obtains a first RNS representation of a value Cpdp×B mod p and a remainder value dp=d mod (p−1) based on the remainder value cp=C mod p.
19
References
A systolic, linear-array multiplier for a class of right-shift algorithms
TL;DR: It is shown how the multiplier, with some simple back-end connections, can compute modular inverses and perform modular division for a power of two as modulus.
100
Patent
A compact microelectronic device for performing modular multiplication and exponentiation over large numbers
Carmi David Gressel,David Hendel,Itai Dror,Isaac Hadad,Benjamin Azari +4 more
- 26 Nov 1993
TL;DR: In this paper, a synchronous microelectronic peripheral machine for standard microprocessors with means for proper clocking and control, has as essential elements: three main subdivided, switched and clocked shift registers, B, S, and N; two only multiplexed serial/parallel multipliers; borrow detectors, ancillary subtractors and adders; delay registers and switching elements.
100
Patent
Method of and apparatus for encryption and decryption of communication data
Keiichi C,O Canon Kabushiki Kaisha Iwamura,Takahisa C,O Canon Kabushiki Kaisha Yamamoto +3 more
- 04 Sep 1992
TL;DR: In this article, a method and apparatus which enables a circuit of a small circuit scale to perform high-speed modular multiplication or modular exponentiation which are necessary in encryption or decryption in cryptic communication is presented.
63
Patent
Method for the implementation of modular multiplication according to the Montgomery method
Guy Monier
- 07 Nov 1995
TL;DR: In this article, a method for the implementation of modular multiplication according to the Montgomery method was proposed, where a multiplicand A and a multiplier B are encoded respectively on a and b words of k bits, the most significant words of A and B being non-zero, with 0
56
Patent
Multiplier cell and method of computing
Philipp Michael Glaser,Michael J. Torla +1 more
- 25 Mar 2002
TL;DR: In this paper, the Rivest-Shamir-Adleman (RSA) and ECC algorithms for public-key cryptography were implemented in an integrated cryptographic system, where an arithmetic processor (22) receives data values stored in a temporary storage memory (14) and computes both the RSA and elliptic curve cryptography (ECC) algorithms.
34
Related Papers (5)
Chin-Long Chen,Vincenzo Condorelli,Camil Fayad +2 more
- 19 Dec 2000
Morten Stribaek,Pascal Paillier +1 more
- 21 Feb 2001