47 search results - page 8 / 10 » Solving a 676-Bit Discrete Logarithm Problem in GF(36n) |
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
EUROCRYPT
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
COMPGEOM
1998
ACM
15 years 1 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
QCQC
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
CTRSA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Identity-Based Encryption (IBE) offers an interesting alternative to PKI-enabled encryption as it eliminates the need for digital certificates. While revocation has bee...