3702 search results - page 29 / 741 » All Pairings Are in a Group |
CORR
2008
Springer
15 years 8 hour ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
104
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained env...
105
click to vote
GC
2010
Springer
14 years 9 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
100
Voted
JOC
2010
14 years 11 months ago
2010
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
WIDM
2004
ACM
15 years 5 months ago
2004
ACM
We present a technique to group search-engine returned citations for person-name queries, such that the search-engine returned citations in each group belong to the same person. T...