5488 search results - page 781 / 1098 » On the Secure Implementation of Security Protocols |
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
164
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
155
click to vote
PPL
2008
15 years 6 months ago
2008
This discussion paper explores the problems of operating systems support when implementing concurrency controls at the level of the instruction set in processors designed for mult...
166
click to vote
COREGRID
2007
Springer
16 years 24 days ago
2007
Springer
Abstract Following earlier work demonstrating the utility of Orc as a means of specifying and reasoning about grid applications we propose the enhancement of such specifications w...
182
click to vote
CARDIS
1998
Springer
15 years 11 months ago
1998
Springer
We proposed a new block cipher, Serpent, as a candidate for the Advanced Encryption Standard. This algorithm uses a new structure that simultaneously allows a more rapid avalanche,...