Sciweavers

180 search results - page 13 / 36
» Discrete Logarithm Based Protocols
Sort
View
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 2 days ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
15 years 3 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
EUROCRYPT
1999
Springer
15 years 1 months ago
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Distributed key generation is a main component of threshold cryptosystems and distributed cryptographic computing in general. Solutions to the distributed generation of private key...
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,...
ACISP
2010
Springer
14 years 11 months ago
Security Estimates for Quadratic Field Based Cryptosystems
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
Jean-François Biasse, Michael J. Jacobson, ...
JNW
2006
120views more  JNW 2006»
14 years 9 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani