检索结果-内蒙古大学图书馆

Numerical algorithm for phase offsets of binary codes in the code division multiple access system

ETRI JOURNAL 2006年第2期28卷 227-230页

作者： Park, HG Hanyang Univ Dept Math Seoul South Korea

There has been a growing need for increased capacity in cellular systems. This has resulted in the adoption of the code division multiple access (CDMA) system as a multiple channel access method. Thus, it is important to obtain the phase offsets of binary codes in the CDAM system because distinct phase offsets of the same code arc, used to distinguish signals received at the mobile station from different base stations. This letter proposes an efficient algorithm to compute the phase offset of a binary code in the CDMA system through the use of the basic facts of number theory and a new notion of the subcodes (of a given code. We also formulate the algorithm in a compact form.

关键词： binary code phase offset code division multiple access system subcode

来源：评论

学校读者我要写书评

暂无评论

Buffer Overflow Detection on binary code

引用

Journal of Shanghai Jiaotong university(Science) 2006年第2期11卷 224-229页

作者：郑燕飞李晖陈克非 School of Information Security Eng. Dept. of Computer Science and Eng. Shanghai Jiaotong Univ. Shanghai 200030 China

Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically the potential buffer overflow vulnerabilities in the binary code of software. The binary code was translated into assembly code without the lose of the information of string operation functions. The feature code abstract graph was constructed to generate more accurate constraint statements, and analyze the assembly code using the method of integer range constraint. After getting the elementary report on suspicious code where buffer overflows possibly happen, the control flow sensitive analysis using program dependence graph was done to decrease the rate of false positive. A prototype was implemented which demonstrates the feasibility and efficiency of the new approach.

关键词： binary code buffer overflow integer range constraint feature abstract graph

来源：评论

学校读者我要写书评

暂无评论

Blurred binary code for the Sustainable Development of Functional Systems

引用

SYSTEMS RESEARCH AND BEHAVIORAL SCIENCE 2018年第4期35卷 386-398页

作者： Appignanesi, Laura Univ Politecn Marche Ancona Italy

Luhmann's general systems theory is based on the concept of autopoietic closed systems. However, social changes, globalization and digitization currently constitute factors of change that require a critical review of this theory. Although moving in the functionalist and systemic tradition, this paper aims to address the problem not of system reproduction but of system transformation, with the focus shifting from the system to its boundaries. This paper considers the use of binary codes for the communicative boundaries of systems, suggesting that rigid binary codes' be replaced by a communication code that includes shades between the two extremes, or better: a trade-off relation. The goal is to align the system to the necessary sustainable development, according to environmental changes. Methodologically, the discussion begins with a concrete example of three partial systems: the legal system, art and mass media. The paper then proposes a logical demonstration and an artistic demonstration through the interpretation of the artworks of M.C. Escher. (c) 2018 John Wiley & Sons, Ltd.

关键词： systems theory binary code trade-off sustainable development

来源：评论

学校读者我要写书评

暂无评论

BUGGRAPH: Differentiating Source-binary code Similarity with Graph Triplet-Loss Network 21

BUGGRAPH: Differentiating Source-Binary Code Similarity with...

引用

16th ACM ASIA Conference on Computer and Communications Security (ACM ASIACCS)

作者： Ji, Yuede Cui, Lei Huang, H. Howie George Washington Univ Graph Comp Lab Washington DC 20052 USA

ISBN: (纸本)9781450382878

binary code similarity detection, which answers whether two pieces of binary code are similar, has been used in a number of applications, such as vulnerability detection and automatic patching. Existing approaches face two hurdles in their efforts to achieve high accuracy and coverage: (1) the problem of source-binary code similarity detection, where the target code to be analyzed is in the binary format while the comparing code (with ground truth) is in source code format. Meanwhile, the source code is compiled to the comparing binary code with either a random or fixed configuration (e.g., architecture, compiler family, compiler version, and optimization level), which significantly increases the difficulty of code similarity detection;and (2) the existence of different degrees of code similarity. Less similar code is known to be more, if not equally, important in various applications such as binary vulnerability study. To address these challenges, we design BugGraph, which performs source-binary code similarity detection in two steps. First, BugGraph identifies the compilation provenance of the target binary and compiles the comparing source code to a binary with the same provenance. Second, BugGraph utilizes a new graph triplet-loss network on the attributed control flow graph to produce a similarity ranking. The experiments on four real-world datasets show that BugGraph achieves 90% and 75% true positive rate for syntax equivalent and similar code, respectively, an improvement of 16% and 24% over state-of-the-art methods. Moreover, BugGraph is able to identify 140 vulnerabilities in six commercial firmware.

关键词： code Similarity Vulnerability binary code Graph Embedding

来源：评论

学校读者我要写书评

暂无评论

Application of static analyses for state-space reduction to the microcontroller binary code

引用

SCIENCE OF COMPUTER PROGRAMMING 2011年第2期76卷 100-118页

作者： Schlich, Bastian Brauer, Joerg Kowalewski, Stefan Rhein Westfal TH Aachen Embedded Software Lab D-52074 Aachen Germany

This paper describes the application of two abstraction techniques, namely dead variable reduction and path reduction, to the microcontroller binary code in order to tackle the state-explosion problem in model checking. These abstraction techniques are based on static analyses, which have to cope with the peculiarities of the binary code such as hardware dependencies, interrupts, recursion, and globally accessible memory locations. An interprocedural static analysis framework is presented that handles these peculiarities. Based on this framework, extensions of dead variable reduction and path reduction are detailed. A case study using several microcontroller programs is presented in order to demonstrate the efficiency of the described abstraction techniques. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Static analysis Model checking Abstraction Embedded software binary code

来源：评论

学校读者我要写书评

暂无评论

Malware behavior analysis using binary code Tracking 4

Malware behavior analysis using Binary code Tracking

引用

4th International Conference on Computer Applications and Information Processing Technology (CAIPT)

作者： Kim, Jihun Youn, Jonghee M. Yeungnam Univ Dept Comp Engn Gyongsan 38541 Gyeongbuk South Korea

ISBN: (纸本)9781538606001

The rapidly increasing malware goes beyond personal security threats and has a negative effect on criminal society. To prevent these security threats, many anti-virus vendors and analysts are starving to more efficiently distinguish malicious behavior. In order to contribute to this, in this study, we try to detect malicious behavior by tracking the execution flow of binary code. Our method of tracking the execution flow of the binary code utilizing the BFS(Breath-First Search) algorithm advances static analysis based on binary code, but it can be a method combining the advantage of static analysis and the advantage of dynamic analysis. In addition to visualizing malicious behavior as a graph image based on APIs, it is possible to analyze more obviously malicious behavior.

关键词： Malware analysis binary code Visulization

来源：评论

学校读者我要写书评

暂无评论

VESTIGE: Identifying binary code Provenance for Vulnerability Detection 19th

VESTIGE: Identifying Binary Code Provenance for Vulnerabilit...

引用

19th International Conference on Applied Cryptography and Network Security (ACNS)

作者： Ji, Yuede Cui, Lei Huang, H. Howie George Washington Univ Graph Comp Lab Washington DC 20037 USA

ISBN: (纸本)9783030783754

Identifying the compilation provenance of a binary code helps to pinpoint the specific compilation tools and configurations that were used to produce the executable. Unfortunately, existing techniques are not able to accurately differentiate among closely related executables, especially those generated with minor different compiling configurations. To address this problem, we have designed a new provenance identification system, VESTIGE. We build a new representation of the binary code, i.e., attributed function call graph (AFCG), that covers three types of features: idiom features at the instruction level, graphlet features at the function level, and function call graph at the binary level. VESTIGE applies a graph neural network model on the AFCG and generates representative embeddings for provenance identification. The experiment shows that VESTIGE achieves 96% accuracy on the publicly available datasets of more than 6,000 binaries, which is significantly better than previous works. When applied for binary code vulnerability detection, VESTIGE can help to improve the top-1 hit rate of three recent code vulnerability detection methods by up to 27%.

关键词： Compilation provenance code similarity Vulnerability binary code Graph neural network

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Obfuscation Scheme Recognition on binary code 1

引用

12th edition of the European Alliance for Innovation (EAI) International Conference on Digital Forensics and Cyber Crime (ICDF2C)

作者： Tian, Zhenzhou Mao, Hengchao Huang, Yaqian Tian, Jie Li, Jinrui Xian Univ Posts & Telecommun Sch Comp Sci & Technol Xian 710121 Peoples R China Shaanxi Key Lab Network Data Anal & Intelligent P Xian Peoples R China

ISBN: (数字)9783031063657

ISBN: (纸本)9783031063657;9783031063640

code obfuscation is to change program characteristics through code transformation, so as to avoid detection by virus scanners or prevent security analysts from performing reverse analysis. This paper proposes a new method of extracting from functions their reduced shortest paths (RSP), through path search and abstraction, to identify functions in a more fine-grained manner. The method of deep representation learning is utilized to identify whether the binary code is obfuscated and the specific obfuscation algorithms used. In order to evaluate the performance of the model, a data set of 60,000 obfuscation samples is constructed. The extensive experimental evaluation results show that the model can successfully identify the characteristics of code obfuscation. The accuracy for the task of identifying whether the code is obfuscated reaches 98.6%, while the accuracy for the task of identifying the specific obfuscation algorithm performed reaches 97.6%.

关键词： code obfuscation recognition binary code Neural network

来源：评论

学校读者我要写书评

暂无评论

Cross-Modality binary code Learning via Fusion Similarity Hashing 30

Cross-Modality Binary Code Learning via Fusion Similarity Ha...

引用

30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Liu, Hong Ji, Rongrong Wu, Yongjian Huang, Feiyue Zhang, Baochang Xiamen Univ Xiamen Peoples R China Tencent Technol Shanghai Co Ltd Shanghai Peoples R China Beihang Univ Beijing Peoples R China

ISBN: (纸本)9781538604571

binary code learning has recently been emerging topic in large-scale cross-modality retrieval. It aims to map features from multiple modalities into a common Hamming space, where the cross-modality similarity can be approximated efficiently via Hamming distance. To this end, most existing works learn binary codes directly from data instances in multiple modalities, which preserve both intra-and inter-modal similarities respectively. Few methods consider to preserve the "fusion similarity" among multi-modal instances instead, which can explicitly capture their heterogeneous correlation in cross-modality retrieval. In this paper, we propose a hashing scheme, termed Fusion Similarity Hashing (FSH), which explicitly embeds the graphbased fusion similarity across modalities into a common Hamming space. Inspired by the "fusion by diffusion", our core idea is to construct an undirected asymmetric graph to model the fusion similarity among different modalities, upon which a graph hashing scheme with alternating optimization is introduced to learn binary codes that embeds such fusion similarity. Quantitative evaluations on three widely used benchmarks, i.e., UCI Handwritten Digit, MIR-Flickr25K and NUS-WIDE, demonstrate that the proposed FSH approach can achieve superior performance over the state-of-the-art methods.

关键词： Cross-Modality binary code Learning via Fusion Similarity Hashing FSH binary code FUEL SLEEVE HOUSING Follicle Stimulating Hormone hashing Fusion reactions FUSION fusion (melting) Fusion, biological Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Dynamic Re-Vectorization of binary code 15

Dynamic Re-Vectorization of Binary Code

引用

International Conference on Embedded Computer Systems Architectures Modeling and Simulation

作者： Hallou, Nabil Rohou, Erven Clauss, Philippe Ketterlin, Alain INRIA Rennes Team ALF Rennes France Univ Strasbourg CNRS Team CAMUS INRIAICube Lab Strasbourg France

ISBN: (纸本)9781467373111

In many cases, applications are not optimized for the hardware on which they run. Several reasons contribute to this unsatisfying situation, including legacy code, commercial code distributed in binary form, or deployment on compute farms. In fact, backward compatibility of ISA guarantees only the functionality, not the best exploitation of the hardware. In this work, we focus on maximizing the CPU efficiency for the SIMD extensions and propose to convert automatically, and at runtime, loops vectorized for an older version of the SIMD extension to a newer one. We propose a lightweight mechanism, that does not include a vectorizer, but instead leverages what a static vectorizer previously did. We show that many loops compiled for x86 SSE can be dynamically converted to the more recent and more powerful AVX;as well as, how correctness is maintained with regards to challenges such as data dependences and reductions. We obtain speedups in line with those of a native compiler targeting AVX. The re-vectorizer is implemented inside a dynamic optimization platform;it is completely transparent to the user, does not require rewriting binaries, and operates during program execution.

关键词： binary code Computer hardware binary form single instruction multiple datastream Leverage compilers Legacy accuracy class Loops backward compatibility deployment

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：