Marie Henderson

Computer Science · Physical Sciences

9h-index332citations23works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Coding theory and cryptography(14), Finite Group Theory Research(6), Polynomial and algebraic computation(5), graph theory and CDMA systems(4), Access Control and Trust(3)

Publications23 total

On the splitting case of a semi-biplane construction
arXiv (Cornell University)·2016Open Access
Giesbrecht's algorithm, the HFE cryptosystem and Ore's $p^s$-polynomials
arXiv (Cornell University)·2016Open Access
Planning Security Services for IT Systems
arXiv (Cornell University)·2014Open Access
On a conjecture on planar polynomials of the form<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">Tr</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mi>u</mml:mi><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
Finite Fields and Their Applications·2013· 5 cited
A note on constructing permutation polynomials
Finite Fields and Their Applications·2009· 13 cited
Commutative presemifields and semifields
Advances in Mathematics·2007· 93 cited
Planar polynomials for commutative semifields with specified nuclei
Designs Codes and Cryptography·2007· 28 cited
Extending abelian groups to rings
Journal of the Australian Mathematical Society·2007· 3 citedOpen Access
On certain combinatorial Diophantine equations and their connection to Pythagorean numbers
Acta Arithmetica·2006Open Access
On decomposition of sub-linearised-polynomials
Journal of the Australian Mathematical Society·2004· 10 citedOpen Access
A note on the roots of trinomials over a finite field
Bulletin of the Australian Mathematical Society·2004· 43 citedOpen Access
The compositional inverse of a class of permutation polynomials over a finite field
Bulletin of the Australian Mathematical Society·2002· 23 citedOpen Access
Modelling Trust Structures for Public Key Infrastructures
Lecture notes in computer science·2002· 14 cited
GIESBRECHT'S ALGORITHM, THE HFE CRYPTOSYSTEM AND ORE'S p<sup>s</sup>-POLYNOMIALS
2001· 7 cited
Permutations amongst the Dembowski-Ostrom Polynomials
2001· 52 cited
Applications of Trusted Review to Information Security
Lecture notes in computer science·2001
A State-Based Model for Certificate Management Systems
Lecture notes in computer science·2000· 7 cited
The PKI Specification Dilemma: A Formal Solution
Lecture notes in computer science·2000· 3 cited
A class of functions and their application in constructing semi-biplanes and association schemes
Discrete Mathematics·1999· 18 cited
Composition behaviour of sub-linearised polynomials over a finite field
Contemporary mathematics - American Mathematical Society·1999· 4 cited
page 1 of 2Next →

Frequent Co-authors

Robert S. Coulter(15), George Havas(3), Rex W. Matthews(2), Chuchang Liu(2), Māris Ozols(2), Tony Cant(2), Aart Blokhuis(1), Christine M. O’Keefe(1), Pamela Kosick(1), Ed Dawson(1), Eiji Okamoto(1), Rex D. Matthews(1), Lynn Batten(1), Felix Lazebnik(1), Howard Philip Page(1), John Yesberg(1)