首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
A NEW ALGORITHM FOR MULTIPLICATION IN FINITE-FIELDS
被引:14
|
作者
:
PINCIN, A
论文数:
0
引用数:
0
h-index:
0
PINCIN, A
机构
:
来源
:
IEEE TRANSACTIONS ON COMPUTERS
|
1989年
/ 38卷
/ 07期
关键词
:
D O I
:
10.1109/12.30855
中图分类号
:
TP3 [计算技术、计算机技术];
学科分类号
:
0812 ;
摘要
:
引用
收藏
页码:1045 / 1049
页数:5
相关论文
共 50 条
[1]
ON THE COMPLEXITY OF MULTIPLICATION IN FINITE-FIELDS
LEMPEL, A
论文数:
0
引用数:
0
h-index:
0
机构:
IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
LEMPEL, A
SEROUSSI, G
论文数:
0
引用数:
0
h-index:
0
机构:
IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
SEROUSSI, G
WINOGRAD, S
论文数:
0
引用数:
0
h-index:
0
机构:
IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
WINOGRAD, S
THEORETICAL COMPUTER SCIENCE,
1983,
22
(03)
: 285
-
296
[2]
MULTIPLICATION OF POLYNOMIALS OVER FINITE-FIELDS
BSHOUTY, NH
论文数:
0
引用数:
0
h-index:
0
BSHOUTY, NH
KAMINSKI, M
论文数:
0
引用数:
0
h-index:
0
KAMINSKI, M
SIAM JOURNAL ON COMPUTING,
1990,
19
(03)
: 452
-
456
[3]
BIT SERIAL MULTIPLICATION IN FINITE-FIELDS
WANG, MH
论文数:
0
引用数:
0
h-index:
0
WANG, MH
BLAKE, IF
论文数:
0
引用数:
0
h-index:
0
BLAKE, IF
SIAM JOURNAL ON DISCRETE MATHEMATICS,
1990,
3
(01)
: 140
-
148
[4]
CURVES WITH MANY POINTS AND MULTIPLICATION IN FINITE-FIELDS
SHPARLINSKI, IE
论文数:
0
引用数:
0
h-index:
0
机构:
MOSCOW INFORMAT TRANSMISS INST, MOSCOW, RUSSIA
MOSCOW INFORMAT TRANSMISS INST, MOSCOW, RUSSIA
SHPARLINSKI, IE
TSFASMAN, MA
论文数:
0
引用数:
0
h-index:
0
机构:
MOSCOW INFORMAT TRANSMISS INST, MOSCOW, RUSSIA
MOSCOW INFORMAT TRANSMISS INST, MOSCOW, RUSSIA
TSFASMAN, MA
VLADUT, SG
论文数:
0
引用数:
0
h-index:
0
机构:
MOSCOW INFORMAT TRANSMISS INST, MOSCOW, RUSSIA
MOSCOW INFORMAT TRANSMISS INST, MOSCOW, RUSSIA
VLADUT, SG
LECTURE NOTES IN MATHEMATICS,
1992,
1518
: 145
-
169
[5]
ON A NEW FACTORIZATION ALGORITHM FOR POLYNOMIALS OVER FINITE-FIELDS
NIEDERREITER, H
论文数:
0
引用数:
0
h-index:
0
NIEDERREITER, H
GOTTFERT, R
论文数:
0
引用数:
0
h-index:
0
GOTTFERT, R
MATHEMATICS OF COMPUTATION,
1995,
64
(209)
: 347
-
353
[6]
A NEW ALGORITHM FOR FACTORING POLYNOMIALS OVER FINITE-FIELDS
CANTOR, DG
论文数:
0
引用数:
0
h-index:
0
机构:
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
CANTOR, DG
ZASSENHAUS, H
论文数:
0
引用数:
0
h-index:
0
机构:
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
ZASSENHAUS, H
MATHEMATICS OF COMPUTATION,
1981,
36
(154)
: 587
-
592
[7]
MULTIPLICATIVE COMPLEXITY OF POLYNOMIAL MULTIPLICATION OVER FINITE-FIELDS
KAMINSKI, M
论文数:
0
引用数:
0
h-index:
0
KAMINSKI, M
BSHOUTY, NH
论文数:
0
引用数:
0
h-index:
0
BSHOUTY, NH
JOURNAL OF THE ACM,
1989,
36
(01)
: 150
-
170
[8]
A NEW EFFICIENT FACTORIZATION ALGORITHM FOR POLYNOMIALS OVER SMALL FINITE-FIELDS
NIEDERREITER, H
论文数:
0
引用数:
0
h-index:
0
机构:
AUSTRIAN ACAD SCI,INST INFORMAT PROC,A-1010 VIENNA,AUSTRIA
AUSTRIAN ACAD SCI,INST INFORMAT PROC,A-1010 VIENNA,AUSTRIA
NIEDERREITER, H
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING,
1993,
4
(02)
: 81
-
87
[9]
EFFICIENT MULTIPLICATION ALGORITHM OVER THE FINITE-FIELDS GF(Q(M)) WHERE Q = 3, 5
TRUONG, TK
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV SO CALIF,DEPT ELECT ENGN,LOS ANGELES,CA 90089
UNIV SO CALIF,DEPT ELECT ENGN,LOS ANGELES,CA 90089
TRUONG, TK
REED, IS
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV SO CALIF,DEPT ELECT ENGN,LOS ANGELES,CA 90089
UNIV SO CALIF,DEPT ELECT ENGN,LOS ANGELES,CA 90089
REED, IS
SHIH, MT
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV SO CALIF,DEPT ELECT ENGN,LOS ANGELES,CA 90089
UNIV SO CALIF,DEPT ELECT ENGN,LOS ANGELES,CA 90089
SHIH, MT
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES,
1993,
140
(02):
: 92
-
94
[10]
ON ITERATIVE ARRAYS FOR THE EUCLIDEAN ALGORITHM OVER FINITE-FIELDS
MANDELBAUM, DM
论文数:
0
引用数:
0
h-index:
0
MANDELBAUM, DM
IEEE TRANSACTIONS ON COMPUTERS,
1989,
38
(10)
: 1473
-
1478
←
1
2
3
4
5
→