• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1277-1285
• /
• 2003

In this paper, we present a conference key authentication mechanism by employing an algebraic method on IMT-2000 environment. To accomplish this, the symmetric balanced incomplete block design is applied for generating a conference key and then this key is distributed to participants. Through the technique for creation of a conference key and mutual authentications peformed based on identification information, a communication protocol is designed. The protocol proposed minimizes the communication complexity for generating a conference key. On a special case the complexity is O(equation omitted), where v is the number of participants. The security of the mechanism, which is a significant problem in construction of secure systems, can be assured since finding discrete logarithms is generally a hard problem.

• Honam Mathematical Journal
• /
• v.24 no.1
• /
• pp.109-119
• /
• 2002

Some sufficient conditions on the existence and uniqueness of certain symmetric balanced incomplete block design are introduced. Also, a construction algorithm for the design and some examples are presented. The algorithm is developed based on the construction of subspaces of the three-dimensional vector space over a field.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.65-71
• /
• 2001

In this paper, optimal block designs for complete diallel crosses are proposed. These optimal block designs are constructed by using triangular partially balanced incomplete designs derived from symmetric balanced incomplete block designs. Also, it is shown that block designs for complete dialle crosses derived from complementary designs of triangular designs are optimal block designs.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.105-125
• /
• 2005

Motivated by the field experimental designs in agriculture, the theory of block designs has been applied to several areas such as statistics, combinatorics, communication networks, distributed systems, cryptography, etc. An explicit formula and its fast computational algorithm for a class of symmetric balanced incomplete block designs are presented. Based on the formula and the careful investigation of the modulus multiplication table, the algorithm is developed. The computational costs of the algorithm is superior to those of the conventional ones.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.307-312
• /
• 2003

In this paper, a special incidence structure is designed based on (v, k+1, 1)-configuration, a subset of symmetric balanced incomplete block design, where ν = k$^2$+ k + 1. The time complexity required for desinging this incidence structure is O(equation omitted).

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.682-691
• /
• 2012

Key agreement protocol is a fundamental protocol in cryptography whereby two or more participants can agree on a common conference key in order to communicate securely among themselves. In this situation, the participants can securely send and receive messages with each other. An adversary not having access to the conference key will not be able to decrypt the messages. In this paper, we propose a novel identity-based authenticated multi user key agreement protocol employing a symmetric balanced incomplete block design. Our protocol is built on elliptic curve cryptography and takes advantage of a kind of bilinear map called Weil pairing. The protocol presented can provide an identification (ID)-based authentication service and resist different key attacks. Furthermore, our protocol is efficient and needs only two rounds for generating a common conference key. It is worth noting that the communication cost for generating a conference key in our protocol is only O($\sqrt{n}$) and the computation cost is only O($nm^2$), where $n$ implies the number of participants and m denotes the extension degree of the finite field $F_{p^m}$. In addition, in order to resist the different key attack from malicious participants, our protocol can be further extended to provide the fault tolerant property.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.27-32
• /
• 2014

Two-dimensional hybrid codewords are generated by using each row of identity matrix for spatial encoding and nonideal symmetric balance incomplete block design(BIBD) code for spectral encoding. This spatial/spectral optical code-division multiple-access (OCDMA) network uses single-balanced detectors to abstract the desired information bits and to eliminate the multiple-access interference(MAI). Analytical results show that the number of simultaneous users increases significantly by using the proposed hybrid codes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.2
• /
• pp.119-124
• /
• 2015

In this paper, we analyze the effect of line-width of optical sources on the performance of spectral amplitude coding (SAC) optical code division multiple-access (OCDMA) systems. For a performance analysis we use a symmetric balanced incomplete block design (BIBD) code as the code sequence because we can construct a series of code families by choosing different values of q and m. The ideal BIBD code (m=2) requires narrower line-width than the nonideal BIBD codes when the effective power is large ($P_{sr}=-10dBm$). But the nonideal BIBD codes (m>2) need narrower line-width than the ideal BIBD code when $P_{sr}=-25dBm$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.386-393
• /
• 2004

In order to maintain load balancing in distributed systems in a decentralized manner, every node should obtain workload information from all the nodes on the network. It requires $Ο({v^2})$ traffic overheads, where v is the number of nodes. This paper presents a new synchronous dynamic distributed load balancing algorithm for a ( v,k+1,1)-configured network topology, which is a kind of 2k regular graph, based on symmetric balanced incomplete block design, where v equals ${k^2}+k+1$. Our algorithm needs only Ο(v√v) message overheads and each node receives workload information from all the nodes without redundancy. And load balancing in this algorithm is maintained so that every link has same amount of traffic by √v for transferring workload information.

• The Korean Journal of Applied Statistics
• /
• v.12 no.1
• /
• pp.253-260
• /
• 1999

이어진 블록계획 중에서 대칭 균형된 불완비 블록계획(Symmetrical Balanced Incomplete Block Design : SBIBD)을 이용하여 n-ary를 블록 완전이면교배(Complete Diallel Cross : CDC)계획을 설계하였다. 처리 수와 반복 수가 고정된 경우, 이렇게 설계된 계획이 균형된 불완비 블록계획을 이용해서 설계한 계획들 중에서 가장 효율이 높은 계획임을 보인다.