Sciweavers

247 search results - page 10 / 50
» A New Cryptosystem Based On Hidden Order Groups
Sort
View
APSCC
2007
IEEE
14 years 1 months ago
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments
In order to secure communications for dynamic peer groups in mobile computing environments, key agreement protocols are required. In this paper, we propose a new key agreement pro...
Raylin Tso, Xun Yi, Eiji Okamoto
JCM
2008
134views more  JCM 2008»
13 years 7 months ago
Cover-Free Family based Efficient Group Key Management Strategy in Wireless Sensor Network
Abstract-- Secure group key distribution and efficient rekeying is one of the most challenging security issues in sensor networks at present. In this paper, Latin square is firstly...
Li Xu, Jianwei Chen, Xiaoding Wang
BMCBI
2006
160views more  BMCBI 2006»
13 years 7 months ago
Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources
Background: In order to improve gene prediction, extrinsic evidence on the gene structure can be collected from various sources of information such as genome-genome comparisons an...
Mario Stanke, Oliver Schöffmann, Burkhard Mor...
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
14 years 1 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama
CSDA
2008
126views more  CSDA 2008»
13 years 7 months ago
A new genetic algorithm in proteomics: Feature selection for SELDI-TOF data
Mass spectrometry from clinical specimens is used in order to identify biomarkers in a diagnosis. Thus, a reliable method for both feature selection and classification is required...
Christelle Reynès, Robert Sabatier, Nicolas...