http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Generalization of Key Distribution Patterns for every $n$-pairof users
신선호,Julia C. Bate 한국전산응용수학회 2008 Journal of applied mathematics & informatics Vol.26 No.3-4
In this paper, we discuss about a generalization of the Key Distribution Pattern which was proposed by C. Mitchell and F. Piper[6]. It is allowing secure communication between every n-pair of users(n ≥ 2) in a large network for reducing storage requirements. We further suggest a generalization of K. Quinn’s bounds in [9] for the number of subkeys in such general Key Distribution Patterns. In this paper, we discuss about a generalization of the Key Distribution Pattern which was proposed by C. Mitchell and F. Piper[6]. It is allowing secure communication between every n-pair of users(n ≥ 2) in a large network for reducing storage requirements. We further suggest a generalization of K. Quinn’s bounds in [9] for the number of subkeys in such general Key Distribution Patterns.
GENERALIZATION OF KEY DISTRIBUTION PATTERNS FOR EVERY n-PAIR OF USERS
Shin, Seon-Ho,Bate, Julia C. Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.3-4
In this paper, we discuss about a generalization of the Key Distribution Pattern which was proposed by C. Mitchell and F. Piper[6]. It is allowing secure communication between every n-pair of users($n\leq2$) in a large network for reducing storage requirements. We further suggest a generalization of K. Quinn's bounds in [9] for the number of subkeys in such general Key Distribution Patterns.