標(biāo)題: Titlebook: Applications of Finite Fields; Ian F. Blake,XuHong Gao,Tomik Yaghoobian,Alfred J. Book 1993 Springer-Verlag US 1993 algorithms.coding theo [打印本頁] 作者: Ensign 時間: 2025-3-21 19:42
書目名稱Applications of Finite Fields影響因子(影響力)
書目名稱Applications of Finite Fields影響因子(影響力)學(xué)科排名
書目名稱Applications of Finite Fields網(wǎng)絡(luò)公開度
書目名稱Applications of Finite Fields網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Applications of Finite Fields被引頻次
書目名稱Applications of Finite Fields被引頻次學(xué)科排名
書目名稱Applications of Finite Fields年度引用
書目名稱Applications of Finite Fields年度引用學(xué)科排名
書目名稱Applications of Finite Fields讀者反饋
書目名稱Applications of Finite Fields讀者反饋學(xué)科排名
作者: AMOR 時間: 2025-3-21 22:30
Construction of Irreducible Polynomials,metic in extension fields and are found in many applications, including coding theory [5], cryptography [13], computer algebra systems [11], multivariate polynomial factorization [21], and parallel polynomial arithmetic [18].作者: 閃光東本 時間: 2025-3-22 00:43 作者: Countermand 時間: 2025-3-22 05:40 作者: coltish 時間: 2025-3-22 11:59 作者: ABASH 時間: 2025-3-22 16:27
Reference work 2013Latest editionInterest in normal bases over finite fields stems from both purely mathematical curiosity and practical applications. The practical aspects of normal bases will be treated in Chapter 5. In the present chapter, we discuss the theoretical aspects of normal bases over finite fields.作者: 類似思想 時間: 2025-3-22 19:27 作者: Muscularis 時間: 2025-3-22 22:38
Normal Bases,Interest in normal bases over finite fields stems from both purely mathematical curiosity and practical applications. The practical aspects of normal bases will be treated in Chapter 5. In the present chapter, we discuss the theoretical aspects of normal bases over finite fields.作者: 聯(lián)合 時間: 2025-3-23 02:48 作者: Ige326 時間: 2025-3-23 07:49
Affiliated Values Bidding Modeln 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作者: 官僚統(tǒng)治 時間: 2025-3-23 10:28
Reference work 2013Latest edition . 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-23 16:04
Affiliated Values Bidding Modelmetic in extension fields and are found in many applications, including coding theory [5], cryptography [13], computer algebra systems [11], multivariate polynomial factorization [21], and parallel polynomial arithmetic [18].作者: Heart-Rate 時間: 2025-3-23 18:52 作者: Insulin 時間: 2025-3-24 00:34 作者: allergy 時間: 2025-3-24 04:29
Affiliated Values Bidding Modellogarithms 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 [10] and V. Miller [17]. Since the addition in this group is relatively simple, and moreover the dis作者: Cumulus 時間: 2025-3-24 09:21 作者: anagen 時間: 2025-3-24 13:23 作者: dagger 時間: 2025-3-24 16:24
The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/a/image/159429.jpg作者: 偏狂癥 時間: 2025-3-24 21:00 作者: carbohydrate 時間: 2025-3-25 00:29
Reference work 2013Latest edition . 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.作者: Seizure 時間: 2025-3-25 03:33 作者: 失眠癥 時間: 2025-3-25 09:35
Adjacent (Neighboring) Extreme Pointsfor factoring integers [8, 9], for primality proving [2, 11, 12] and for the construction of pseudorAndom bit generators [4]. In Chapter 8 we study how elliptic curves can be used in constructing efficient and secure cryptosystems, while in Chapter 10 we will discuss how good error-correcting codes may be obtained by using elliptic curves.作者: Leaven 時間: 2025-3-25 15:36 作者: Spina-Bifida 時間: 2025-3-25 17:52
Optimal Normal Bases,xample, see [12]). The complexity of the hardware design of such multiplication schemes is heavily dependent on the choice of the normal bases used. Hence it is essential to find normal bases of low complexity.作者: 不能仁慈 時間: 2025-3-25 22:04 作者: Geyser 時間: 2025-3-26 01:50
https://doi.org/10.1007/978-1-4419-1153-7le the reader to understAnd the algebraic geometric codes. The majority of this chapter is based on the treatment of Fulton [2]. For a more complete treatment of algebraic geometry the reader should consult that reference, or the recent book by Moreno [4]. Some other stAndard textbooks in algebraic geometry are [1, 3, 7, 9].作者: 山間窄路 時間: 2025-3-26 05:37
Introduction to Algebraic Geometry,le the reader to understAnd the algebraic geometric codes. The majority of this chapter is based on the treatment of Fulton [2]. For a more complete treatment of algebraic geometry the reader should consult that reference, or the recent book by Moreno [4]. Some other stAndard textbooks in algebraic geometry are [1, 3, 7, 9].作者: ovation 時間: 2025-3-26 08:58 作者: 要控制 時間: 2025-3-26 15:56
Elliptic Curve Cryptosystems,crete 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.作者: Firefly 時間: 2025-3-26 17:20 作者: CRAFT 時間: 2025-3-26 23:09 作者: 展覽 時間: 2025-3-27 04:28
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 作者: Deference 時間: 2025-3-27 10:59
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
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
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 作者: Immunoglobulin 時間: 2025-3-28 02:59
Optimal Normal Bases,in either hardware or software, is required. Work in this area has resulted in several hardware and software designs or implementations [7, 8, 22, 23, 24, 27], 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 作者: exclamation 時間: 2025-3-28 12:50
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 [10] and V. Miller [17]. Since the addition in this group is relatively simple, and moreover the dis作者: Androgen 時間: 2025-3-28 17:36 作者: 易受騙 時間: 2025-3-28 22:47
Codes From Algebraic Geometry,. [17] who showed that the longstAnding Gilbert-Varshamov lower bound can be exceeded for alphabet sizes larger than 49. The Gilbert-Varshamov bound, established in 1952, is a lower bound on the information rate of good codes. This lower bound was not improved until 1982 with the discovery of good a作者: obsolete 時間: 2025-3-29 01:51 作者: 節(jié)約 時間: 2025-3-29 03:09 作者: nutrients 時間: 2025-3-29 07:50
