Method and apparatus for calculating the remainder of a modulo division
Patent 7197526 Issued on March 27, 2007. Estimated Expiration Date: 
May 28, 2019. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
May 28, 2019. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesData processor having carry apparatus supporting a decimal divide operation Method for generating a public key Computer-implemented method and computer for performing modular reduction Dividing method Scheme for carrying out modular calculations based on redundant binary calculation Optical device for processing an optical digital signal Patent #: 6275311 InventorAssigneeApplicationNo. 09321611 filed on 05/28/1999US Classes:708/491, Residue number714/808, Modulo-n residue check character714/784, Reed-Solomon code708/652, Coded decimal380/30, Public key708/650, Division359/107OPTICAL COMPUTING WITHOUT DIFFRACTIONExaminersPrimary: Decady, AlbertAssistant: Lamarre, Guy International ClassG06F 7/38AbstractA non-iterative technique for calculating the remainder of modulo division, which requires significantly fewer operations than the traditional iterative technique for the same calculation. The number of calculations required in the present invention is independent of the number of bits of the divisor in the modulo operation. Two requirements of the non-iterative technique are that the value of the divisor D should be equal to 2n−1 (where n is the number of bits of the divisor D) and the value of the dividend N should be less than or equal to (D−1)2, but greater than or equal to zero. If these two conditions are met, the remainder R of N mod D is determined by summing the upper n 2and lower n 2 bits of the dividend N. Other References
Field of SearchModulo-n residue check characterReed-Solomon code OPTICAL COMPUTING WITHOUT DIFFRACTION METHODS Public key PARTICULAR ALGORITHMIC FUNCTION ENCODING Residue number Evaluation of powers Recursive Multiplication Division Shifting Binary Repeated subtraction Data compression and expansion Coding by table look-up techniques Generating specific digital signature type (e.g., blind, shared, or undeniable) | |
