Titlebook: Research in Cryptology; Second Western Europ Stefan Lucks,Ahmad-Reza Sadeghi,Christopher Wolf Conference proceedings 2008 Springer-Verlag B

中間時(shí)期

書目名稱Research in Cryptology影響因子(影響力)




書目名稱Research in Cryptology影響因子(影響力)學(xué)科排名




書目名稱Research in Cryptology網(wǎng)絡(luò)公開度




書目名稱Research in Cryptology網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Research in Cryptology被引頻次




書目名稱Research in Cryptology被引頻次學(xué)科排名




書目名稱Research in Cryptology年度引用




書目名稱Research in Cryptology年度引用學(xué)科排名




書目名稱Research in Cryptology讀者反饋




書目名稱Research in Cryptology讀者反饋學(xué)科排名

squander

SLAY

0302-9743 systems and their integration into secure systems, secure operating systems and trusted computing, applications such as watermarking and code obfuscation.978-3-540-88352-4978-3-540-88353-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

偽證

A Privacy Protection Scheme for a Scalable Control Method in Context-Dependent Services,e to be determined by terminals such as GPS. However, GPS has efficiency (it must collect as many contexts as possible to provide services appropriately) and privacy problems (all data is concentrated on one place). Previous studies have addressed only either one of the two problems. We propose a sc

dragon

抱怨

Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256,arch methods of SHA-256 can be described by means of conditions on and between state and message bits. We describe a tool for efficient automatic searching of message pairs conforming to useful sets of conditions, . stemming from (interleaved) local collisions. We not only considerably improve upon

GILD

Efficient Hash Collision Search Strategies on Special-Purpose Hardware,ctions which are mostly members of the so-called MD4-family. This work shows whether it is possible to significantly speedup collision search for MD4-family hash functions using special-purpose hardware. A thorough analysis of the computational requirements for MD4-family hash functions and correspo

冬眠

ACME

encyclopedia

Preimages for Reduced-Round Tiger, on the compression function of Tiger-12, i.e., Tiger reduced to 12 rounds out of 24, with a complexity of 2. compression function evaluations. We show how this can be used to construct second preimages with complexity 2. and first preimages with complexity 2. for Tiger-12. These attacks can also be