default search action
Paul Camion
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j7]Paul Camion, Jacques Patarin:
t-resilient functions and the partial exposure problem. Appl. Algebra Eng. Commun. Comput. 19(2): 99-133 (2008) - 2006
- [j6]Paul Camion:
Unimodular modules. Discret. Math. 306(19-20): 2355-2382 (2006) - 2005
- [i1]Jacques Patarin, Paul Camion:
Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model. IACR Cryptol. ePrint Arch. 2005: 135 (2005) - 2002
- [c12]Paul Camion, Miodrag J. Mihaljevic, Hideki Imai:
Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q). Selected Areas in Cryptography 2002: 196-213
1990 – 1999
- 1999
- [j5]Paul Camion, Hervé Chabanne:
On the Powerline System. Appl. Algebra Eng. Commun. Comput. 9(5): 405-432 (1999) - [j4]Paul Camion, Anne Canteaut:
Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography. Des. Codes Cryptogr. 16(2): 121-149 (1999) - [c11]Paul Camion:
Codes over Zpn and association schemes. Codes and Association Schemes 1999: 59-86 - 1997
- [c10]Paul Camion, Hervé Chabanne:
On the powerline system. ICICS 1997: 381-385 - 1996
- [c9]Paul Camion, Anne Canteaut:
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations. CRYPTO 1996: 372-386 - [c8]Paul Camion, Anne Canteaut:
Construction of t-Resilient Functions over a Finite Alphabet. EUROCRYPT 1996: 283-293 - 1992
- [j3]Paul Camion, Bernard Courteau, André Montpetit:
Weight distribution of cosets of 2-error-correcting binary BCH codes of length 15, 63 and 255. IEEE Trans. Inf. Theory 38(4): 1353-1357 (1992) - 1991
- [j2]Paul Camion, Bernard Courteau, Philippe Delsarte:
On r-Partition Designs in Hamming Spaces. Appl. Algebra Eng. Commun. Comput. 2: 147-162 (1991) - [c7]Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier:
On Correlation-Immune Functions. CRYPTO 1991: 86-100 - [c6]Paul Camion, Jacques Patarin:
The Knapsack Hash Function proposed at Crypto'89 can be broken. EUROCRYPT 1991: 39-53
1980 – 1989
- 1988
- [c5]Paul Camion:
Majority Decoding of Large Repetition Codes for the R-Ary Symmetric Channel. AAECC 1988: 458-466 - [c4]Paul Camion, Jean-Luc Politano:
Evaluation of a coding design for a very noisy channel. Coding Theory and Applications 1988: 301-311 - [c3]Philippe Godlewski, Paul Camion:
Manipulations and Errors, Detection and Localization. EUROCRYPT 1988: 97-106 - 1987
- [c2]Paul Camion:
An Iterative Euclidean Algorithm. AAECC 1987: 88-128 - 1984
- [c1]Paul Camion:
Can a fast signature scheme without secret key be secure?. AAECC 1984: 215-241 - 1983
- [j1]Paul Camion:
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. IEEE Trans. Inf. Theory 29(3): 378-385 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: