CRAFT
发表于 2025-3-26 23:09:50
http://reply.papertrans.cn/16/1595/159429/159429_31.png
展览
发表于 2025-3-27 04:28:55
Book 1993Inrecent years we have witnessed a resurgence of interest in finite fields, and this is partly due to important applications in coding theory and cryptography. The purpose of this book is to introduce the reader to some of these recent developments. It should be of interest to a wide range of studen
泰然自若
发表于 2025-3-27 06:45:43
http://reply.papertrans.cn/16/1595/159429/159429_33.png
Deference
发表于 2025-3-27 10:59:09
Affiliated Values Bidding Modelcrete logarithm problem in . is believed to be intractable, elliptic curve cryptosystems have the potential to provide security equivalent to that of existing public key schemes, but with shorter key lengths. Having short key lengths is a factor that can be crucial in some applications, for example the design of smart card systems.
byline
发表于 2025-3-27 17:12:51
Introduction to Finite Fields and Bases,n is on the existence of certain types of bases, their duals and their enumeration. There has been considerable activity in this area in the past decade and while many of the questions are resolved, a few of the important ones remain open. The presentation here tries to complement that of Lidl and N
thrombosis
发表于 2025-3-27 21:40:50
Factoring Polynomials over Finite Fields, . and . . ≠ 0. To be more precise, . (.) is called a . to distinguish the more general situation where more indeterminates are involved. Most of this chapter will deal with univariate polynomials but the multivariate case will be briefly mentioned at the end.
易碎
发表于 2025-3-27 22:13:30
http://reply.papertrans.cn/16/1595/159429/159429_37.png
Immunoglobulin
发表于 2025-3-28 02:59:26
Optimal Normal Bases,in either hardware or software, is required. Work in this area has resulted in several hardware and software designs or implementations , including single-chip exponentiators for the fields ., and an encryption processor for . public key cryptography. These products are based o
GONG
发表于 2025-3-28 06:39:15
http://reply.papertrans.cn/16/1595/159429/159429_39.png
exclamation
发表于 2025-3-28 12:50:51
Elliptic Curve Cryptosystems,logarithms of elements in G is infeasible. We may take . to be a cyclic subgroup of .(..), the group of ..-rational points of an elliptic curve defined over ..; this was first suggested by N. Koblitz and V. Miller . Since the addition in this group is relatively simple, and moreover the dis