— Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasi...

We propose a speaker verification method using non-audible murmur (NAM) segments, which are different from normal speech and hard for other people to catch them. To use NAM, we therefore take a text-dependent verification strategy in which each user utters her/his own keyword phrase and utilize not only speaker-specific but also keyword-specific acoustic information. We expect this strategy to ...

In this paper, assuming that there is an intermediate functional category called Agreement Phrase (AGRP) in DP, I argue that an adnominal modifier such as a pre-nominal adjective or relative clause (RC) is base-generated in Spec,AGRP. In particular, I distinguish between Restrictive Adnominal Modifiers (RAM) and Non-restrictive Adnominal Modifiers (NAM), and argue that the NAM in head-final lan...

While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...

We point out, in this paper, that the theory of generalized inverses of matrices over nite elds is a potential tool in cryptographic research, by proposing a public key cryptosystem. We analyse some properties of the public key cryptosystem and compare them with those of McEliece's public key cryptosystem. The idea is similar to that of McEliece's public key cryptosystem in terms of the usage o...

Hidden field equation (HFE) multivariable cryptosystems were first suggested by Patarin. Kipnis and Shamir showed that to make the cryptosystem secure, a special parameter D of any HFE cryptosystem can not be too small. Consequently Kipnis, Patarin and Goubin proposed an enhanced variant of the HFE cryptosystem by combining the idea of Oil and Vinegar construction with the HFE construction. Ess...

Biometric cryptosystem provides a seamless connection between the biometrics and traditional password, and it represents a new development in the next generation cryptography. Even if the biometric cryptosystem is secure in algorithmic design, it may still be vulnerable to side-channel attack due to the physical leakage. To assess the possible side-channel attack on biometric cryptosystem, a se...

In 1987, Desmedt first proposed a group oriented cryptosystem. During the past decade, group oriented cryptosystem has become one of the important cryptographical primitives. Laih and Harn proposed a generalized threshold cryptosystem with two models in 1991. In their system, each group is only assigned public key. A ciphertext can be decoded by utilizing all the secret keys owned by the users ...

At Eurocrypt ’96, Meyer and Müller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Rabin-Williams.

Species composition, frequency distribution of diameter classes, species diversity, and stem vitality of woody plants were analyzed in a Mongolian oak (Quercus mongolica Fisch. ex Ledeb.) forests in permanent quadrates of Mt. Nam and Mt. Jeombong, which were installed for Long Term Ecological Research (LTER). The principal objective of this study was to clarify the ecological characteristics of...