14386 search results - page 11 / 2878 » The Chinese Generals Problem |
ACMSE
2007
ACM
15 years 3 months ago
2007
ACM
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
132
click to vote
ICMI
2000
Springer
15 years 3 months ago
2000
Springer
For offline handwritten Chinese character recognition, stroke variation is the most difficult problem to be solved. A new method of optimal sampling features is proposed to compens...
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
JSC
2010
14 years 10 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...