Direct Division in Factor Rings

Patrick Fitzpatrick; Christopher Wolf

Paper 2004/353

Direct Division in Factor Rings

Patrick Fitzpatrick and Christopher Wolf

Abstract

Conventional techniques for division in the polynomial factor ring $\Ftm$ or the integer ring $\Zzs$ use a combination of inversion and multiplication. We present a new algorithm that computes the division directly and therefore eliminates the multiplication step. The algorithm requires $2 d e g r e e \/ (m)$ (resp. $2 \log_{2} n$ ) steps, each of which uses only shift and multiply-subtract operations.

Metadata

Available format(s): PDF PS
Category: Implementation
Publication info: Published elsewhere. Electronic Letters 38 No. 21 (2002), pp 1253-1254
Keywords: Division Extended Euclid Elliptic Curves Multivariate Quadratic Public Key
Contact author(s): Christopher Wolf @ esat kuleuven ac be
History: 2004-12-18: revised; 2004-12-13: received; See all versions
Short URL: https://ia.cr/2004/353
License: CC BY

BibTeX

@misc{cryptoeprint:2004/353,
      author = {Patrick Fitzpatrick and Christopher Wolf},
      title = {Direct Division in Factor Rings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/353},
      year = {2004},
      url = {https://eprint.iacr.org/2004/353}
}