Sciweavers

3702 search results - page 16 / 741
» All Pairings Are in a Group
Sort
View
119
Voted
EM
2010
155views Management» more  EM 2010»
15 years 15 days ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
15 years 2 months ago
An Authentication Scheme Based on the Twisted Conjugacy Problem
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
Vladimir Shpilrain, Alexander Ushakov
IJON
2007
90views more  IJON 2007»
15 years 10 days ago
Spatially organized spike correlation in cat visual cortex
Inspired by optical recordings from visual cortex which show maps of orientation selectivity, and the finding that very similar patterns of population activity occur when the neu...
Denise Berger, David Warren, Richard Normann, Amos...
CP
2005
Springer
15 years 6 months ago
Breaking All Value Symmetries in Surjection Problems
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Jean-Francois Puget
108
Voted
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
15 years 7 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...