Sciweavers

1418 search results - page 71 / 284
» Schema polynomials and applications
Sort
View
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 9 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
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...
Martin Albrecht, Carlos Cid
ICASSP
2010
IEEE
15 years 4 months ago
2-D two-fold symmetric circular shaped filter design with homomorphic processing application
A design method of a linear-phased, two-dimensional (2-D), twofold symmetric circular shaped filter is presented in this paper. Although the proposed method designs a non-separab...
Akila J. Seneviratne, Ha Hoang Kha, Hoang Duong Tu...
JCP
2006
91views more  JCP 2006»
15 years 6 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
JC
2000
138views more  JC 2000»
15 years 6 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
ACMSE
2006
ACM
15 years 10 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar