default search action
Pascale Charpin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j50]Pascale Charpin:
The crooked property. Finite Fields Their Appl. 81: 102032 (2022)
2010 – 2019
- 2019
- [j49]Pascale Charpin, Jie Peng:
Differential uniformity and the associated codes of cryptographic functions. Adv. Math. Commun. 13(4): 579-600 (2019) - [j48]Pascale Charpin, Philippe Langevin:
Obituary of Jacques Wolfmann (1932-2018). Des. Codes Cryptogr. 87(5): 955-956 (2019) - [j47]Pascale Charpin, Jie Peng:
New links between nonlinearity and differential uniformity. Finite Fields Their Appl. 56: 188-208 (2019) - 2017
- [j46]Pascale Charpin, Thomas Johansson
, Gohar M. Kyureghyan, Nicolas Sendrier, Jean-Pierre Tillich:
Editorial: Special issue on coding and cryptography. Des. Codes Cryptogr. 82(1-2): 1-2 (2017) - [j45]Nastja Cepak
Permutations via linear translators. Finite Fields Their Appl. 45: 19-42 (2017) - [j44]Pascale Charpin, Gohar M. Kyureghyan:
On sets determining the differential spectrum of mappings. Int. J. Inf. Coding Theory 4(2/3): 170-184 (2017) - 2016
- [j43]Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
Involutions Over the Galois Field 𝔽n. IEEE Trans. Inf. Theory 62(4): 2266-2276 (2016) - [i4]Nastja Cepak, Pascale Charpin, Enes Pasalic:
Permutations via linear translators. CoRR abs/1609.09291 (2016) - 2015
- [c17]Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
On involutions of finite fields. ISIT 2015: 186-190 - [i3]Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
Dickson Polynomials that are Involutions. IACR Cryptol. ePrint Arch. 2015: 434 (2015) - 2014
- [j42]Pascale Charpin, Gohar M. Kyureghyan, Valentin Suder:
Sparse permutations with low differential uniformity. Finite Fields Their Appl. 28: 214-243 (2014) - 2013
- [p1]Pascale Charpin:
PN and APN functions. Handbook of Finite Fields 2013: 253-261 - [e2]Pascale Charpin, Alexander Pott, Arne Winterhof:
Finite Fields and Their Applications - Character Sums and Polynomials. Radon Series on Computational and Applied Mathematics 11, De Gruyter 2013, ISBN 978-3-11-028240-5 [contents] - [i2]Pascale Charpin, Gohar M. Kyureghyan:
A note on verifying the APN property. IACR Cryptol. ePrint Arch. 2013: 475 (2013) - 2011
- [j41]Matthew Geoffrey Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes:
Editorial. Des. Codes Cryptogr. 59(1-3): 1 (2011) - [j40]Pascale Charpin, Sumanta Sarkar:
Polynomials With Linear Structure and Maiorana-McFarland Construction. IEEE Trans. Inf. Theory 57(6): 3796-3804 (2011) - [j39]Céline Blondeau
Differential Properties of ${x\mapsto x^{2^{t}-1}}$. IEEE Trans. Inf. Theory 57(12): 8127-8137 (2011) - [r4]Pascale Charpin:
Cyclic Codes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 291-294 - [r3]Pascale Charpin:
Reed-Muller Codes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1037-1038 - [i1]Céline Blondeau, Anne Canteaut, Pascale Charpin:
Differential properties of functions x -> x^{2^t-1} -- extended version. CoRR abs/1108.4753 (2011) - 2010
- [j38]Enes Pasalic
Some results concerning cryptographically significant mappings over GF(2n). Des. Codes Cryptogr. 57(3): 257-269 (2010) - [j37]Céline Blondeau, Anne Canteaut, Pascale Charpin:
Differential properties of power functions. Int. J. Inf. Coding Theory 1(2): 149-170 (2010) - [c16]Pascale Charpin, Sumanta Sarkar:
Polynomials with linear structure and Maiorana-McFarland construction. ISIT 2010: 1138-1142 - [c15]Céline Blondeau
Differential properties of power functions. ISIT 2010: 2478-2482
2000 – 2009
- 2009
- [j36]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
Divisibility properties of classical binary Kloosterman sums. Discret. Math. 309(12): 3975-3984 (2009) - [j35]Pascale Charpin, Gohar M. Kyureghyan:
When does G(x)+gammaTr(H(x)) permute Fpn? Finite Fields Their Appl. 15(5): 615-632 (2009) - 2008
- [j34]Pascale Charpin, Tor Helleseth:
Editorial: In memory of Hans Dobbertin. Des. Codes Cryptogr. 49(1-3): 1-2 (2008) - [j33]Anne Canteaut, Pascale Charpin, Gohar M. Kyureghyan:
A new class of monomial bent functions. Finite Fields Their Appl. 14(1): 221-241 (2008) - [j32]Pascale Charpin, Gohar M. Kyureghyan:
Cubic Monomial Bent Functions: A Subclass of M. SIAM J. Discret. Math. 22(2): 650-665 (2008) - [j31]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
On Cosets of Weight 4 of BCH(2m, 8), m Even, and Exponential Sums. SIAM J. Discret. Math. 23(1): 59-78 (2008) - [j30]Pascale Charpin, Guang Gong:
Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials. IEEE Trans. Inf. Theory 54(9): 4230-4238 (2008) - [c14]Pascale Charpin, Guang Gong:
Hyperbent functions, Kloosterman sums and Dickson polynomials. ISIT 2008: 1758-1762 - [c13]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
Divisibility properties of Kloosterman sums over finite fields of characteristic two. ISIT 2008: 2608-2612 - [c12]Pascale Charpin, Gohar M. Kyureghyan:
On a Class of Permutation Polynomials over F2m. SETA 2008: 368-376 - 2007
- [j29]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
Propagation characteristics of xx-1 and Kloosterman sums. Finite Fields Their Appl. 13(2): 366-381 (2007) - [j28]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd. J. Comb. Theory A 114(2): 322-338 (2007) - [c11]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
On binary primitive BCH codes with minimum distance 8 and exponential sums. ISIT 2007: 1976-1980 - 2006
- [j27]Pascale Charpin, Gregory Kabatianski:
Special Issue on Coding and Cryptography. Discret. Appl. Math. 154(2): 173 (2006) - [j26]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
The coset distribution of triple-error-correcting binary primitive BCH codes. IEEE Trans. Inf. Theory 52(4): 1727-1732 (2006) - [j25]Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy:
On Almost Perfect Nonlinear Functions Over F2n. IEEE Trans. Inf. Theory 52(9): 4160-4170 (2006) - [c10]Anne Canteaut, Pascale Charpin, Gohar M. Kyureghyan:
A new class of monomial bent functions. ISIT 2006: 903-906 - 2005
- [j24]Pascale Charpin, Enes Pasalic
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces. Des. Codes Cryptogr. 37(2): 319-346 (2005) - [j23]Victor A. Zinoviev, Tor Helleseth, Pascale Charpin:
On Cosets of Weight 4 of Binary BCH Codes with Minimum Distance 8 and Exponential Sums. Probl. Inf. Transm. 41(4): 331-348 (2005) - [j22]Claude Carlet, Pascale Charpin:
Cubic Boolean functions with highest resiliency. IEEE Trans. Inf. Theory 51(2): 562-571 (2005) - [j21]Pascale Charpin, Enes Pasalic
On bent and semi-bent quadratic Boolean functions. IEEE Trans. Inf. Theory 51(12): 4286-4298 (2005) - [c9]Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
Coset distribution of triple-error-correcting binary primitive BCH codes. ISIT 2005: 1972-1976 - [c8]Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy:
On almost perfect nonlinear mappings over Fn2. ISIT 2005: 2002-2006 - [r2]Pascale Charpin:
Cyclic Codes. Encyclopedia of Cryptography and Security 2005 - [r1]Pascale Charpin:
Reed-Muller Codes. Encyclopedia of Cryptography and Security 2005 - 2004
- [j20]Pascale Charpin:
Normal Boolean functions. J. Complex. 20(2-3): 245-265 (2004) - [j19]Pascale Charpin:
Cyclic codes with few weights and Niho exponents. J. Comb. Theory A 108(2): 247-259 (2004) - 2003
- [j18]Anne Canteaut, Pascale Charpin:
Decomposing bent functions. IEEE Trans. Inf. Theory 49(8): 2004-2019 (2003) - 2002
- [c7]Pascale Charpin, Enes Pasalic:
On Propagation Characteristics of Resilient Functions. Selected Areas in Cryptography 2002: 175-195 - 2001
- [j17]Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev:
On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property. IEEE Trans. Inf. Theory 47(1): 421-425 (2001) - [j16]Anne Canteaut, Claude Carlet, Pascale Charpin, Caroline Fontaine:
On cryptographic properties of the cosets of R(1, m). IEEE Trans. Inf. Theory 47(4): 1494-1513 (2001) - 2000
- [j15]Anne Canteaut, Pascale Charpin, Hans Dobbertin:
Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences. SIAM J. Discret. Math. 13(1): 105-138 (2000) - [j14]Anne Canteaut, Pascale Charpin, Hans Dobbertin:
Binary m-sequences with three-valued crosscorrelation: A proof of Welch's conjecture. IEEE Trans. Inf. Theory 46(1): 4-9 (2000) - [c6]Anne Canteaut, Claude Carlet, Pascale Charpin, Caroline Fontaine:
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions. EUROCRYPT 2000: 507-522
1990 – 1999
- 1999
- [j13]Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev:
On the Minimum Distances of Non-Binary Cyclic Codes. Des. Codes Cryptogr. 17(1-3): 81-85 (1999) - [j12]Thierry P. Berger, Pascale Charpin:
The Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields. Des. Codes Cryptogr. 18(1/3): 29-53 (1999) - [c5]Anne Canteaut, Pascale Charpin, Hans Dobbertin:
A New Characterization of Almost Bent Functions. FSE 1999: 186-200 - 1998
- [j11]Claude Carlet, Pascale Charpin, Victor A. Zinoviev:
Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems. Des. Codes Cryptogr. 15(2): 125-156 (1998) - 1997
- [j10]Pascale Charpin, Victor A. Zinoviev:
On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes. SIAM J. Discret. Math. 10(1): 128-145 (1997) - 1996
- [j9]Thierry P. Berger, Pascale Charpin:
The permutation group of affine-invariant extended cyclic codes. IEEE Trans. Inf. Theory 42(6): 2194-2209 (1996) - 1994
- [j8]Pascale Charpin, Françoise Levy-dit-Vehel:
On Self-Dual Affine-Invariant Codes. J. Comb. Theory A 67(2): 223-244 (1994) - [j7]Pascale Charpin:
Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not. IEEE Trans. Inf. Theory 40(5): 1425-1442 (1994) - 1993
- [j6]Thierry P. Berger, Pascale Charpin:
The automorphism group of Generalized Reed-Muller codes. Discret. Math. 117(1-3): 1-17 (1993) - 1992
- [j5]Daniel Augot, Pascale Charpin, Nicolas Sendrier:
Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inf. Theory 38(3): 960-973 (1992) - 1991
- [c4]Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier:
On Correlation-Immune Functions. CRYPTO 1991: 86-100 - [e1]Gérard D. Cohen, Pascale Charpin:
EUROCODE '90, International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990, Proceedings. Lecture Notes in Computer Science 514, Springer 1991, ISBN 3-540-54303-1 [contents] - 1990
- [j4]Pascale Charpin:
Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonne. Discret. Math. 80(3): 229-247 (1990) - [j3]Pascale Charpin:
On a class of primitive BCH-codes. IEEE Trans. Inf. Theory 36(1): 222-228 (1990) - [c3]Daniel Augot, Pascale Charpin, Nicolas Sendrier:
The minimum distance of some binary codes via the Newton's identities. EUROCODE 1990: 65-73
1980 – 1989
- 1989
- [j2]Pascale Charpin:
Definition et Caracterisation d'une Dimension Minimale pour les Codes Principaux Nilpotents d'une Algebre Modulaire de p-Groupe Abelien Elementaire. Eur. J. Comb. 10(1): 1-12 (1989) - 1987
- [c2]Pascale Charpin:
Some Applications of Classification of Affine-Invariant Codes. AAECC 1987: 151-160 - 1985
- [j1]Pascale Charpin:
A description of some extended cyclic codes with application to Reed-Solomon codes. Discret. Math. 56(2-3): 117-124 (1985) - [c1]Pascale Charpin:
A Minimum System of Generators for Extended Cyclic Codes which are Invariant under the Affine Group. AAECC 1985: 34-42
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-06-10 20:29 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: