Title of Invention

# METHOD OF MODULAR MULTIPLICATION

Abstract 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 (10) into a transformed modulus that is greater than said modulus . The transformation is carried out such that a predetermined fraction of the transformed modulus has a higher-order digit with a first predetermined value that is followed by at least one low-order digit having a second predetermined value . During the iterative working off (12 ) of the modular multiplication using the multiplication look-ahead process and the reduction look-ahead process , the transformed modulus is utilized so as to obtain at the end of the iteration a transformed result for the modular multiplication . Finally, the transformed result is retransformed (14) by modular reduction using the original modulus . By means of the transformation according to the invention, iterative working off of the modular multiplication is simplified so that the modular multiplication can be performed faster .

### Documents:

1008-kolnp-2003-granted-abstract.pdf

1008-kolnp-2003-granted-claims.pdf

1008-kolnp-2003-granted-correspondence.pdf

1008-kolnp-2003-granted-description (complete).pdf

1008-kolnp-2003-granted-drawings.pdf

1008-kolnp-2003-granted-examination report.pdf

1008-kolnp-2003-granted-form 1.pdf

1008-kolnp-2003-granted-form 18.pdf

1008-kolnp-2003-granted-form 2.pdf

1008-kolnp-2003-granted-form 3.pdf

1008-kolnp-2003-granted-form 5.pdf

1008-kolnp-2003-granted-gpa.pdf

1008-kolnp-2003-granted-letter patent.pdf

1008-kolnp-2003-granted-specification.pdf

Patent Number 214075
Indian Patent Application Number 01008/KOLNP/2003
PG Journal Number 05/2008
Publication Date 01-Feb-2008
Grant Date 30-Jan-2008
Date of Filing 06-Aug-2003
Name of Patentee INFINEON TECHNOLOGIES AG,.
Applicant Address ST. MARTIN STRASSE 53, 81669 MUNCHEN GERMANY