標(biāo)題: Titlebook: Arithmetic of Finite Fields; Second International Joachim Gathen,José Luis Ima?a,?etin Kaya Ko? Conference proceedings 2008 Springer-Verlag [打印本頁] 作者: 審美家 時(shí)間: 2025-3-21 19:45
書目名稱Arithmetic of Finite Fields影響因子(影響力)
書目名稱Arithmetic of Finite Fields影響因子(影響力)學(xué)科排名
書目名稱Arithmetic of Finite Fields網(wǎng)絡(luò)公開度
書目名稱Arithmetic of Finite Fields網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Arithmetic of Finite Fields被引頻次
書目名稱Arithmetic of Finite Fields被引頻次學(xué)科排名
書目名稱Arithmetic of Finite Fields年度引用
書目名稱Arithmetic of Finite Fields年度引用學(xué)科排名
書目名稱Arithmetic of Finite Fields讀者反饋
書目名稱Arithmetic of Finite Fields讀者反饋學(xué)科排名
作者: hardheaded 時(shí)間: 2025-3-22 00:04 作者: disparage 時(shí)間: 2025-3-22 04:23
Optimal Extension Field Inversion in the Frequency Domains the first time a frequency domain finite field inversion algorithm is proposed for elliptic curve cryptography. We believe the proposed algorithm would be well suited especially for efficient low-power hardware implementation of elliptic curve cryptography using affine coordinates in constrained s作者: Blemish 時(shí)間: 2025-3-22 06:28
Efficient Finite Fields in the Maxima Computer Algebra Systemwe focused our efforts on efficient computation of primitive elements and modular roots. Our optimizations involve some heuristic methods that use “modular composition” and the generalized Tonelli-Shanks algorithm. Other open and free systems such as GP/Pari do not include in their standard packages作者: resilience 時(shí)間: 2025-3-22 11:14 作者: countenance 時(shí)間: 2025-3-22 15:12
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fieldsch is known as the shifted polynomial basis, has been introduced. Current research shows that this new basis provides better performance in designing bit-parallel and subquadratic space complexity multipliers over binary extension fields. In this paper, we study digit-serial multiplication algorithm作者: tenuous 時(shí)間: 2025-3-22 17:51
Some Theorems on Planar Mappingso planar functions are CCZ-equivalent exactly when they are EA-equivalent. We give a sharp lower bound on the size of the image set of a planar function. Further we observe that all currently known main examples of planar functions have image sets of that minimal size.作者: insecticide 時(shí)間: 2025-3-22 23:52 作者: Malcontent 時(shí)間: 2025-3-23 03:12
EA and CCZ Equivalence of Functions over ,(2,)functions. We show that they can be related to subsets .[.] and .[.] of equivalence classes [.] of transversals, respectively, thus clarifying their relationship and providing a new approach to their study. We derive a formula which characterises when two CCZ-equivalent functions are EA-inequivalent作者: Melanocytes 時(shí)間: 2025-3-23 07:44
On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomialsted in [4]. On the other hand, an explicit formula for the number of one-weight cyclic codes, when the length and dimension are given, was proved in [3]. By imposing some conditions on the finite field, we now combine both results in order to give a lower bound for the number of two-weight cyclic co作者: Landlocked 時(shí)間: 2025-3-23 12:58 作者: euphoria 時(shí)間: 2025-3-23 17:36
Montgomery Ladder for All Genus 2 Curves in Characteristic 2this method was known for elliptic curves and for genus 2 curves in odd characteristic. We obtain an algorithm that is competitive compared to usual methods of scalar multiplication and that has additional properties such as resistance to simple side-channel attacks. Moreover it provides a significa作者: Inertia 時(shí)間: 2025-3-23 21:03
On Cryptographically Significant Mappings over GF(2,) that takes . binary inputs whose image is a binary .-tuple; therefore it is represented as .. One of the most important cryptographic applications is the case .?=?., thus the S-box may be viewed as a function over .. We show that certain classes of functions over . do not possess a cryptographic pr作者: Jacket 時(shí)間: 2025-3-24 00:49
Conference proceedings 2008ections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and construction of mappings over finite fields, and codes and cryptography.作者: 一窩小鳥 時(shí)間: 2025-3-24 04:11
0302-9743 topical sections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and construction of mappings over finite fields, and codes and cryptography.978-3-540-69498-4978-3-540-69499-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 止痛藥 時(shí)間: 2025-3-24 07:26
Basics of Expert System Technology, any support for finite fields. The computation of the primitive element in Maxima is now faster than in Axiom. Our package provides a more user-friendly interface for teaching than other comparable systems.作者: 起皺紋 時(shí)間: 2025-3-24 12:24
K. P. Valavanis,S. G. Tzafestasnt speed-up of scalar multiplication in many cases. This new algorithm has very important applications in cryptography using hyperelliptic curves and more particularly for people interested in cryptography on embedded systems (such as smart cards).作者: remission 時(shí)間: 2025-3-24 15:12
Efficient Finite Fields in the Maxima Computer Algebra System any support for finite fields. The computation of the primitive element in Maxima is now faster than in Axiom. Our package provides a more user-friendly interface for teaching than other comparable systems.作者: 名詞 時(shí)間: 2025-3-24 20:59 作者: vasospasm 時(shí)間: 2025-3-25 02:07
0302-9743 Siena, Italy, in July 2008. The 16 revised full papers presented were carefully reviewed and selected from 34 submissions. The papers are organized in topical sections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and co作者: 不適當(dāng) 時(shí)間: 2025-3-25 05:31
Proposing Expert System Projects,uld be well suited especially for efficient low-power hardware implementation of elliptic curve cryptography using affine coordinates in constrained small devices such as smart cards and wireless sensor network nodes.作者: 同步信息 時(shí)間: 2025-3-25 09:37 作者: 拒絕 時(shí)間: 2025-3-25 13:35 作者: 貪婪地吃 時(shí)間: 2025-3-25 19:50
Optimal Extension Field Inversion in the Frequency Domainuld be well suited especially for efficient low-power hardware implementation of elliptic curve cryptography using affine coordinates in constrained small devices such as smart cards and wireless sensor network nodes.作者: 沒花的是打擾 時(shí)間: 2025-3-25 23:03 作者: 按時(shí)間順序 時(shí)間: 2025-3-26 00:36
On Field Size and Success Probability in Network Codingding. These estimates take into account which monomials occur in the support of the determinant of the product of Edmonds matrices. Therefore we finally investigate which monomials can occur in the determinant of the Edmonds matrix.作者: isotope 時(shí)間: 2025-3-26 06:26 作者: corporate 時(shí)間: 2025-3-26 12:12 作者: 夾克怕包裹 時(shí)間: 2025-3-26 15:55
John M. McCann,John P. Gallaghers on balanced transitive q-ary functions are given. Implementation solutions are suggested based on q-ary multiple-valued decision diagrams and examples show simple implementations for these kind of symmetric functions. Applications include ciphers design and hash functions design but also search for improved covering radius of codes.作者: 阻撓 時(shí)間: 2025-3-26 18:01
Interpolation of the Double Discrete Logarithmdiscrete logarithm, the Diffie-Hellmann mapping and related functions as well as functions related to the integer factoring problem have already been known to the literature. The investigations on the double discrete logarithm in this paper are motivated by these results on other cryptographic functions.作者: SPALL 時(shí)間: 2025-3-26 22:43 作者: FIN 時(shí)間: 2025-3-27 01:20
Dimitris N. Chorafas,Heinrich Steinmannto DDT and LAT distributions. Moreover, a formula is given for the calculation of the number of terms in the algebraic expression for a power mapping based S-box according to the given three probable cases.作者: 甜得發(fā)膩 時(shí)間: 2025-3-27 07:05 作者: Water-Brash 時(shí)間: 2025-3-27 11:09 作者: 可忽略 時(shí)間: 2025-3-27 15:05 作者: 是剝皮 時(shí)間: 2025-3-27 18:45 作者: indoctrinate 時(shí)間: 2025-3-28 00:43 作者: 拱墻 時(shí)間: 2025-3-28 02:43 作者: Aprope 時(shí)間: 2025-3-28 06:57 作者: 協(xié)奏曲 時(shí)間: 2025-3-28 11:33 作者: freight 時(shí)間: 2025-3-28 15:13
Basics of Expert System Technology,we focused our efforts on efficient computation of primitive elements and modular roots. Our optimizations involve some heuristic methods that use “modular composition” and the generalized Tonelli-Shanks algorithm. Other open and free systems such as GP/Pari do not include in their standard packages作者: epidermis 時(shí)間: 2025-3-28 19:34
Recording, Evaluating and Testing Controlsted efficiently without using a pre-computational phase. We extend the set of moduli that is recommended by Standards for Efficient Cryptography (SEC) by defining two distinct sets for which either Barrett or Montgomery reduction is applicable. As the proposed algorithm is very suitable for a fast m作者: 有偏見 時(shí)間: 2025-3-29 00:57
Recording, Evaluating and Testing Controlsch is known as the shifted polynomial basis, has been introduced. Current research shows that this new basis provides better performance in designing bit-parallel and subquadratic space complexity multipliers over binary extension fields. In this paper, we study digit-serial multiplication algorithm作者: 共棲 時(shí)間: 2025-3-29 05:28 作者: 學(xué)術(shù)討論會 時(shí)間: 2025-3-29 11:03
Dimitris N. Chorafas,Heinrich Steinmanneration, finite field inversion, power mappings and heuristic techniques. From these techniques, the use of finite field inversion in the construction of an S-box is so popular because it presents good cryptographic properties. On the other hand, while S-boxes such as AES, Shark, Square and Hierocry作者: 精確 時(shí)間: 2025-3-29 15:20 作者: 外面 時(shí)間: 2025-3-29 19:24 作者: 亞麻制品 時(shí)間: 2025-3-29 19:51
Rin-ichiro Taniguchi,Eiji Kawaguchiest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network coding. These estimates take into account which monomials occur in the support of the determinant of the product of Edmonds matrices. Therefore we final作者: Inoperable 時(shí)間: 2025-3-30 02:28 作者: falsehood 時(shí)間: 2025-3-30 07:12
Expert Systems in Engineering Applications that takes . binary inputs whose image is a binary .-tuple; therefore it is represented as .. One of the most important cryptographic applications is the case .?=?., thus the S-box may be viewed as a function over .. We show that certain classes of functions over . do not possess a cryptographic pr作者: Spinous-Process 時(shí)間: 2025-3-30 09:34
https://doi.org/10.1007/978-3-540-69499-1Algebra; LA; algebraic computation; algebraic number theory; algorithmic number theory; binary polynomial作者: Genteel 時(shí)間: 2025-3-30 15:41
978-3-540-69498-4Springer-Verlag Berlin Heidelberg 2008作者: 改革運(yùn)動 時(shí)間: 2025-3-30 18:49
John M. McCann,John P. GallagherIn this paper, we introduce Dedekind sums associated to lattices defined over finite fields. We establish the reciprocity law for them.作者: ASSET 時(shí)間: 2025-3-30 22:04
John M. McCann,John P. GallagherElliptic curves find numerous applications. This paper describes a simple strategy to speed up their arithmetic in right-to-left methods. In certain settings, this leads to a non-negligible performance increase compared to the left-to-right counterparts.作者: Dislocation 時(shí)間: 2025-3-31 01:15 作者: cocoon 時(shí)間: 2025-3-31 06:14
Finite Dedekind SumsIn this paper, we introduce Dedekind sums associated to lattices defined over finite fields. We establish the reciprocity law for them.
