Ezra Brown

Learn More
We develop a public key cryptosystem whose security is based on the intractability of the ideal membership problem for a noncommutative algebra over a finite field. We show that this system, which is the noncommutative analogue of the Polly Cracker cryptosystem, is more secure than the commutative version. This is due to the fact that there are a number of(More)
Performing social network analysis (SNA) requires a set of powerful techniques to analyze structural information contained in interactions between social entities. Many SNA technologies and methodologies have been developed and have successfully provided significant insights for small-scale interactions. However, these techniques are not suitable for(More)
1. INTRODUCTION. The groups of invertible matrices over finite fields are among the first groups we meet in a beginning course in modern algebra. Eventually, we find out about simple groups and that the unique simple group of order 168 has two representations as a group of matrices. And this is where we learn that the group of 2 × 2 unimodular matrices over(More)
1. Introduction. Let a and n > 0 be integers, and define G(a, n) to be the directed graph with vertex set V = {0, 1,. .. , n − 1} such that there is an arc from x to y if and only if y ≡ ax (mod n). Recently, Ehrlich [1] studied these graphs in the special case a = 2 and n odd. He proved that if n is odd, then the number of cycles in G(2, n) is odd or even(More)