59 search results - page 4 / 12 » Fast Computation on Encrypted Polynomials and Applications |
FOCS
2002
IEEE
14 years 19 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
ACNS
2011
Springer
12 years 11 months ago
2011
Springer
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
INTEGRATION
2007
13 years 7 months ago
2007
The Data Encryption Standard (DES) is a cipher that is still used in a broad range of applications, from smartcards, where it is often implemented as a tamperresistant embedded co...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...