• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.3-12
• /
• 1999

The public key crytptosystem is represented by RSA based on the difficulty of integer factorization and ElGamal cryptosystem based on the intractability of the discrete logarithm problem in a cyclic group G. The index-calculus algorithm for discrete logarithms in GF${$q^n$}^+$ requires an polynomial factorization. The Niederreiter recently developed deterministic facorization algorithm for polynomial over GF$q^n$ In this paper we implemented the arithmetic of finite field with c-language and gibe an implementation of the Niederreiter's algorithm over GF$2^n$ using normal bases.

• Journal of Yeungnam Medical Science
• /
• v.12 no.2
• /
• pp.306-318
• /
• 1995

To evaluate the intractability of partial epileptic patients by variables, the author studied 113 patients (uncontrolled: 45, controlled: 68) who were admitted to the Department of Neurology, College of Medicine, Yeungnam University from January, 1991 to August, 1993. The results were as follows. The items related to complex partial seizures, multiple seizure types and a histories of status epilepticus or clusters of seizures were significantly associated with drug-refractoriness (p<0.01). A high frequency of seizures before evaluation was associated with a poor outcome(p<0.01). The presences of known etiology of seizures, neurologic abnormalities and psychiatric disturbance were associated with limited treatment responses(p<0.01, p<0.05, p<0.01). An abnormal EEG findings such as background slowing, focal slowing, epileptiform discharges or secondarily bilateral synchrony were statistically significant (p<0.01). Age at onset, sex, distribution of epileptic foci, duration of seizure before evaluation, family history and abnormal neuroradiologic findings were not statistically significant. By these results, it was suggested that having at least four factors of the above variables were associated with limited treatment response.

• Journal of Chest Surgery
• /
• v.17 no.1
• /
• pp.133-139
• /
• 1984

Ten cases of the right middle lobe syndromes were experienced. Nine out of ten were treated surgically, six-right middle lobectomy, one-right middle and lower lobectomy, one-right middle lobectomy and decortication, one-incidental right pneumonectomy. Pathologic diagnosis were tuberculosis in five, bronchiectasis in two, organizing pneumonia in one, and foreign body granuloma in one. There were three postoperative complications, postoperative empyema-1, pleural effusion-1, pneu-monia-1. The surgical candidates for middle lobe syndromes were; 1.Suspicious malignancy 2.Fixed bronchiectasis 3.Bronchostenosis 4.Intractability to medical treatment or recurrent atelectasis and obstructive pneumonia.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.553-560
• /
• 2007

In this paper, we consider two components system which lifetimes have Freund's bivariate exponential model with equal failure rates. We propose Bayesian multiple comparisons procedure for the failure rates of I Freund's bivariate exponential populations based on Dirichlet process priors(DPP). The family of DPP is applied in the form of baseline prior and likelihood combination to provide the comparisons. Computation of the posterior probabilities of all possible hypotheses are carried out through Markov Chain Monte Carlo(MCMC) method, namely, Gibbs sampling, due to the intractability of analytic evaluation. The whole process of multiple comparisons problem for the failure rates of bivariate exponential populations is illustrated through a numerical example.

• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.38-42
• /
• 2018

In this paper, we consider measurement allocation problem in a spatially correlated sensor field. Our goal is to determine the probability of each sensor's being measured based on its contribution to the estimation reliability; it is desirable that a sensor improving the estimation reliability is measured more frequently. We consider a spatial correlation model of a sensor field reflecting transmission power limit, noise in measurement and transmission channel, and channel attenuation. Then the estimation reliability is defined distortion error between event source and its estimation at sink. Motivated by the correlation nature, we model the measurement allocation problem into a cooperative game, and then quantify each sensor's contribution using Shapley value. Against the intractability in the computation of exact Shapley value, we deploy a randomized method that enables to compute the approximate Shapley value within a reasonable time. Besides, we envisage a measurement scheduling achieving the balance between network lifetime and estimation reliability.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.11a
• /
• pp.71-80
• /
• 2006

A nonparametric Bayesian multiple comparisons problem (MCP) for dependence parameters in I bivariate exponential populations is studied here. A simple method for pairwise comparisons of these parameters is also suggested. Here we extend the methodology studied by Gopalan and Berry (1998) using Dirichlet process priors. The family of Dirichlet process priors is applied in the form of baseline prior and likelihood combination to provide the comparisons. Computation of the posterior probabilities of all possible hypotheses are carried out through Markov Chain Monte Carlo method, namely, Gibbs sampling, due to the intractability of analytic evaluation. The whole process of MCP for the dependent parameters of bivariate exponential populations is illustrated through a numerical example.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.1
• /
• pp.67-76
• /
• 2005

Bresson et al. have recently proposed an efficient group key agreement scheme well suited for a wireless network environment. Although it is claimed that the proposed scheme is provably secure under certain intractability assumptions, we show in this paper that this claim is unfounded, breaking the allegedly secure scheme in various ways.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.13-22
• /
• 2001

The notion of pseudorandomness plays an important role in modem cryptography as well as computer science. We show a simple and practical construction of a pseudorandom generator based on the intractability of the problem in braid groups. The generator is proved as secure as a hard instance of a variant of the conjugacy problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1065-1085
• /
• 2020

With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.59-69
• /
• 2004

Password-based authenticated group key exchange protocols provide a group of user, communicating over a public(insecure) channel and holding a common human-memorable password, with a session key to be used to construct secure multicast sessions for data integrity and confidentiality. In this paper, we present a password-based authenticated group key exchange protocol and prove the security in the random oracle model and the ideal cipher model under the intractability of the decisional Diffie-Hellman(DH) problem and computational DH problem. The protocol is scalable, i.e. constant round and with O(1) exponentiations per user, and provides forward secrecy.