365 search results - page 35 / 73 » On the combinatorics of Galois numbers |
IAJIT
2006
14 years 11 months ago
2006
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
MOC
2000
14 years 11 months ago
2000
Abstract. There has been important progress in constructing units and Sunits associated to curves of genus 2 or 3. These approaches are based mainly on the consideration of propert...
COMBINATORICS
2006
14 years 12 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
COMBINATORICS
2006
14 years 12 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
COMBINATORICS
2006
14 years 12 months ago
2006
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...