Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). - Shuhong Gao; Joachim von zur Gathen; Daniel Panario (LATIN, 1995)

Random Polynomials and Polynomial Factorization. - Philippe Flajolet; Xavier Gourdon; Daniel Panario (ICALP, 1996)

Combinatorial and algebraic aspects of polynomials over finite fields. - Daniel Panario (1997)

An Analytic Approach to Smooth Polynominals over Finite Fields. - Daniel Panario; Xavier Gourdon; Philippe Flajolet (ANTS, 1998)

Analysis of Rabin's Polynomial Irreducability Test. - Daniel Panario; Alfredo Viola (LATIN, 1998)

Gauss periods: orders and cryptographical applications. - Shuhong Gao; Joachim von zur Gathen; Daniel Panario (Math. Comput., 1998)

Analysis of Ben-Or's polynomial irreducibility test. - Daniel Panario; L. Bruce Richmond (Random Struct. Algorithms, 1998)

Algorithms for Exponentiation in Finite Fields. - Shuhong Gao; Joachim von zur Gathen; Daniel Panario; Victor Shoup (J. Symb. Comput., 2000)

Smallest Components in Decomposable Structures: Exp-Log Class. - Daniel Panario; L. Bruce Richmond (Algorithmica, 2001)

Exact Largest and Smallest Size of Components. - Daniel Panario; L. Bruce Richmond (Algorithmica, 2001)

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. - Philippe Flajolet; Xavier Gourdon; Daniel Panario (J. Algorithms, 2001)

Factoring Polynomials Over Finite Fields: A Survey. - Joachim von zur Gathen; Daniel Panario (J. Symb. Comput., 2001)

The index calculus method using non-smooth polynomials. - Theodoulos Garefalakis; Daniel Panario (Math. Comput., 2001)

Analysis of Rabin's irreducibility test for polynomials over finite fields. - Daniel Panario; Boris G. Pittel; L. Bruce Richmond; Alfredo Viola (Random Struct. Algorithms, 2001)

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. - Michael Drmota; Daniel Panario (Des. Codes Cryptogr., 2002)

Polynomials over finite fields free from large and small degree irreducible factors. - Theodoulos Garefalakis; Daniel Panario (J. Algorithms, 2002)

Low density parity check lattices based on construction D' and cycle-free Tanner graphs. - Mohammad-Reza Sadeghi 001; Daniel Panario (Algebraic Coding Theory and Information Theory, 2003)

Mutual Irreducibility of Certain Polynomials. - Michael Dewar; Daniel Panario (International Conference on Finite Fields and Applications, 2003)

What Do Random Polynomials over Finite Fields Look Like? - Daniel Panario (International Conference on Finite Fields and Applications, 2003)

Linear transformation shift registers. - Michael Dewar; Daniel Panario (IEEE Trans. Inf. Theory, 2003)

A Simple Primality Test and th rth Smallest Prime Factor. - Daniel Panario; L. Bruce Richmond; Martha Yip (ALENEX/ANALC, 2004)

Integer to integer Karhunen Loeve transform over finite fields [communication system applications]. - Günes Karabulut; Daniel Panario; Abbas Yongaçoglu (ICASSP (5), 2004)

Adaptive sampling for quickselect. - Conrado Martinez; Daniel Panario; Alfredo Viola (SODA, 2004)

The Degree of the Splitting Field of a Random Polynomial over a Finite Field. - John D. Dixon; Daniel Panario (Electron. J. Comb., 2004)

Low complexity normal bases in F22. - Benjamin Young; Daniel Panario (Finite Fields Their Appl., 2004)

Asymptotics of combinatorial structures with large smallest component. - Edward A. Bender; Atefeh Mashatan; Daniel Panario; L. Bruce Richmond (J. Comb. Theory A, 2004)

Flexible tree-search based orthogonal matching pursuit algorithm. - Günes Karabulut; Lucia Moura; Daniel Panario; Abbas Yongaçoglu (ICASSP (4), 2005)

Preface. - Philippe Jacquet; Daniel Panario; Wojciech Szpankowski (Algorithmica, 2006)

Asymptotics of Largest Components in Combinatorial Structures. - Mohamed Omar; Daniel Panario; L. Bruce Richmond; Jacki Whitely (Algorithmica, 2006)

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. - Philippe Flajolet; Éric Fusy; Xavier Gourdon; Daniel Panario; Nicolas Pouyanne (Electron. J. Comb., 2006)

The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes. - Ariane M. Masuda; Daniel Panario; Qiang Wang 012 (Electron. J. Comb., 2006)

Degree distribution of the greatest common divisor of polynomials over Fq. - Zhicheng Gao; Daniel Panario (Random Struct. Algorithms, 2006)

Low-Density Parity-Check Lattices: Construction and Decoding Analysis. - Mohammad-Reza Sadeghi 001; Amir H. Banihashemi; Daniel Panario (IEEE Trans. Inf. Theory, 2006)

Division of trinomials by pentanomials and orthogonal arrays. - Michael Dewar; Lucia Moura; Daniel Panario; Brett Stevens; Qiang Wang 012 (Des. Codes Cryptogr., 2007)

Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields. - Juliano B. Lima; Ricardo M. Campello de Souza; Daniel Panario (ISIT, 2008)

Algorithms to Locate Errors Using Covering Arrays. - Conrado Martínez; Lucia Moura; Daniel Panario; Brett Stevens (LATIN, 2008)

The trace of an optimal normal element and low complexity normal bases. - Maria Christopoulou; Theodoulos Garefalakis; Daniel Panario; David Thomson (Des. Codes Cryptogr., 2008)

Low Complexity Normal Elements over Finite Fields of Characteristic Two. - Ariane M. Masuda; Lucia Moura; Daniel Panario; David Thomson (IEEE Trans. Computers, 2008)

Efficient p th root computations in finite fields of characteristic p. - Daniel Panario; David Thomson (Des. Codes Cryptogr., 2009)

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. - Conrado Martínez; Lucia Moura; Daniel Panario; Brett Stevens (SIAM J. Discret. Math., 2009)

Self-inverse interleavers based on permutation functions for turbo codes. - Amin Sakzad; Daniel Panario; Mohammad-Reza Sadeghi 001; Nasim Eshghi (Allerton, 2010)

Construction of turbo lattices. - Amin Sakzad; Mohammad-Reza Sadeghi 001; Daniel Panario (Allerton, 2010)

Bivariate Asymptotics for Striped Plane Partitions. - Daniel Panario; L. Bruce Richmond; Benjamin Young (ANALCO, 2010)

Ambiguity and Deficiency in Costas Arrays and APN Permutations. - Daniel Panario; Brett Stevens; Qiang Wang 012 (LATIN, 2010)

Self-Inverse Interleavers for Turbo Codes - Amin Sakzad; Mohammad-Reza Sadeghi 001; Daniel Panario; Nasim Eshghi (CoRR, 2010)

Codes with girth 8 Tanner graph representation. - Amin Sakzad; Mohammad-Reza Sadeghi 001; Daniel Panario (Des. Codes Cryptogr., 2010)

The number of irreducible polynomials of degree n over Fq with given trace and constant terms. - B. Omidi Koma; Daniel Panario; Qiang Wang 012 (Discret. Math., 2010)

Asymptotics of smallest component sizes in decomposable structures of alg-log type. - Li Dong; Zhicheng Gao; Daniel Panario; L. Bruce Richmond (Discret. Math. Theor. Comput. Sci., 2010)

Public-key encryption based on Chebyshev polynomials over GF(q). - Juliano B. Lima; Daniel Panario; Ricardo M. Campello de Souza (Inf. Process. Lett., 2010)

Adaptive sampling strategies for quickselects. - Conrado Martínez; Daniel Panario; Alfredo Viola (ACM Trans. Algorithms, 2010)

A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form. - Juliano B. Lima; Daniel Panario; Qiang Wang 012 (IEEE Trans. Computers, 2010)

Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p. - Asie Abolpour; Mohammad-Reza Sadeghi 001; Daniel Panario (ITW, 2011)

Ambiguity and deficiency of permutations from finite fields. - Daniel Panario; Amin Sakzad; Brett Stevens; Qiang Wang 012 (ITW, 2011)

Counting Words by Number of Occurrences of Some Patterns. - Zhicheng Gao; Andrew MacFie; Daniel Panario (Electron. J. Comb., 2011)

Turbo Lattices: Construction and Performance Analysis - Amin Sakzad; Mohammad-Reza Sadeghi 001; Daniel Panario (CoRR, 2011)

