標(biāo)題: Titlebook: Arithmetic of Finite Fields; 8th International Wo Jean Claude Bajard,Alev Topuzo?lu Conference proceedings 2021 Springer Nature Switzerland [打印本頁(yè)] 作者: Magnanimous 時(shí)間: 2025-3-21 18:02
書目名稱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é)科排名
作者: 知識(shí)分子 時(shí)間: 2025-3-21 22:31 作者: 冥界三河 時(shí)間: 2025-3-22 00:30 作者: 惰性氣體 時(shí)間: 2025-3-22 04:36
Statement and PreparedStatement,mputing improved lower bounds for .(.,?.) is the subject of much current research with applications in error correcting codes. Using ., we obtain significantly improved lower bounds on . and ., for ..作者: blister 時(shí)間: 2025-3-22 09:27 作者: 一加就噴出 時(shí)間: 2025-3-22 16:19
Recursion Polynomials of Unfolded Sequencesuires minimal memory usage and permits dynamic updating of sequences or arrays..The aim of our work was to broaden current knowledge of sets of sequences with low correlation studying their implementation using linear feedback shift registers. A remarkable feature of these families is their similari作者: 粘連 時(shí)間: 2025-3-22 18:39
Finding Linearly Generated Subsequencests of computing determinants for each possible Hankel matrices made up from a given finite length sequence. Our new accelerated approach on a single processor is faster than the trivial algorithm on 160 processors for input sequences of length 16384 for instance.作者: Medicaid 時(shí)間: 2025-3-22 23:46 作者: 小卷發(fā) 時(shí)間: 2025-3-23 05:13
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/161612.jpg作者: 征兵 時(shí)間: 2025-3-23 06:45
Installation and Agent Deployment,a function of the solving degree. In this paper, we discuss how to rigorously estimate the solving degree of a system, focusing on systems arising within public-key cryptography. In particular, we show that it is upper bounded by, and often equal to, the Castelnuovo-Mumford regularity of the ideal g作者: 隱藏 時(shí)間: 2025-3-23 12:09 作者: 摘要 時(shí)間: 2025-3-23 17:30 作者: 尊嚴(yán) 時(shí)間: 2025-3-23 19:19 作者: CUMB 時(shí)間: 2025-3-24 00:39 作者: Cabg318 時(shí)間: 2025-3-24 04:01
Using Weakly Typed Struct Objects,stigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the binary case, we present some examples of optimal dihedral codes obtained by this construction.作者: 邪惡的你 時(shí)間: 2025-3-24 08:55 作者: GONG 時(shí)間: 2025-3-24 11:42
Oracle Objects: An Objective Analysis,r algorithm fits within the dynamic programming paradigm by exploiting new recursive relations on the determinants of Hankel matrices together with new observations concerning the distribution of zero determinants among the possible matrix sizes allowed by the length of the original sequence. The al作者: definition 時(shí)間: 2025-3-24 15:43
Using Oracle Collections and References,s of APN binomials over the finite field ., one for . divisible by 3, and one for . divisible by 4. By relaxing conditions, the family of APN binomials for . divisible by 3 was generalized to a family of differentially .-uniform functions in 2012 by Bracken, Tan and Tan; in this sense, the binomials作者: Glucose 時(shí)間: 2025-3-24 22:42 作者: prediabetes 時(shí)間: 2025-3-25 00:30 作者: Fraudulent 時(shí)間: 2025-3-25 03:45 作者: 注入 時(shí)間: 2025-3-25 09:36 作者: Friction 時(shí)間: 2025-3-25 13:02
Dihedral Codes with Prescribed Minimum Distancestigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the binary case, we present some examples of optimal dihedral codes obtained by this construction.作者: Ophthalmologist 時(shí)間: 2025-3-25 16:52 作者: Gyrate 時(shí)間: 2025-3-25 20:40
Conference proceedings 202120, held in Rennes, France in July 2020. ..Due to the COVID-19, the workshop was held online. .The 12 revised full papers and 3 invited talks presented were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on invited talks, Finite Field Arithmetic, Coding Theory, Network Security and much more..作者: HAVOC 時(shí)間: 2025-3-26 01:17
Martin Bach,Karl Arao,Tanel PoderThroughout this paper we let . be a prime number, let . and let . denote a finite field with . elements, where . is a positive integer.作者: Atrium 時(shí)間: 2025-3-26 07:20 作者: Lice692 時(shí)間: 2025-3-26 11:22 作者: Biguanides 時(shí)間: 2025-3-26 15:07 作者: 凌辱 時(shí)間: 2025-3-26 20:32 作者: 天氣 時(shí)間: 2025-3-26 22:52 作者: 監(jiān)禁 時(shí)間: 2025-3-27 01:23
Using Weakly Typed Struct Objects,stigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the binary case, we present some examples of optimal dihedral codes obtained by this construction.作者: 保守 時(shí)間: 2025-3-27 08:42 作者: Magnificent 時(shí)間: 2025-3-27 13:14
https://doi.org/10.1007/978-3-030-68869-1bit error rate; communication; communication channels (information theory); communication systems; compu作者: CLAP 時(shí)間: 2025-3-27 17:35
978-3-030-68868-4Springer Nature Switzerland AG 2021作者: Connotation 時(shí)間: 2025-3-27 18:23 作者: 小蟲 時(shí)間: 2025-3-28 00:11 作者: intercede 時(shí)間: 2025-3-28 05:02
A HDL Generator for Flexible and Efficient Finite-Field Multipliers on FPGAsmultiplication. They are designed to exploit finely the DSPs available on most FPGAs, interleaving independent computations to maximize throughput and DSP’s workload. Beside their throughput-efficiency, these operators can dynamically adapt to different finite-fields by changing both operand width a作者: 定點(diǎn) 時(shí)間: 2025-3-28 08:55
Trisymmetric Multiplication Formulae in?Finite Fieldsf multiplications involved when computing a bilinear map. The minimal number of multiplications in such formulae is called the ., and it is also of theoretical interest to asymptotically understand it. Moreover, when the bilinear maps admit some kind of invariance, it is also desirable to find formu作者: 頑固 時(shí)間: 2025-3-28 13:20 作者: sclera 時(shí)間: 2025-3-28 15:39 作者: 舊式步槍 時(shí)間: 2025-3-28 22:38
Recursion Polynomials of Unfolded Sequencestempts of modification, legitimate users should not be aware that it is embedded in the media. One of the techniques for watermarking is using an special variant of spread-spectrum technique, called frequency hopping. It requires ensembles of periodic binary sequences with low off-peak autocorrelati作者: 無(wú)彈性 時(shí)間: 2025-3-29 02:34 作者: Lineage 時(shí)間: 2025-3-29 03:49 作者: echnic 時(shí)間: 2025-3-29 08:57
On Subspaces of Kloosterman Zeros and Permutations of the Form f the inverse function. In this paper, we show that . cannot be a permutation on binary fields if the kernel of . or . is large. A key step of our proof is an observation on the maximal size of a subspace . of . that consists of Kloosterman zeros, i.e. a subspace . such that . for every . where . de作者: 是他笨 時(shí)間: 2025-3-29 13:31
Explicit Factorization of Some Period Polynomialsthat ., if 4|.. Also let . such that .. Assume that . or . is semiprimitive modulo .. Under these conditions, we are going to obtain the explicit factorization of the period polynomial of degree . for the finite field .. In fact, we will see that such polynomial has always integer roots, meaning tha作者: Flagging 時(shí)間: 2025-3-29 17:06 作者: Macronutrients 時(shí)間: 2025-3-29 23:41 作者: bromide 時(shí)間: 2025-3-30 02:14 作者: 詼諧 時(shí)間: 2025-3-30 07:38 作者: REP 時(shí)間: 2025-3-30 09:08
0302-9743 , WAIFI 2020, held in Rennes, France in July 2020. ..Due to the COVID-19, the workshop was held online. .The 12 revised full papers and 3 invited talks presented were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on invited talks, Finite Field Arit作者: intricacy 時(shí)間: 2025-3-30 13:44 作者: STAT 時(shí)間: 2025-3-30 16:32
Using Oracle Collections and References,orization of the period polynomial of degree . for the finite field .. In fact, we will see that such polynomial has always integer roots, meaning that the corresponding Gaussian periods are also integer numbers. As an application, we also determine the number of solutions of certain diagonal equations with constant exponent.作者: 急性 時(shí)間: 2025-3-30 21:43
Efficient, Actively Secure MPC with a Dishonest Majority: A Surveymajor pillar in this advance has been in the case of active security with a dishonest majority, mainly due to the SPDZ-line of work protocols. This survey gives an overview of these protocols, with a focus of the original SPDZ paper (Damg?rd et al. CRYPTO 2012) and its subsequent optimizations.作者: 離開可分裂 時(shí)間: 2025-3-31 03:17
Explicit Factorization of Some Period Polynomialsorization of the period polynomial of degree . for the finite field .. In fact, we will see that such polynomial has always integer roots, meaning that the corresponding Gaussian periods are also integer numbers. As an application, we also determine the number of solutions of certain diagonal equations with constant exponent.
