Sciweavers

1399 search results - page 142 / 280
» Multi-party Finite Computations
Sort
View
DCC
2004
IEEE
16 years 3 months ago
Towards a Uniform Description of Several Group Based Cryptographic Primitives
The public key cryptosystems MST1 and MST2 make use of certain kinds of factorizations of finite groups. We show that generalizing such factorizations to infinite groups allows a ...
Maria Isabel Gonzalez Vasco, Consuelo Martínez, R...
ICDCS
2009
IEEE
16 years 1 months ago
Characterization and Solution to a Stateful IDS Evasion
We identify a new type of stateful IDS evasion, named signature evasion. We formalize the signature evasion on those Stateful IDSs whose state can be modeled using Deterministic F...
Issam Aib, Tung Tran, Raouf Boutaba
DAC
2000
ACM
15 years 8 months ago
CYCLONE: automated design and layout of RF LC-oscillators
This paper presents an automated, layout-aware RF LCoscillator design tool, called CYCLONE that delivers an accurate and optimal LC-oscillator design, from specification to layout...
Carl De Ranter, B. De Muer, Geert Van der Plas, Pe...
PARA
1994
Springer
15 years 8 months ago
The Full Quantum Mechanical Three Body Problem of H2+
A model describing the full quantum mechanical three body problem of the hydrogen molecular ion is presented, and some of the numerical results are subsequently discussed. The ove...
K. Museth, Gert D. Billing, J. Linderberg
FCT
2007
Springer
15 years 8 months ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet