Selected Areas in Cryptography B

28 papers

YearTitle / Authors
2001A Differential Attack on Reduced-Round SC2000.
Håvard Raddum, Lars R. Knudsen
2001A Practical Cryptanalysis of SSC2.
Philip Hawkes, Frank Quick, Gregory G. Rose
2001A Simple Algebraic Representation of Rijndael.
Niels Ferguson, Richard Schroeppel, Doug Whiting
2001Algorithms for Multi-exponentiation.
Bodo Möller
2001An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic.
Brian King
2001Analysis of the E
Scott R. Fluhrer, Stefan Lucks
2001Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case.
Amr M. Youssef, Guang Gong
2001Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves.
Jean-Sébastien Coron, David M'Raïhi, Christophe Tymen
2001Fast Multiplication of Integers for Public-Key Applications.
Gurgen H. Khachatrian, Melsik K. Kuregian, Karen R. Ispiryan, James L. Massey
2001Fast Normal Basis Multiplication Using General Purpose Processors.
Arash Reyhani-Masoleh, M. Anwarul Hasan
2001Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form.
Toru Akishita
2001Generalized Zig-zag Functions and Oblivious Transfer Reductions.
Paolo D'Arco, Douglas R. Stinson
2001Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.
Liam Keliher, Henk Meijer, Stafford E. Tavares
2001Key Revocation with Interval Cover Families.
Johannes Blömer, Alexander May
2001Linear Codes in Constructing Resilient Functions with High Nonlinearity.
Enes Pasalic, Subhamoy Maitra
2001New (Two-Track-)MAC Based on the Two Trails of RIPEMD.
Bert den Boer, Bart Van Rompay, Bart Preneel, Joos Vandewalle
2001New Covering Radius of Reed-Muller Codes for t-Resilient Functions.
Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa
2001On the Complexity of Matsui's Attack.
Pascal Junod
2001On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication.
Yasuyuki Sakai, Kouichi Sakurai
2001Polynomial Reconstruction Based Cryptography.
Aggelos Kiayias, Moti Yung
2001Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms.
Fabian Kuhn, René Struik
2001Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers
Serge Vaudenay, Amr M. Youssef
2001The GH Public-Key Cryptosystem.
Guang Gong, Lein Harn, Huapeng Wu
2001The Two Faces of Lattices in Cryptology.
Phong Q. Nguyen
2001Timed-Release Cryptography.
Wenbo Mao
2001Two Topics in Hyperelliptic Cryptography.
Florian Hess, Gadiel Seroussi, Nigel P. Smart
2001Weaknesses in the Key Scheduling Algorithm of RC4.
Scott R. Fluhrer, Itsik Mantin, Adi Shamir
2001XTR Extended to GF(p
Seongan Lim, Seungjoo Kim, Ikkwon Yie, Jaemoon Kim, Hongsub Lee