Sequences and Their Applications – SETA 2010
Carlet, Claude.
Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings / [recurso electrónico] : edited by Claude Carlet, Alexander Pott. - X, 465p. 50 illus. online resource. - Lecture Notes in Computer Science, 6338 0302-9743 ; . - Lecture Notes in Computer Science, 6338 .
Invited Paper -- Low Correlation Zone Sequences -- Algorithmic Aspects -- Decimation Generator of Zadoff-Chu Sequences -- An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence -- Acquisition Times of Contiguous and Distributed Marker Sequences: A Cross-Bifix Analysis -- Frequency Hopping -- Lower Bounds on the Average Partial Hamming Correlations of Frequency Hopping Sequences with Low Hit Zone -- New Families of Frequency-Hopping Sequences of Length mN Derived from the k-Fold Cyclotomy -- Multiple Access Systems -- User-Irrepressible Sequences -- New Optimal Variable-Weight Optical Orthogonal Codes -- Invited Paper -- Recent Results on Recursive Nonlinear Pseudorandom Number Generators -- Linear Complexity -- A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets -- On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences -- An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform -- Finite Fields -- Transformations on Irreducible Binary Polynomials -- Power Permutations in Dimension 32 -- Character Sums -- Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators -- Ternary Kloosterman Sums Modulo 18 Using Stickelberger’s Theorem -- Merit Factor -- Appended m-Sequences with Merit Factor Greater than 3.34 -- FCSR -- A With-Carry Walsh Transform -- Clock-Controlled FCSR Sequence with Large Linear Complexity -- Vectorial Conception of FCSR -- Hadamard Matrices and Transforms -- Fourier Duals of Björck Sequences -- New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences -- Cryptography -- ?4-Nonlinearity of a Constructed Quaternary Cryptographic Functions Class -- A Public Key Cryptosystem Based upon Euclidean Addition Chains -- Optimal Authentication Codes from Difference Balanced Functions -- Invited Paper -- New Extensions and Applications of Welch-Bound-Equality Sequence Sets -- Statistical Analysis -- Evaluation of Randomness Test Results for Short Sequences -- Statistical Analysis of Search for Set of Sequences in Random and Framed Data -- Boolean Functions and Related Problems -- On the Nonlinearity of Discrete Logarithm in -- On a Conjecture about Binary Strings Distribution -- Nega–Hadamard Transform, Bent and Negabent Functions -- Synchronization of Boolean Dynamical Systems: A Spectral Characterization -- Nonbinary Sequences -- Some Constructions of Almost-Perfect, Odd-Perfect and Perfect Polyphase and Almost-Polyphase Sequences -- Almost p-Ary Perfect Sequences -- Sequences, Bent Functions and Jacobsthal Sums -- Infinite Sequences -- Infinite Sequences with Finite Cross-Correlation -- Invited Paper -- Reed Muller Sensing Matrices and the LASSO.
This volumecontainstherefereedproceedingsoftheSixth International Conf- ence on Sequences and Their Applications (SETA 2010), held in Paris, France, September 13-17, 2010. The previous ?ve conferences were held in Singapore (RepublicofSingapore),Bergen(Norway),Seoul(SouthKorea),Beijing(China) and Lexington (USA). Topics of SETA include: – Randomness of sequences – Correlation (periodic and aperiodic types) and combinatorial aspects of - quences (di?erence sets) – Sequences with applications in coding theory and cryptography – Sequences over ?nite ?elds/rings/function ?elds – Linear and nonlinear feedback shift register sequences – Sequences for radar distance ranging, synchronization, identi?cation, and hardware testing – Sequences for wireless communication – Pseudorandom sequence generators – Boolean and vectorial functions for sequences, coding and/or cryptography – Multidimensional sequences and their correlation properties – Linear and nonlinear complexity of sequences The Technical Program Committee of SETA 2010 refereed 56 submitted - pers. Each paper was reviewed by at least 2 referees (at least 3 when an author was a TPC member) and the TPC selected 33 papers to be presented at the conference. In addition, we had 4 invited papers, byRobert Calderbank(Prin- ton University, USA), James Massey (retired from ETH Zurich, Switzerland), Jong-Seon No (Seoul National University, South Korea) and Arne Winterhof ¨ (Osterreichische Akademie der Wissenschaften, Austria). TheCo-chairsoftheTPCwereClaudeCarlet(Universit´ eParis8,France)and Alexander Pott (Otto-von-Guericke-Universit¨ at, Magdeburg, Germany). They wish to thank the other members of the ProgramCommittee: Thierry P.
9783642158742
Computer science.
Computer Communication Networks.
Data encryption (Computer science).
Coding theory.
Computer software.
Computational complexity.
Information Systems.
Computer Science.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Data Encryption.
Computer Communication Networks.
Management of Computing and Information Systems.
Coding and Information Theory.
QA76.9.M35
004.0151
Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings / [recurso electrónico] : edited by Claude Carlet, Alexander Pott. - X, 465p. 50 illus. online resource. - Lecture Notes in Computer Science, 6338 0302-9743 ; . - Lecture Notes in Computer Science, 6338 .
Invited Paper -- Low Correlation Zone Sequences -- Algorithmic Aspects -- Decimation Generator of Zadoff-Chu Sequences -- An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence -- Acquisition Times of Contiguous and Distributed Marker Sequences: A Cross-Bifix Analysis -- Frequency Hopping -- Lower Bounds on the Average Partial Hamming Correlations of Frequency Hopping Sequences with Low Hit Zone -- New Families of Frequency-Hopping Sequences of Length mN Derived from the k-Fold Cyclotomy -- Multiple Access Systems -- User-Irrepressible Sequences -- New Optimal Variable-Weight Optical Orthogonal Codes -- Invited Paper -- Recent Results on Recursive Nonlinear Pseudorandom Number Generators -- Linear Complexity -- A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets -- On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences -- An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform -- Finite Fields -- Transformations on Irreducible Binary Polynomials -- Power Permutations in Dimension 32 -- Character Sums -- Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators -- Ternary Kloosterman Sums Modulo 18 Using Stickelberger’s Theorem -- Merit Factor -- Appended m-Sequences with Merit Factor Greater than 3.34 -- FCSR -- A With-Carry Walsh Transform -- Clock-Controlled FCSR Sequence with Large Linear Complexity -- Vectorial Conception of FCSR -- Hadamard Matrices and Transforms -- Fourier Duals of Björck Sequences -- New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences -- Cryptography -- ?4-Nonlinearity of a Constructed Quaternary Cryptographic Functions Class -- A Public Key Cryptosystem Based upon Euclidean Addition Chains -- Optimal Authentication Codes from Difference Balanced Functions -- Invited Paper -- New Extensions and Applications of Welch-Bound-Equality Sequence Sets -- Statistical Analysis -- Evaluation of Randomness Test Results for Short Sequences -- Statistical Analysis of Search for Set of Sequences in Random and Framed Data -- Boolean Functions and Related Problems -- On the Nonlinearity of Discrete Logarithm in -- On a Conjecture about Binary Strings Distribution -- Nega–Hadamard Transform, Bent and Negabent Functions -- Synchronization of Boolean Dynamical Systems: A Spectral Characterization -- Nonbinary Sequences -- Some Constructions of Almost-Perfect, Odd-Perfect and Perfect Polyphase and Almost-Polyphase Sequences -- Almost p-Ary Perfect Sequences -- Sequences, Bent Functions and Jacobsthal Sums -- Infinite Sequences -- Infinite Sequences with Finite Cross-Correlation -- Invited Paper -- Reed Muller Sensing Matrices and the LASSO.
This volumecontainstherefereedproceedingsoftheSixth International Conf- ence on Sequences and Their Applications (SETA 2010), held in Paris, France, September 13-17, 2010. The previous ?ve conferences were held in Singapore (RepublicofSingapore),Bergen(Norway),Seoul(SouthKorea),Beijing(China) and Lexington (USA). Topics of SETA include: – Randomness of sequences – Correlation (periodic and aperiodic types) and combinatorial aspects of - quences (di?erence sets) – Sequences with applications in coding theory and cryptography – Sequences over ?nite ?elds/rings/function ?elds – Linear and nonlinear feedback shift register sequences – Sequences for radar distance ranging, synchronization, identi?cation, and hardware testing – Sequences for wireless communication – Pseudorandom sequence generators – Boolean and vectorial functions for sequences, coding and/or cryptography – Multidimensional sequences and their correlation properties – Linear and nonlinear complexity of sequences The Technical Program Committee of SETA 2010 refereed 56 submitted - pers. Each paper was reviewed by at least 2 referees (at least 3 when an author was a TPC member) and the TPC selected 33 papers to be presented at the conference. In addition, we had 4 invited papers, byRobert Calderbank(Prin- ton University, USA), James Massey (retired from ETH Zurich, Switzerland), Jong-Seon No (Seoul National University, South Korea) and Arne Winterhof ¨ (Osterreichische Akademie der Wissenschaften, Austria). TheCo-chairsoftheTPCwereClaudeCarlet(Universit´ eParis8,France)and Alexander Pott (Otto-von-Guericke-Universit¨ at, Magdeburg, Germany). They wish to thank the other members of the ProgramCommittee: Thierry P.
9783642158742
Computer science.
Computer Communication Networks.
Data encryption (Computer science).
Coding theory.
Computer software.
Computational complexity.
Information Systems.
Computer Science.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Data Encryption.
Computer Communication Networks.
Management of Computing and Information Systems.
Coding and Information Theory.
QA76.9.M35
004.0151
