Modular reduction for a cryptographic process and corprocessor for carrying out said reduction
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Jul 12, 2007
app pub date -
Aug 23, 2004
filing date -
Sep 4, 2003
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
The invention relates to a cryptographic method wherein, in order to carry out a fully polynomial division of type Q(x)[U(x)/N(x)], wherein Q(x), N(x) and U(x) are polynomials, respectively a result, dividend and a divider, multiplication of the two polynomials is carried out followed by displacement of the bits of the result of the multiplication. The operation is performed on the body of polynomials F.sub.p[x]. The invention enables more complex operations to be carried out, including modular operations. The invention is an alternative to the Montgomery method and does not need any correction. It is useful, in particular, for cryptographic methods wherein polynomial operations are carried out on the body F.sub.2[x]. The invention also relates to an appropriate coprocessor for carrying out the method.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully