Refereed articles (Journals or refereed proceedings)
|
|
- Gyles Lynch
- 6 years ago
- Views:
Transcription
1 Refereed articles (Journals or refereed proceedings) [1] Dieter Jungnickel and Alexander Pott. Two results on difference sets. In Colloquia Mathematica Societatis János Bolyai 52. Combinatorics, volume 52, pages , Eger (Hungary), [2] Alexander Pott. Applications of the DFT to abelian difference sets. Arch. Math., 51: , [3] Alexander Pott. A note on non-abelian difference sets. Europ. J. Combinatorics, 9: , [4] K. T. Arasu and Alexander Pott. Relative difference sets with multiplier 2. Ars Combinatoria, 27: , [5] Dieter Jungnickel and Alexander Pott. Computational non-existence results for abelian affine difference sets. Congressus Numerantium, 68:91 98, [6] Alexander Pott. On abelian difference sets with multiplier -1. Arch. Math., 53: , [7] Alexander Pott. A note on self-orthogonal codes. Discrete Math., 76: , [8] K. T. Arasu, James Davis, Dieter Jungnickel, and Alexander Pott. A note on intersection numbers of difference sets. European J. Combin., 11:95 98, [9] K. T. Arasu, Dieter Jungnickel, and Alexander Pott. Divisible difference sets with multiplier -1. Journal of Algebra, 133(1):35 62, [10] Alexander Pott. An affine analogue of Wilbrink s theorem. J. Comb. Theory Ser.A, 55: , [11] Alexander Pott. On multiplier theorems. In Dijen K. Ray-Chaudhuri, editor, Coding theory and design theory, Part II Design Theory, volume 21 of The IMA volumes in mathematics and its applications, pages Springer, [12] Alexander Pott. On symmetric designs whose incidence matrices satisfy a certain condition. J. Combin. Math. Combin. Comput., 8:13 16, [13] K. T. Arasu, James Davis, Dieter Jungnickel, and Alexander Pott. Some nonexistence results on divisible difference sets. Combinatorica, 11(1):1 8, [14] K. T. Arasu, Willem H. Haemers, Dieter Jungnickel, and Alexander Pott. Matrix constructions of divisible designs. Linear Algebra Appl., 153: , [15] K. T. Arasu, Dieter Jungnickel, and Alexander Pott. The Mann test for divisible difference sets. Graphs and Combinatorics, 7: , [16] K. T. Arasu, Dieter Jungnickel, and Alexander Pott. Symmetric divisible designs with k λ 1 = 1. Discrete Math., 97:25 38, [17] K. T. Arasu and Alexander Pott. Group divisible designs with 2 a points. Utilitas Mathematica, 39: , [18] K. T. Arasu and Alexander Pott. On quasiregular collineation groups of projective planes. Des., Codes, Cryptogr., 1:83 92, [19] K. T. Arasu and Alexander Pott. Some constructions of group divisible designs with Singer groups. Discrete Math., 97:39 45, 1991.
2 [20] Alexander Pott and Mohan Shrikhande. t-designs with few intersection numbers. Discrete Math., 90: , [21] K. T. Arasu and Alexander Pott. Cyclic affine planes and Paley difference sets. Discrete Math., 106/107:19 23, [22] Alexander Pott. A generalization of a construction of Lenz. Sankhyā, Ser.A, 54: , [23] Alexander Pott. New necessary conditions on the existence of abelian difference sets. Combinatorica, 12(1):89 93, [24] Alexander Pott. On abelian difference set codes. Des., Codes, Cryptogr., 2: , [25] Alexander Pott. On the complexity of normal bases. Bull. Inst. Combin. Appl., 4:51 52, [26] Alexander Pott. Maximal difference matrices of order q. Journal of Combinatorial Designs, 1(2): , [27] K. T. Arasu, Dieter Jungnickel, Siu Lun Ma, and Alexander Pott. Strongly regular Cayley graphs with λ µ = 1. J. Comb. Theory Ser.A, 67: , [28] K. T. Arasu and Alexander Pott. Variations on the McFarland and Spence constructions of difference sets. Australas. J. Comb., 10: , [29] Dieter Jungnickel and Alexander Pott. A new class of symmetric (v, k, λ)- designs. Des., Codes, Cryptogr., 4: , [30] Alexander Pott. On projective planes admitting elations and homologies. Geom. Dedicata, 52: , [31] Alexander Pott. On the structure of abelian groups admitting divisible difference sets. Journal of Combinatorial Theory, Series A, 65(2): , [32] K. T. Arasu, J. F. Dillon, D. Jungnickel, and A. Pott. The solution of the Waterloo problem. J. Comb. Theory Ser.A, 71(2): , [33] K. T. Arasu, Dieter Jungnickel, Siu Lun Ma, and Alexander Pott. Relative difference sets with n = 2. Discrete Math., 147:1 17, [34] S. L. Ma and A. Pott. Relative difference sets, planar functions, and generalized Hadamard matrices. Journal of Algebra, 175: , [35] Alexander Pott and Steven P. Bradley. Existence and nonexistence of almostperfect autocorrelation sequences. IEEE Trans. Inf. Th., 41(1): , January [36] Alexander Pott. A survey on relative difference sets. In K. T. Arasu, J.F. Dillon, K. Harada, S. Sehgal, and R. Solomon, editors, Groups, Difference Sets, and the Monster. Proceedings of a Special Research Quarter at the Ohio State University, Spring 1993, pages , Berlin, Walter de Gruyter. [37] Alexander Pott, Dirk Reuschling, and Bernhard Schmidt. A multiplier theorem for projections of affine difference sets. J. Stat. Plann. Inference, 62(200):63 67, 1997.
3 [38] Dieter Jungnickel and Alexander Pott. Difference sets: An introduction. In Alexander Pott, P. Vijay Kumar, Tor Helleseth, and Dieter Jungnickel, editors, Difference sets, sequences and their correlation properties, volume 542 of NATO Science Series. Kluwer Academic Publishers, Dordrecht, [39] Dieter Jungnickel and Alexander Pott. Perfect and almost perfect sequences. Discrete Applied Mathematics, 95: , [40] Holger Glaab and Alexander Pott. The Hamiltonian p-median problem. Electron. J. Combin., 7(1), R42. [41] K. T. Arasu, Yuqing Chen, and Alexander Pott. Hadamard and conference matrices. J. Algebraic Combin., 14(2): , September [42] K.T. Arasu and Alexander Pott. A nonexistence result on negacirculant conference matrices. Congressus Numerantium, 150: , [43] Hans Dobbertin, Donald Mills, Eva Nuria Müller, Alexander Pott, and Wolfgang Willems. APN functions in odd characteristic. Discrete Appl. Math., 267(1 3):95 112, [44] Alexander Pott and Gohar Kyureghyan. On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences. Des., Codes, Cryptogr., 29: , [45] Alexander Pott. Nonlinear functions in abelian groups and relative difference sets. Discrete Appl. Math., 138: , [46] Alexander Pott. Group algebras and correlation immune functions. In Tor Helleseth and Dilip Sarwate, editors, Sequences and Their Applications Proceedings of SETA 04, volume 3486 of Lecture Notes in Computer Science, pages Springer-Verlag, [47] Yves Edel, Gohar Kyureghyan, and Alexander Pott. A new APN function which is not equivalent to a power mapping. IEEE Trans. Inform. Theory, 52(2): , [48] Lilya Budaghyan, Claude Carlet, and Alexander Pott. New classes of almost bent and almost perfect nonlinear polynomials. IEEE Trans. Inform. Theory, 52(3): , [49] K. T. Arasu, Yu Qing Chen, and Alexander Pott. On abelian (2 2m+1 (2 m 1 + 1), 2 m (2 m + 1), 2 m )-difference sets. J. Combin. Theory Ser. A, 113(6): , [50] Matthew G. Parker and Alexander Pott. On boolean functions which are bent and negabent. In Solomon W. Golomb, Guang Gong, Tor Helleseth, and Hong- Yeop Song, editors, Sequences, Subsequences and Consequences, volume 4893 of Lecture Notes in Computer Science, pages 9 23, Berlin, Heidelberg, Springer-Verlag. [51] Doreen Hertel and Alexander Pott. Two results on maximum nonlinear functions. Des., Codes, Cryptogr., 47: , [52] Alexander Pott. Two applications of relative difference sets: Difference triangles and negaperiodic autocorrelation functions. Discrete Math., 308: , 2008.
4 [53] Gohar Kyureghyan and Alexander Pott. Some theorems on planar functions. In Joachim von zur Gathen, José Luis Imaña, and Çetin Kaya Koç, editors, Arithmetic of Finite Fields, volume 5130 of Lecture Notes in Computer Science, pages Springer Berlin/Heidelberg, [54] Faruk Göloğlu and Alexander Pott. Results on crosscorrelation and autocorrelation of sequences. In Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, editors, Sequences and Their Applications - SE- TA 2008, volume 5203 of Lecture Notes in Computer Science, pages Springer Berlin/Heidelberg, [55] Kai-Uwe Schmidt, Matthew G. Parker, and Alexander Pott. Negabent funtions in the Maiorana-McFarland class. In Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, editors, Sequences and Their Applications - SETA 2008, volume 5203 of Lecture Notes in Computer Science, pages Springer Berlin/Heidelberg, [56] Tor Helleseth, Gohar Kyureghyan, Geir Jarle Ness, and Alexander Pott. On a family of perfect nonlinear binomials. In Bart Preneel and Oleg A. Logachev, editors, Boolean Functions in Cryptology and Information Security, pages NATO Advanced Study Institute, IOS Press, [57] Lilya Budaghyan and Alexander Pott. On differential uniformity and nonlinearity of functions. Discrete Math, 309: , [58] Yves Edel and Alexander Pott. A new almost perfect nonlinear function which is not quadratic. Adv. Math. Commun., 3:59 81, [59] Yves Edel and Alexander Pott. On the equivalence of nonlinear functions. In Bart Preneel, Stefan Dodunekov, Vincent Rijmen, and Svetla Nikova, editors, Enhancing Cryptographic Primitives with Techniques from Coding Theory, pages NATO Advanced Research Workshop, IOS Press, [60] Alexander Pott, Yin Tan, Tao Feng, and San Ling. Association schemes arising from bent functions. In Alexander Kholosha, Eirik Rosnes, and Matthew Parker, editors, Preproceedings: The International Workshop on Coding and Cryptography, pages 48 61, Bergen, [61] Yves Edel and Alexander Pott. On designs and multiplier groups constructed from almost perfect nonlinear functions. In Matthew G. Parker, editor, Cryptography and Coding Twelfth IMA International Conference, volume 5921 of Lecture Notes in Comput. Sci., pages , Berlin, The Institute of Mathematics and its Applications, Springer. [62] K.T. Arasu and Alexander Pott. Perfect binary sequences of even period. Stat. Appl., 4(2,3): , [63] Faruk Göloğlu and Alexander Pott. Consequences of the multiplier conjecture to the existence of hadamard difference sets. J. Comb. Inf. Syst. Sci., 34(1 4): , [64] Alexander Pott and Yue Zhou. Switching construction of planar functions on finite fields. In M. Anwar Hasan and Tor Helleseth, editors, Arithmetic of Finite Fields, volume 6087 of Lecture Notes in Comput. Sci., pages Springer Berlin/Heidelberg, [65] Yin Tan, Alexander Pott, and Tao Feng. Strongly regular graphs associated with ternary bent functions. J. Comb. Theory Ser.A, 117(6): , 2010.
5 [66] Alexander Pott and Yue Zhou. A character theoretic approach to planar functions. Cryptogr. Commun., 3(4): , [67] Alexander Pott, Yin Tan, Tao Feng, and San Ling. Association schemes arising from bent functions. Des. Codes Cryptogr., 59(1-3): , [68] Laurent Poinsot and Alexander Pott. Non-Boolean almost perfect nonlinear functions on non-abelian groups. Internat. J. Found. Comput. Sci., 22(6): , [69] Alexander Pott and Yue Zhou. CCZ and EA equivalence between mappings over finite abelian groups. In Daniel Augot and Anne Canteaut, editors, Preproceedings: The International Workshop on Coding and Cryptography, pages , Paris, [70] Ferruh Özbudak Gohar M. Kyureghyan and Alexander Pott. Some planar maps and related function fields. In Arithmetic, Geometry, Cryptography and Coding Theory, volume 574 of Contemp. Math., pages Amer. Math. Soc., Providence, RI, [71] Alexander Pott, Qi Wang, and Yue Zhou. Sequences and functions derived from projective planes and ther difference sets. In Ferruh Özbudak and Francisco Rodríguez-Henríquez, editors, Arithmetic of Finite Fields, volume 7369 of Lecture Notes in Computer Science, pages Springer Berlin/Heidelberg, [72] Yue Zhou and Alexander Pott. A new family of semifields with 2 parameters. Adv. Math., 234:43 60, [73] Wei Su, Xiaohu Tang, and Alexander Pott. A note on a conjecture for balanced elementary symmetric Boolean functions. IEEE Trans. Inform. Theory, 59(1): , [74] Ayça Çeşmelioğlu, Wilfried Meidl, and Alexander Pott. On the dual of (non)- weakly regular bent functions and self-dual bent functions. Adv. Math. Commun., 7(4): , [75] Ayça Çeşmelioğlu, Wilfried Meidl, and Alexander Pott. Generalized Maiorana- McFarland class and normality of p-ary bent functions. Finite Fields Appl., 24: , [76] Alexander Pott and Yue Zhou. CCZ and EA equivalence between mappings over finite Abelian groups. Des. Codes Cryptogr., 66(1-3):99 109, [77] Wei Su, Alexander Pott, and Xiaohu Tang. Characterization of negabent functions and construction of bent-negabent functions with maximum algebraic degree. IEEE Trans. Inform. Theory, 59(6): , [78] Cunsheng Ding, Alexander Pott, and Qi Wang. Constructions of almost difference sets from finite fields. Des. Codes Cryptogr., 72(3): , [79] Ferruh Özbudak and Alexander Pott. Uniqueness of F q -quadratic perfect nonlinear maps from F q 3 to F 2 q. Finite Fields Appl., 29:49 88, [80] A. Pott, K.-U. Schmidt, and Y. Zhou. Semifields, relative difference sets, and bent functions. In Harald Niederreiter, Alina Ostafe, Daniel Panario, and Arne WInterhof, editors, Algebraic Curves and Finite Fields, volume 16 of Radon Series on Computational and Applied Mathematics, pages De Gruyter, 2014.
6 [81] D. Thomson A. Muratović-Ribić, A. Pott and Q. Wang. Semi-multiplicative planar functions over finite fields. in press: Proceedings Conference Finite Fields 2013, Magdeburg. [82] Ayça Çeşmelioğlu, Wilfried Meidl, and Alexander Pott. Bent functions and semifield spreads. submitted. [83] Alexander Pott, Kai-Uwe Schmidt, and Yue Zhou. Pairs of quadratic forms over finite fields. submitted. Editor [1] A. Pott, P. V. Kumar, T. Helleseth, and D. Jungnickel, editors. Difference sets, sequences and their correlation properties, volume 542 of NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences. Kluwer Academic Publishers Group, Dordrecht, [2] Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, editors. Sequences and their applications SETA 2008, volume 5203 of Lecture Notes in Computer Science. Springer, Berlin, [3] Claude Carlet and Alexander Pott, editors. Sequences and their applications SETA 2010, volume 6338 of Lecture Notes in Computer Science. Springer, Berlin, [4] Pascale Charpin, Alexander Pott, and Arne Winterhof, editors. Finite fields and their applications, volume 11 of Radon Series on Computational and Applied Mathematics. De Gruyter, Berlin, Character sums and polynomials. Others [1] Alexander Pott. Finite Geometry and Character Theory, volume 1601 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, Heidelberg, [2] Dieter Jungnickel and Alexander Pott. Difference Sets: Abelian. In Charles J. Colbourn and Jeffrey H. Dinitz, editors, The CRC Handbook of Combinatorial Designs, pages CRC Press, Boca Raton, [3] Holger Glaab and Alexander Pott. Optimization problems in a semi-automatic device for cutting leather. In Willi Jäger and Hans-Joachim Krebs, editors, Mathematics Key Technology for the Future, pages Springer, Berlin, Heidelberg, New York, [4] Lilya Budaghyan, Claude Carlet, and Alexander Pott. New constructions of almost bent and almost perfect nonlinear polynomials. In Pascale Charpin and Øyvind Ytrehus, editors, Abstract Book of the International Workshop on Coding and Cryptography, Bergen (Norway), pages , [5] Dieter Jungnickel, Alexander Pott, and Ken W. Smith. Difference Sets. In Charles J. Colbourn and Jeffrey H. Dinitz, editors, The CRC Handbook of Combinatorial Designs, pages CRC Press, Boca Raton, [6] Faruk Göloğlu and Alexander Pott. Almost perfect nonlinear functions: A possible geometric approach. In S. Nikova, B. Preneel, L. Storme, and J.A. Thas, editors, Coding Theory and Cryptography II, pages Koninklijke Vlaamse Academie van België voor Wetenschappen en Kunsten, 2007.
Almost Difference Sets and Their Sequences With Optimal Autocorrelation
2934 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 7, NOVEMBER 2001 Almost Difference Sets Their Sequences With Optimal Autocorrelation K. T. Arasu, Cunsheng Ding, Member, IEEE, Tor Helleseth,
More informationNonlinear Functions A topic in Designs, Codes and Cryptography
Nonlinear Functions A topic in Designs, Codes and Cryptography Alexander Pott Otto-von-Guericke-Universität Magdeburg September 21, 2007 Alexander Pott (Magdeburg) Nonlinear Functions September 21, 2007
More informationA New Class of Bent Negabent Boolean Functions
A New Class of Bent Negabent Boolean Functions Sugata Gangopadhyay and Ankita Chaturvedi Department of Mathematics, Indian Institute of Technology Roorkee Roorkee 247667 INDIA, {gsugata, ankitac17}@gmail.com
More informationPostdoctoral Researcher, Otto-von-Guericke University, Germany, September September 2013,
Contact Information Address: İstanbul Kemerburgaz University Faculty of Arts and Sciences Mahmutbey Dilmenler Caddesi, No:26 34217 Bağcılar-İstanbul Turkey E-mail: ayca.cesmelioglu@kemerburgaz.edu.tr Present
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA July 2004 The Autocorrelation Function The autocorrelation of a binary sequence {s(t)} of period N at shift w is C s (w) = ( 1) s(t+w) s(t). N 1 t=0 The
More informationSemifields, Relative Difference Sets, and Bent Functions
Semifields, Relative Difference Sets, and Bent Functions Alexander Pott Otto-von-Guericke-University Magdeburg December 09, 2013 1 / 34 Outline, or: 2 / 34 Outline, or: Why I am nervous 2 / 34 Outline,
More informationOn the normality of p-ary bent functions
Noname manuscrit No. (will be inserted by the editor) On the normality of -ary bent functions Ayça Çeşmelioğlu Wilfried Meidl Alexander Pott Received: date / Acceted: date Abstract In this work, the normality
More informationOn the Existence and Constructions of Vectorial Boolean Bent Functions
On the Existence and Constructions of Vectorial Boolean Bent Functions Yuwei Xu 1, and ChuanKun Wu 1 1 State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy
More informationDecomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
More informationOn the Linear Complexity of Legendre-Sidelnikov Sequences
On the Linear Complexity of Legendre-Sidelnikov Sequences Ming Su Nankai University, China Emerging Applications of Finite Fields, Linz, Dec. 12 Outline Motivation Legendre-Sidelnikov Sequence Definition
More informationLIST OF PUBLICATIONS
LIST OF PUBLICATIONS Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Houghton, Michigan 49931 (USA) January 15, 2012 References [1] A characterization of the Baby
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA September 2008 Outline of this talk Difference sets and almost difference sets Cyclotomic classes Introduction of binary sequences with optimal autocorrelation
More informationOn the existence of cyclic difference sets with small parameters
Fields Institute Communications Volume 00, 0000 On the existence of cyclic difference sets with small parameters Leonard D. Baumert 325 Acero Place Arroyo Grande, CA 93420 Daniel M. Gordon IDA Center for
More informationA matrix approach for constructing quadratic APN functions
Noname manuscript No (will be inserted by the editor) A matrix approach for constructing quadratic APN functions Yuyin Yu Mingsheng Wang Yongqiang Li Received: date / Accepted: date Abstract We find a
More informationConstructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice
Noname manuscript No. (will be inserted by the editor) Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice Chunming Tang Yanfeng Qi Received: date
More informationConstructions of Quadratic Bent Functions in Polynomial Forms
1 Constructions of Quadratic Bent Functions in Polynomial Forms Nam Yul Yu and Guang Gong Member IEEE Department of Electrical and Computer Engineering University of Waterloo CANADA Abstract In this correspondence
More informationQuadratic Almost Perfect Nonlinear Functions With Many Terms
Quadratic Almost Perfect Nonlinear Functions With Many Terms Carl Bracken 1 Eimear Byrne 2 Nadya Markin 3 Gary McGuire 2 School of Mathematical Sciences University College Dublin Ireland Abstract We introduce
More informationDIFFERENTIAL cryptanalysis is the first statistical attack
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 12, DECEMBER 2011 8127 Differential Properties of x x 2t 1 Céline Blondeau, Anne Canteaut, Pascale Charpin Abstract We provide an extensive study of
More informationThe simplest method for constructing APN polynomials EA-inequivalent to power functions
The siplest ethod for constructing APN polynoials EA-inequivalent to power functions Lilya Budaghyan Abstract The first APN polynoials EA-inequivalent to power functions have been constructed in [7, 8]
More informationOptimal Ternary Cyclic Codes From Monomials
5898 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 59, NO 9, SEPTEMBER 2013 Optimal Ternary Cyclic Codes From Monomials Cunsheng Ding, Senior Member, IEEE, and Tor Helleseth, Fellow, IEEE Abstract Cyclic
More informationHyperbent functions, Kloosterman sums and Dickson polynomials
Hyperbent functions, Kloosterman sums and Dickson polynomials Pascale Charpin INRIA, Codes Domaine de Voluceau-Rocquencourt BP 105-78153, Le Chesnay France Email: pascale.charpin@inria.fr Guang Gong Department
More informationDifference Sets Corresponding to a Class of Symmetric Designs
Designs, Codes and Cryptography, 10, 223 236 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Difference Sets Corresponding to a Class of Symmetric Designs SIU LUN MA
More informationStephen Cohen, University of Glasgow Methods for primitive and normal polynomials
Stephen Cohen, University of Glasgow Methods for primitive and normal polynomials Primitive and normal polynomials over a finite field are, of course, particular examples of irreducible polynomials over
More informationSequences and Linear Codes from Highly Nonlinear Functions
Sequences and Linear Codes from Highly Nonlinear Functions Chunlei Li Dissertation for the degree of philosophiae doctor(phd) at the University of Bergen 2014 Dissertation date: June 16th A C K N O W
More information6054 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 9, SEPTEMBER 2012
6054 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 9, SEPTEMBER 2012 A Class of Binomial Bent Functions Over the Finite Fields of Odd Characteristic Wenjie Jia, Xiangyong Zeng, Tor Helleseth, Fellow,
More informationConstructing differential 4-uniform permutations from know ones
Noname manuscript No. (will be inserted by the editor) Constructing differential 4-uniform permutations from know ones Yuyin Yu Mingsheng Wang Yongqiang Li Received: date / Accepted: date Abstract It is
More informationFourier Spectra of Binomial APN Functions
Fourier Spectra of Binomial APN Functions arxiv:0803.3781v1 [cs.dm] 26 Mar 2008 Carl Bracken Eimear Byrne Nadya Markin Gary McGuire March 26, 2008 Abstract In this paper we compute the Fourier spectra
More informationSome Results on the Known Classes of Quadratic APN Functions
Some Results on the Known Classes of Quadratic APN Functions Lilya Budaghyan, Tor Helleseth, Nian Li, and Bo Sun Department of Informatics, University of Bergen Postboks 7803, N-5020, Bergen, Norway {Lilya.Budaghyan,Tor.Helleseth,Nian.Li,Bo.Sun}@uib.no
More informationComplete characterization of generalized bent and 2 k -bent Boolean functions
Complete characterization of generalized bent and k -bent Boolean functions Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng 1 Abstract In this paper we investigate properties of generalized bent Boolean
More informationOn Boolean functions which are bent and negabent
On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra
More informationThere are no Barker arrays having more than two dimensions
There are no Barker arrays having more than two dimensions Jonathan Jedwab Matthew G. Parker 5 June 2006 (revised 7 December 2006) Abstract Davis, Jedwab and Smith recently proved that there are no 2-dimensional
More informationHyper-bent Functions
Hyper-bent Functions Amr M. Youssef 1 and Guang Gong 2 1 Center for Applied Cryptographic Research Department of Combinatorics & Optimization University of Waterloo, Waterloo, Ontario N2L3G1, CANADA a2youssef@cacr.math.uwaterloo.ca
More informationhal , version 1-9 Mar 2011
Non-Boolean Almost Perfect Nonlinear Functions on Non-Abelian Groups Laurent Poinsot LIPN - UMR CNRS 7030, Institut Galilée, University Paris XIII, 99, avenue Jean-Baptiste Clment, 93430 Villetaneuse laurent.poinsot@lipn.univ-paris13.fr
More informationK. T. Arasu Jennifer Seberry y. Wright State University and University ofwollongong. Australia. In memory of Derek Breach.
On Circulant Weighing Matrices K. T. Arasu Jennifer Seberry y Department of Mathematics and Statistics Department of Computer Science Wright State University and University ofwollongong Dayton, Ohio{45435
More informationConstructing new APN functions from known ones
Constructing new APN functions from known ones Lilya Budaghyan a, Claude Carlet b, and Gregor Leander c a Department of Mathematics University of Trento ITALY b Department of Mathematics University of
More information50 Years of Crosscorrelation of m-sequences
50 Years of Crosscorrelation of m-sequences Tor Helleseth Selmer Center Department of Informatics University of Bergen Bergen, Norway August 29, 2017 Tor Helleseth (Selmer Center) 50 Years of Crosscorrelation
More informationTrace Representation of Legendre Sequences
C Designs, Codes and Cryptography, 24, 343 348, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Trace Representation of Legendre Sequences JEONG-HEON KIM School of Electrical and
More informationSELF DUAL BENT FUNCTIONS
Boolean Functions: Cryptography and Applications Fonctions Booléennes : Cryptographie & Applications BFCA 08 SELF DUAL BENT FUNCTIONS Claude Carlet 1, Lars Eirik Danielsen 2, Matthew Geoffrey Parker 2
More informationG-Perfect Nonlinear Functions
University of Richmond UR Scholarship Repository Math and Computer Science Faculty Publications Math and Computer Science 1-2008 G-Perfect Nonlinear Functions James A. Davis University of Richmond, jdavis@richmond.edu
More informationA conjecture about Gauss sums and bentness of binomial Boolean functions. 1 Introduction. Jean-Pierre Flori
A conjecture about Gauss sums and bentness of binomial Boolean functions Jean-Pierre Flori arxiv:608.05008v2 [math.nt] 9 Aug 206 Abstract In this note, the polar decomposition of binary fields of even
More informationA class of quadratic APN binomials inequivalent to power functions
A class of quadratic APN binomials inequivalent to power functions Lilya Budaghyan, Claude Carlet, Gregor Leander November 30, 2006 Abstract We exhibit an infinite class of almost perfect nonlinear quadratic
More informationCharacterization of Negabent Functions and Construction of Bent-Negabent Functions with Maximum Algebraic Degree
Characterization of Negabent Functions and Construction of Bent-Negabent Functions with Maximum Algebraic Degree 1 Wei Su Alexander Pott and Xiaohu Tang arxiv:105.6568v1 [cs.it] 30 May 01 Abstract We present
More informationA New Characterization of Semi-bent and Bent Functions on Finite Fields
A New Characterization of Semi-bent and Bent Functions on Finite Fields Khoongming Khoo DSO National Laboratories 20 Science Park Dr S118230, Singapore email: kkhoongm@dso.org.sg Guang Gong Department
More informationNew Ternary and Quaternary Sequences with Two-Level Autocorrelation
New Ternary and Quaternary Sequences with Two-Level Autocorrelation Honggang Hu Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1, Canada Email. h7hu@uwaterloo.ca
More informationCCZ-equivalence and Boolean functions
CCZ-equivalence and Boolean functions Lilya Budaghyan and Claude Carlet Abstract We study further CCZ-equivalence of (n, m)-functions. We prove that for Boolean functions (that is, for m = 1), CCZ-equivalence
More informationConstruction of Some New Classes of Boolean Bent Functions and Their Duals
International Journal of Algebra, Vol. 11, 2017, no. 2, 53-64 HIKARI Ltd, www.-hikari.co https://doi.org/10.12988/ija.2017.61168 Construction of Soe New Classes of Boolean Bent Functions and Their Duals
More informationCOMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125
COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125 ROBERT S. COULTER AND PAMELA KOSICK Abstract. This note summarises a recent search for commutative semifields of order 243 and 3125. For each of these two orders,
More informationSome results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences
Some results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences A joint work with Chunlei Li, Xiangyong Zeng, and Tor Helleseth Selmer Center, University of Bergen
More informationSinger and GMW constructions (or generalized GMW constructions), little else is known about p-ary two-level autocorrelation sequences. Recently, a few
New Families of Ideal -level Autocorrelation Ternary Sequences From Second Order DHT Michael Ludkovski 1 and Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo,
More informationHadamard ideals and Hadamard matrices with two circulant cores
Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More informationSome properties of q-ary functions based on spectral analysis
Some properties of q-ary functions based on spectral analysis Deep Singh and Maheshanand Bhaintwal Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667 INDIA deepsinghspn@gmail.com,mahesfma@iitr.ernet.in
More informationThird-order nonlinearities of some biquadratic monomial Boolean functions
Noname manuscript No. (will be inserted by the editor) Third-order nonlinearities of some biquadratic monomial Boolean functions Brajesh Kumar Singh Received: April 01 / Accepted: date Abstract In this
More information[1] G. Marino, R. Toscano: Periodic solutions of a class of nonlinear ODE systems, Differential Equations, 40 (2004),
CURRICULUM VITAE Name: Giuseppe Surname: Marino Date of birth: 19 October 1977 Work Address Department of Mathematics and Applications Renato Caccioppoli - University of Napoli Federico II Via Cintia,
More informationIf a Generalised Butterfly is APN then it Operates on 6 Bits
If a Generalised Butterfly is APN then it Operates on 6 Bits Anne Canteaut 1, Léo Perrin 1, Shizhu Tian 1,2,3 1 Inria, Paris, France. 2 State Key Laboratory of Information Security, Institute of Information
More informationSmall Group Divisible Steiner Quadruple Systems
Small Group Divisible Steiner Quadruple Systems Artem A. Zhuravlev, Melissa S. Keranen, Donald L. Kreher Department of Mathematical Sciences, Michigan Technological University Houghton, MI 49913-0402,
More informationExtended Binary Linear Codes from Legendre Sequences
Extended Binary Linear Codes from Legendre Sequences T. Aaron Gulliver and Matthew G. Parker Abstract A construction based on Legendre sequences is presented for a doubly-extended binary linear code of
More informationOn the N th linear complexity of p-automatic sequences over F p
On the N th linear complexity of p-automatic sequences over F p László Mérai and Arne Winterhof Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstr.
More informationHyperbent functions, Kloosterman sums and Dickson polynomials
Hyperbent functions, Kloosterman sums and Dickson polynomials Pascale Charpin Guang Gong INRIA, B.P. 105, 78153 Le Chesnay Cedex, France, Pascale.Charpin@inria.fr Department of Electrical and Computer
More information15. C. Koukouvinos, M. Mitrouli and J. Seberry, On the Smith normal form of weighing matrices, Bull. Inst. Combin. Appl., Vol. 19 (1997), pp
Papers in journals 1. G. Kalogeropoulos and M. Mitrouli, On the computation of the Weierstrass canonical form of a regular matrix pencil, Control and Computers, Vol. 20 (1992), No. 3, pp. 61-68. 2. M.
More informationarxiv: v1 [cs.it] 31 May 2013
Noname manuscript No. (will be inserted by the editor) A Note on Cyclic Codes from APN Functions Chunming Tang Yanfeng Qi Maozhi Xu arxiv:1305.7294v1 [cs.it] 31 May 2013 Received: date / Accepted: date
More informationTransversal Designs in Classical Planes and Spaces. Aiden A. Bruen and Charles J. Colbourn. Computer Science. University of Vermont
Transversal Designs in Classical Planes and Spaces Aiden A. Bruen and Charles J. Colbourn Computer Science University of Vermont Burlington, VT 05405 U.S.A. Abstract Possible embeddings of transversal
More informationDisjoint difference families from Galois rings
Disjoint difference families from Galois rings Koji Momihara Faculty of Education Kumamoto University 2-40-1 Kurokami, Kumamoto 860-8555, Japan momihara@educ.kumamoto-u.ac.jp Submitted: Mar 11, 2016; Accepted:
More informationHadamard matrices of order 32
Hadamard matrices of order 32 H. Kharaghani a,1 B. Tayfeh-Rezaie b a Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K3M4, Canada b School of Mathematics,
More informationA SHORT SURVEY OF P-ARY PSEUDO-RANDOM SEQUENCES. Zhaneta Tasheva
JOURNAL SCIENCE EDUCATION INNOVATION, VOL. 2. 2014 Association Scientific and Applied Research International Journal Original Contribution ISSN 1314-9784 A SHORT SURVEY OF P-ARY PSEUDO-RANDOM SEQUENCES
More informationOn the Cross-Correlation of a p-ary m-sequence of Period p 2m 1 and Its Decimated
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 3, MARCH 01 1873 On the Cross-Correlation of a p-ary m-sequence of Period p m 1 Its Decimated Sequences by (p m +1) =(p +1) Sung-Tai Choi, Taehyung Lim,
More informationI. INTRODUCTION. i) is an -PCDP if and only if partitions, and for any fixed, the equation has at most solutions. ii) For a set, let
5738 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 56, NO 11, NOVEMBER 2010 Optimal Partitioned Cyclic Difference Packings for Frequency Hopping Code Synchronization Yeow Meng Chee, Senior Member, IEEE,
More informationBalanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity
Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity Xiaohu Tang 1, Deng Tang 1, Xiangyong Zeng and Lei Hu 3 In this paper, we present a class of k-variable balanced
More informationOn one class of permutation polynomials over finite fields of characteristic two *
On one class of permutation polynomials over finite fields of characteristic two * Leonid Bassalygo, Victor A. Zinoviev To cite this version: Leonid Bassalygo, Victor A. Zinoviev. On one class of permutation
More informationOn a Conjectured Ideal Autocorrelation Sequence and a Related Triple-Error Correcting Cyclic Code
680 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 2, MARCH 2000 [13] B. R. McDonald, Finite Rings with Identity. New York: Marcel Dekker, 1974. [14] F. J. MacWilliams and N. J. A. Sloane, The Theory
More informationSome results concerning global avalanche characteristics of two q-ary functions
Some results concerning global avalanche characteristics of two -ary functions Brajesh Kumar Singh Department of Mathematics, School of Allied Sciences, Graphic Era Hill University, Dehradun-4800 (Uttarakhand)
More informationAffine designs and linear orthogonal arrays
Affine designs and linear orthogonal arrays Vladimir D. Tonchev Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA, tonchev@mtu.edu Abstract It is proved
More informationPolynomial Residue Systems via Unitary Transforms Matthew G. Parker
Polynomial Residue Systems via Unitary Transforms Matthew G. Parker Selmer Centre, Inst. for Informatikk, Høyteknologisenteret i Bergen, University of Bergen, Bergen 500, Norway Email: matthew@ii.uib.no
More informationOn the Classification of Splitting (v, u c, ) BIBDs
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 18, No 5 Special Thematic Issue on Optimal Codes and Related Topics Sofia 2018 Print ISSN: 1311-9702; Online ISSN: 1314-4081
More informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
More informationOn Cryptographic Properties of the Cosets of R(1;m)
1494 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 On Cryptographic Properties of the Cosets of R(1;m) Anne Canteaut, Claude Carlet, Pascale Charpin, and Caroline Fontaine Abstract
More informationConstructions of bent functions and difference sets KAISA NYBERG. University of Helsinki and Finnish Defence Forces
Constructions of bent functions and difference sets KAISA NYBERG University of Helsinki and Finnish Defence Forces 1. Introduction. Based on the work of Rothaus 1121, Olsen, Scholtz and Welch suggested
More informationTwin bent functions and Clifford algebras
Twin bent functions and Clifford algebras Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at ADTHM 2014, Lethbridge. 8 July 2014 Acknowledgements Richard
More informationOn a generalized combinatorial conjecture involving addition mod 2 k 1
On a generalized combinatorial conjecture involving addition mod k 1 Gérard Cohen Jean-Pierre Flori Tuesday 14 th February, 01 Abstract In this note, e give a simple proof of the combinatorial conjecture
More informationA construction of bent functions from plateaued functions
A construction of bent functions from lateaued functions Ayca Cesmelioglu, Wilfried Meidl To cite this version: Ayca Cesmelioglu, Wilfried Meidl. A construction of bent functions from lateaued functions.
More information#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS
#A3 INTEGERS 7 (27) CONFERENCE MATRICES WITH MAIMUM ECESS AND TWO-INTERSECTION SETS Koji Momihara Faculty of Education, Kumamoto University, Kurokami, Kumamoto, Japan momihara@educ.kumamoto-u.ac.jp Sho
More informationPolynomials on F 2. cryptanalysis. Y. Aubry 1 G. McGuire 2 F. Rodier 1. m with good resistance to. 1 IML Marseille 2 University College Dublin
Polynomials on F 2 m with good resistance to cryptanalysis Y Aubry 1 G McGuire 2 F Rodier 1 1 IML Marseille 2 University College Dublin Outline APN functions A lower bound for the degree of an APN polynomial
More informationarxiv: v1 [math.co] 6 Jan 2019
BENT FUNCTIONS FROM TRIPLES OF PERMUTATION POLYNOMIALS arxiv:1901.02359v1 [math.co] 6 Jan 2019 DANIELE BARTOLI, MARIA MONTANUCCI, AND GIOVANNI ZINI Abstract. We provide constructions of bent functions
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento
More informationCharacterizations of the differential uniformity of vectorial functions by the Walsh transform
Characterizations of the differential uniformity of vectorial functions by the Walsh transform Claude Carlet LAGA, Department of Mathematics, University of Paris 8 (and Paris 13 and CNRS), Saint Denis
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationOn Welch-Gong Transformation Sequence Generators
On Welch-Gong Transformation Sequence Generators G. Gong and A.M. Youssef Center for Applied Cryptographic Research, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario
More informationOn The Nonlinearity of Maximum-length NFSR Feedbacks
On The Nonlinearity of Maximum-length NFSR Feedbacks Meltem Sönmez Turan National Institute of Standards and Technology meltem.turan@nist.gov Abstract. Linear Feedback Shift Registers (LFSRs) are the main
More informationA construction of bent functions from plateaued functions
A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for
More informationFast Algebraic Immunity of 2 m + 2 & 2 m + 3 variables Majority Function
Fast Algebraic Immunity of 2 m + 2 & 2 m + 3 variables Majority Function Yindong Chen a,, Fei Guo a, Liu Zhang a a College of Engineering, Shantou University, Shantou 515063, China Abstract Boolean functions
More informationarxiv: v1 [cs.cr] 25 Jul 2013
On the k-error linear complexity of binary sequences derived from polynomial quotients Zhixiong Chen School of Applied Mathematics, Putian University, Putian, Fujian 351100, P. R. China ptczx@126.com arxiv:1307.6626v1
More informationBinary Additive Counter Stream Ciphers
Number Theory and Related Area ALM 27, pp. 1 23 c Higher Education Press and International Press Beijing Boston Binary Additive Counter Stream Ciphers Cunsheng Ding, Wenpei Si Abstract Although a number
More informationDickson Polynomials that are Involutions
Dickson Polynomials that are Involutions Pascale Charpin Sihem Mesnager Sumanta Sarkar May 6, 2015 Abstract Dickson polynomials which are permutations are interesting combinatorial objects and well studied.
More informationEnumeration of generalized polyominoes
Enumeration of generalized polyominoes MATTHIAS KOCH and SASCHA KURZ Department of Mathematics, University of Bayreuth matthias.koch, sascha.kurz@uni-bayreuth.de D-95440 Bayreuth, Germany Submitted: May
More informationDivision of Trinomials by Pentanomials and Orthogonal Arrays
Division of Trinomials by Pentanomials and Orthogonal Arrays School of Mathematics and Statistics Carleton University daniel@math.carleton.ca Joint work with M. Dewar, L. Moura, B. Stevens and Q. Wang
More informationNew Restrictions on Possible Orders of Circulant Hadamard Matrices
New Restrictions on Possible Orders of Circulant Hadamard Matrices Ka Hin Leung Department of Mathematics National University of Singapore Kent Ridge, Singapore 119260 Republic of Singapore Bernhard Schmidt
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
More informationHadamard Matrices, d-linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights
Hadamard Matrices, d-linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights Qichun Wang Abstract It is known that correlation-immune (CI) Boolean functions used
More informationNew Constructions for Resilient and Highly Nonlinear Boolean Functions
New Constructions for Resilient and Highly Nonlinear Boolean Functions Khoongming Khoo 1 and Guang Gong 2 1 Department of Combinatorics and Optimization, 2 Department of Electrical and Computer Engineering,
More informationFREQUENCY hopping spread spectrum (FHSS) [1] is an
1 Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization Yeow Meng Chee, Senior Member, IEEE, Alan C. H. Ling, and Jianxing Yin Abstract Optimal partitioned cyclic
More information