Sciweavers

363 search results - page 12 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 11 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
11 years 10 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
PPSN
2004
Springer
14 years 1 months ago
Finding Knees in Multi-objective Optimization
Abstract. Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searchin...
Jürgen Branke, Kalyanmoy Deb, Henning Dierolf...
DISOPT
2011
201views Education» more  DISOPT 2011»
12 years 11 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
ASIACRYPT
2000
Springer
13 years 12 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois