標題: Titlebook: Arithmetic of Finite Fields; 5th International Wo ?etin Kaya Ko?,Sihem Mesnager,Erkay Sava? Conference proceedings 2015 Springer Internatio [打印本頁] 作者: Clinical-Trial 時間: 2025-3-21 19:35
書目名稱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é)科排名
作者: parsimony 時間: 2025-3-21 22:08
John K. Tsotsos,Tetsutaro Shibahara linear systems arising when attacking the discrete logarithm problem on groups of size 100 to 1000 bits, which includes the relevant range for current cryptanalytic computations. The proposed SpMV implementation contributed to solving the discrete logarithm problem in GF(.) and GF(.) using the FFS 作者: Meditate 時間: 2025-3-22 02:37
0302-9743 e Field, WAIFI 2014, held in Gebze, Turkey, in September 2014. The 9 revised full papers and 43 invited talks presented were carefully reviewed and selected from 27 submissions. This workshop is a forum of mathematicians, computer scientists, engineers and physicists performing research on finite fi作者: 配置 時間: 2025-3-22 05:56
John K. Tsotsos,Tetsutaro Shibahara method (with exceptions). This threshold appears often reachable: we moreover provide an explicit method for this purpose..We also provide new bounds for the multiplication in small- algebras over .. Building on these ingredients, we:. Although illustrated only over ., the techniques introduced apply to all characteristics.作者: abject 時間: 2025-3-22 12:16
John K. Tsotsos,Tetsutaro Shibahara into account the cost of forward and backward transformations. The algorithm is more suitable for applications in which tens or hundreds of field multiplications are performed before needing to transform the results back.作者: GOAT 時間: 2025-3-22 14:09 作者: 泥瓦匠 時間: 2025-3-22 18:26 作者: patella 時間: 2025-3-22 21:58 作者: cataract 時間: 2025-3-23 01:42
Open Questions on Nonlinearity and on APN Functionscond part of the paper, we introduce four new open problems (leading to several related sub-problems) and the results which lead to them. Addressing these problems may be less difficult since they have not been much worked on.作者: Matrimony 時間: 2025-3-23 06:14
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over ,bserve that it is more beneficial to study the automorphism group of bijective mappings as a subgroup of the symmetric group of the . dimensional .-vector space due to the existence of non-affine mapping classes.作者: 清澈 時間: 2025-3-23 10:49 作者: NIB 時間: 2025-3-23 14:25
Conference proceedings 2015 the advances in the theory, applications, and implementations of finite fields. The workshop will help to bridge the gap between the mathematical theory of finite fields and their hardware/software implementations and technical applications.作者: 圖畫文字 時間: 2025-3-23 20:59
ASPES: A Skeletal Pascal Expert System,imultaneously in the verification procedures to get better complexity. We also present the explicit number of operations of the verification procedures of these REA-equivalence types. Moreover, we construct two new REA-equivalence types and present the verification procedures of these types with their complexities.作者: Iniquitous 時間: 2025-3-23 23:06 作者: Osteoarthritis 時間: 2025-3-24 06:15
On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functionsimultaneously in the verification procedures to get better complexity. We also present the explicit number of operations of the verification procedures of these REA-equivalence types. Moreover, we construct two new REA-equivalence types and present the verification procedures of these types with their complexities.作者: temperate 時間: 2025-3-24 08:39
On o-Equivalence of Niho Bent Functionsrect. We also deduce two more transformations preserving o-equivalence but providing potentially EA-inequivalent bent functions. We exhibit examples of infinite classes of o-polynomials for which at least three EA-inequivalent Niho bent functions can be derived.作者: notification 時間: 2025-3-24 12:15 作者: 蒸發(fā) 時間: 2025-3-24 16:47
Conference proceedings 2015 in September 2014. The 9 revised full papers and 43 invited talks presented were carefully reviewed and selected from 27 submissions. This workshop is a forum of mathematicians, computer scientists, engineers and physicists performing research on finite field arithmetic, interested in communicating作者: 共同生活 時間: 2025-3-24 21:30 作者: Chandelier 時間: 2025-3-25 01:34
https://doi.org/10.1007/978-1-4612-2270-5n of the implementations of those primitives in the same platform and also give links to the codes we have developed. Although we did not reach the speed given in the paper in some cases, we managed to beat the results of the reference implementations when they are available.作者: 有權(quán) 時間: 2025-3-25 03:57 作者: 清澈 時間: 2025-3-25 08:12 作者: 門窗的側(cè)柱 時間: 2025-3-25 13:40
?etin Kaya Ko?,Sihem Mesnager,Erkay Sava?Includes supplementary material: 作者: BOOM 時間: 2025-3-25 19:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/161619.jpg作者: FECK 時間: 2025-3-25 23:03
https://doi.org/10.1007/978-3-319-16277-5Algebraic Curves; Bent Function; Boolean Function; Code-based Cryptography; Cryptography; Elliptic Curve; 作者: 委屈 時間: 2025-3-26 04:03
978-3-319-16276-8Springer International Publishing Switzerland 2015作者: Juvenile 時間: 2025-3-26 06:31
Computing Discrete Logarithms in , and , Using Magmainite field . with very modest computational resources. Our . implementation was the first to illustrate the effectiveness of Joux’s algorithm for computing discrete logarithms in small-characteristic finite fields that are not Kummer or twisted-Kummer extensions.作者: 一個姐姐 時間: 2025-3-26 11:01 作者: SOBER 時間: 2025-3-26 15:47
Quadratic Residue Codes over , codes of length . over . quadratic residue codes over . are defined by their generating idempotents and their extension codes are discussed. Examples of codes and idempotents for small values of . and . are given. As a by-product almost MDS codes over . and . are constructed.作者: confederacy 時間: 2025-3-26 17:37 作者: 隱語 時間: 2025-3-26 23:02
https://doi.org/10.1007/978-1-4302-0133-5inite field . with very modest computational resources. Our . implementation was the first to illustrate the effectiveness of Joux’s algorithm for computing discrete logarithms in small-characteristic finite fields that are not Kummer or twisted-Kummer extensions.作者: FAZE 時間: 2025-3-27 04:00
Dialog and Explanatory Components,lows us to prove the balance property of difference balanced functions from . to . where . is a prime power. We further prove two necessary and sufficient conditions for .-homogeneous difference balanced functions. This unifies several combinatorial objects related to difference balanced functions.作者: 輕率的你 時間: 2025-3-27 07:20
Extending Graphically Specified Models, codes of length . over . quadratic residue codes over . are defined by their generating idempotents and their extension codes are discussed. Examples of codes and idempotents for small values of . and . are given. As a by-product almost MDS codes over . and . are constructed.作者: modish 時間: 2025-3-27 09:42 作者: 鋸齒狀 時間: 2025-3-27 14:16
John K. Tsotsos,Tetsutaro Shibaharave or the function field sieve, requires solving large sparse systems of linear equations modulo the group order. Most of the fast algorithms used to solve such systems — e.g., the conjugate gradient or the Lanczos and Wiedemann algorithms — iterate a product of the corresponding sparse matrix with 作者: 鉆孔 時間: 2025-3-27 20:07
John K. Tsotsos,Tetsutaro Shibaharaelds. It is grounded on interpolation on algebraic curves: we give a theoretical lower threshold for the smallest bounds that one can expect from this method (with exceptions). This threshold appears often reachable: we moreover provide an explicit method for this purpose..We also provide new bounds作者: 群島 時間: 2025-3-28 00:15 作者: 等級的上升 時間: 2025-3-28 02:36 作者: 殖民地 時間: 2025-3-28 08:34 作者: 色情 時間: 2025-3-28 11:06 作者: Dendritic-Cells 時間: 2025-3-28 17:38
ASPES: A Skeletal Pascal Expert System, challenges in cryptography. In doing this, finding a fast technique for determining whether two given functions are equivalent is a significant problem. A special class of the equivalence called restricted extended affine (REA) equivalence is studied in this paper. We update the verification proced作者: 舊式步槍 時間: 2025-3-28 22:05 作者: IDEAS 時間: 2025-3-29 01:20 作者: 留戀 時間: 2025-3-29 03:30
