標(biāo)題: Titlebook: Advances in Cryptology – EUROCRYPT ‘90; Workshop on the Theo Ivan Bjerre Damg?rd Conference proceedings 1991 Springer-Verlag Berlin Heidelb [打印本頁] 作者: 關(guān)稅 時(shí)間: 2025-3-21 17:48
書目名稱Advances in Cryptology – EUROCRYPT ‘90影響因子(影響力)
書目名稱Advances in Cryptology – EUROCRYPT ‘90影響因子(影響力)學(xué)科排名
書目名稱Advances in Cryptology – EUROCRYPT ‘90網(wǎng)絡(luò)公開度
書目名稱Advances in Cryptology – EUROCRYPT ‘90網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Cryptology – EUROCRYPT ‘90被引頻次
書目名稱Advances in Cryptology – EUROCRYPT ‘90被引頻次學(xué)科排名
書目名稱Advances in Cryptology – EUROCRYPT ‘90年度引用
書目名稱Advances in Cryptology – EUROCRYPT ‘90年度引用學(xué)科排名
書目名稱Advances in Cryptology – EUROCRYPT ‘90讀者反饋
書目名稱Advances in Cryptology – EUROCRYPT ‘90讀者反饋學(xué)科排名
作者: 咒語 時(shí)間: 2025-3-21 20:16 作者: atrophy 時(shí)間: 2025-3-22 04:25
https://doi.org/10.1007/978-1-84996-151-6n cipher with two LFSRs where such correlations can be exploited in a known plaintext attack. A cryptanalytic algorithm is given which is shown to be successful for LFSRs of considerable length and with arbitrary feedback connection.作者: 微不足道 時(shí)間: 2025-3-22 05:05 作者: Generosity 時(shí)間: 2025-3-22 12:04 作者: Eulogy 時(shí)間: 2025-3-22 13:30
Bis zum letzten Tag: Beispiele,problems is infeasible, namely factoring a large integer and computing a discrete logarithm. For this enhanced security we require somewhat more communication and computational power, but the requirements remain quite modest, so that the scheme is well suited for use in smart cards.作者: RUPT 時(shí)間: 2025-3-22 18:23 作者: 漂浮 時(shí)間: 2025-3-22 21:25
0302-9743 sequences, implementations, combinatorial schemes, cryptanalysis, new cryptosystems, signatures and authentication, and impromptu talks.978-3-540-53587-4978-3-540-46877-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 小木槌 時(shí)間: 2025-3-23 01:24 作者: figment 時(shí)間: 2025-3-23 07:54 作者: Abominate 時(shí)間: 2025-3-23 11:04
Case-Based Reasoning Environment — Cabareenhm feasible. While this first application does not pose serious threats to factorization-based cryptosystems, the consequences of the second application could be very encouraging (from the cryptanalysts point of view).作者: Antagonism 時(shí)間: 2025-3-23 16:16 作者: 遵循的規(guī)范 時(shí)間: 2025-3-23 19:57 作者: 牛馬之尿 時(shí)間: 2025-3-24 01:16 作者: 奇思怪想 時(shí)間: 2025-3-24 04:27 作者: 上釉彩 時(shí)間: 2025-3-24 10:03
https://doi.org/10.1007/978-3-540-75707-8ream ciphers, where combining functions which are not correlation immune are vulnerable to ciphertext only attacks (see, for example [.]). The concept of .th order correlation immunity was introduced by Siegenthaler [.] as a measure of resistance against such an attack.作者: Ornament 時(shí)間: 2025-3-24 13:31 作者: RENIN 時(shí)間: 2025-3-24 16:14
Correlation Functions of Geometric Sequences of temporal passage, illusions and duration, illusions of temporal order and simultaneity, and the relationship between temporal illusions and the cognitive representation of time..978-3-030-22050-1978-3-030-22048-8作者: 步履蹣跚 時(shí)間: 2025-3-24 20:11
Distributed Primality Proving and the Primality of (23539 + 1)/3nalysis reveals how and why the changing communication environment facilitates selective exposure to ideologically and politically homogeneous sources, fosters changes in normative assumptions that guide media 978-3-031-54491-0978-3-031-54489-7作者: 口訣法 時(shí)間: 2025-3-25 00:04
Properties of binary functionsut nuclear waste. I have seen first hand the effects of poorly done risk asse- ments and bad risk communication, and especially the way in which the uncertainly of risk estimates is handled (or mishandled). The978-0-387-75165-8978-0-387-48572-0作者: 積習(xí)難改 時(shí)間: 2025-3-25 06:00 作者: Myocyte 時(shí)間: 2025-3-25 07:50 作者: 世俗 時(shí)間: 2025-3-25 12:02
On the Importance of Memory Resources in the Security of Key Exchange Protocols978-0-230-34141-8作者: 仇恨 時(shí)間: 2025-3-25 16:30 作者: 懶洋洋 時(shí)間: 2025-3-25 21:44
Which new RSA signatures can be computed from some given RSA signatures?作者: notification 時(shí)間: 2025-3-26 02:37 作者: 怪物 時(shí)間: 2025-3-26 04:51 作者: Shuttle 時(shí)間: 2025-3-26 08:58
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-26 16:11
Correlation Properties of Combiners with Memory in Stream Ciphers (Extended Abstract)978-1-137-36115-8作者: 敘述 時(shí)間: 2025-3-26 18:52 作者: OMIT 時(shí)間: 2025-3-26 22:16 作者: custody 時(shí)間: 2025-3-27 01:06 作者: Hay-Fever 時(shí)間: 2025-3-27 06:41 作者: Blasphemy 時(shí)間: 2025-3-27 12:13
Front Matterthe more successful Batavian Revolution of 1795. For the United Provinces that age had begun after a series of crises in 1747 and resulted in the un- precedented establishment of a single individual in the office of chief executive in all of the component provinces. The new form which emerged from t作者: 注入 時(shí)間: 2025-3-27 16:23
An Interactive Identification Scheme Based on Discrete Logarithms and Factoringrafficking.Offers a brand-new perspective on human trafficki.This book offers a brand-new perspective on human trafficking as an illegal business. It also proposes a new form of networked action: combining the perspectives of academic researchers with those of highly skilled professionals involved i作者: 千篇一律 時(shí)間: 2025-3-27 21:36
Implementation of a Key Exchange Protocol Using Real Quadratic Fieldstific computations into the realm of practicality. Conceived initially as a grand experiment in computer science, the revolutionary architecture incorporated both a high level of parallelism and pipe- lining. After a difficult gestation, the Illiac IV became operational in November 1975. It has for 作者: Herd-Immunity 時(shí)間: 2025-3-27 22:51 作者: Obvious 時(shí)間: 2025-3-28 04:38 作者: MOCK 時(shí)間: 2025-3-28 08:32 作者: 不自然 時(shí)間: 2025-3-28 10:37 作者: enchant 時(shí)間: 2025-3-28 14:46 作者: 使激動(dòng) 時(shí)間: 2025-3-28 20:14
Correlation Functions of Geometric Sequenceson timing and time perception are to furthering research on This edited collection presents the latest cutting-edge research in the philosophy and cognitive science of temporal illusions. Illusion and error have long been important points of entry for both philosophical and psychological approaches 作者: moribund 時(shí)間: 2025-3-29 01:13 作者: mechanism 時(shí)間: 2025-3-29 05:32 作者: deviate 時(shí)間: 2025-3-29 09:02
Case-Based Reasoning Environment — CabareenLinear feedback shift registers over the ring ... can be implemented efficiently on standard microprocessors. The most significant bits of the elements of a sequence in .. constitute a binary pseudo-random sequence. We derive lower bounds for the linear complexity over .. of these binary sequences.作者: Little 時(shí)間: 2025-3-29 11:28
Hongxia Dan,Xin Jin,Qianming ChenThis paper considers the cross-correlation function values of a family of binary sequences obtained from finite geometries. These values are shown to depend on the intersection of hyperplanes in a projective space and the cross-correlation function values of the nonlinear feedforward functions used in the construction of the geometric sequences.作者: 信任 時(shí)間: 2025-3-29 16:45
https://doi.org/10.1007/3-540-46877-3Cryptanalysis; Cryptosystems; Digital signatures; Digitale Unterschrift; Kryptanalysis; Kryptographie; Kry作者: 坦白 時(shí)間: 2025-3-29 20:00 作者: 追逐 時(shí)間: 2025-3-30 00:39 作者: Extricate 時(shí)間: 2025-3-30 06:56 作者: Invigorate 時(shí)間: 2025-3-30 10:32
Yuri Avramenko,Andrzej Kraslawskihave proved that such generators are pseudorandom only if the pseudorandom function is used internally at least five times. The proof is given using two different approaches: deterministic and probabilistic. Some cryptographic implications are also discussed.作者: 打算 時(shí)間: 2025-3-30 15:03
Pre-Detailed Design: Process Model Selection with the jump complexity, establish formulas for the expected value and the variance of the jump complexity, and prove probabilistic theorems on the jump complexity profile of random sequences. We also extend earlier work on frequency distributions in the linear complexity profile to joint frequency distributions.作者: circuit 時(shí)間: 2025-3-30 18:24 作者: Temporal-Lobe 時(shí)間: 2025-3-30 22:29 作者: DENT 時(shí)間: 2025-3-31 02:16
Shuchen Huang,Junjian Qi,Kai Sun key-updating schemes, i.e., one is sequential type and the other is parallel type, and show that both schemes are equivalent to each other in a polynomial time sense, i.e., there exists a deterministic polynomial time algorithm that transforms the sequential key-updating scheme to the parallel one,作者: voluble 時(shí)間: 2025-3-31 05:25 作者: 閑聊 時(shí)間: 2025-3-31 12:40
Bis zum letzten Tag: Beispiele,ity based on the difficulty of computing discrete logarithms. The modification that we present here will remain secure if either of two computational problems is infeasible, namely factoring a large integer and computing a discrete logarithm. For this enhanced security we require somewhat more commu作者: dendrites 時(shí)間: 2025-3-31 14:50 作者: GRIPE 時(shí)間: 2025-3-31 18:40 作者: 遠(yuǎn)地點(diǎn) 時(shí)間: 2025-3-31 22:20
Case-Based Reasoning Environment — Cabareen arithmetic in the multiplicative group .* of a finite field . (or any finite Abelian group .), it uses a finite subset of an infinite Abelian group which itself is not a subgroup, namely the set of reduced principal ideals in a real quadratic field. As the authors presented the scheme and its secur作者: 偽證 時(shí)間: 2025-4-1 02:15
https://doi.org/10.1007/978-3-540-75707-8tion immunity. The strict avalanche criterion was introduced by Webster and Tavares [.] in order to combine the ideas of completeness and the avalanche effect. A cryptographic transformation is said to be complete if each output bit depends on each input bit, and it exhibits the avalanche effect if 作者: Density 時(shí)間: 2025-4-1 06:45 作者: 鋼筆記下懲罰 時(shí)間: 2025-4-1 13:49
Yuri Avramenko,Andrzej Kraslawskinces which possess high linear complexity and very nearly optimum crosscorrelation properties [.]. In [.] Meier and Staffelbach discovered, that binary bent functions give a solution to the correlation problem when used as combining functions of several binary linear shiftregister sequences. One of 作者: 飲料 時(shí)間: 2025-4-1 17:11 作者: entice 時(shí)間: 2025-4-1 20:54
Pre-Detailed Design: Process Model Selection with the jump complexity, establish formulas for the expected value and the variance of the jump complexity, and prove probabilistic theorems on the jump complexity profile of random sequences. We also extend earlier work on frequency distributions in the linear complexity profile to joint frequenc作者: 遭遇 時(shí)間: 2025-4-2 00:54
