Sciweavers

933 search results - page 27 / 187
» Monotone Complexity of a Pair
Sort
View
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 9 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi
CSDA
2008
115views more  CSDA 2008»
13 years 7 months ago
Complex-valued ICA based on a pair of generalized covariance matrices
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
Esa Ollila, Hannu Oja, Visa Koivunen
COMPSAC
2003
IEEE
14 years 25 days ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
EUROCRYPT
2010
Springer
14 years 10 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
IANDC
1998
64views more  IANDC 1998»
13 years 7 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...