標題: Titlebook: Cryptology and Network Security; 11th International C Josef Pieprzyk,Ahmad-Reza Sadeghi,Mark Manulis Conference proceedings 2012 Springer-V [打印本頁] 作者: 烏鴉 時間: 2025-3-21 16:24
書目名稱Cryptology and Network Security影響因子(影響力)
書目名稱Cryptology and Network Security影響因子(影響力)學科排名
書目名稱Cryptology and Network Security網絡公開度
書目名稱Cryptology and Network Security網絡公開度學科排名
書目名稱Cryptology and Network Security被引頻次
書目名稱Cryptology and Network Security被引頻次學科排名
書目名稱Cryptology and Network Security年度引用
書目名稱Cryptology and Network Security年度引用學科排名
書目名稱Cryptology and Network Security讀者反饋
書目名稱Cryptology and Network Security讀者反饋學科排名
作者: eustachian-tube 時間: 2025-3-21 21:22 作者: 安裝 時間: 2025-3-22 02:39
uce a new version of the meet-in-the-middle technique which they call ”2-dimensional meet in the middle (2DMITM)” attack. Their attack is based on applying 2DMITM attack on 8-round GOST 2. times. In this work, we mount an attack with time complexity of 2. using 2. chosen plaintexts instead of the wh作者: 侵略 時間: 2025-3-22 06:36
eature mining results, we take advantage of the structural properties of the .-partite graph formed by considering the natural interconnections between objects of different types. We show that the proposed method is straightforward, fast and scalable. The results of the analysis of rogue security so作者: 勛章 時間: 2025-3-22 10:37
Mechanische Werkstoffeigenschaften,dy several protocol variants which are extremely flexible allowing different trade-offs on bus load, computational cost and security level. Experimental results are presented on state-of-the-art Infineon TriCore controllers which are contrasted with low end controllers with Freescale S12X cores, all作者: 引水渠 時間: 2025-3-22 13:27 作者: 引水渠 時間: 2025-3-22 17:34
Improved Linear Analysis on Block Cipher MULTI2cryption key recovery, i.e., in time 2. for .?=?8,12,16,20,24. Note that previously, the best linear key-recovery attack was a 20-round attack with time 2. (of 20-round encryptions) and data 2.. As ISO register recommends to use at least 32 rounds, our attacks remain to be theoretical and do not thr作者: Rebate 時間: 2025-3-23 00:18 作者: 能量守恒 時間: 2025-3-23 04:30 作者: 態(tài)度暖昧 時間: 2025-3-23 08:05
LiBrA-CAN: A Lightweight Broadcast Authentication Protocol for Controller Area Networksdy several protocol variants which are extremely flexible allowing different trade-offs on bus load, computational cost and security level. Experimental results are presented on state-of-the-art Infineon TriCore controllers which are contrasted with low end controllers with Freescale S12X cores, all作者: 意外的成功 時間: 2025-3-23 11:43
Applicability of OR-Proof Techniques to Hierarchical Identity-Based Identification作者: 執(zhí) 時間: 2025-3-23 17:17 作者: 散布 時間: 2025-3-23 19:05 作者: 袋鼠 時間: 2025-3-23 23:55
on A2U2 under the known-plaintext-attack model, which only needs at most 210 consecutive ciphertext bits and its corresponding plaintext with the time complexity about 2.. Our result is much better than that of the attack proposed by M. Abdelraheem et al. in [9] whose complexity is .(2.×.), where . 作者: Opponent 時間: 2025-3-24 02:24 作者: 摻假 時間: 2025-3-24 10:29
ge recovery attacks on this cryptosystem. The first one is a broadcast attack: a single message of . bits can be recovered if it is encrypted for . recipients. The second attack is a multiple transmission attack in which a message can be recovered with a probability of (1???2.). if it is encrypted u作者: 消滅 時間: 2025-3-24 11:29 作者: 發(fā)酵劑 時間: 2025-3-24 17:59
cks include the use of differential and linear relation patterns that allow to bypass the diffusion provided by MDS codes altogether. Therefore, we can attack only a single IDEA instance out of . copies, effectively using a narrow trail for the propagation of differences and masks across WIDEA-.. In作者: AGOG 時間: 2025-3-24 22:30
and Japan. MULTI2 uses the Feistel structure and operates on the 64-bit blocks. The encryption key has 256 bits..This paper studies the linear analysis on MULTI2. We give a detailed bias analysis on MULTI2 round functions. For the first time formal proofs on their bias properties are given. This all作者: META 時間: 2025-3-25 01:08 作者: Dri727 時間: 2025-3-25 06:53 作者: 反省 時間: 2025-3-25 07:39 作者: 口音在加重 時間: 2025-3-25 15:00 作者: 相互影響 時間: 2025-3-25 16:31 作者: Accede 時間: 2025-3-25 23:22 作者: FER 時間: 2025-3-26 01:40 作者: 百靈鳥 時間: 2025-3-26 06:20
Organische Werkstoffe. Kunststoffe,y useful to enable sharing information with privacy, as they allow two or more parties to jointly compute operations on their sets (e.g., intersection, union, etc.), such that only the minimum required amount of information is disclosed. In the last few years, the research community has proposed a n作者: 不適當 時間: 2025-3-26 09:00
Optische Werkstoffeigenschaften, error locator polynomial during the decryption operation of code-based encryption schemes. We compare the performance of these algorithms and show that optimizations concerning finite field element representations play a key role for the speed of software implementations. Furthermore, we point out 作者: aviator 時間: 2025-3-26 16:32 作者: Relinquish 時間: 2025-3-26 18:48 作者: 話 時間: 2025-3-26 22:01
differential attacks on both the new and old versions. The comparison of symbolic expressions suggests that Grain-128a is immune against dynamic cube attacks. Additionally, we find that it is also immune against differential attacks as the best attack we could find results in a bias at round 189 out of 256.作者: prostate-gland 時間: 2025-3-27 03:51 作者: 混合 時間: 2025-3-27 05:45 作者: Axillary 時間: 2025-3-27 11:31
https://doi.org/10.1007/978-3-642-35404-5authenticated encryption; code-based cryptography; forward secrecy; s-box; timing attack作者: facetious 時間: 2025-3-27 14:40 作者: 裙帶關系 時間: 2025-3-27 19:47 作者: CON 時間: 2025-3-27 23:15
Conference proceedings 2012Germany, in December 2012. The 22 revised full papers, presented were carefully reviewed and selected from 99 submissions. The papers are organized in topical sections on cryptanalysis; network security; cryptographic protocols; encryption; and s-box theory.作者: Enteropathic 時間: 2025-3-28 04:35
Conference proceedings 2012Germany, in December 2012. The 22 revised full papers, presented were carefully reviewed and selected from 99 submissions. The papers are organized in topical sections on cryptanalysis; network security; cryptographic protocols; encryption; and s-box theory.作者: 指數 時間: 2025-3-28 10:10 作者: SHRIK 時間: 2025-3-28 11:46
Attacking Animated CAPTCHAs via Character Extractionvery much relevant to the design of animated CAPTCHAs. In this paper, we show that animated CAPTCHAs not designed with this principle in mind can be easily be broken using simple techniques to extract individual characters from the animation frames. We present our experimental results on attacking 13 existing animated CAPTCHAs.作者: 揮舞 時間: 2025-3-28 18:10
Group Key Establishment: Adding Perfect Forward?Secrecy at the Cost of One Roundnfrastructure. Building on a secure unauthenticated 1-round 2-party key establishment . with perfect forward secrecy as auxiliary input, . is transformed into an authenticated group key establishment protocol with perfect forward secrecy and with one more round than ..作者: modest 時間: 2025-3-28 21:32
Strong Privacy for RFID Systems from Plaintext-Aware Encryptionr proposes a slight change in the definition of privacy from the Vaudenay model (Asiacrypt 2007). Then, we show that by adding a plaintext-aware assumption on the public-key cryptosystem, the proposed protocol always achieves strong privacy with our new definitions.作者: Halfhearted 時間: 2025-3-29 00:24
0302-9743 ed were carefully reviewed and selected from 99 submissions. The papers are organized in topical sections on cryptanalysis; network security; cryptographic protocols; encryption; and s-box theory.978-3-642-35403-8978-3-642-35404-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: prediabetes 時間: 2025-3-29 05:26
is the complexity of solving a sparse quadratic equation system on 56 unknown key bits. Furthermore we provide a new approach to solving the above sparse quadratic equation system, which reduces the complexity . to a very small constant. Finally we do an entire experiment on a PC and recover all bits of a random key in a few seconds.作者: Occupation 時間: 2025-3-29 09:58
nder a same public key for .?=??log..?+?2? times using different random numbers. The multiple transmission attack can be further improved with a linearization technique to that only . times of encryptions are required to recover the message. An open problem related to the message recovery attack using only one cipehertext is discussed.作者: NEXUS 時間: 2025-3-29 12:55 作者: debouch 時間: 2025-3-29 16:26
A Real-Time Key Recovery Attack on the Lightweight Stream Cipher A2U2is the complexity of solving a sparse quadratic equation system on 56 unknown key bits. Furthermore we provide a new approach to solving the above sparse quadratic equation system, which reduces the complexity . to a very small constant. Finally we do an entire experiment on a PC and recover all bits of a random key in a few seconds.作者: 假 時間: 2025-3-29 20:02
Cryptanalysis of a Lattice-Knapsack Mixed Public Key Cryptosystemnder a same public key for .?=??log..?+?2? times using different random numbers. The multiple transmission attack can be further improved with a linearization technique to that only . times of encryptions are required to recover the message. An open problem related to the message recovery attack using only one cipehertext is discussed.作者: 不可比擬 時間: 2025-3-30 01:28
Biclique Cryptanalysis of TWINEher. In these attacks, we use the recently developed biclique technique. The complexities of the attacks on TWINE-80 and TWINE-128 are 2. and 2. respectively and the data requirement for the two attacks is 2..作者: Cloudburst 時間: 2025-3-30 04:17
Optische Werkstoffeigenschaften,entations of most of the root-finding variants presented in this work. As a result, we find that one of the variants provides security with respect to all vulnerabilities as well as competitive computation time for code parameters that minimize the public key size.作者: implore 時間: 2025-3-30 10:07 作者: grounded 時間: 2025-3-30 15:42 作者: Narcissist 時間: 2025-3-30 18:45
n adversary to recover the key by using a standard time-memory trade-off strategy. On its best setting the attack has a complexity as low as 2 ·2., while this should be 2. for a good scheme. Taking AES-128 as an example this would result in an attack with complexity of 2..作者: 鬼魂 時間: 2025-3-30 22:43
very much relevant to the design of animated CAPTCHAs. In this paper, we show that animated CAPTCHAs not designed with this principle in mind can be easily be broken using simple techniques to extract individual characters from the animation frames. We present our experimental results on attacking 13 existing animated CAPTCHAs.作者: paltry 時間: 2025-3-31 04:06
nfrastructure. Building on a secure unauthenticated 1-round 2-party key establishment . with perfect forward secrecy as auxiliary input, . is transformed into an authenticated group key establishment protocol with perfect forward secrecy and with one more round than ..作者: Buttress 時間: 2025-3-31 05:14 作者: 易怒 時間: 2025-3-31 12:06 作者: BRAND 時間: 2025-3-31 16:15
eaches of the trust infrastructure. We had simplicity, flexibility, and scalability in mind, solving the problem within the context of the protocol (with the underlying goal of embedding the solution in the TLS layer) with minor field changes, minimal cryptographic additions, no interaction with other protocol layers, and no added trusted parties.作者: 凹處 時間: 2025-3-31 21:26
Organische Werkstoffe. Kunststoffe, than the contents, of the intersection – we denote this problem as Private Set Intersection Cardinality (PSI-CA). This paper explores a few PSI-CA variations and constructs several protocols that are more efficient than the state-of-the-art.作者: 流浪 時間: 2025-3-31 23:07 作者: 心胸狹窄 時間: 2025-4-1 03:54 作者: 兇殘 時間: 2025-4-1 07:30
Fast and Private Computation of Cardinality of Set Intersection and Union than the contents, of the intersection – we denote this problem as Private Set Intersection Cardinality (PSI-CA). This paper explores a few PSI-CA variations and constructs several protocols that are more efficient than the state-of-the-art.作者: Indent 時間: 2025-4-1 10:22 作者: galley 時間: 2025-4-1 14:59 作者: HARP 時間: 2025-4-1 18:57
A Simple Key-Recovery Attack on McOE-Xttack is based on the observation that in McOE-X the key is changed for every block of message that is encrypted in a deterministic way. This allows an adversary to recover the key by using a standard time-memory trade-off strategy. On its best setting the attack has a complexity as low as 2 ·2., wh作者: Carcinogenesis 時間: 2025-4-2 01:04 作者: 錯事 時間: 2025-4-2 03:12 作者: Detoxification 時間: 2025-4-2 08:55
Differential and Linear Attacks on the Full WIDEA-, Block Ciphers (under Weak Keys)cks include the use of differential and linear relation patterns that allow to bypass the diffusion provided by MDS codes altogether. Therefore, we can attack only a single IDEA instance out of . copies, effectively using a narrow trail for the propagation of differences and masks across WIDEA-.. In
