標(biāo)題: Titlebook: Number Theoretic Methods in Cryptography; Complexity lower bou Igor Shparlinski Book 1999 Springer Basel AG 1999 complexity.complexity theo [打印本頁] 作者: 貶損 時間: 2025-3-21 18:27
書目名稱Number Theoretic Methods in Cryptography影響因子(影響力)
書目名稱Number Theoretic Methods in Cryptography影響因子(影響力)學(xué)科排名
書目名稱Number Theoretic Methods in Cryptography網(wǎng)絡(luò)公開度
書目名稱Number Theoretic Methods in Cryptography網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Number Theoretic Methods in Cryptography被引頻次
書目名稱Number Theoretic Methods in Cryptography被引頻次學(xué)科排名
書目名稱Number Theoretic Methods in Cryptography年度引用
書目名稱Number Theoretic Methods in Cryptography年度引用學(xué)科排名
書目名稱Number Theoretic Methods in Cryptography讀者反饋
書目名稱Number Theoretic Methods in Cryptography讀者反饋學(xué)科排名
作者: 斷斷續(xù)續(xù) 時間: 2025-3-21 23:19
Igor Shparlinski physics to a brief review of basic semiconductor physics. Its purpose is to establish a common platform of language and symbols, and to make the entire treatment, as far as pos- ble, self-contained. Parts II a978-3-642-26480-1978-3-642-10586-9Series ISSN 0171-1873 Series E-ISSN 2197-4179 作者: 無法解釋 時間: 2025-3-22 02:04
physics to a brief review of basic semiconductor physics. Its purpose is to establish a common platform of language and symbols, and to make the entire treatment, as far as pos- ble, self-contained. Parts II a978-3-642-26480-1978-3-642-10586-9Series ISSN 0171-1873 Series E-ISSN 2197-4179 作者: 有節(jié)制 時間: 2025-3-22 05:16
Igor Shparlinski physics to a brief review of basic semiconductor physics. Its purpose is to establish a common platform of language and symbols, and to make the entire treatment, as far as pos- ble, self-contained. Parts II a978-3-642-26480-1978-3-642-10586-9Series ISSN 0171-1873 Series E-ISSN 2197-4179 作者: DOLT 時間: 2025-3-22 12:06 作者: 心胸狹窄 時間: 2025-3-22 15:36 作者: SPASM 時間: 2025-3-22 17:55
physics to a brief review of basic semiconductor physics. Its purpose is to establish a common platform of language and symbols, and to make the entire treatment, as far as pos- ble, self-contained. Parts II a978-3-642-26480-1978-3-642-10586-9Series ISSN 0171-1873 Series E-ISSN 2197-4179 作者: dysphagia 時間: 2025-3-22 21:32
Igor Shparlinski physics to a brief review of basic semiconductor physics. Its purpose is to establish a common platform of language and symbols, and to make the entire treatment, as far as pos- ble, self-contained. Parts II a978-3-642-26480-1978-3-642-10586-9Series ISSN 0171-1873 Series E-ISSN 2197-4179 作者: 下船 時間: 2025-3-23 04:20
Book 1999e representation of the right- most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de- gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These 作者: 羊齒 時間: 2025-3-23 08:01
Igor Shparlinskio ?ve major parts. Part I moves from a survey of the fundamentals of classical and quantum physics to a brief review of basic semiconductor physics. Its purpose is to establish a common platform of language and symbols, and to make the entire treatment, as far as pos- ble, self-contained. Parts II a作者: 厭惡 時間: 2025-3-23 11:04
Book 1999ods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de-作者: 蕨類 時間: 2025-3-23 17:43
Boolean Complexity of the Diffie—Hellman Keyer, as a dual question of computing powers in parallel shows in some cases (over finite fields of small characteristic), the Boolean model of computation is exponentially more powerful than the arithmetic model [71, 72].作者: 因無茶而冷淡 時間: 2025-3-23 20:33 作者: Crepitus 時間: 2025-3-24 01:48 作者: 藕床生厭倦 時間: 2025-3-24 03:47 作者: 吹牛大王 時間: 2025-3-24 07:24
a reference work for researchers and a study text for graduaThis book originated out of a desire to provide students with an instrument which might lead them from knowledge of elementary classical and quantum physics to moderntheoreticaltechniques for the analysisof electrontransport in semiconducto作者: 我不明白 時間: 2025-3-24 13:52
Igor Shparlinskia reference work for researchers and a study text for graduaThis book originated out of a desire to provide students with an instrument which might lead them from knowledge of elementary classical and quantum physics to moderntheoreticaltechniques for the analysisof electrontransport in semiconducto作者: notice 時間: 2025-3-24 17:17
Igor Shparlinskia reference work for researchers and a study text for graduaThis book originated out of a desire to provide students with an instrument which might lead them from knowledge of elementary classical and quantum physics to moderntheoreticaltechniques for the analysisof electrontransport in semiconducto作者: Relinquish 時間: 2025-3-24 19:29
Igor Shparlinskia reference work for researchers and a study text for graduaThis book originated out of a desire to provide students with an instrument which might lead them from knowledge of elementary classical and quantum physics to moderntheoreticaltechniques for the analysisof electrontransport in semiconducto作者: Foam-Cells 時間: 2025-3-24 23:53
a reference work for researchers and a study text for graduaThis book originated out of a desire to provide students with an instrument which might lead them from knowledge of elementary classical and quantum physics to moderntheoreticaltechniques for the analysisof electrontransport in semiconducto作者: Agility 時間: 2025-3-25 05:03
Igor Shparlinskihysics to moderntheoreticaltechniques for the analysisof electrontransport in semiconductors. The book is basically a textbook for students of physics, material science, and electronics. Rather than a monograph on detailed advanced research in a speci?c area, it intends to introduce the reader to th作者: ethnology 時間: 2025-3-25 10:42
Igor Shparlinskia reference work for researchers and a study text for graduaThis book originated out of a desire to provide students with an instrument which might lead them from knowledge of elementary classical and quantum physics to moderntheoreticaltechniques for the analysisof electrontransport in semiconducto作者: 虛假 時間: 2025-3-25 14:40 作者: Barter 時間: 2025-3-25 19:33
Boolean Complexity of the Diffie—Hellman Keyowerful than the Boolean model (and in some situations it is), but there is no proof that this is really the case for our particular situation. Moreover, as a dual question of computing powers in parallel shows in some cases (over finite fields of small characteristic), the Boolean model of computat作者: BOAST 時間: 2025-3-25 22:14
Trade-off between the Boolean and Arithmetic Depths of Modulo , Functionsom the bit representation of x and obtain a lower bound on their sensitivity (see Chapter 6 for the definition of this notion). Then a similar but a weaker bound is obtained for the sensitivity of Boolean functions producing the second leftmost bit of rational functions modulo ..作者: dearth 時間: 2025-3-26 03:16 作者: sterilization 時間: 2025-3-26 04:57
Introductionields such as polynomials and their combinations with exponential functions (linear recurring sequences, basically) and algebraic functions (that is, via functions .(.) satisfying a polynomial equation .(.(.)) = 0 over a finite field).作者: 船員 時間: 2025-3-26 11:28 作者: Host142 時間: 2025-3-26 15:58 作者: 性學(xué)院 時間: 2025-3-26 17:57
Auxiliary ResultsHere we collect some lemmas we will need later.作者: 不真 時間: 2025-3-26 21:35
Approximation of the Discrete Logarithm Modulo Here we show that polynomials and algebraic functions approximating the discrete logarithm modulo . on sufficiently large sets must be of sufficiently large degree, in fact exponentially large (in terms of log.). Many of the results of this chapter can also be found in [48]. We start with a rather simple statement.作者: 衰弱的心 時間: 2025-3-27 03:23
Approximation of the Discrete Logarithm Modulo , - 1In this chapter we consider various approximations and representations of the discrete logarithm modulo a divisor . of . - 1. Certainly the case of . = 2 is of special interest because it corresponds to representation of the rightmost bit of ind ..作者: 灰姑娘 時間: 2025-3-27 09:14
Approximation of the Discrete Logarithm by Boolean FunctionsHere we consider the bitwise approximation of the discrete logarithm given the bit representation of the argument. Moreover, we concentrate on the rightmost bit of ind .. This question is essentially equivalent to deciding quadratic residuacity of ..作者: deriver 時間: 2025-3-27 13:31
Approximation of the Discrete Logarithm by Real and Complex PolynomialsHere we consider some questions about approximation of the discrete logarithm by real and even complex polynomials. Unfortunately our results are weaker that those in our previous settings.作者: LINE 時間: 2025-3-27 15:33 作者: mortgage 時間: 2025-3-27 18:11
Special Polynomials and Boolean FunctionsIn this chapter we show how to apply the techniques of this book to various questions about permutation polynomials, powers ., Zech’s logarithm, primitive root testing and symmetric Boolean functions.作者: 群居男女 時間: 2025-3-27 23:40
RSA and Blum—Blum—Shub Generators of Pseudo-Random NumbersLet ?, . and . be integers such that gcd(?, .) = 1.作者: 衍生 時間: 2025-3-28 06:09
Further DirectionsWe now try very briefly to describe several other problems which look quite unrelated to the questions considered in this book (in particular, they are not directly related to any functions over a finite field), but for which, nevertheless, we hope our approach could turn out to be useful.作者: FATAL 時間: 2025-3-28 08:02
978-3-0348-9723-5Springer Basel AG 1999作者: 罵人有污點(diǎn) 時間: 2025-3-28 13:25 作者: frivolous 時間: 2025-3-28 15:25 作者: pulse-pressure 時間: 2025-3-28 19:33
https://doi.org/10.1007/978-3-0348-8664-2complexity; complexity theory; computer science; cryptography; finite field; number theory作者: 輕快走過 時間: 2025-3-28 23:07
7樓作者: 鬼魂 時間: 2025-3-29 04:30
8樓作者: 彩色的蠟筆 時間: 2025-3-29 09:52
8樓作者: obscurity 時間: 2025-3-29 12:37
8樓作者: Stress-Fracture 時間: 2025-3-29 16:53
8樓作者: 含水層 時間: 2025-3-29 19:48
9樓作者: Nutrient 時間: 2025-3-30 01:18
9樓作者: CAGE 時間: 2025-3-30 04:26
9樓作者: bioavailability 時間: 2025-3-30 11:40
9樓作者: meditation 時間: 2025-3-30 15:58
10樓作者: BILL 時間: 2025-3-30 19:44
10樓作者: FIR 時間: 2025-3-30 21:52
10樓作者: LIMIT 時間: 2025-3-31 02:45
10樓
