2446 search results - page 232 / 490 » Choiceless Polynomial Time |
116
Voted
CHES
2001
Springer
15 years 8 months ago
2001
Springer
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
144
Voted
CTRSA
2001
Springer
15 years 8 months ago
2001
Springer
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remain...
157
click to vote
ISAAC
2001
Springer
15 years 8 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
110
Voted
ECRTS
2000
IEEE
15 years 8 months ago
2000
IEEE
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to ...
134
Voted
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...