Daniel Panario
Orcid: 0000-0003-3551-4063
According to our database1,
Daniel Panario
authored at least 142 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, January, 2024
Appl. Algebra Eng. Commun. Comput., January, 2024
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
IEEE Commun. Lett., 2022
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
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
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
ACM Trans. Algorithms, 2020
QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field.
Adv. Math. Commun., 2020
Appl. Algebra Eng. Commun. Comput., 2020
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020
2019
IEEE Trans. Inf. Theory, 2019
A new class of irreducible pentanomials for polynomial-based multipliers in binary fields.
J. Cryptogr. Eng., 2019
Des. Codes Cryptogr., 2019
Des. Codes Cryptogr., 2019
Squeezing a vectorial nonlinear binary transformation between two perpendicular matrices.
CoRR, 2019
Appl. Algebra Eng. Commun. Comput., 2019
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
Inf. Process. Lett., 2018
Des. Codes Cryptogr., 2018
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018
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
Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
IEEE Trans. Inf. Theory, 2017
Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields.
Finite Fields Their Appl., 2017
2016
Am. Math. Mon., 2016
Discret. Math., 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology, 2016
2015
SIAM J. Discret. Math., 2015
Inf. Process. Lett., 2015
CoRR, 2015
Cryptogr. Commun., 2015
ACM Commun. Comput. Algebra, 2015
2014
Proceedings of the Open Problems in Mathematics and Computational Science, 2014
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
IEEE Trans. Commun., 2013
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
J. Symb. Comput., 2012
A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields.
Finite Fields Their Appl., 2012
Des. Codes Cryptogr., 2012
Des. Codes Cryptogr., 2012
Adv. Math. Commun., 2012
Proceedings of the Sequences and Their Applications - SETA 2012, 2012
Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012
2011
IEEE Trans. Inf. Theory, 2011
Swan-like results for binomials and trinomials over finite fields of odd characteristic.
Des. Codes Cryptogr., 2011
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
IEEE Trans. Computers, 2010
Inf. Process. Lett., 2010
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
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
2009
SIAM J. Discret. Math., 2009
Des. Codes Cryptogr., 2009
2008
IEEE Trans. Computers, 2008
Des. Codes Cryptogr., 2008
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
Des. Codes Cryptogr., 2007
2006
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
Electron. J. Comb., 2006
2005
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005
2004
J. Comb. Theory, Ser. A, 2004
Finite Fields Their Appl., 2004
Electron. J. Comb., 2004
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
Proceedings of the Finite Fields and Applications, 2003
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
J. Algorithms, 2002
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.
Des. Codes Cryptogr., 2002
2001
Random Struct. Algorithms, 2001
J. Algorithms, 2001
2000
1998
Proceedings of the LATIN '98: Theoretical Informatics, 1998
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998
1997
PhD thesis, 1997
1996
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
1995
Proceedings of the LATIN '95: Theoretical Informatics, 1995