標(biāo)題: Titlebook: Coding Theory, Cryptography and Related Areas; Proceedings of an In Johannes Buchmann,Tom H?holdt,Horacio Tapia-Recill Conference proceedin [打印本頁] 作者: VERSE 時間: 2025-3-21 19:52
書目名稱Coding Theory, Cryptography and Related Areas影響因子(影響力)
書目名稱Coding Theory, Cryptography and Related Areas影響因子(影響力)學(xué)科排名
書目名稱Coding Theory, Cryptography and Related Areas網(wǎng)絡(luò)公開度
書目名稱Coding Theory, Cryptography and Related Areas網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding Theory, Cryptography and Related Areas被引頻次
書目名稱Coding Theory, Cryptography and Related Areas被引頻次學(xué)科排名
書目名稱Coding Theory, Cryptography and Related Areas年度引用
書目名稱Coding Theory, Cryptography and Related Areas年度引用學(xué)科排名
書目名稱Coding Theory, Cryptography and Related Areas讀者反饋
書目名稱Coding Theory, Cryptography and Related Areas讀者反饋學(xué)科排名
作者: 不開心 時間: 2025-3-21 20:46 作者: Forage飼料 時間: 2025-3-22 03:07 作者: 金哥占卜者 時間: 2025-3-22 07:19 作者: 強(qiáng)行引入 時間: 2025-3-22 09:10 作者: preservative 時間: 2025-3-22 14:12 作者: preservative 時間: 2025-3-22 17:56 作者: Explicate 時間: 2025-3-22 21:57
Werner Gottschalk,Hermann P. Müllerit to show that, for field extensionsequation y.=x.-x+1 over a finite field ..., of degree . prime to ., the Jacobian has a cyclic group structure. We furthermore propose a method for faster scalar multiplication in the Jacobian by using efficient operators other than the Frobenius that have smaller eigenvalues.作者: Cholesterol 時間: 2025-3-23 04:37 作者: 微粒 時間: 2025-3-23 05:34
Ashok Gaur,Atul Kumar,Raj Kiran,Pooja Kumarithe best known bound could not be met. The purpose of this paper is to give another new example of this phenomenon, and to explain the method used to obtain these results. This method gives rise to lists of all possible zeta functions, even in cases where we cannot conclude that no curve exists to meet the bound.作者: 集合 時間: 2025-3-23 10:28
Modifications of the Rao-Nam Cryptosystem,e discuss several modifications of the improved Rao-Nam system. The goal of these modifications is to reduce the amount of secret key that needs to be exchanged, while maintaining the security of the system..作者: 極少 時間: 2025-3-23 16:02 作者: faculty 時間: 2025-3-23 18:20 作者: 細(xì)查 時間: 2025-3-23 23:50 作者: 魯莽 時間: 2025-3-24 02:59
Future Strategies and Conclusions,lts of Hua in the one variable case, and Igusa in the case of several variables. In general, Gauss sums over finite rings possess asymptotic expansions whose leading term can be expressed in terms of quadratic Gauss sums. The principal tool turns out to be an arithmetic analogue of Morse’s Lemma.作者: paltry 時間: 2025-3-24 10:27 作者: 狂熱文化 時間: 2025-3-24 14:32 作者: Thyroid-Gland 時間: 2025-3-24 17:43
Mary L. Duryea,Gregory N. Brown (see [3] and [6]) for exponential sums over the binary field. We also give an elementary new proof of Moreno-Moreno’s partial improvement to the Ax-Katz’s theorem (see [5]) for finite fields of characteristic.作者: Chromatic 時間: 2025-3-24 19:45 作者: CAGE 時間: 2025-3-24 23:21
Exponential Sums in Several Variables Over Finite Fields, (see [3] and [6]) for exponential sums over the binary field. We also give an elementary new proof of Moreno-Moreno’s partial improvement to the Ax-Katz’s theorem (see [5]) for finite fields of characteristic.作者: 樹木中 時間: 2025-3-25 03:37 作者: 昏睡中 時間: 2025-3-25 10:03
Efficient Reduction on the Jacobian Variety of Picard Curves,ric interpretation and provide us with an unifying environment to obtain an efficient algorithm for the reduction and addition of divisors. Exploiting the geometry of the Picard curves, a completely effective reduction algorithm is developed, which works for curves defined over any ground fieldk, wi作者: 細(xì)查 時間: 2025-3-25 12:18
Efficient Algorithms for the Jacobian Variety of Hyperelliptic Curves y,=x,-x+1 Over a Finite Fieldistic .. We first determine the zeta function of the curve which yields the order of the Jacobian. We also investigate the Frobenius operator and use it to show that, for field extensionsequation y.=x.-x+1 over a finite field ..., of degree . prime to ., the Jacobian has a cyclic group structure. We作者: 不可救藥 時間: 2025-3-25 16:41
On Weierstrass Semigroups and One-point Algebraic Geometry Codes,plane model of the curve. The first one works in a quite general situation and it is founded on the Brill-Noether algorithm. The second method works in the case of . being the only point at infinity of the plane model, what is very usual in practice, and it is based on the Abhyankar-Moh theorem, the作者: Melanocytes 時間: 2025-3-25 22:25
A Public Key Cryptosystem Based on Sparse Polynomials,d give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well.作者: 傾聽 時間: 2025-3-26 03:17 作者: ARC 時間: 2025-3-26 05:35 作者: 諂媚于人 時間: 2025-3-26 10:03
Zeta Functions of Curves over Finite Fields with Many Rational Points,n most cases come from the optimization of the explicit formulae method, which is detailed in [7] and [9]. In [4], we gave an example of a case where the best known bound could not be met. The purpose of this paper is to give another new example of this phenomenon, and to explain the method used to 作者: incarcerate 時間: 2025-3-26 13:12
Elliptic Curves, Pythagorean Triples and Applications,ways a multiple of eight. Moreover, a sub-family of them is also introduced: the curves which are associated with pythagorean triples, for which there exists a rational distinguished point. The number of such triples in ?., is given. Finally, a refinement on the Goldwasser-Kilian primality test is s作者: 胡言亂語 時間: 2025-3-26 18:42
Exponential Sums and Stationary Phase (I),especialy those arising from p-adic fields. The principal theme is the application of the classical method of stationary phase in a number theoretic context. After surveying the well known results of Kummer, Lamprecht, and Dwork, we indicate some generalizations which include and extend certain resu作者: 保全 時間: 2025-3-27 00:32
Exponential Sums in Several Variables Over Finite Fields,following the method of Moreno and Moreno (see [3] and [6]). We begin combining the reduction to the ground field method and the Newton polyhedra method of Adolphson and Sperber to improve the partial improvement given by Moreno and Moreno of the Ax-Katz’s theorem (see theorem 4). We give a new and 作者: 煩人 時間: 2025-3-27 03:18 作者: Customary 時間: 2025-3-27 07:57
Ashok Gaur,Atul Kumar,Raj Kiran,Pooja Kumari weights of Grassmann codes. As a consequence, we obtain a bound on the number of higher dimensional subcodes of the Grassmann code having the minimum Hamming norm. We also discuss a generalization of Grassmann codes.作者: BUMP 時間: 2025-3-27 12:38 作者: 說不出 時間: 2025-3-27 15:09 作者: Observe 時間: 2025-3-27 19:10 作者: gerontocracy 時間: 2025-3-28 00:37 作者: Connotation 時間: 2025-3-28 03:12
978-3-540-66248-8Springer-Verlag Berlin Heidelberg 2000作者: 吞吞吐吐 時間: 2025-3-28 07:40 作者: Indecisive 時間: 2025-3-28 11:25
Genetics of Seed Proteins in Wheat,We summarize recent developments on the computation of discrete logarithms in general groups as well as in some specialized settings. More specifically, we consider the following abelian groups: the multiplicative group of finite fields, the group of points of an elliptic curve over a finite field, and the class group of quadratic number fields.作者: 紅潤 時間: 2025-3-28 18:14 作者: 北極人 時間: 2025-3-28 19:51
https://doi.org/10.1007/978-94-011-4431-5The undetected error probability of .-out-of-. codes on the binary symmetric channel is studied in this paper. A new and simplified proof of the main results of Wang, Yang and Zhang in [6]-(11] is given.作者: 除草劑 時間: 2025-3-29 01:43
Sudipta Basu,Steven P. C. GrootA tower of function fields over a finite field . is a sequence . of function fields . satisfying the following conditions:作者: 妨礙議事 時間: 2025-3-29 03:35 作者: muscle-fibers 時間: 2025-3-29 09:39
Somnath K. Holkar,Nagamani Sandra,R. K. JainWe give an exact worst-case analysis of an algorithm for computing the greatest common divisor of n inputs. The algorithm is extracted from a 1995 algorithm of de Rooij for fixed-base exponentiation.作者: HIKE 時間: 2025-3-29 13:19 作者: Pillory 時間: 2025-3-29 17:16
Continued Fractions in Hyperelliptic Function Fields,Known results on hyperelliptic continued fractions, and in particular the Baby-Step Giant-Step algorithm, are obtained using algebro-geometric techniques. The methods used are valid in all characteristics and the proofs are simpler than those based on analogies with real quadratic number fields.作者: falsehood 時間: 2025-3-29 23:18 作者: 革新 時間: 2025-3-30 00:29 作者: 自作多情 時間: 2025-3-30 07:46 作者: finale 時間: 2025-3-30 12:16 作者: 揮舞 時間: 2025-3-30 12:50 作者: PHAG 時間: 2025-3-30 19:57
Worst-Case Analysis of an Algorithm for Computing the Greatest Common Divisor of , Inputs,We give an exact worst-case analysis of an algorithm for computing the greatest common divisor of n inputs. The algorithm is extracted from a 1995 algorithm of de Rooij for fixed-base exponentiation.作者: 確定的事 時間: 2025-3-31 00:02 作者: Prosaic 時間: 2025-3-31 04:38
A Public Key Cryptosystem Based on Sparse Polynomials,d give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well.作者: Mendacious 時間: 2025-3-31 07:04 作者: 壯觀的游行 時間: 2025-3-31 10:09 作者: 牢騷 時間: 2025-3-31 17:03
Miller B. McDonald,Lawrence O. Copelandruik and van Tilburg [8] improved the Rao-Nam cryptosystem. However, the size of the key remains a practical problem also for their improved scheme. We discuss several modifications of the improved Rao-Nam system. The goal of these modifications is to reduce the amount of secret key that needs to be作者: HUMP 時間: 2025-3-31 19:13 作者: 詞匯表 時間: 2025-4-1 01:31 作者: painkillers 時間: 2025-4-1 05:20
Craig E. Coleman,Brian A. Larkinsplane model of the curve. The first one works in a quite general situation and it is founded on the Brill-Noether algorithm. The second method works in the case of . being the only point at infinity of the plane model, what is very usual in practice, and it is based on the Abhyankar-Moh theorem, the作者: 辯論 時間: 2025-4-1 08:27
