844 search results - page 13 / 169 » Solving the p |
139
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
122
click to vote
CRYPTO
2009
Springer
16 years 22 hour ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
136
click to vote
MOC
2010
15 years 6 days ago
2010
We derive midpoint criteria for solving Pell's equation x2 -Dy2 =
120
click to vote
AIPS
1998
15 years 6 months ago
1998
Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnatur...
148
click to vote
TPDS
2008
15 years 5 months ago
2008
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...