Paul Camion

19 papers A* 5B 1C 1Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2006 J jnl
Unimodular modules.
Discret. Math.
Paul Camion
2005 J jnl
Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model.
IACR Cryptol. ePrint Arch.
Jacques Patarin, Paul Camion
2002 B conf
Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q).
Selected Areas in Cryptography
Paul Camion, Miodrag J. Mihaljevic, Hideki Imai
1999 — conf
Codes over
Codes and Association Schemes
Paul Camion
1999 J jnl
Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography.
Des. Codes Cryptogr.
Paul Camion, Anne Canteaut
1999 J jnl
On the Powerline System.
Appl. Algebra Eng. Commun. Comput.
Paul Camion, Hervé Chabanne
1997 C conf
On the powerline system.
ICICS
Paul Camion, Hervé Chabanne
1996 A* conf
Construction of t-Resilient Functions over a Finite Alphabet.
EUROCRYPT
Paul Camion, Anne Canteaut
1996 A* conf
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations.
CRYPTO
Paul Camion, Anne Canteaut
1992 J jnl
Weight distribution of cosets of 2-error-correcting binary BCH codes of length 15, 63 and 255.
IEEE Trans. Inf. Theory
Paul Camion, Bernard Courteau, André Montpetit
1991 A* conf
On Correlation-Immune Functions.
CRYPTO
Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier
1991 J jnl
On r-Partition Designs in Hamming Spaces.
Appl. Algebra Eng. Commun. Comput.
Paul Camion, Bernard Courteau, Philippe Delsarte
1991 A* conf
The Knapsack Hash Function proposed at Crypto'89 can be broken.
EUROCRYPT
Paul Camion, Jacques Patarin
1988 — conf
Evaluation of a coding design for a very noisy channel.
Coding Theory and Applications
Paul Camion, Jean-Luc Politano
1988 — conf
Majority Decoding of Large Repetition Codes for the R-Ary Symmetric Channel.
AAECC
Paul Camion
1988 A* conf
Manipulations and Errors, Detection and Localization.
EUROCRYPT
Philippe Godlewski, Paul Camion
1987 — conf
An Iterative Euclidean Algorithm.
AAECC
Paul Camion
1984 — conf
Can a fast signature scheme without secret key be secure?.
AAECC
Paul Camion
1983 J jnl
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials.
IEEE Trans. Inf. Theory
Paul Camion