Paul Camion

According to our database1, Paul Camion authored at least 19 papers between 1983 and 2008.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
<i>t</i>-resilient functions and the partial exposure problem.
Appl. Algebra Eng. Commun. Comput., 2008

2006
Unimodular modules.
Discret. Math., 2006

2005
Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model.
IACR Cryptol. ePrint Arch., 2005

2002
Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q).
Proceedings of the Selected Areas in Cryptography, 2002

1999
Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography.
Des. Codes Cryptogr., 1999

On the Powerline System.
Appl. Algebra Eng. Commun. Comput., 1999

Codes over <i>Z<sub>p</sub><sup>n</sup></i> and association schemes.
Proceedings of the Codes and Association Schemes, 1999

1996
Construction of t-Resilient Functions over a Finite Alphabet.
Proceedings of the Advances in Cryptology, 1996

Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations.
Proceedings of the Advances in Cryptology, 1996

1992
Weight distribution of cosets of 2-error-correcting binary BCH codes of length 15, 63 and 255.
IEEE Trans. Inf. Theory, 1992

1991
On r-Partition Designs in Hamming Spaces.
Appl. Algebra Eng. Commun. Comput., 1991

The Knapsack Hash Function proposed at Crypto'89 can be broken.
Proceedings of the Advances in Cryptology, 1991

On Correlation-Immune Functions.
Proceedings of the Advances in Cryptology, 1991

1988
Manipulations and Errors, Detection and Localization.
Proceedings of the Advances in Cryptology, 1988

Evaluation of a coding design for a very noisy channel.
Proceedings of the Coding Theory and Applications, 1988

Majority Decoding of Large Repetition Codes for the R-Ary Symmetric Channel.
Proceedings of the Applied Algebra, 1988

1987
An Iterative Euclidean Algorithm.
Proceedings of the Applied Algebra, 1987

1984
Can a fast signature scheme without secret key be secure?.
Proceedings of the Applied Algebra, 1984

1983
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials.
IEEE Trans. Inf. Theory, 1983


  Loading...