5019 search results - page 186 / 1004 » Computing in Quotient Groups |
159
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
154
click to vote
JCP
2007
15 years 6 months ago
2007
Abstract— Converting a secure group key agreement protocol into password-based setting is not a trivial task. The security of a password-based scheme hinges on preventing diction...
220
click to vote
CSCW
2004
ACM
15 years 6 months ago
2004
ACM
Awareness of others' interests can lead to fruitful collaborations, friendships and positive social change. Interviews of groups involved in both research and corporate work r...
150
click to vote
COLING
2002
15 years 6 months ago
2002
With the rapid growth of real application domains for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build sp...
190
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...