Cryptography – Particular algorithmic function encoding
Patent
1992-03-04
1994-05-17
Cangialosi, Salvatore
Cryptography
Particular algorithmic function encoding
380 30, 364746, H04L 930, G06F 752
Patent
active
053135300
ABSTRACT:
A modular multiplication of integers of large digits can be calculated at high speed although the size of the circuit can be reduced. Furthermore, encryption/decryption for a communication by using cryptograph is performed by using it.
In order to achieve this, when the modular multiplication is executed by alternately repeating a partial sum of product calculation and the residue calculation, a portion of the result of the previous calculation larger than the maximum digit of a number which is the modulo of this residue calculation is subjected to the residue calculation in the intermediate stage. Furthermore, the residue is directly obtained from the result of the previous calculation and the partial sum of product calculation is performed in such a manner that an obtained residue is added in place of a portion of the result of the previous calculation larger than the maximum digit of the modulo of this residue calculation. Furthermore, the additions are performed by a plurality of adders in parallel and a carry generated in each adder is added at the next addition performed by each upper adder. This circuit is formed into a systolic array composed by the same processing elements to realize the aforesaid calculation by a pipeline process.
REFERENCES:
patent: 4538238 (1975-08-01), Circello et al.
patent: 4555769 (1985-11-01), Carter et al.
patent: 4709345 (1987-11-01), Vu
patent: 4747103 (1988-05-01), Iwamura et al.
patent: 4949293 (1990-08-01), Kawamura et al.
patent: 4996527 (1991-02-01), Houk et al.
patent: 5101431 (1992-03-01), Even
"A Programmable VLSI Architecture for Computing Multiplication and Polynomical Evaluation Modulo a Positive Integer", IEEE Journal of Solid State Circuits, vol. 23, No. 1, Feb. 1988, New York, US, pp. 204-207.
"A Fast Modular-multiplication Algorithm Based on a Radix 4 and Its Application", Transaction of the Institute of Electronics and Communication Engineeers of Japan, Section E. vol. E73, No. 7, Jul. 1990, Tokyo, Japan, pp. 1081-1086.
"VLSI Design for Exponentiation in GF(2**n)", AUSCRYPT '90, Int. Conf. on Cryptology, Jan. 1990, Sidney, Australia, p. 398.
"An Algorith for Modular Exponentiation", Proceedings 5th Symp. on Comp. Arithmetic, May 18-19, Michigan, USA, pp. 135-136.
IEEE Trans on Computers, vol. C-34, No. 7 C7/85) Vu "Efficient Implimentation of the Chinese Remainder Theorem for Sign Detection and Residue Decoding".
Cangialosi Salvatore
Canon Kabushiki Kaisha
LandOfFree
Calculating apparatus and method of encrypting/decrypting commun does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Calculating apparatus and method of encrypting/decrypting commun, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Calculating apparatus and method of encrypting/decrypting commun will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-883554