default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSAC 2001: Toronto, Ontario, Canada
- Serge Vaudenay, Amr M. Youssef:
Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers. Lecture Notes in Computer Science 2259, Springer 2001, ISBN 3-540-43066-0
Cryptanalysis I
- Scott R. Fluhrer, Itsik Mantin, Adi Shamir:
Weaknesses in the Key Scheduling Algorithm of RC4. 1-24 - Philip Hawkes, Frank Quick, Gregory G. Rose:
A Practical Cryptanalysis of SSC2. 25-37 - Scott R. Fluhrer, Stefan Lucks:
Analysis of the E0 Encryption System. 38-48
Boolean Functions
- Amr M. Youssef, Guang Gong:
Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case. 49-59 - Enes Pasalic, Subhamoy Maitra:
Linear Codes in Constructing Resilient Functions with High Nonlinearity. 60-74 - Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa:
New Covering Radius of Reed-Muller Codes for t-Resilient Functions. 75-86 - Paolo D'Arco, Douglas R. Stinson:
Generalized Zig-zag Functions and Oblivious Transfer Reductions. 87-102
Rijndael
- Niels Ferguson, Richard Schroeppel, Doug Whiting:
A Simple Algebraic Representation of Rijndael. 103-111 - Liam Keliher, Henk Meijer, Stafford E. Tavares:
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. 112-128
Invited Talk I
- Aggelos Kiayias, Moti Yung:
Polynomial Reconstruction Based Cryptography. 129-133
Elliptic Curves and Efficient Implementation I
- Brian King:
An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic. 134-150 - Jean-Sébastien Coron, David M'Raïhi, Christophe Tymen:
Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves. 151-164 - Bodo Möller:
Algorithms for Multi-exponentiation. 165-180 - Florian Hess, Gadiel Seroussi, Nigel P. Smart:
Two Topics in Hyperelliptic Cryptography. 181-189
Cryptanalysis II
- Håvard Raddum, Lars R. Knudsen:
A Differential Attack on Reduced-Round SC2000. 190-198 - Pascal Junod
:
On the Complexity of Matsui's Attack. 199-211 - Fabian Kuhn, René Struik:
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms. 212-229
Elliptic Curves and Efficient Implementation
- Arash Reyhani-Masoleh, M. Anwarul Hasan:
Fast Normal Basis Multiplication Using General Purpose Processors. 230-244 - Gurgen H. Khachatrian, Melsik K. Kuregian, Karen R. Ispiryan, James L. Massey:
Fast Multiplication of Integers for Public-Key Applications. 245-254 - Toru Akishita:
Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form. 255-267 - Yasuyuki Sakai, Kouichi Sakurai:
On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication. 268-283
Public Key Systems
- Guang Gong, Lein Harn, Huapeng Wu:
The GH Public-Key Cryptosystem. 284-300 - Seongan Lim, Seungjoo Kim, Ikkwon Yie, Jaemoon Kim, Hongsub Lee:
XTR Extended to GF(p6m). 301-312
Invited Talk II
- Phong Q. Nguyen:
The Two Faces of Lattices in Cryptology. 313
Protocol and Mac
- Bert den Boer, Bart Van Rompay, Bart Preneel, Joos Vandewalle:
New (Two-Track-)MAC Based on the Two Trails of RIPEMD. 314-324 - Johannes Blömer, Alexander May:
Key Revocation with Interval Cover Families. 325-341 - Wenbo Mao:
Timed-Release Cryptography. 342-358
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