Swan-like results for binomials and trinomials over finite fields of odd characteristic. - Brandon Hanson; Daniel Panario; David Thomson (Des. Codes Cryptogr., 2011)

Two New Measures for Permutations: Ambiguity and Deficiency. - Daniel Panario; Amin Sakzad; Brett Stevens; Qiang Wang 012 (IEEE Trans. Inf. Theory, 2011)

Random Mappings with Restricted Preimages. - Andrew MacFie; Daniel Panario (LATINCRYPT, 2012)

Word-Oriented Transformation Shift Registers and Their Linear Complexity. - Sartaj Ul Hasan; Daniel Panario; Qiang Wang 012 (SETA, 2012)

Interval Partitions and Polynomial Factorization. - Joachim von zur Gathen; Daniel Panario; L. Bruce Richmond (Algorithmica, 2012)

Cycle structure of permutation functions over finite fields and their applications. - Amin Sakzad; Mohammad-Reza Sadeghi 001; Daniel Panario (Adv. Math. Commun., 2012)

Generalized Alcuin's Sequence. - Daniel Panario; Murat Sahin; Qiang Wang 012 (Electron. J. Comb., 2012)

Gauss periods as constructions of low complexity normal bases. - Maria Christopoulou; Theodoulos Garefalakis; Daniel Panario; David Thomson (Des. Codes Cryptogr., 2012)

Divisibility of polynomials over finite fields and combinatorial applications. - Daniel Panario; Olga Sosnovski; Brett Stevens; Qiang Wang 012 (Des. Codes Cryptogr., 2012)

A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields. - Daniel Panario; Georgios Tzanakis (Finite Fields Their Appl., 2012)

Sets of orthogonal hypercubes of class r. - John T. Ethier; Gary L. Mullen; Daniel Panario; Brett Stevens; David Thomson (J. Comb. Theory A, 2012)

In honour of the research and influence of Joachim von zur Gathen at 60. - Mark Giesbrecht; Daniel Panario (J. Symb. Comput., 2012)

Introduction to finite fields : Basic properties of finite fields. - Gary L. Mullen; Daniel Panario (Handbook of Finite Fields, 2013)

Introduction to primitive polynomials. - Gary L. Mullen; Daniel Panario (Handbook of Finite Fields, 2013)

Conditions for reducible polynomials. - Daniel Panario (Handbook of Finite Fields, 2013)

Univariate polynomial counting and algorithms. - Daniel Panario (Handbook of Finite Fields, 2013)

Existence and properties of k-normal elements over finite fields. - Sophie Huczynska; Gary L. Mullen; Daniel Panario; David Thomson (Finite Fields Their Appl., 2013)

A Family of Fibonacci-Like Conditional Sequences. - Daniel Panario; Murat Sahin; Qiang Wang 012 (Integers, 2013)

Grobner Bases for Lattices and an Algebraic Decoding Algorithm. - Malihe Aliasgari; Mohammad-Reza Sadeghi 001; Daniel Panario (IEEE Trans. Commun., 2013)

Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map. - Daniel Panario; Amin Sakzad; Brett Stevens; David Thomson; Qiang Wang 012 (IEEE Trans. Inf. Theory, 2013)

A trigonometric approach for Chebyshev polynomials over finite fields. - Juliano B. Lima; Daniel Panario; Ricardo M. Campello de Souza (Applied Algebra and Number Theory, 2014)

Open Problems for Polynomials over Finite Fields and Applications. - Daniel Panario (Open Problems in Mathematics and Computational Science, 2014)

General conditional recurrences. - Daniel Panario; Murat Sahin; Qiang Wang 012; William Webb (Appl. Math. Comput., 2014)

The rth Smallest Part Size of a Random Integer Partition. - Zhicheng Gao; Conrado Martinez; Daniel Panario; L. Bruce Richmond (Integers, 2014)

A Johnson-type bound for group codes and lattices. - Malihe Aliasgari; Mohammad-Reza Sadeghi 001; Daniel Panario (ACM Commun. Comput. Algebra, 2015)

Binomial ideal associated to a lattice and its label code. - Malihe Aliasgari; Daniel Panario; Mohammad-Reza Sadeghi 001 (ACM Commun. Comput. Algebra, 2015)

