Références

ABSS93

S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximating problems defined by linear constraints. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 586--597, 1993. à paraître dans JCSS.

BBC93

C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters. Teleporting an unkown quantum state by dual classical and EPR channels. Physical Review Letter, 70:1895--1898, 1993.

BBCM94

C.H. Bennett, G. Brassard, C. Crépeau, and U. Maurer. Generalized privacy amplification (abstract). In Proceedings of the IEEE Symposium on Information Theory, page 350, 1994.

BBCM95

C.H. Bennett, G. Brassard, C. Crépeau, and U. Maurer. Generalized privacy amplification. IEEE Transaction on Information Theory, 1995. à paraître.

BBCS92

C.H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska. Practical quantum oblivious transfer protocols. In Advances in Cryptology: Proceedings of CRYPTO'91, volume 576 of LNCS, pages 351--366. Springer-Verlag, 1992.

BC91

G. Brassard and C. Crépeau. Quantum bit commitment and coin tossing protocols. In Advances in Cryptology: Proceedings of CRYPTO'90, volume 537 of LNCS, pages 49--61. Springer-Verlag, 1991.

BC95

P. Béguin and A. Cresti. General short non perfect secret sharing schemes. In Advances in Cryptology: Proceedings of Eurocrypt'95, LNCS. Springer-Verlag, 1995. to appear.

BCJL93

G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois. A quantum bit commitment scheme provably unbreakable by both parties. In Symposium on Foundations of Computer Science, pages 42--52. IEEE, 1993.

BCLL91

G. Brassard, C. Crépeau, S. Laplante, and C. Léger. Computationally convincing proofs of knowledge. In Proceedings of STACS'91, volume 480 of LNCS, pages 251--262. Springer-Verlag, 1991.

BCY91

G. Brassard, C. Crépeau, and M. Yung. Constant-round perfect zero-knowledge computationally convincing protocols. Theoretical Computer Science, 84:23--52, 1991.

BN94

P. Béguin and D. Naccache. Breacking an improved version of a "more flexible exponentiation with precomputation". Presented at the rump session of CRYPTO '94, 1994.

BQ93a

P. Béguin and J.-J. Quisquater. Accélération de calculs cryptographiques à l'aide d'un serveur non sécurisé. In Journées de Cargèse : Complexité, Codage, Compression et Cryptographie, pages 13 -- 25, 1993.

BQ93b

P. Béguin and J.-J. Quisquater. Efficient inverse cubic RSA computations aided by a powerful untrusted server. Presented at the rump session of CRYPTO'93, 1993.

BQ94a

P. Béguin and J.-J. Quisquater. Resistant server-aided secret computations for public-key cryptosystems. In B. Macq, editor, Proceedings of the Fifteenth Symposium on Information Theory in the Benelux, pages 127--131. 'Werkgemeenschap voor Informatie- en Communicatie theorie', The Netherlands, 1994.

BQ94b

P. Béguin and J.-J. Quisquater. Secure acceleration of DSS signatures using insecure server. In Advances in Cryptology Asiacrypt '94, LNCS. Springer-Verlag, 1994. To appear.

BQ95

P. Béguin and J.-J. Quisquater. Acceleration of RSA signatures using an insecure server. Submitted to Crypto '95, 1995.

CC

A. Canteaut and F. Chabaud. A general improvement of the previous attacks on McEliece's cryptosystem. Non publié.

CDFdRS94

J.-M. Couveignes, J. F. Diaz-Frias, M. de Rougemont, and M. Santha. On the interactive complexity of graph reliability. In 14th FSTTCS Foundations of Software Technology and Theoretical Computer Science. Springer, 1994.

CG94a

J.-M. Couveignes and L. Granboulan. Dessins from a geometric point of view. In Grothendieck's dessins d'enfants, Lecture Notes in Math. Cambridge University Press, 1994. Disponible comme LIENS-94-2.

CG94b

J.-M. Couveignes and L. Granboulan. Explicit computation of some M24 covering. En préparation, 1994.

Cha93

F. Chabaud. Asymptotic analysis of probabilistic algorithms for finding short codewords. In P. Camion, P. Charpin, and S. Harari, editors, EUROCODE'92, volume 339 of CISM Courses and Lectures, pages 175--183. Springer-Verlag, 1993.

Cha94

F. Chabaud. On the security of some cryptosystems based on error-correcting codes. In Advances in Cryptology: Proceedings of EUROCRYPT'94, LNCS. Springer-Verlag, 1994. To appear.

CJL93

