Titlebook: Information Security and Cryptology – ICISC 2006; 9th International Co Min Surp Rhee,Byoungcheon Lee Conference proceedings 2006 Springer-V

畸齒矯正學(xué)

書目名稱Information Security and Cryptology – ICISC 2006影響因子(影響力)




書目名稱Information Security and Cryptology – ICISC 2006影響因子(影響力)學(xué)科排名




書目名稱Information Security and Cryptology – ICISC 2006網(wǎng)絡(luò)公開度




書目名稱Information Security and Cryptology – ICISC 2006網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Information Security and Cryptology – ICISC 2006被引頻次




書目名稱Information Security and Cryptology – ICISC 2006被引頻次學(xué)科排名




書目名稱Information Security and Cryptology – ICISC 2006年度引用




書目名稱Information Security and Cryptology – ICISC 2006年度引用學(xué)科排名




書目名稱Information Security and Cryptology – ICISC 2006讀者反饋




書目名稱Information Security and Cryptology – ICISC 2006讀者反饋學(xué)科排名

過分

Generic Attacks on Symmetric Cipherspecially with respect to DES. An interesting variant of exhaustive search is to use a so-called time-memory trade-off (TMTO) attack. This attack and its many variants will be described and recent research on TMTO attacks will be surveyed. The effectiveness of generic attacks is determined by improve

幾何學(xué)家

Improved Collision Attack on the Hash Function Proposed at PKC’98sh computations, while the previous attack of Chang . presented at SAC?2002 has a complexity of about 2. hash computations. In the analysis of the hash function we combined existing approaches with recent results in cryptanalysis of hash functions. We show that message-dependent rotations can be exp

MAZE

Birthday Paradox for Multi-collisionsshing .=.. times. We first show that this probability is at most 1/.! which is very small for large .. We next show that by hashing (.!). ×. times, an .-collision is found with probability approximately 0.5 for sufficiently large .. Note that if .=2, it coincides with the usual birthday paradox. Hen

Multiple

New Variant of the Self-Shrinking Generator and Its Cryptographic Propertiese the selection rule is determined by the XORed value of a couple of bits. It is shown that the period and the linear complexity of an output sequence of SSG-XOR are better than those of the self-shrinking generator. It is also shown that the SSG-XOR generator has meaningful advantages from the view

Dealing

On Constructing of a 32 ×32 Binary Matrix as a Diffusion Layer for a 256-Bit Block Cipher of matrices for increasing efficiency in software implementations of the binary matrix. We estimate a security against cryptanlysis when the binary matrix is used as a diffusion layer of a 256-bit SPN block cipher with an 8-bit s-box as a substitution layer in a round function. Also we describe the

Ostrich

On Algebraic Immunity and Annihilators for computing the optimal annihilator of . and .(.) are inefficient. This work consists of two parts. In the first part, we extend the concept of algebraic immunity. In particular, we argue that a function . may be replaced by another boolean function .. called the algebraic complement of .. This m

喃喃而言

High-Speed RSA Crypto-processor with Radix-4 Modular Multiplication and Chinese Remainder Theoremth modified radix-4 Montgomery multiplication algorithm and Chinese Remainder Theorem (CRT). Our design takes 0.84M clock cycles for a 1024-bit modular exponentiation and 0.25M clock cycles for two 512-bit exponentiations. Using 0.18 um standard cell library, the processor achieves 365Kbps for a 102

Congruous

Obscure