|
|||||
|
|
On the applications of Extremal Graph Theory to Coding Theory and Cryptography |
|
| Institution: | 1. Department of Mathematics, College of Science, King Khalid University, Abha, Saudi Arabia;2. Department of Mathematics, Quaid-i-Azam University, Islamabad, Pakistan;3. Department of Mathematics, University of Management and Technology, Sialkot, Pakistan |
| Abstract: | Explicit constructions in Extremal graph theory give appropriate lower bound for Turan type problems. In the case of prohibited cycles explicit constructions can be used in various problems of Information Security. We observe algebraic constructions of regular graphs of large girth and graphs with large cycle indicator and describe some algorithms of Coding Theory and Cryptography based on such special families of graphs. |
| Keywords: | graphs of large girth graphs of large cycle indicator LDPC codes graph based stream ciphers multivariate cryptography key exchange protocols |
| 本文献已被 ScienceDirect 等数据库收录！ | |