358 search results - page 23 / 72 » Report on Generic Case Complexity |
118
click to vote
CSMR
2005
IEEE
15 years 5 months ago
2005
IEEE
Wrapping databases allows them to be reused in formerly unplanned contexts, such as web-based applications or federated systems. Indeed, a wrapper can provide external clients of ...
PAIRING
2007
Springer
15 years 5 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
IACR
2011
13 years 11 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
ISCAS
1999
IEEE
15 years 4 months ago
1999
IEEE
Radix-r modulo rn multipliers and adders are introduced in this paper. The proposed architectures are shown to require several times less area than previously reported architectur...
109
click to vote
COMPSAC
2008
IEEE
15 years 1 months ago
2008
IEEE
This paper presents a methodology for setting up a Decision Support system for User Interface Design (DSUID). We first motivate the role and contributions of DSUID and then demons...