Titlebook: Selected Areas in Cryptography; 6th Annual Internati Howard Heys,Carlisle Adams Conference proceedings 2000 Springer-Verlag Berlin Heidelbe

广大

Modeling Linear Characteristics of Substitution-Permutation Networkseration of the model is based on our observation that for sufficiently large s-boxes, the best linear characteristic usually involves one active s-box per round. We obtain a result which allows us to compute an upper bound on the probability that linear cryptanalysis using such a characteristic is f

极微小

SAGE

Security of E2 against Truncated Differential Cryptanalysisible attack on an 8-round variant of E2 without .-Function (the initial transformation) and .-Function (the final trans-formation) based on byte characteristics. To evaluate the security against attacks using truncated differentials, which mean bytewise differentials in this paper, we searched for a

byline

开始从未

我怕被刺穿

Efficient Implementation of Cryptosystems Based on Non-maximal Imaginary Quadratic Orderson is the factorization of the non-fundamental discriminant Δ. = Δ.... The NICE-cryptosystem (.ew .deal .oset .n-cryption) [., .] is an efficient variant thereof, which uses an element ., where . is random and ..: .(Δ.) → (Δ.) is a map between the class groups of the non-maximal and maximal order, t

群居动物

Improving and Extending the Lim/Lee Exponentiation Algorithms one precomputation for several computations in order to minimize the average time needed for one exponentiation. This paper generalizes the previous work proposing several improvements and a method for fast precomputation. The basic Lim/Lee algorithm is improved by determining the optimal segmenta

Jargon

Software Optimization of Decorrelation Module operation in the DFC cipher. We show that we can take advantage of the language and architecture properties in order to get efficient implementations..In this paper we use the ANSI C and the Java languages. We also investigate assembly code, and data structure alternatives. Finally, we show that we

MUMP

Pseudonym Systemsn such a way that a user can prove to one organization a statement about his relationship with another. Such a statement is called a credential. Previous work in this area did not protect the system against dishonest users who collectively use their pseudonyms and credentials, i.e., share an identit

刻苦读书

Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures unconditionally secure VSS. Then we construct a new proactive secret sharing scheme based on that VSS. In a proactive scheme, the shares are periodically renewed so that an adversary cannot get any information about the secret unless he is able to access a specified number of shares in a short time