KMS Of Academy of mathematics and systems sciences, CAS
| solvingbooleanequationsystemsandapplicationsincryptanalysis | |
Gao Xiaoshan1 ; Huang Zhenyu2
| |
| 2016 | |
| Source Publication | sciencechinainformationsciences
 |
| ISSN | 1674-733X |
| Volume | 59Issue:5Pages:2 |
| Abstract | Solving Boolean equation systems plays a fundamental role in many important fields such as coding theory, cryptology, and analysis of computer hardware. To find efficient algorithms for solving Boolean equations and estimate their complexities are central issues in theoretic computer science. In this note, we will survey recent results on the complexity of using the approximate algorithm to solve Boolean equation systems and on new characteristic set algorithms for solving Boolean equation systems and their applications in cryptanalysis. |
| Language | 英语 |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/40103 |
| Collection | 系统科学研究所 |
| Affiliation | 1.中国科学院数学与系统科学研究院 2.中国科学院信息工程研究所 |
| Recommended Citation GB/T 7714 | Gao Xiaoshan,Huang Zhenyu. solvingbooleanequationsystemsandapplicationsincryptanalysis[J]. sciencechinainformationsciences,2016,59(5):2. |
| APA | Gao Xiaoshan,&Huang Zhenyu.(2016).solvingbooleanequationsystemsandapplicationsincryptanalysis.sciencechinainformationsciences,59(5),2. |
| MLA | Gao Xiaoshan,et al."solvingbooleanequationsystemsandapplicationsincryptanalysis".sciencechinainformationsciences 59.5(2016):2. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment