EUROCRYPT 2007 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EUROCRYPT-2007 Paper

click to vote

EUROCRYPT
2007
Springer

171views Cryptology» more EUROCRYPT 2007»

Cryptanalysis of the Sidelnikov Cryptosystem

12 years 7 months ago

Download infoscience.epfl.ch

We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is eﬀecti...

Lorenz Minder, Amin Shokrollahi

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	171	Cryptanalysis of the Sidelnikov Cryptosystem	claim
2	166	Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy	claim
3	160	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries	claim
4	156	Batch Verification of Short Signatures	claim
5	145	Round-Efficient Secure Computation in Point-to-Point Networks	claim
6	144	Universally Composable Multi-party Computation Using Tamper-Proof Hardware	claim
7	141	Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility	claim
8	136	Simulatable Adaptive Oblivious Transfer	claim
9	134	Divisible E-Cash Systems Can Be Truly Anonymous	claim
10	134	Atomic Secure Multi-party Multiplication with Low Communication	claim
11	128	Mesh Signatures	claim
12	128	Cryptanalysis of SFLASH with Slightly Modified Parameters	claim
13	125	The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks	claim
14	125	Revisiting the Efficiency of Malicious Two-Party Computation	claim
15	123	Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability	claim
16	121	Efficient Two-Party Secure Computation on Committed Inputs	claim
17	118	Ideal Multipartite Secret Sharing Schemes	claim
18	117	Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit	claim
19	117	Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities	claim
20	115	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security	claim
21	114	Feistel Networks Made Public, and Applications	claim
22	111	Zero Knowledge and Soundness Are Symmetric	claim
23	104	Secure Computation from Random Error Correcting Codes	claim
24	101	Ate Pairing on Hyperelliptic Curves	claim
25	100	Non-interactive Proofs for Integer Multiplication	claim
26	100	General Ad Hoc Encryption from Exponent Inversion IBE	claim
27	89	Range Extension for Weak PRFs; The Good, the Bad, and the Ugly	claim
28	88	Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist	claim
29	87	Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers