1380 search results - page 265 / 276 » A General Polynomial Sieve |
PKC
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
ECOWS
2008
Springer
13 years 10 months ago
2008
Springer
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
AAAI
2010
13 years 10 months ago
2010
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
DAGSTUHL
2007
13 years 10 months ago
2007
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...