Daniel M. Gordon

25 papers A* 3Journal 18Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Modular Golomb Rulers and Almost Difference Sets. IEEE Trans. Inf. Theory Daniel M. Gordon
2023	J	`jnl`	Signed difference sets. Des. Codes Cryptogr. Daniel M. Gordon
2021	J	`jnl`	New nonexistence results on circulant weighing matrices. Cryptogr. Commun. K. T. Arasu, Daniel M. Gordon, Yiran Zhang
2016	J	`jnl`	A survey of the multiplier conjecture. Des. Codes Cryptogr. Daniel M. Gordon, Bernhard Schmidt
2011	—	`ch.`	Discrete Logarithm Problem. Encyclopedia of Cryptography and Security (2nd Ed.) Daniel M. Gordon
2011	—	`ch.`	Generic Attacks Against DLP. Encyclopedia of Cryptography and Security (2nd Ed.) Daniel M. Gordon
2010	J	`jnl`	On the density of the set of known Hadamard orders. Cryptogr. Commun. Warwick de Launey, Daniel M. Gordon
2010	J	`jnl`	Optimal hash functions for approximate matches on the n-cube. IEEE Trans. Inf. Theory Daniel M. Gordon, Victor S. Miller, Peter Ostapenko
2008	J	`jnl`	Optimal hash functions for approximate closest pairs on the n-cube CoRR Daniel M. Gordon, Victor S. Miller, Peter Ostapenko
2006	J	`jnl`	Perfect Single Error-Correcting Codes in the Johnson Scheme. IEEE Trans. Inf. Theory Daniel M. Gordon
2001	J	`jnl`	A Comment on the Hadamard Conjecture. J. Comb. Theory A Warwick de Launey, Daniel M. Gordon
2001	J	`jnl`	A remark on Plotkin's bound. IEEE Trans. Inf. Theory Warwick de Launey, Daniel M. Gordon
2000	—	`conf`	Factoring Polynominals over ANTS David G. Cantor, Daniel M. Gordon
1998	J	`jnl`	A Survey of Fast Exponentiation Methods. J. Algorithms Daniel M. Gordon
1998	—	`conf`	Dense Admissible Sets. ANTS Daniel M. Gordon, Eugene R. Rodemich
1996	J	`jnl`	Asymptotically Optimal Covering Designs. J. Comb. Theory A Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer
1996	J	`jnl`	On sequences without geometric progressions. Math. Comput. Brienne E. Brown, Daniel M. Gordon
1994	J	`jnl`	Minimum degree games for graphs. Discret. Math. Daniel M. Gordon, Robert W. Robinson, Frank Harary
1994	J	`jnl`	The Prime Power Conjecture is True for n < 2, 000, 000. Electron. J. Comb. Daniel M. Gordon
1993	J	`jnl`	Discrete Logarithms in SIAM J. Discret. Math. Daniel M. Gordon
1992	A*	`conf`	Designing and Detecting Trapdoors for Discrete Log Cryptosystems. CRYPTO Daniel M. Gordon
1992	A*	`conf`	Fast Exponentiation with Precomputation (Extended Abstract). EUROCRYPT Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson
1992	A*	`conf`	Massively Parallel Computation of Discrete Logarithms. CRYPTO Daniel M. Gordon, Kevin S. McCurley
1991	J	`jnl`	Parallel Sorting on Cayley Graphs. Algorithmica Daniel M. Gordon
1982	J	`jnl`	Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inf. Theory Daniel M. Gordon

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.