標(biāo)題: Titlebook: Selected Areas in Cryptography; 19th International C Lars R. Knudsen,Huapeng Wu Conference proceedings 2013 Springer-Verlag Berlin Heidelbe [打印本頁(yè)] 作者: graphic 時(shí)間: 2025-3-21 16:04
書(shū)目名稱Selected Areas in Cryptography影響因子(影響力)
書(shū)目名稱Selected Areas in Cryptography影響因子(影響力)學(xué)科排名
書(shū)目名稱Selected Areas in Cryptography網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Selected Areas in Cryptography網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Selected Areas in Cryptography被引頻次
書(shū)目名稱Selected Areas in Cryptography被引頻次學(xué)科排名
書(shū)目名稱Selected Areas in Cryptography年度引用
書(shū)目名稱Selected Areas in Cryptography年度引用學(xué)科排名
書(shū)目名稱Selected Areas in Cryptography讀者反饋
書(shū)目名稱Selected Areas in Cryptography讀者反饋學(xué)科排名
作者: 制定 時(shí)間: 2025-3-22 00:12
https://doi.org/10.1007/978-3-642-35999-6blowfish; digital signature; keyword search; meet-in-the-middle attack; smart cards; algorithm analysis a作者: Allowance 時(shí)間: 2025-3-22 02:42 作者: 馬籠頭 時(shí)間: 2025-3-22 07:45
Selected Areas in Cryptography978-3-642-35999-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Kernel 時(shí)間: 2025-3-22 12:20 作者: Osmosis 時(shí)間: 2025-3-22 16:46 作者: 集中營(yíng) 時(shí)間: 2025-3-22 20:53
An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphersfferences for a given input difference and to combine the information derived from them in an optimal way. We then propose a new attack that implicitly mounts several standard, truncated, impossible, improbable and possible future variants of differential attacks in parallel and hence allows to sign作者: 誹謗 時(shí)間: 2025-3-22 21:32
A New Method for Solving Polynomial Systems with Noise over , and Its Applications in Cold Boot Key e ground field is .. In this paper, we present a new method called . for solving the family of Max-PoSSo problems over .. This method is based on the ideas of incrementally solving polynomial system and searching the values of polynomials with backtracking. The . method can be combined with differen作者: exorbitant 時(shí)間: 2025-3-23 02:19
Cryptanalysis of the Xiao – Lai White-Box AES Implementationrsary has full access to the implementation and its execution environment. In 2002, Chow . presented a white-box AES implementation which aims at preventing key-extraction in the white-box attack context. However, in 2004, Billet . presented an efficient practical attack on Chow .’s white-box AES im作者: appall 時(shí)間: 2025-3-23 06:46 作者: Chagrin 時(shí)間: 2025-3-23 10:23
Forward Secure Signatures on Smart CardsMSS. In contrast to the only previous implementation of a hash-based signature scheme on smart cards by Rohde et al., we solve the problem of on-card key generation. Compared to XMSS, we reduce the key generation time from . to ., where . is the number of signatures that can be created with one key 作者: 豪華 時(shí)間: 2025-3-23 17:52
Extracts from the SHA-3 Competition1, 2] and at Crypto 2005 [3, 4]. Collisions were given for the hash functions MD4, MD5, RIPEMD and SHA-0. An algorithm was shown that can produce collisions for SHA-1 with a complexity that is much lower than previously thought. Before 2005, there were already partial attacks known for several of th作者: Negotiate 時(shí)間: 2025-3-23 18:35
Cryptanalysis of the “Kindle” Ciphercademic cryptanalysis of this cipher and it shows that PC1 is a very weak stream cipher, and can be practically broken in a known-plaintext and even in a ciphertext-only scenario..A hash function based on this cipher has also been proposed and is implemented in the binary editor WinHex. We show that作者: Ibd810 時(shí)間: 2025-3-23 22:41
Cryptographically Strong de Bruijn Sequences with Large Periods the feedback functions that generate de Bruijn sequences. The cycle structures of the approximated feedback functions and the linear complexity of a sequence produced by an approximated feedback function are determined. Furthermore, we present a compact representation of an (.?+?16)-stage nonlinear作者: resilience 時(shí)間: 2025-3-24 05:49
Cryptanalysis of the Loiss Stream Cipherists of a linear feedback shift register (LFSR) and a non-linear finite state machine (FSM). Loiss utilizes a structure called Byte-Oriented Mixer with Memory (BOMM) in its filter generator, which aims to improve resistance against algebraic attacks, linear distinguishing attacks and fast correlatio作者: exclamation 時(shí)間: 2025-3-24 08:26
Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three3 and their equivalent Hessian curves over finite fields of characteristic three. The cost of basic point operations is lower than that of all previously proposed ones. The new doubling, mixed addition and tripling formulae in projective coordinates require 3.?+?2., 8.?+?1.?+?1. and 4.?+?4.?+?1. res作者: HALL 時(shí)間: 2025-3-24 11:43 作者: Ovulation 時(shí)間: 2025-3-24 16:17
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over ,ring at the 128-bit security level in less than one milli-second. The high performance of their cryptoprocessor comes largely from the use of the Karatsuba method for field multiplication. In this article, for the same type of pairing we propose hybrid sequential/parallel multipliers based on the To作者: 群島 時(shí)間: 2025-3-24 22:16
Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllersremote access and control systems or all sort of sensors. Yet the feasibility and practicability of standardized cryptography on 4-bit MCUs has been mostly neglected. In this work we close this gap and provide, to the best of our knowledge, the first implementations of . and ., and the fastest imple作者: 修剪過(guò)的樹(shù)籬 時(shí)間: 2025-3-25 02:08
All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approachstrictive. In other words, most of the recent MITM attacks work only on block ciphers consisting of a bit permutation based key schedule such as KTANTAN, GOST, IDEA, XTEA, LED and Piccolo. In this paper, we extend the MITM attack so that it can be applied to a wider class of block ciphers. In our ap作者: 可觸知 時(shí)間: 2025-3-25 05:50 作者: 為現(xiàn)場(chǎng) 時(shí)間: 2025-3-25 10:13 作者: incisive 時(shí)間: 2025-3-25 14:42 作者: 蠟燭 時(shí)間: 2025-3-25 16:56 作者: 手術(shù)刀 時(shí)間: 2025-3-25 20:49
The Boomerang Attacks on the Round-Reduced Skein-512imitive operations: modular addition, rotation and bitwise XOR (ARX). This paper studies the boomerang attacks on Skein-512. Boomerang distinguishers on the compression function reduced to 32 and 36 rounds are proposed, with time complexities 2. and 2. hash computations respectively. Examples of the作者: Judicious 時(shí)間: 2025-3-26 01:11
A Practical Leakage-Resilient Signature Scheme in the Generic Group Modelciency is close to that of non leakage-resilient pairing-based signature schemes. It tolerates leakage of almost half of the bits of the secret key at every new signature invocation. We prove the security of the new scheme in the generic bilinear group model.作者: 不能約 時(shí)間: 2025-3-26 05:41
Cryptanalysis of the “Kindle” Ciphern a ciphertext-only scenario..A hash function based on this cipher has also been proposed and is implemented in the binary editor WinHex. We show that this hash function is also vulnerable to a practical attack, which can produce meaningful collisions or second pre-images.作者: 平庸的人或物 時(shí)間: 2025-3-26 11:43
An All-In-One Approach to Differential Cryptanalysis for Small Block CiphersTAN-32. In particular, our attack allows us to break 115 rounds of KATAN-32. For this, our attack exploits the non-uniformity of the difference distribution after 91 rounds which is 20 rounds more than the previously best known differential characteristic.作者: Lipoma 時(shí)間: 2025-3-26 14:05 作者: 令人不快 時(shí)間: 2025-3-26 18:13 作者: Irrepressible 時(shí)間: 2025-3-26 22:44 作者: immunity 時(shí)間: 2025-3-27 04:16 作者: 向下五度才偏 時(shí)間: 2025-3-27 05:19 作者: crescendo 時(shí)間: 2025-3-27 11:09 作者: Nomogram 時(shí)間: 2025-3-27 14:12
Cryptographically Strong de Bruijn Sequences with Large Periods feedback shift register (NLFSR) and a few examples of de Bruijn sequences of period 2.,? 35?≤?.?≤?40, which are generated by the recursively constructed NLFSR together with the evaluation of their implementation.作者: 相符 時(shí)間: 2025-3-27 18:11 作者: Ballad 時(shí)間: 2025-3-28 01:19
0302-9743 sis, digital signatures, stream ciphers, implementations, block cipher cryptanalysis, lattices, hashfunctions, blockcipher constructions, and miscellaneous.978-3-642-35998-9978-3-642-35999-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 培養(yǎng) 時(shí)間: 2025-3-28 04:23
0302-9743 ed post-conference proceedings of the 19th International Conference on Selected Areas in Cryptography, SAC 2012, held in Windsor, Ontario, Canada, in August 2012.The 24 papers presented were carefully reviewed and selected from 87 submissions. They are organized in topical sections named: cryptanaly作者: AND 時(shí)間: 2025-3-28 08:01 作者: Agility 時(shí)間: 2025-3-28 13:49 作者: MIME 時(shí)間: 2025-3-28 18:11
Improved Cryptanalysis of the Block Cipher KASUMIifferential attack on the last 7 rounds needs 2. encryptions with 2. chosen plaintexts. For the attack on the first 7 rounds, the data complexity is 2. known plaintexts and the time complexity is 2. encryptions.作者: endoscopy 時(shí)間: 2025-3-28 19:07
Meet-in-the-Middle Technique for Integral Attacks against Feistel Ciphersique is demonstrated for several Feistel ciphers. Improvements on integral attacks against LBlock, HIGHT, and CLEFIA are presented. Particularly, the number of attacked rounds with integral analysis is extended for LBlock.作者: Defraud 時(shí)間: 2025-3-29 00:14
Conference proceedings 20132012, held in Windsor, Ontario, Canada, in August 2012.The 24 papers presented were carefully reviewed and selected from 87 submissions. They are organized in topical sections named: cryptanalysis, digital signatures, stream ciphers, implementations, block cipher cryptanalysis, lattices, hashfunctio作者: Liberate 時(shí)間: 2025-3-29 03:29
Martin R. Albrecht,Gregor Leander heart of these techniques is ., which has played a critical role in both deterministic and stochastic control theory since the 1960s. The material in this chapter is more advanced than that of previous ones, it involves some results that were published in the research literature fairly recently, an作者: 要塞 時(shí)間: 2025-3-29 08:31
Zhenyu Huang,Dongdai Lins. An operator or function defined in such a way is often called ‘derived’ for this reason.However, we may well find difficulty in producing an explicit definition for a number of reasons: the result of the function may not be expressible in a single formula, but may require a number of assertions t作者: PHAG 時(shí)間: 2025-3-29 11:26
Yoni De Mulder,Peter Roelse,Bart Preneels. An operator or function defined in such a way is often called ‘derived’ for this reason.However, we may well find difficulty in producing an explicit definition for a number of reasons: the result of the function may not be expressible in a single formula, but may require a number of assertions t作者: 小爭(zhēng)吵 時(shí)間: 2025-3-29 17:27
David Galindo,Srinivas Viveks. An operator or function defined in such a way is often called ‘derived’ for this reason.However, we may well find difficulty in producing an explicit definition for a number of reasons: the result of the function may not be expressible in a single formula, but may require a number of assertions t作者: thrombosis 時(shí)間: 2025-3-29 22:48
Andreas Hülsing,Christoph Busold,Johannes Buchmanns. An operator or function defined in such a way is often called ‘derived’ for this reason.However, we may well find difficulty in producing an explicit definition for a number of reasons: the result of the function may not be expressible in a single formula, but may require a number of assertions t作者: Deadpan 時(shí)間: 2025-3-30 02:20
Vincent Rijmens. An operator or function defined in such a way is often called ‘derived’ for this reason.However, we may well find difficulty in producing an explicit definition for a number of reasons: the result of the function may not be expressible in a single formula, but may require a number of assertions t作者: APO 時(shí)間: 2025-3-30 05:58 作者: Peculate 時(shí)間: 2025-3-30 10:57 作者: 妨礙 時(shí)間: 2025-3-30 15:49
Efficient Implementation of Bilinear Pairings on ARM Processors study the efficiency of using M-type sextic twists in the pairing computation and carry out a detailed comparison between affine and projective coordinate systems. Our implementations on various mass-market smartphones and tablets significantly improve the state-of-the-art of pairing computation on作者: 斗志 時(shí)間: 2025-3-30 19:29 作者: Innovative 時(shí)間: 2025-3-30 21:09
Attacking (EC)DSA Given Only an Implicit Hinte middle. Under the Gaussian heuristic assumption, theoretical bounds on the number of shared bits in function of the number of signed messages are proven. Experimental results show that we are often able to go a few bits beyond the theoretical bound. For instance, if only 2 shared LSBs on each ephe作者: 進(jìn)入 時(shí)間: 2025-3-31 03:51
Lattice Reduction for Modular Knapsack for the low density knapsack problem, assuming a uniform distribution, where . is the dimension of the lattice, . is the bit length of the maximum norm of knapsack-type basis..We also provide some techniques when dealing with a principal ideal lattice basis, which can be seen as a special case of a作者: Figate 時(shí)間: 2025-3-31 05:39 作者: transplantation 時(shí)間: 2025-3-31 13:08 作者: liaison 時(shí)間: 2025-3-31 17:07
Keting Jia,Leibo Li,Christian Rechberger,Jiazhe Chen,Xiaoyun Wang作者: GULF 時(shí)間: 2025-3-31 19:45 作者: nitroglycerin 時(shí)間: 2025-4-1 00:25 作者: 糾纏,纏繞 時(shí)間: 2025-4-1 03:22
Alex Biryukov,Aleksandar Kircanski,Amr M. Youssefvia Logic and Proof. will suit intermediate undergraduates majoring in mathematics, computer science, engineering, and related subjects with no formal prerequisites beyond a background in secondary mathematics.978-3-030-25360-8978-3-030-25358-5Series ISSN 0172-6056 Series E-ISSN 2197-5604 作者: 等待 時(shí)間: 2025-4-1 09:01
en systems.Coverage includes control, communications, comput.This unique textbook comprehensively introduces the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that 作者: VICT 時(shí)間: 2025-4-1 10:49
Martin R. Albrecht,Gregor Leanderwe saw how special classes of Markov chains (mostly, birth–death chains) can be used to model queueing systems. We pointed out, however, that queueing theory is largely “descriptive” in nature; that is, its main objective is to evaluate the behavior of queueing systems operating under a particular s作者: Veneer 時(shí)間: 2025-4-1 17:09
