DocumentCode :
852205
Title :
Direct division in factor rings
Author :
Fitzpatrick, P. ; Wolf, Christian
Author_Institution :
Dept. of Math., Univ. Coll. Cork
Volume :
38
Issue :
21
fYear :
2002
fDate :
10/10/2002 12:00:00 AM
Firstpage :
1253
Lastpage :
1254
Abstract :
Conventional techniques for division in the polynomial factor ring F[z]/(m) or the integer ring Zn use a combination of inversion and multiplication. A new algorithm is presented that computes the division directly and therefore eliminates the multiplication step. The algorithm requires 2 degree(m) (resp. 2 log2 n) steps, each of which uses only shift and multiply-subtract operations.
Keywords :
cryptography; information theory; polynomials; coding theory; cryptography; direct division; fast division algorithms; integer ring; multiply-subtract operations; polynomial factor ring; shift operations;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:20020855
Filename :
1043703
Link To Document :
بازگشت