DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Se-Hun | - |
dc.contributor.advisor | 김세헌 | - |
dc.contributor.author | Um, Bong-Sik | - |
dc.contributor.author | 엄봉식 | - |
dc.date.accessioned | 2011-12-14T05:30:20Z | - |
dc.date.available | 2011-12-14T05:30:20Z | - |
dc.date.issued | 1995 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=98595&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/43756 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 경영과학과, 1995.2, [ vi, 120 p. ] | - |
dc.description.abstract | The security problem on sensitive information carried over computer telecommunication networks is one of major issues in an information oriented society. To make information transmitted over networks to be secure, it is inevitable to use the information processing techniques, cryptosystems. Currently the need for cryptographic protection for communication networks becomes widely recognized. In 1976, Merkle and Hellman introduced the idea of public key cryptosystems, in which encryption key and decryption key are different from each other from the computational complexity point of view. Since then, many kinds of public key cryptosystems have been developed. Public key cryptosystems are, generally, based on hard number theoretic problems such as discrete logarithm or factoring large numbers. From the wide application areas and the obvious relations to complexity theory, public key cryptosystem is one of the major research areas in cryptography. Among cryptosystems, knapsack public key cryptosystems are characterized by the efficiency in encryption and decryption process. They are constructed by imposing a trapdoor on a knapsack problem which falls into the category of NP-complete problem. To convince the security of cryptosystems and guide a more secure construction of cryptosystems, it is essential to develop methods for breaking cryptosystems. There does not exist a methodology to convince the security of cryptosystems completely. Their security can be assured only by showing that they are secure against all possible attacks known yet. There are many attacks on knapsack public key cryptosystems, but most attacks use the lattice basis reduction techniques as the basic tool. However, the knapsack problems on which knapsack public key cryptosystems are constructed, are 0-1 integer problems in nature. Therefore it may be possible to attack on knapsack public key cryptosystems using the mathematical programming techniques. In this paper, we develop two cryptanalytic... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | (A) study on the analysis of cryptosystems for telecommunication | - |
dc.title.alternative | 통신시스템의 암호법 분석 : 수리계획적 접근 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 98595/325007 | - |
dc.description.department | 한국과학기술원 : 경영과학과, | - |
dc.identifier.uid | 000865246 | - |
dc.contributor.localauthor | Kim, Se-Hun | - |
dc.contributor.localauthor | 김세헌 | - |
dc.title.subtitle | mathematical programming approach | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.