FIELD: computer engineering, in particular, digital computers for generation of finite fields. SUBSTANCE: third register, converter group 3 for conversion of code of number of ones to code of modulo remainder, AND gates group 4, combinatorial modulo adder 5, AND gates group 9 are introduced to accomplish the goal of invention. In order to calculate modulo m of A, method involves splitting it into two numbers starting from lowermost bits. Bit-length of said numbers is equal to period of repetition of remainders of 2i (i= 0, n). Then periods are superimposed and intermediate modulo remainders of period are added in series. EFFECT: increased speed. 2 dwg , 4 tbl
Title | Year | Author | Number |
---|---|---|---|
DEVICE FOR GENERATING MODULO NUMBER REMAINDER | 2000 |
|
RU2209460C2 |
MODULO-N REMAINDER DRIVER | 1999 |
|
RU2157589C1 |
DEVICE FOR MODULO MULTIPLICATION OF NUMBERS | 1998 |
|
RU2143723C1 |
APPARATUS FOR SUBTRACTING BY MODULUS | 1997 |
|
RU2133495C1 |
DEVICE FOR MODULE ADDITION OF N INTEGERS | 1997 |
|
RU2131618C1 |
MODULO ADDER | 1996 |
|
RU2110087C1 |
DEVICE FOR MODULO MULTIPLICATION OF NUMBERS | 1998 |
|
RU2137181C1 |
DEVICE FOR MODULO ADDITION AND SUBTRACTION OF NUMBERS | 1998 |
|
RU2145112C1 |
DEVICE FOR MODULO ADDITION AND SUBTRACTION OF INTEGERS | 1999 |
|
RU2156998C1 |
DEVICE FOR FORMATION OF REMAINDER BY ARBITRARY MODULUS OF NUMBER | 1990 |
|
RU2029434C1 |
Authors
Dates
1998-04-27—Published
1996-04-10—Filed