M. J. Coster, A. Joux, B. A. LaMacchia, A. Odlyzko, C.-P. Schnorr, and J. Stern. Improved low-density subset sum algorithms. Computational Complexity, 2:11--128, 1993.

CJM94

J.-M. Couveignes, A. Joux, and F. Morain. évaluation des sommes de caractères liées aux courbes elliptiques à multiplication complexe par l'anneau des entiers d'un corps quadratique imaginaire de nombre de classes 2. En préparation, 1994.

CJS91

Y. M. Chee, A. Joux, and J. Stern. The cryptanalysis of a new public-key cryptosystem based on modular knapsacks. In J. Feigenbaum, editor, Advances in Cryptology: Proceedings of CRYPTO'91, volume 576 of LNCS, pages 204--212. Springer-Verlag, 1991.

CK93

C. Crépeau and J. Kilian. Discreet solitary games. In Advances in Cryptology: Proceedings of CRYPTO'93, volume 537 of LNCS, pages 319--330. Springer-Verlag, 1993.

CM94

J.-M. Couveignes and F. Morain. Schoof's algorithm and isogeny cycles. In First Algorithmic Number Theory Conference, Lecture Notes in Math., 1994.

Cou93

J.-M. Couveignes. Computing a square root for the number field sieve. In The development of the number field sieve, volume 1554 of Lecture Notes in Math., pages 95--102. Springer-Verlag, 1993.

Cou94a

J.-M. Couveignes. Calcul et rationalité de fonctions de Belyi en genre 0. Annales de l'Institut Fourier, 44, 1994.

Cou94b

J.-M. Couveignes. Computing isogenies in small characteristic. Submitted for publication, 1994.

Cou94c

J.-M. Couveignes. Existence de fonctions de Belyi sans automorphismes. Submitted for publication, 1994.

Cou94d

J.-M. Couveignes. Quelques calculs en théorie des nombres. Thèse de doctorat, École Doctorale de Bordeaux, 1994.

Cré93

C. Crépeau. Cryptographic primitives and quantum theory. In Proceedings of the second Physics of Computation Workshop, PHYSCOMP'92, pages 200--204, 1993.

Cré94

C. Crépeau. Quantum oblivious transfer. Journal of Modern Optics, 41(12):2445--2454, 1994.

CS91a

Crépeau C and M. Sántha. On the reversibility of oblivious transfer. In Advances in Cryptology: Proceedings of EUROCRYPT'91, volume 547 of LNCS, pages 106--113. Springer-Verlag, 1991.

CS91b

C. Crépeau and M. Sántha. Efficient reductions among oblivious transfer protocols based on new self-intersecting codes. In Sequences II, Methods in Communications, Security, and Computer Science, pages 360--368. Springer-Verlag, 1991.

CS95

C. Crépeau and L. Salvail. Quantum oblivious mutual identification. In Advances in Cryptology: Proceedings of Eurocrypt'95. Springer-Verlag, 1995. à paraître.

CSV94

D. Coppersmith, J. Stern, and S. Vaudenay. Attacks on the birational permutation signature schemes. In D. R. Stinson, editor, Advances in Cryptology CRYPTO'93, volume 773 of LNCS, pages 435--443. Springer-Verlag, 1994. Disponible comme LIENS-93-25.

CT95

C. Crépeau and A. Tapp. Committed oblivious transfer. In Advances in Cryptology: Proceedings of Crypto'95. Springer-Verlag, 1995.

CV94

F. Chabaud and S. Vaudenay. Links between differential and linear cryptanalysis. In A. de Santis, editor, Advances in Cryptology: Proceedings of EUROCRYPT'94. Springer-Verlag, 1994. Disponible comme LIENS-94-3.

FJR94

J. Friedman, A. Joux, Y. Roichman, J. Stern, and J.-P. Tillich. Most regular graph are quickly r-transitive. 1994. non-publié.

Gra94

L. Granboulan. Construction d'une extension régulière de Q(T) de groupe de galois M24. Journal of Experimental Maths, 1994. Submitted for publication.

GS94

M. Girault and J. Stern. On the length of cryptographic hash-values used in cryptographic identification scheme. In Advances in Cryptology, Proceedings of CRYPTO'94, LNCS. Springer-Verlag, 1994.

JG94

A. Joux and L. Granboulan. A practical attack against knapsack based hash functions. In Advances in Cryptology: Proceedings of EUROCRYPT'94, LNCS. Springer-Verlag, 1994.

Jou93a

A. Joux. A fast parallel lattice reduction algorithm. Submitted to Gauss Symposium, 1993.

Jou93b

