標(biāo)題: Titlebook: Cryptography and Coding; 10th IMA Internation Nigel P. Smart Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Signcryptio [打印本頁] 作者: 平凡人 時(shí)間: 2025-3-21 20:05
書目名稱Cryptography and Coding影響因子(影響力)
書目名稱Cryptography and Coding影響因子(影響力)學(xué)科排名
書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度
書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cryptography and Coding被引頻次
書目名稱Cryptography and Coding被引頻次學(xué)科排名
書目名稱Cryptography and Coding年度引用
書目名稱Cryptography and Coding年度引用學(xué)科排名
書目名稱Cryptography and Coding讀者反饋
書目名稱Cryptography and Coding讀者反饋學(xué)科排名
作者: 彈藥 時(shí)間: 2025-3-21 20:46 作者: prolate 時(shí)間: 2025-3-22 01:43 作者: nocturia 時(shí)間: 2025-3-22 04:54
A Trellis-Based Bound on (2,1)-Separating Codes codes find applications in digital fingerprinting and broadcast encryption for example. We conjecture some bounds on the higher weights, whose proof would considerably strengthen the upper bound on the rate of (2,1)-separating codes.作者: 善辯 時(shí)間: 2025-3-22 11:56
Hash Based Digital Signature Schemesplications, but their importance may increase if ever a practical quantum computer was built. We discuss issues related to both their implementation and their security. As far as we are aware this is the first complete treatment of practical implementations of hash based signature schemes in the literature.作者: Choreography 時(shí)間: 2025-3-22 14:01 作者: Choreography 時(shí)間: 2025-3-22 19:29
Partial Key Recovery Attacks on XCBC, TMAC and OMACs against all three of these schemes are described, yielding upper bounds on the effective security level. The results imply that there is relatively little to be gained practically through the introduction of these schemes by comparison with other well-established MAC functions.作者: RECUR 時(shí)間: 2025-3-22 23:21
https://doi.org/10.1007/978-981-99-6222-8 For example, one can prove a lower bound on the complexity of computing discrete logarithms in a cyclic group if one considers only generic algorithms which can not exploit the properties of the representation of the group elements..We propose an abstract model of computation which allows to captur作者: 懸崖 時(shí)間: 2025-3-23 03:29
Web Information Systems and Applicationss area was the elegant solution by Boneh and Franklin [8] of the problem of efficient identity-based encryption. At the same time, the security standards for public key cryptosystems are expected to increase, so that in the future they will be capable of providing security equivalent to 128-, 192-, 作者: 幼兒 時(shí)間: 2025-3-23 08:16 作者: 導(dǎo)師 時(shí)間: 2025-3-23 10:55 作者: Grating 時(shí)間: 2025-3-23 15:32 作者: 前兆 時(shí)間: 2025-3-23 18:15 作者: 消音器 時(shí)間: 2025-3-24 01:13 作者: 脫離 時(shí)間: 2025-3-24 05:27
Alessandro Visintin,Mauro Contiplications, but their importance may increase if ever a practical quantum computer was built. We discuss issues related to both their implementation and their security. As far as we are aware this is the first complete treatment of practical implementations of hash based signature schemes in the lit作者: 投射 時(shí)間: 2025-3-24 06:44
Manel BenSassi,Maher Abbes,Faten Atiguiology of Cramer and Shoup combined with a secure signature scheme..We describe an instantiation of our construction that provides all the functionality of a signature scheme and of an encryption scheme. This instantiation is more efficient than similar constructions proposed to-date.作者: 階層 時(shí)間: 2025-3-24 14:42
Alessandro Visintin,Mauro Conti undeniable signature schemes. There appears to be no formal security modelling for NIDV undeniable signatures or for NIDV proofs in general. Indeed, recent work by Wang has shown the original NIDV undeniable signature scheme of Jakobsson . to be flawed. We argue that NIDV proofs may have applicatio作者: 萬神殿 時(shí)間: 2025-3-24 18:24 作者: muscle-fibers 時(shí)間: 2025-3-24 20:17
Ghada Ben Abdennour,Karim Gasmi,Ridha Ejbalightness of its security reduction is investigated in detail. Our new on-line single-key AIL-MAC construction, the PDI-construction, transforms any FIL-MAC into an AIL-MAC and is superior to all previous AIL-MAC constructions given in the literature (taking the tradeoff into account). It appears obvi作者: geriatrician 時(shí)間: 2025-3-25 02:58 作者: 水土 時(shí)間: 2025-3-25 05:24
Lecture Notes in Computer Science128-bit and 256-bit keys, respectively. Since these ciphers use very simple key scheduling and controlled permutation (CP) for fast hardware encryption, they are suitable for wireless communications networks which require high-speed networks. Actually, these ciphers have better hardware performances作者: BRINK 時(shí)間: 2025-3-25 09:06 作者: 我們的面粉 時(shí)間: 2025-3-25 12:18 作者: Fatten 時(shí)間: 2025-3-25 17:13 作者: URN 時(shí)間: 2025-3-25 22:58
Wearable Transdermal Biosensorseven more recently Ding and Gower showed that PMI can be repaired with the Plus (+) method of externally adding as few as 10 randomly chosen quadratic polynomials. Since relatively few extra polynomials are added, the attack complexity of a Gr?bner basis attack on PMI+ will be roughly equal to that 作者: nitroglycerin 時(shí)間: 2025-3-26 00:55
https://doi.org/10.1007/978-981-99-8122-9In this paper we discuss the idea of block cipher embeddings and consider a natural algebraic framework for such constructions. In this approach we regard block cipher state spaces as algebras and study some properties of cipher extensions on larger algebras. We apply this framework to some well-known examples of AES embeddings.作者: CUB 時(shí)間: 2025-3-26 05:58
An Algebraic Framework for Cipher EmbeddingsIn this paper we discuss the idea of block cipher embeddings and consider a natural algebraic framework for such constructions. In this approach we regard block cipher state spaces as algebras and study some properties of cipher extensions on larger algebras. We apply this framework to some well-known examples of AES embeddings.作者: Indecisive 時(shí)間: 2025-3-26 08:34 作者: filial 時(shí)間: 2025-3-26 14:17 作者: 緩和 時(shí)間: 2025-3-26 17:24 作者: 粘 時(shí)間: 2025-3-26 23:11 作者: 食品室 時(shí)間: 2025-3-27 03:32 作者: meditation 時(shí)間: 2025-3-27 08:04
Alessandro Visintin,Mauro Contiplications, but their importance may increase if ever a practical quantum computer was built. We discuss issues related to both their implementation and their security. As far as we are aware this is the first complete treatment of practical implementations of hash based signature schemes in the literature.作者: MITE 時(shí)間: 2025-3-27 11:28 作者: macabre 時(shí)間: 2025-3-27 16:17 作者: Aspiration 時(shí)間: 2025-3-27 18:32
Alessandro Visintin,Mauro Contil NIDV proof systems, and one specifically for NIDV undeniable signatures..We go on to repair the NIDV proofs of Jakobsson ., producing secure NIDV proofs suited to combination with Chaum’s original undeniable signature scheme resulting in a secure and efficient concrete NIDV undeniable signature scheme.作者: 品嘗你的人 時(shí)間: 2025-3-27 22:28
Lecture Notes in Computer ScienceH64 and Cobra-H128 are vulnerable to related-key differential attacks. We first describe how to construct full-round related-key differential characteristics of Cobra-H64 and Cobra-H128 with high probabilities and then we exploit them to attack full-round Cobra-H64 with a complexity of 2. and Cobra-H128 with a complexity of 2..作者: 地名詞典 時(shí)間: 2025-3-28 03:46
Non-interactive Designated Verifier Proofs and Undeniable Signaturesl NIDV proof systems, and one specifically for NIDV undeniable signatures..We go on to repair the NIDV proofs of Jakobsson ., producing secure NIDV proofs suited to combination with Chaum’s original undeniable signature scheme resulting in a secure and efficient concrete NIDV undeniable signature scheme.作者: geriatrician 時(shí)間: 2025-3-28 09:18 作者: Mammal 時(shí)間: 2025-3-28 12:12 作者: 低三下四之人 時(shí)間: 2025-3-28 15:39
Web 3.0: Concept, Content and Contextto correct the bit with the lowest extrinsic information is proposed and analyzed. The performance is improved as expected from simulation results as compared to the conventional scheme especially in error floor region.作者: 綁架 時(shí)間: 2025-3-28 20:41 作者: Verify 時(shí)間: 2025-3-28 23:12
Alessandro Visintin,Mauro Contistructural property for the AES S-box, which also holds for a large class of permutation functions when the dimension . is even. Moreover, we prove a relation with the propagation characteristics of a vectorial function and extend the scope of non-APN functions for . even.作者: LINES 時(shí)間: 2025-3-29 06:59
Hongjiao Liu,Shan Xue,Jian Yang,Jia Wulaborious and error prone as their complexity increases. We investigate techniques for automating this process and find that effective solutions can be constructed with only minor amounts of computational effort.作者: Alcove 時(shí)間: 2025-3-29 09:40 作者: Addictive 時(shí)間: 2025-3-29 14:09 作者: Chromatic 時(shí)間: 2025-3-29 18:49
Normality of Vectorial Functionsstructural property for the AES S-box, which also holds for a large class of permutation functions when the dimension . is even. Moreover, we prove a relation with the propagation characteristics of a vectorial function and extend the scope of non-APN functions for . even.作者: 美食家 時(shí)間: 2025-3-29 19:49 作者: 舔食 時(shí)間: 2025-3-30 03:21 作者: Allowance 時(shí)間: 2025-3-30 04:23 作者: 要求比…更好 時(shí)間: 2025-3-30 11:01
Pairing-Based Cryptography at High Security Levelss area was the elegant solution by Boneh and Franklin [8] of the problem of efficient identity-based encryption. At the same time, the security standards for public key cryptosystems are expected to increase, so that in the future they will be capable of providing security equivalent to 128-, 192-, 作者: Debility 時(shí)間: 2025-3-30 16:10 作者: 賠償 時(shí)間: 2025-3-30 18:51 作者: 通便 時(shí)間: 2025-3-31 00:31
A Trellis-Based Bound on (2,1)-Separating Codes codes find applications in digital fingerprinting and broadcast encryption for example. We conjecture some bounds on the higher weights, whose proof would considerably strengthen the upper bound on the rate of (2,1)-separating codes.作者: Coordinate 時(shí)間: 2025-3-31 02:19 作者: 分開 時(shí)間: 2025-3-31 05:45 作者: Classify 時(shí)間: 2025-3-31 11:33
Hash Based Digital Signature Schemesplications, but their importance may increase if ever a practical quantum computer was built. We discuss issues related to both their implementation and their security. As far as we are aware this is the first complete treatment of practical implementations of hash based signature schemes in the lit作者: Manifest 時(shí)間: 2025-3-31 16:28
A General Construction for Simultaneous Signing and Encryptingology of Cramer and Shoup combined with a secure signature scheme..We describe an instantiation of our construction that provides all the functionality of a signature scheme and of an encryption scheme. This instantiation is more efficient than similar constructions proposed to-date.作者: 悲痛 時(shí)間: 2025-3-31 18:37 作者: arousal 時(shí)間: 2025-3-31 23:01 作者: Euthyroid 時(shí)間: 2025-4-1 01:50 作者: Jejune 時(shí)間: 2025-4-1 07:05 作者: 令人苦惱 時(shí)間: 2025-4-1 11:02 作者: BAN 時(shí)間: 2025-4-1 18:04 作者: 惹人反感 時(shí)間: 2025-4-1 21:20 作者: dry-eye 時(shí)間: 2025-4-2 00:13
Efficient Countermeasures for Thwarting the SCA Attacks on the Frobenius Based Methodsic (.). However, on devices with small resources, scalar multiplication algorithms using Frobenius are, as the usual double-and-add algorithms, vulnerable to Side Channel Attacks (SCA). The more successful countermeasure for thwarting the SCA attacks on the Frobenius-based . – . method seems to be t
