EUROCRYPT 2001 - PDF Preprint Papers

EUROCRYPT 2001 Int. Workshop/Conference on Theory and Application of

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EUROCRYPT-2001 Paper

click to vote

EUROCRYPT
2001
Springer

145views Cryptology» more EUROCRYPT 2001»

The Rectangle Attack - Rectangling the Serpent

13 years 9 months ago

Download www.iacr.org

Abstract. Serpent is one of the 5 AES ﬁnalists. The best attack published so far analyzes up to 9 rounds. In this paper we present attacks on 7-round, 8-round, and 10-round varia...

Eli Biham, Orr Dunkelman, Nathan Keller

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	145	The Rectangle Attack - Rectangling the Serpent	claim
2	141	Cryptanalysis of Reduced-Round MISTY	claim
3	136	NSS: An NTRU Lattice-Based Signature Scheme	claim
4	135	Key Recovery and Message Attacks on NTRU-Composite	claim
5	133	Multiparty Computation from Threshold Homomorphic Encryption	claim
6	129	Lower Bounds for Multicast Message Authentication	claim
7	127	New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs	claim
8	126	How Secure Are Elliptic Curves over Composite Extension Fields?	claim
9	122	Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels	claim
10	122	Min-round Resettable Zero-Knowledge in the Public-Key Model	claim
11	116	Identification Protocols Secure against Reset Attacks	claim
12	116	Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems	claim
13	112	Structural Cryptanalysis of SASAS	claim
14	112	Encryption Modes with Almost Free Message Integrity	claim
15	111	Cryptographic Counters and Applications to Electronic Voting	claim
16	111	Hyper-bent Functions	claim
17	108	A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures	claim
18	105	Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy	claim
19	102	The Bit Security of Paillier's Encryption Scheme and Its Applications	claim
20	102	Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference	claim
21	101	Does Encryption with Redundancy Provide Authenticity?	claim
22	95	Practical Threshold RSA Signatures without a Trusted Dealer	claim
23	93	On Perfect and Adaptive Security in Exposure-Resilient Cryptography	claim
24	88	How to Convert the Flavor of a Quantum Bit Commitment	claim
25	78	Priced Oblivious Transfer: How to Sell Digital Goods	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers