Daniel J. Katz

45 papers C 1Journal 44

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences. IEEE Trans. Inf. Theory Daniel J. Katz, Miriam E. Ramirez
2025	J	`jnl`	Moments of autocorrelation demerit factors of binary sequences. Des. Codes Cryptogr. Daniel J. Katz, Miriam E. Ramirez
2025	J	`jnl`	Sequences With Identical Autocorrelation Functions. IEEE Trans. Inf. Theory Daniel J. Katz, Adeebur Rahman, Michael J. Ward
2023	J	`jnl`	Almost perfect nonlinear power functions with exponents expressed as fractions. CoRR Daniel J. Katz, Kathleen R. O'Connor, Kyle Pacheco, Yakov Sapozhnikov
2023	J	`jnl`	Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences. CoRR Daniel J. Katz, Miriam E. Ramirez
2023	J	`jnl`	Moments of Autocorrelation Demerit Factors of Binary Sequences. CoRR Daniel J. Katz, Miriam E. Ramirez
2023	J	`jnl`	Rationality of Four-Valued Families of Weil Sums of Binomials. CoRR Daniel J. Katz, Allison E. Wong
2023	J	`jnl`	Sequences with identical autocorrelation spectra. CoRR Daniel J. Katz, Adeebur Rahman, Michael J. Ward
2022	J	`jnl`	Peak Sidelobe Level and Peak Crosscorrelation of Golay-Rudin-Shapiro Sequences. IEEE Trans. Inf. Theory Daniel J. Katz, Courtney M. van der Linden
2022	J	`jnl`	Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation. IEEE Trans. Inf. Theory Daniel J. Katz, Eli Moore
2021	J	`jnl`	Peak Sidelobe Level and Peak Crosscorrelation of Golay-Rudin-Shapiro Sequences. CoRR Daniel J. Katz, Courtney M. van der Linden
2021	J	`jnl`	Sets of Low Correlation Sequences from Cyclotomy. CoRR Jonathan M. Castello, Daniel J. Katz, Jacob M. King, Alain Olavarrieta
2021	J	`jnl`	The Resolution of Niho's Last Conjecture Concerning Sequences, Codes, and Boolean Functions. IEEE Trans. Inf. Theory Tor Helleseth, Daniel J. Katz, Chunlei Li
2020	J	`jnl`	Rudin-Shapiro-Like Sequences With Maximum Asymptotic Merit Factor. IEEE Trans. Inf. Theory Daniel J. Katz, Sangman Lee, Stanislav A. Trunov
2020	J	`jnl`	The resolution of Niho's last conjecture concerning sequences, codes, and Boolean functions. CoRR Tor Helleseth, Daniel J. Katz, Chunlei Li
2018	J	`jnl`	On Chebotarëv's nonvanishing minors theorem and the Biró-Meshulam-Tao discrete uncertainty principle. CoRR Stephan Ramon Garcia, Gizem Karaali, Daniel J. Katz
2018	C	`conf`	Sequences with Low Correlation. WAIFI Daniel J. Katz
2018	J	`jnl`	Sequences with Low Correlation. CoRR Daniel J. Katz
2018	J	`jnl`	Weil sums of binomials: properties and applications. CoRR Daniel J. Katz
2017	J	`jnl`	Crosscorrelation of Rudin-Shapiro-Like Polynomials. CoRR Daniel J. Katz, Sangman Lee, Stanislav A. Trunov
2017	J	`jnl`	Low Correlation Sequences From Linear Combinations of Characters. IEEE Trans. Inf. Theory Kelly T. R. Boothby, Daniel J. Katz
2017	J	`jnl`	Rudin-Shapiro-Like Polynomials with Maximum Asymptotic Merit Factor. CoRR Daniel J. Katz, Stanislav A. Trunov
2017	J	`jnl`	Sequence Pairs with Lowest Combined Autocorrelation and Crosscorrelation. CoRR Daniel J. Katz, Eli Moore
2016	J	`jnl`	Aperiodic Crosscorrelation of Sequences Derived From Characters. IEEE Trans. Inf. Theory Daniel J. Katz
2016	J	`jnl`	Aperiodic Crosscorrelation of Sequences Derived from Characters. CoRR Daniel J. Katz
2016	J	`jnl`	Low Correlation Sequences from Linear Combinations of Characters. CoRR Tomas Boothby, Daniel J. Katz
2016	J	`jnl`	New open problems related to old conjectures by Helleseth. Cryptogr. Commun. Daniel J. Katz, Philippe Langevin
2016	J	`jnl`	On the Number of Similar Instances of a Pattern in a Finite Set. Electron. J. Comb. Bernardo M. Ábrego, Silvia Fernández-Merchant, Daniel J. Katz, Levon Kolesnikov
2015	J	`jnl`	On The Number of Similar Instances of a Pattern in a Finite Set. CoRR Bernardo M. Ábrego, Silvia Fernández-Merchant, Daniel J. Katz, Levon Kolesnikov
2014	J	`jnl`	Divisibility of Weil Sums of Binomials. CoRR Daniel J. Katz
2014	J	`jnl`	New Open Problems Related to Old Conjectures by Helleseth. CoRR Daniel J. Katz, Philippe Langevin
2014	J	`jnl`	Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials. CoRR Daniel J. Katz, Philippe Langevin
2013	J	`jnl`	Advances in the merit factor problem for binary sequences. J. Comb. Theory A Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt
2013	J	`jnl`	Cyclotomy of Weil Sums of Binomials. CoRR Yves Aubry, Daniel J. Katz, Philippe Langevin
2012	J	`jnl`	Advances in the merit factor problem for binary sequences CoRR Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt
2012	J	`jnl`	Asymptotic $L^4$ norm of polynomials derived from characters CoRR Daniel J. Katz
2012	J	`jnl`	Littlewood Polynomials with Small $L^4$ Norm CoRR Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt
2012	J	`jnl`	On theorems of Delsarte-McEliece and Chevalley-Warning-Ax-Katz. Des. Codes Cryptogr. Daniel J. Katz
2012	J	`jnl`	Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth. J. Comb. Theory A Daniel J. Katz
2011	J	`jnl`	Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period 2 CoRR Daniel J. Katz
2010	J	`jnl`	Correction to "Sharp p -Divisibility of Weights in Abelian Codes Over BBZ/p IEEE Trans. Inf. Theory Daniel J. Katz
2008	J	`jnl`	Bounds on degrees of p-adic separating polynomials. J. Comb. Theory A Daniel J. Katz, Joshua Zahl
2008	J	`jnl`	Sharp p -Divisibility of Weights in Abelian Codes Over BBZ/p IEEE Trans. Inf. Theory Daniel J. Katz
2006	J	`jnl`	p-Adic estimates of hamming weights in abelian codes over galois rings. IEEE Trans. Inf. Theory Daniel J. Katz
2005	J	`jnl`	p-Adic valuation of weights in Abelian codes over ℤ(p IEEE Trans. Inf. Theory Daniel J. Katz

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.