402 search results - page 14 / 81 » Cryptosystems using Linear Groups |
109
click to vote
SACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
106
click to vote
CARDIS
2000
Springer
15 years 2 months ago
2000
Springer
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
SACRYPT
1999
Springer
15 years 2 months ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...
FSE
2006
Springer
15 years 1 months ago
2006
Springer
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...