Sciweavers

20 search results - page 4 / 4
» Parity of the number of irreducible factors for composite po...
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 6 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
ECRTS
2009
IEEE
13 years 3 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
ICALP
2009
Springer
14 years 5 months ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
EUROCRYPT
1999
Springer
13 years 9 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
EUROCRYPT
2003
Springer
13 years 10 months ago
The GHS Attack Revisited
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
Florian Hess