33193327
An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications
A new algorithm is developed for making attacks to certain comparatively simple LFSR based ciphersystems. Special attention is paid towards minimizing the solution distance and guaranteeing the success probability of the attacks. The algorithm is then applied to crack the random bit generators of Geffe (1973) and Beth-Piper (1984).
8656490
Large Primes in Stream Cipher Cryptography
The present research is motivated by the observation that if the period T of a certain binary sequence is a prime, then its linear complexity will be bounded from below by the order of 2 modulo T, i.e., LC⩾OrdT(2). A class of generators with state periods T(q, n)=q·2n−1 are constructed for q=3, 5, 7, 9 and arbitrary n on the basis of a pair of m-sequence generators with the same number of stages, each controlling the clock of the other (bilateral stop-and-go clock control). A new test is derived to find the primes among the numbers T(q, n) with the cases 3 | q and 3 | q treated in a unified manner. The orders of 2 modulo some of the primes T(q, n) are given and some additional cryptographic and implementational remarks are made.
7396248
SDMI-based rights management systems
Building digital rights management (DRM) systems for electronic commerce is still a complex task because such systems are usually required to manage a large set of different media contents, rights information, and enabling technologies. The Secure Digital Music Initiative (SDMI) was proposed to provide a secure environment in which rights management is performed for music distribution through the Internet. Rights management in SDMI is implemented by digital watermarking, but it is not the responsibility of SDMI to provide guidelines for the design of digital watermarks and to explore other potential benefits of using digital watermarks for the music distribution business. This paper fills this gap by proposing an SDMI-based rights management system. The proposed rights management system can support basic SDMI functions and non-SDMI features such as video. A prototype of the SDMI-based rights management system has been developed and the interfaces of the major components are presented.
1160125
Foreign Name Backward Transliteration in Chinese-English Cross-Language Image Retrieval
In this paper we propose an approach to deal with the Chinese-English cross-language image retrieval problem. Text-based image retrieval and query translation methods were adopted in the experiments. A similarity-based backward transliteration model with candidate filter was proposed to translate proper nouns that have no entries in a bilingual dictionary. The experimental results showed that using similarity-based backward transliteration increased retrieval performances.
12707268
A Peer-to-Peer Based Framework of InterLibrary Cooperation for Digital Libraries
Traditionally, interlibrary cooperation is an important interaction between libraries. Nevertheless, the emerging digital library architecture has not explicitly supported this requirement. In this paper, we proposed an interlibrary cooperation framework for digital libraries using P2P technology. An application of this framework to Faculty Publication Sharing System was presented. Besides, a reputation model based on data mining is utilized to provide libraries with incentives to join this framework
7536937
An algorithm for all-du-path testing coverage of shared memory parallel programs
Little attention has focused on applying traditional testing methodology to parallel programs. This paper discusses issues involved in providing all-du-path coverage in shared memory parallel programs, and describes an algorithm for finding a set of paths covering all define-use pairs. To our knowledge, this is the first effort of this kind.
7211602
Improved fast gauss transform and efficient kernel density estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimation technique. The quadratic computational complexity of the summation is a significant barrier to the scalability of this algorithm to practical applications. The fast Gauss transform (FGT) has successfully accelerated the kernel density estimation to linear running time for low-dimensional problems. Unfortunately, the cost of a direct extension of the FGT to higher-dimensional problems grows exponentially with dimension, making it impractical for dimensions above 3. We develop an improved fast Gauss transform to efficiently estimate sums of Gaussians in higher dimensions, where a new multivariate expansion scheme and an adaptive space subdivision technique dramatically improve the performance. The improved FGT has been applied to the mean shift algorithm achieving linear computational complexity. Experimental results demonstrate the efficiency and effectiveness of our algorithm.