Sciweavers

532 search results - page 11 / 107
» Graphically abelian groups
Sort
View
CHES
2007
Springer
115views Cryptology» more  CHES 2007»
14 years 4 months ago
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when...
Marc Joye
JCT
2006
54views more  JCT 2006»
13 years 9 months ago
Spectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
Joel Friedman, Ram Murty, Jean-Pierre Tillich
JCT
2008
57views more  JCT 2008»
13 years 9 months ago
Invariant boundary distributions for finite graphs
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
Guyan Robertson
SIAMADS
2010
114views more  SIAMADS 2010»
13 years 4 months ago
The Abelian Hopf H mod K Theorem
We study the symmetries of periodic solutions from Hopf bifurcation in systems with finite abelian symmetries. Our main result, the Abelian Hopf H mod K Theorem, gives necessary a...
Natasha Filipski, Martin Golubitsky
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
14 years 1 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert