180 search results - page 5 / 36 » Discrete Logarithm Based Protocols |
INDOCRYPT
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
ANTS
2010
Springer
14 years 2 months ago
2010
Springer
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
ASIACRYPT
2000
Springer
14 years 3 months ago
2000
Springer
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...
ACNS
2004
Springer
14 years 2 months ago
2004
Springer
A general technique of batch verification for equality of discrete logarithms is proposed. Examples of batching threshold decryption schemes are presented based on threshold versio...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...