Sciweavers

365 search results - page 41 / 73
» On the combinatorics of Galois numbers
Sort
View
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
15 years 3 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
COCOON
2000
Springer
15 years 4 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
COCOON
2006
Springer
15 years 3 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
CVPR
2012
IEEE
13 years 2 months ago
Unsupervised learning of translation invariant occlusive components
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...
Zhenwen Dai, Jörg Lücke
CISS
2007
IEEE
15 years 6 months ago
High-Throughput Cooperative Communications with Complex Field Network Coding
Relay-based cooperative communications can achieve spatial diversity gains, enhance coverage and potentially increase capacity. If considered for large networks, traditional relayi...
Tairan Wang, Georgios B. Giannakis