Daniel Panario

Orcid: 0000-0003-3551-4063

According to our database1, Daniel Panario authored at least 148 papers between 1995 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Stable binomials over finite fields.
Finite Fields Their Appl., 2025

2024
Additive codes with few weights.
Cryptogr. Commun., September, 2024

Girth Analysis of Quantum Quasi-Cyclic LDPC Codes.
Probl. Inf. Transm., June, 2024

Probabilistic root finding in code-based cryptography.
J. Cryptogr. Eng., April, 2024

Construction of Protograph-Based LDPC Codes With Chordless Short Cycles.
IEEE Trans. Inf. Theory, January, 2024

Linear label code of a root lattice using Gröbner bases.
Appl. Algebra Eng. Commun. Comput., January, 2024

Nilpotent linearized polynomials over finite fields, revisited.
Finite Fields Their Appl., 2024

The complexity of elliptic normal bases.
CoRR, 2024

A Concrete LIP-Based KEM With Simple Lattices.
IEEE Access, 2024

Disjoint Difference Sets and QC-LDPC Codes With Girth 10.
Proceedings of the 12th Iran Workshop on Communication and Information Theory, 2024

2023
One-generator quasi-cyclic codes and their dual codes.
Discret. Math., June, 2023

Comparing balanced sequences obtained from ElGamal function to random balanced sequences.
Cryptogr. Commun., May, 2023

Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \mathbb {F}_{q}[v_{1}, v_{2},\dots ,v_{t}]$.
Cryptogr. Commun., May, 2023

2022
QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs.
IEEE Commun. Lett., 2022

Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces.
CoRR, 2022

Equivalence Classes and Balance Properties of Interleaved Sequences.
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022

Trade-Based LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Maximum-Length Low-Density MDS Codes and Near Resolvable Designs.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Protograph-based LDPC codes with chordless short cycles and large minimum distance.
Proceedings of the 17th Canadian Workshop on Information Theory, 2022

2021
Secure one-way relaying scheme based on random difference family (RDF) lattice codes.
Wirel. Networks, 2021

Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels.
IEEE Trans. Inf. Theory, 2021

Improved constant-sum encodings for hash-based signatures.
J. Cryptogr. Eng., 2021

Comparing balanced Z<sub>v</sub>-sequences obtained from ElGamal function to random balanced sequences.
CoRR, 2021

Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
The Design of a Novel Multiple-Parameter Fractional Number-Theoretic Transform and Its Application to Image Encryption.
IEEE Trans. Circuits Syst. Video Technol., 2020

A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes.
IEEE Trans. Commun., 2020

Periods of Iterations of Functions with Restricted Preimage Sizes.
ACM Trans. Algorithms, 2020

Finding linearly generated subsequences.
CoRR, 2020

A construction of 픽<sub>2</sub>-linear cyclic, MDS codes.
Adv. Math. Commun., 2020

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field.
Adv. Math. Commun., 2020

A trigonometric approach for Dickson polynomials over fields of characteristic two.
Appl. Algebra Eng. Commun. Comput., 2020

Finding Linearly Generated Subsequences.
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019
A General Construction of Ordered Orthogonal Arrays Using LFSRs.
IEEE Trans. Inf. Theory, 2019

A new class of irreducible pentanomials for polynomial-based multipliers in binary fields.
J. Cryptogr. Eng., 2019

The graph structure of Chebyshev polynomials over finite fields and applications.
Des. Codes Cryptogr., 2019

The functional graph of linear maps over finite fields and applications.
Des. Codes Cryptogr., 2019

Squeezing a vectorial nonlinear binary transformation between two perpendicular matrices.
CoRR, 2019

A Lattice Based Joint Encryption, Encoding and Modulation Scheme.
CoRR, 2019

Unicyclic strong permutations.
Cryptogr. Commun., 2019

Fixed points of rational functions satisfying the Carlitz property.
Appl. Algebra Eng. Commun. Comput., 2019

Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays.
Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018
A generating matrix method for constructing Hermite-Gaussian-like number-theoretic transform eigenvectors.
Signal Process., 2018

Fast modular reduction and squaring in <i>GF</i>(2<sup><i>m</i></sup>).
Inf. Process. Lett., 2018

Number of <i>t</i>-tuples in arrays from LFSRs.
Electron. Notes Discret. Math., 2018

A non-commutative cryptosystem based on quaternion algebras.
Des. Codes Cryptogr., 2018

Nonlinear vectorial primitive recursive sequences.
Cryptogr. Commun., 2018

Normal Basis Exhaustive Search: 10 Years Later.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

A Neural Network Lattice Decoding Algorithm.
Proceedings of the IEEE Information Theory Workshop, 2018

Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security.
Proceedings of the 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2018

Secret Sharing Schemes with Hidden Sets.
Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

A Family of Matrices for Generating Hermite-Gaussian-Like DFT Eigenvectors.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Ordered Orthogonal Array Construction Using LFSR Sequences.
IEEE Trans. Inf. Theory, 2017

Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields.
Finite Fields Their Appl., 2017

Covering arrays from m-sequences and character sums.
Des. Codes Cryptogr., 2017

Cycle structure of iterating Redei functions.
Adv. Math. Commun., 2017

2016
Fast and Simple Modular Interpolation Using Factorial Representation.
Am. Math. Mon., 2016

Constructing new covering arrays from LFSR sequences over finite fields.
Discret. Math., 2016

Finite field constructions of combinatorial arrays.
Des. Codes Cryptogr., 2016

Construction of Full-Diversity LDPC Lattices for Block-Fading Channels.
CoRR, 2016

Computing Gröbner bases associated with lattices.
Adv. Math. Commun., 2016

Construction of full-diversity 1-level LDPC lattices for block-fading channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

A secret key encryption scheme based on 1-level QC-LDPC lattices.
Proceedings of the 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology, 2016

2015
Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group.
SIAM J. Discret. Math., 2015

Locating modifications in signed data for partial data integrity.
Inf. Process. Lett., 2015

An asymptotic formula for the number of irreducible transformation shift registers.
CoRR, 2015

Linear complexity profile and correlation measure of interleaved sequences.
Cryptogr. Commun., 2015

Binomial ideal associated to a lattice and its label code.
ACM Commun. Comput. Algebra, 2015

A Johnson-type bound for group codes and lattices.
ACM Commun. Comput. Algebra, 2015

2014
The rth Smallest Part Size of a Random Integer Partition.
Integers, 2014

General conditional recurrences.
Appl. Math. Comput., 2014

Open Problems for Polynomials over Finite Fields and Applications.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

A trigonometric approach for Chebyshev polynomials over finite fields.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map.
IEEE Trans. Inf. Theory, 2013

Grobner Bases for Lattices and an Algebraic Decoding Algorithm.
IEEE Trans. Commun., 2013

A Family of Fibonacci-Like Conditional Sequences.
Integers, 2013

Existence and properties of k-normal elements over finite fields.
Finite Fields Their Appl., 2013

Univariate polynomial counting and algorithms.
Proceedings of the Handbook of Finite Fields., 2013

Conditions for reducible polynomials.
Proceedings of the Handbook of Finite Fields., 2013

Introduction to primitive polynomials.
Proceedings of the Handbook of Finite Fields., 2013

Introduction to finite fields : Basic properties of finite fields.
Proceedings of the Handbook of Finite Fields., 2013

2012
In honour of the research and influence of Joachim von zur Gathen at 60.
J. Symb. Comput., 2012

Sets of orthogonal hypercubes of class r.
J. Comb. Theory A, 2012

A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields.
Finite Fields Their Appl., 2012

Divisibility of polynomials over finite fields and combinatorial applications.
Des. Codes Cryptogr., 2012

Gauss periods as constructions of low complexity normal bases.
Des. Codes Cryptogr., 2012

Generalized Alcuin's Sequence.
Electron. J. Comb., 2012

Cycle structure of permutation functions over finite fields and their applications.
Adv. Math. Commun., 2012

Interval Partitions and Polynomial Factorization.
Algorithmica, 2012

Word-Oriented Transformation Shift Registers and Their Linear Complexity.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

Random Mappings with Restricted Preimages.
Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

2011
Two New Measures for Permutations: Ambiguity and Deficiency.
IEEE Trans. Inf. Theory, 2011

Swan-like results for binomials and trinomials over finite fields of odd characteristic.
Des. Codes Cryptogr., 2011

Turbo Lattices: Construction and Performance Analysis
CoRR, 2011

Counting Words by Number of Occurrences of Some Patterns.
Electron. J. Comb., 2011

Ambiguity and deficiency of permutations from finite fields.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form.
IEEE Trans. Computers, 2010

Adaptive sampling strategies for quickselects.
ACM Trans. Algorithms, 2010

Public-key encryption based on Chebyshev polynomials over GF(q).
Inf. Process. Lett., 2010

Asymptotics of smallest component sizes in decomposable structures of alg-log type.
Discret. Math. Theor. Comput. Sci., 2010

The number of irreducible polynomials of degree n over F<sub>q</sub> with given trace and constant terms.
Discret. Math., 2010

Codes with girth 8 Tanner graph representation.
Des. Codes Cryptogr., 2010

Self-Inverse Interleavers for Turbo Codes
CoRR, 2010

Ambiguity and Deficiency in Costas Arrays and APN Permutations.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Bivariate Asymptotics for Striped Plane Partitions.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Construction of turbo lattices.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Self-inverse interleavers based on permutation functions for turbo codes.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms.
SIAM J. Discret. Math., 2009

Efficient <i>p</i> th root computations in finite fields of characteristic <i>p</i>.
Des. Codes Cryptogr., 2009

2008
Low Complexity Normal Elements over Finite Fields of Characteristic Two.
IEEE Trans. Computers, 2008

The trace of an optimal normal element and low complexity normal bases.
Des. Codes Cryptogr., 2008

Algorithms to Locate Errors Using Covering Arrays.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Division of trinomials by pentanomials and orthogonal arrays.
Des. Codes Cryptogr., 2007

2006
Low-Density Parity-Check Lattices: Construction and Decoding Analysis.
IEEE Trans. Inf. Theory, 2006

Degree distribution of the greatest common divisor of polynomials over F<sub><i>q</i></sub>.
Random Struct. Algorithms, 2006

The Number of Permutation Binomials over F<sub>4p+1</sub> where p and 4p+1 are Primes.
Electron. J. Comb., 2006

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.
Electron. J. Comb., 2006

Asymptotics of Largest Components in Combinatorial Structures.
Algorithmica, 2006

Preface.
Algorithmica, 2006

2005
Flexible tree-search based orthogonal matching pursuit algorithm.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004
Asymptotics of combinatorial structures with large smallest component.
J. Comb. Theory A, 2004

Low complexity normal bases in F<sub>2<sup>2</sup></sub>.
Finite Fields Their Appl., 2004

The Degree of the Splitting Field of a Random Polynomial over a Finite Field.
Electron. J. Comb., 2004

Adaptive sampling for quickselect.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Integer to integer Karhunen Loeve transform over finite fields [communication system applications].
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

A Simple Primality Test and th rth Smallest Prime Factor.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Linear transformation shift registers.
IEEE Trans. Inf. Theory, 2003

What Do Random Polynomials over Finite Fields Look Like?
Proceedings of the Finite Fields and Applications, 2003

Mutual Irreducibility of Certain Polynomials.
Proceedings of the Finite Fields and Applications, 2003

Low density parity check lattices based on construction D' and cycle-free Tanner graphs.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002
Polynomials over finite fields free from large and small degree irreducible factors.
J. Algorithms, 2002

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.
Des. Codes Cryptogr., 2002

2001
Analysis of Rabin's irreducibility test for polynomials over finite fields.
Random Struct. Algorithms, 2001

The index calculus method using non-smooth polynomials.
Math. Comput., 2001

Factoring Polynomials Over Finite Fields: A Survey.
J. Symb. Comput., 2001

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields.
J. Algorithms, 2001

Exact Largest and Smallest Size of Components.
Algorithmica, 2001

Smallest Components in Decomposable Structures: Exp-Log Class.
Algorithmica, 2001

2000
Algorithms for Exponentiation in Finite Fields.
J. Symb. Comput., 2000

1998
Analysis of Ben-Or's polynomial irreducibility test.
Random Struct. Algorithms, 1998

Gauss periods: orders and cryptographical applications.
Math. Comput., 1998

Analysis of Rabin's Polynomial Irreducability Test.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

An Analytic Approach to Smooth Polynominals over Finite Fields.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997
Combinatorial and algebraic aspects of polynomials over finite fields.
PhD thesis, 1997

1996
Random Polynomials and Polynomial Factorization.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).
Proceedings of the LATIN '95: Theoretical Informatics, 1995


  Loading...