Linear complexity profile and correlation measure of interleaved sequences. - Jing Jane He; Daniel Panario; Qiang Wang 012; Arne Winterhof (Cryptogr. Commun., 2015)

An asymptotic formula for the number of irreducible transformation shift registers. - Stephen D. Cohen; Sartaj Ul Hasan; Daniel Panario; Qiang Wang 012 (CoRR, 2015)

Locating modifications in signed data for partial data integrity. - Thaís Bardini Idalino; Lucia Moura; Ricardo Felipe Custódio; Daniel Panario (Inf. Process. Lett., 2015)

Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group. - Claudio M. Qureshi; Daniel Panario (SIAM J. Discret. Math., 2015)

A secret key encryption scheme based on 1-level QC-LDPC lattices. - Khadijeh Bagheri; Mohammad-Reza Sadeghi 001; Taraneh Eghlidos; Daniel Panario (ISCISC, 2016)

Construction of full-diversity 1-level LDPC lattices for block-fading channels. - Hassan Khodaiemehr; Mohammad-Reza Sadeghi 001; Daniel Panario (ISIT, 2016)

Computing Gröbner bases associated with lattices. - Ismara Álvarez-Barrientos; Mijail Borges-Quintana; Miguel Angel Borges-Trenard; Daniel Panario (Adv. Math. Commun., 2016)

Construction of Full-Diversity LDPC Lattices for Block-Fading Channels. - Hassan Khodaiemehr; Mohammad-Reza Sadeghi 001; Daniel Panario (CoRR, 2016)

Finite field constructions of combinatorial arrays. - Lucia Moura; Gary L. Mullen; Daniel Panario (Des. Codes Cryptogr., 2016)

Constructing new covering arrays from LFSR sequences over finite fields. - Georgios Tzanakis; Lucia Moura; Daniel Panario; Brett Stevens (Discret. Math., 2016)

Fast and Simple Modular Interpolation Using Factorial Representation. - Gary L. Mullen; Daniel Panario; David Thomson (Am. Math. Mon., 2016)

Cycle structure of iterating Redei functions. - Claudio M. Qureshi; Daniel Panario; Rodrigo S. V. Martins (Adv. Math. Commun., 2017)

Covering arrays from m-sequences and character sums. - Georgios Tzanakis; Lucia Moura; Daniel Panario; Brett Stevens (Des. Codes Cryptogr., 2017)

Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields. - Daniel Panario; Daniel Santana; Qiang Wang 012 (Finite Fields Their Appl., 2017)

Ordered Orthogonal Array Construction Using LFSR Sequences. - André Guerino Castoldi; Lucia Moura; Daniel Panario; Brett Stevens (IEEE Trans. Inf. Theory, 2017)

Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes. - Rodrigo S. V. Martins; Daniel Panario; Claudio M. Qureshi; Eric Schmutz (AofA, 2018)

A Family of Matrices for Generating Hermite-Gaussian-Like DFT Eigenvectors. - José R. de Oliveira-Neto; Juliano B. Lima; Daniel Panario (ICASSP, 2018)

Secret Sharing Schemes with Hidden Sets. - Rick Lopes de Souza; Martín A. Gagliotti Vigil; Ricardo Felipe Custódio; Florian Caullery; Lucia Moura; Daniel Panario (ISCC, 2018)

Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security. - Hassan Khodaiemehr; Daniel Panario; Mohammad-Reza Sadeghi 001 (ISCISC, 2018)

A Neural Network Lattice Decoding Algorithm. - Mohammad-Reza Sadeghi 001; Farzane Amirzade 001; Daniel Panario; Amin Sakzad (ITW, 2018)

Normal Basis Exhaustive Search: 10 Years Later. - Lucia Moura; Daniel Panario; David Thomson (WAIFI, 2018)

Nonlinear vectorial primitive recursive sequences. - Sartaj Ul Hasan; Daniel Panario; Qiang Wang 012 (Cryptogr. Commun., 2018)

A non-commutative cryptosystem based on quaternion algebras. - Khadijeh Bagheri; Mohammad-Reza Sadeghi 001; Daniel Panario (Des. Codes Cryptogr., 2018)

Number of t-tuples in arrays from LFSRs. - Daniel Panario; Brett Stevens; Georgios Tzanakis (Electron. Notes Discret. Math., 2018)

Fast modular reduction and squaring in GF(2m). - Lucas Boppre Niehues; Ricardo Felipe Custódio; Daniel Panario (Inf. Process. Lett., 2018)

A generating matrix method for constructing Hermite-Gaussian-like number-theoretic transform eigenvectors. - José R. de Oliveira-Neto; Juliano B. Lima; Daniel Panario (Signal Process., 2018)

Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays. - André Guerino Castoldi; Emerson Luiz do Monte Carmelo; Lucia Moura; Daniel Panario; Brett Stevens (CAI, 2019)

Fixed points of rational functions satisfying the Carlitz property. - Kaitlyn Chubb; Daniel Panario; Qiang Wang 012 (Appl. Algebra Eng. Commun. Comput., 2019)

Unicyclic strong permutations. - Claude Gravel; Daniel Panario; David Thomson (Cryptogr. Commun., 2019)

A Lattice Based Joint Encryption, Encoding and Modulation Scheme. - Khadijeh Bagheri; Taraneh Eghlidos; Mohammad-Reza Sadeghi 001; Daniel Panario (CoRR, 2019)

Squeezing a vectorial nonlinear binary transformation between two perpendicular matrices. - Claude Gravel; Daniel Panario (CoRR, 2019)

The functional graph of linear maps over finite fields and applications. - Daniel Panario; Lucas Reis (Des. Codes Cryptogr., 2019)

The graph structure of Chebyshev polynomials over finite fields and applications. - Claudio M. Qureshi; Daniel Panario (Des. Codes Cryptogr., 2019)

A new class of irreducible pentanomials for polynomial-based multipliers in binary fields. - Gustavo Banegas; Ricardo Felipe Custódio; Daniel Panario (J. Cryptogr. Eng., 2019)

A General Construction of Ordered Orthogonal Arrays Using LFSRs. - Daniel Panario; Mark Saaltink; Brett Stevens; Daniel Wevrick (IEEE Trans. Inf. Theory, 2019)

Finding Linearly Generated Subsequences. - Claude Gravel; Daniel Panario; Bastien Rigault (WAIFI, 2020)

A trigonometric approach for Dickson polynomials over fields of characteristic two. - Juliano B. Lima; Daniel Panario (Appl. Algebra Eng. Commun. Comput., 2020)

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field. - Farzane Amirzade 001; Mohammad-Reza Sadeghi 001; Daniel Panario (Adv. Math. Commun., 2020)

A construction of 픽2-linear cyclic, MDS codes. - Sara D. Cardell; Joan-Josep Climent; Daniel Panario; Brett Stevens (Adv. Math. Commun., 2020)

Finding linearly generated subsequences. - Claude Gravel; Daniel Panario (CoRR, 2020)

Periods of Iterations of Functions with Restricted Preimage Sizes. - Rodrigo S. V. Martins; Daniel Panario; Claudio M. Qureshi; Eric Schmutz (ACM Trans. Algorithms, 2020)

A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes. - Khadijeh Bagheri; Taraneh Eghlidos; Mohammad-Reza Sadeghi 001; Daniel Panario; Hassan Khodaiemehr (IEEE Trans. Commun., 2020)

The Design of a Novel Multiple-Parameter Fractional Number-Theoretic Transform and Its Application to Image Encryption. - José R. de Oliveira-Neto; Juliano B. Lima; Daniel Panario (IEEE Trans. Circuits Syst. Video Technol., 2020)

Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length. - Farzane Amirzade 001; Mohammad-Reza Sadeghi 001; Daniel Panario (ISIT, 2021)

Comparing balanced Zv-sequences obtained from ElGamal function to random balanced sequences. - Daniel Panario; Lucas Pandolfo Perin; Brett Stevens (CoRR, 2021)

Improved constant-sum encodings for hash-based signatures. - Lucas Pandolfo Perin; Gustavo Zambonin; Ricardo Felipe Custódio; Lucia Moura; Daniel Panario (J. Cryptogr. Eng., 2021)

Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels. - Hassan Khodaiemehr; Daniel Panario; Mohammad-Reza Sadeghi 001 (IEEE Trans. Inf. Theory, 2021)

Secure one-way relaying scheme based on random difference family (RDF) lattice codes. - Khadijeh Bagheri; Hassan Khodaiemehr; Taraneh Eghlidos; Daniel Panario (Wirel. Networks, 2021)

Protograph-based LDPC codes with chordless short cycles and large minimum distance. - Farzane Amirzade 001; Mohammad-Reza Sadeghi 001; Daniel Panario (CWIT, 2022)

Maximum-Length Low-Density MDS Codes and Near Resolvable Designs. - Odae Al Aboud; Daniel Panario; Brett Stevens (ISIT, 2022)

Trade-Based LDPC Codes. - Farzane Amirzade 001; Daniel Panario; Mohammad-Reza Sadeghi 001 (ISIT, 2022)

Equivalence Classes and Balance Properties of Interleaved Sequences. - Kirsten Nelson; Daniel Panario; Brett Stevens (IWSDA, 2022)

Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces. - André Guerino Castoldi; Emerson L. Monte Carmelo; Lucia Moura; Daniel Panario; Brett Stevens (CoRR, 2022)

QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs. - Farzane Amirzade 001; Mohammad-Reza Sadeghi 001; Daniel Panario (IEEE Commun. Lett., 2022)

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}]$. - Hai Q. Dinh 001; Bhanu Pratap Yadav; Tushar Bag; Daniel Panario; Ashish Kumar Upadhyay (Cryptogr. Commun., 2023)

Comparing balanced sequences obtained from ElGamal function to random balanced sequences. - Daniel Panario; Lucas Pandolfo Perin; Brett Stevens (Cryptogr. Commun., 2023)

One-generator quasi-cyclic codes and their dual codes. - Kanat Abdukhalikov; Tushar Bag; Daniel Panario (Discret. Math., 2023)

Disjoint Difference Sets and QC-LDPC Codes With Girth 10. - Farzane Amirzade 001; Mohammad-Reza Sadeghi 001; Daniel Panario (IWCIT, 2024)

A Concrete LIP-Based KEM With Simple Lattices. - Gustavo de Castro Biage; Gustavo Zambonin; Thaís Bardini Idalino; Daniel Panario; Ricardo Felipe Custódio (IEEE Access, 2024)

Some New Non-binary Quantum Codes from One-generator Quasi-cyclic Codes. - Tushar Bag; Hai Q. Dinh 001; Daniel Panario (CoRR, 2024)

Quantum Codes from Group Ring Codes. - Kanat Abdukhalikov; Tushar Bag; Daniel Panario (CoRR, 2024)

Nilpotent linearized polynomials over finite fields, revisited. - Daniel Panario; Lucas Reis (Finite Fields Their Appl., 2024)

Linear label code of a root lattice using Gröbner bases. - Malihe Aliasgari; Daniel Panario; Mohammad-Reza Sadeghi 001 (Appl. Algebra Eng. Commun. Comput., 2024)

Construction of Protograph-Based LDPC Codes With Chordless Short Cycles. - Farzane Amirzade 001; Mohammad-Reza Sadeghi 001; Daniel Panario (IEEE Trans. Inf. Theory, 2024)

Revisiting linearly extended discrete functions. - Claude Gravel; Daniel Panario (J. Math. Cryptol., 2024)

Probabilistic root finding in code-based cryptography. - Dúnia Marchiori; Ricardo Custódio; Daniel Panario; Lucia Moura (J. Cryptogr. Eng., 2024)

Girth Analysis of Quantum Quasi-Cyclic LDPC Codes. - Farzane Amirzade 001; Daniel Panario; Mohammad-Reza Sadeghi 001 (Probl. Inf. Transm., 2024)

Additive codes with few weights. - Daniel Panario; Murat Sahin; Qiang Wang 012 (Cryptogr. Commun., 2024)

The graph of a family of functions over quadratic extensions of finite fields. - Claude Gravel; Daniel Panario; Hugo Teixeira (Discret. Math., 2025)

Quasi-polycyclic and skew quasi-polycyclic codes over Fq. - Tushar Bag; Daniel Panario (Finite Fields Their Appl., 2025)

Stable binomials over finite fields. - Arthur Fernandes; Daniel Panario; Lucas Reis (Finite Fields Their Appl., 2025)

The complexity of elliptic normal bases. - Daniel Panario; Mohamadou Sall; Qiang Wang 012 (Finite Fields Their Appl., 2025)