Titlebook: Cryptography and Coding; 13th IMA Internation Liqun Chen Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2011 anonymous

dissolution

arrogant

Ye Lei,Yupei Zhang,Yi Lin,Xuequn Shang-core extensions of the aforementioned machines. Finally, we combine previous techniques for parallelizing the eta pairing on a supersingular elliptic curve with embedding degree 4, and achieve an estimated 1.24-fold speedup on an 8-core extension of an Intel Core i7 over the previous best technique.

LAPSE

松紧带

The Symbiosis between Collision and Preimage Resistanceon its own is less powerful than previously thought. However, we prove that ., everywhere preimage resistance implies ‘ordinary’ (domain-based) preimage resistance. We show the implications of our result for iterated hash functions and hash chains, where the latter is related to the Winternitz one-time signature scheme.

disrupt

Enhanced Count of Balanced Symmetric Functions and Balanced Alternating Functions The non existence of balanced finite symmetric or alternating functions is proven under some conditions on ., ., and .. We also exhibit new results for new values of . and ., giving very large numbers of functions.

nonradioactive

FEAT

On the Efficient Implementation of Pairing-Based Protocolsw that even complex protocols may have a surprisingly efficient implementation. We also point out that in some cases the usually recommended pairing friendly curves may not in fact be optimal. We claim a new record with our implementation of a pairing at the AES-256 bit level.

连词

0302-9743 International Conference on Cryptography and Coding, IMACC 2011, held in Oxford, UK in December 2011. The 27 revised full papers presented together with one invited contribution were carefully reviewed and selected from 57 submissions. The papers cover a wide range of topics in the field of mathemat

CHAR

单挑

Chinese Academy of Cyberspace Studiesd call them .. We then generalise to complementary array sets, provide a construction for complementary sets of types I, II, and III over {1, − 1}, further specialize to a construction for all known 2 ×2 ×…×2 complementary array sets of types I, II, and III over {1, − 1}, and derive closed-form Boolean formulas for these cases.