Sciweavers

2 search results - page 1 / 1
» Fast Multi-computations with Integer Similarity Strategy
Sort
View
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
13 years 10 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
ENDM
2007
85views more  ENDM 2007»
13 years 4 months ago
Fast winning strategies in positional games
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...