1942 search results - page 1 / 389 » Speeding Up XTR |
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
This paper describes several speedups and simpliļ¬cations for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
CHES
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Recently, Lenstra and Verheul proposed an efficient cryptosystem called XTR. This system represents elements of F p6 with order dividing p2 -p+1 by their trace over Fp2 ....
DATESO
2009
13 years 2 months ago
2009
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...