Titlebook: Topics in Cryptology -- CT-RSA 2003; The Cryptographers‘ Marc Joye Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003 RSA.

收集

Montgomery Prime Hashing for Message Authenticationance is comparable to that of other high-speed schemes such as MMH. An advantage of MPH is that the secret key (i.e., the modulus) is small, typically 128–256 bits, while in MMH the secret key is typically much larger.I n applications where MMH key length is problematic, MPH may be an attractive alternative.

Engaged

取回

Invisibility and Anonymity of Undeniable and Confirmer Signaturesnatures. We give a precise definition of anonymity for undeniable and confirmer signatures in the multi-user setting and show that anonymity and invisibility are closely related. Finally, we show that anonymity can be achieved even when the parties use completely different cryptographic primitives.

周兴旺

Efficient , ,) Arithmetic Architectures for Cryptographic Applicationsour architectures for the special case of .(3.) on the XCV1000-8-FG1156 and XC2VP20-7-FF1156 FPGAs and provide area/performance numbers and comparisons to previous .(3.) and .(2.) implementations. Finally, we provide tables of irreducible polynomials over .(3) of degree m with 2 ≤ m ≤ 255.

懒鬼才会衰弱

Highbrow

Hardware Performance Characterization of Block Cipher Structuresecause the discussed structures are similar to many existing ciphers (e.g., Rijndael, Camellia, Hierocrypt, and Anubis), the analysis provides a meaningful mechanism for seeking efficient ciphers through a wide comparison of performance, complexity, and security.

evanescent

Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes length-preserving mixes. The conventional definition of security against chosen ciphertext attacks is not applicable to length-preserving mixes; we give an appropriate definition and show that our construction achieves provable security.

choroid

TMAC: Two-Key CBC MACngth. We achieve this by using a universal hash function and the cost is almost negligible. Similar to XCBC, the domain is 0, 1. and it requires no extra invocation of . even if the size of the message is a multiple of ..

昏暗

Foam-Cells