A. Joux. La Réduction des Réseaux en Cryptographie. Thèse de doctorat, Ecole Polytechnique, 1993. Disponible comme LIENS-93-7.

JS91a

A. Joux and J. Stern. Cryptanalysis of another knapsack cryptosystem. In H. Imai, R. L. Rivest, and T. Matsumoto, editors, Advances in Cryptology: Proceedings of ASIACRYPT'91, volume 739 of LNCS, pages 470--476. Springer-Verlag, 1991.

JS91b

A. Joux and J. Stern. Improving the critical density of the lagarias-odlyzko attack against subset sum problems. In L. Budach, editor, Proceedings of Fundamentals of Computation Theory 91, volume 529 of LNCS, pages 258--264. Springer-Verlag, 1991.

JS94

A. Joux and J. Stern. Lattice reduction: a toolbox for the cryptanalyst. Journal of Cryptology, 1994. soumis au J. Cryptology.

LC94

P. Hoogvorst L. Caudal, H. Gilbert. A new identification scheme based on the three dimensional matching problem. non publié, 1994.

LS91

G. Lachaud and J. Stern. Polynomial-time construction of linear codes with almost equal weights. In A. de Santis, editor, Sequences II, Methods in Communications, Security, and Computer Science, pages 59--62, New York, 1991. Springer-Verlag.

LS92a

G. Lachaud and J. Stern. Polynomial-time construction of codes I: linear codes with almost equal weights. Applicable Algebra in Engineering, Communication and Computing, pages 151--161, 1992.

LS92b

G. Lachaud and J. Stern. Polynomial-time construction of spherical codes. In Proceedings of the AAECC-9 Conference, volume 539 of LNCS, pages 218--223. Springer-Verlag, 1992.

LS94

G. Lachaud and J. Stern. Polynomial-time construction of codes II: Spherical codes and the kissing number of spheres. IEEE Transactions on Information Theory, 40:1140--1146, 1994.

MNRV94

D. M'Raïhi, D. Naccache, D. Raphaeli, and S. Vaudenay. Complexity trade-offs with the digital signature standard. In A. de Santis, editor, Advances in Cryptology: EUROCRYPT'94, 1994. To appear.

Poi95

D. Pointcheval. A new identification scheme based on the perceptrons problem. In L. Guillou, editor, Advances in Cryptology EUROCRYPT'95, LNCS. Springer-Verlag, 1995. to appear. LIENS-95-2.

SBM93

J. Stern, S. Blackburn, and S. Murphy. Weaknesses of a public key cryptosystem based on factorization of finite groups. In T. Helleseth, editor, Advances in Cryptology: Proceedings of EUROCRYPT'93, volume 765 of LNCS, pages 50--54. Springer-Verlag, 1993.

Ste93a

J. Stern. Approximating the number of error locations is NP-complete. In T. Mora, editor, Proceedings of the AAECC-10 Conference, volume 673 of LNCS, pages 323--331. Springer-Verlag, 1993.

Ste93b

J. Stern. A new identification scheme based on syndrome decoding. In Advances in Cyrptology, Proceedings of CRYPTO'93, volume 773 of LNCS, pages 13--21. Springer-Verlag, 1993.

Ste94

J. Stern. Designing identification scheme with keys of short size. In Advances in Cryptology, Proceedings of CRYPTO'94, volume 839 of LNCS, pages 164--173. Springer-Verlag, 1994.

SV94a

C. P. Schnorr and S. Vaudenay. Black box cryptanalysis of hash networks based on multipermutations. In A. de Santis, editor, Advances in Cryptology: EUROCRYPT'94, 1994. To appear.

SV94b

C. P. Schnorr and S. Vaudenay. Parallel FFT-hashing. In R. Anderson, editor, Fast Software Encryption, Cambridge Security Workshop, volume 809 of LNCS, pages 149--156. Springer-Verlag, 1994.

Vau93a

S. Vaudenay. FFT-Hash-II is not yet collision-free. In E. F. Brickell, editor, Advances in Cryptology CRYPTO'92, volume 740 of LNCS, pages 587--593. Springer-Verlag, 1993. Disponible comme LIENS-92-17.

Vau93b

S. Vaudenay. One-time identification with low memory. In P. Camion, P. Charpin, and S. Harari, editors, EUROCODE'92, volume 339 of CISM Courses and Lectures, pages 217--228. Springer-Verlag, 1993. Disponible comme LIENS-92-22.

Vau95

S. Vaudenay. On the need for multipermutations: Cryptanalysis of MD4 and SAFER. In B. Preneel, editor, Proceedings of Leuven Workshop on Cryptographic Algorithms, 1995.