Sciweavers

689 search results - page 21 / 138
» Focusing in Linear Meta-logic
Sort
View
PKC
2010
Springer
138views Cryptology» more  PKC 2010»
13 years 12 months ago
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
Mathias Herrmann, Alexander May
TWC
2008
121views more  TWC 2008»
13 years 7 months ago
Optimal Downlink OFDMA Resource Allocation with Linear Complexity to Maximize Ergodic Rates
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...
Ian C. Wong, Brian L. Evans
INDOCRYPT
2001
Springer
14 years 10 days ago
Cryptographic Functions and Design Criteria for Block Ciphers
Most last-round attacks on iterated block ciphers provide some design criteria for the round function. Here, we focus on the links between the underlying properties. Most notably, ...
Anne Canteaut
ACL
2007
13 years 9 months ago
Shallow Dependency Labeling
We present a formalization of dependency labeling with Integer Linear Programming. We focus on the integration of subcategorization into the decision making process, where the var...
Manfred Klenner
EUSFLAT
2003
105views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Nearness relations and topology
J. Dobrakovov´a and the author in [7] introduced the relation of nearness in Banach space. In this paper we will go on investigating the nearness relation in a linear space with ...
Martin Kalina