281 search results - page 37 / 57 » Non-black-box Techniques in Cryptography |
FSE
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
CHES
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
CHES
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
EUROCRYPT
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. The Joint Sparse Form is currently the standard representation system to perform multi-scalar multiplications of the form [n]P + m[Q]. We introduce the concept of Joint D...
WISEC
2009
ACM
14 years 4 months ago
2009
ACM
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...