Analysis model of binary code security flaws based on structure characteristics by Tuan XU, Lei-lei QU, Wen-chang SHI

“…Aiming at the shortcomings of the existing methods to detect the security flaws that have complex structures,a new analysis model and its application method was proposed.First,analysis models based on key information of code structures extracted from path subsets of characteristic element sets that are generated by source code element sets of code security flaws were constructed.Then the analysis model according to the statistical probability of each kind of IR statement was calculated,and the IR code group which matched the feature model was found.Finally,through the translating relation between binary codes and IR codes,various code security flaws of binary program were found out.The analysis models can be applied to both common single-process binary programs and binary parallel programs.Experimental results show that compared with the existing methods,the application of the analysis model can be more comprehensive and in-depth in detecting various types of complex binary code security flaws with higher accuracy.…”
Get full text

MSSA: multi-stage semantic-aware neural network for binary code similarity detection by Bangrui Wan, Jianjun Zhou, Ying Wang, Feng Chen, Ying Qian

“…Binary code similarity detection (BCSD) aims to identify whether a pair of binary code snippets is similar, which is widely used for tasks such as malware analysis, patch analysis, and clone detection. …”
Get full text

Urton Gary, Signs of the Inka khipu. Binary Coding in the Andean Knotted-String Record, University of Texas Press, Austin, 2002, 202 p., bibl., index, append., ill., fig., photos by Ingrid Hall

Get full text

Information sets as permutation cycles for quadratic residue codes by Richard A. Jenson

Subjects: “…binary code…”
Get full text

MEASUREMENT OF THE AMPLITUDE OF PERIODIC SIGNALS USING THE FIBONACCI METHOD by V. S. Petrushak

“…Development of new methods and high-rate means for converting the amplitude of high-frequency periodic signals into a binary code with high speed for solving problems of industrial tomography, radar, radio navigation, during measurements of amplitude-frequency characteristics, measurement of the amplitude of signal generators is relevant in scientific terms and useful in practical applications. …”
Get full text

基于透视不变二值特征描述子的图像匹配算法 by Li-chuan GENG, Song-zhi SU, Shao-zi LI

“…Current local feature based image matching algorithms are usually less robust to image perspective transformation.Aiming to solve this problem，a new perspective invariant binary code (PIBC) based image matching algorithm is proposed.Firstly，FAST corners are detected on the pyramid images，those corners with non-maximum Harris corner response value and the edge points are further eliminated.And then，by simulating the perspective transformations of images taken from different viewpoints，a single FAST corner is described with binary descriptors under different viewpoint transformations，which makes the descriptor could describe the identical feature point on different perspective transform images.Experimental results show its robustness to image perspective transformation，while its complexity is similar with SURF.…”
Get full text

Using coverage analysis to extract Botnet command-and-control protocol by Zhi WANG, Ya-yun CAI, Lu LIU, Chun-fu JIA

“…There are some inherent patterns in the bot execution trace coverage of basic blocks.Using these patterns,an approach was proposed to infer Botnet command-and-control protocol (C&C protocol).Without intermediate representation of binary code and constraints solving,this approach has a lower time and space overhead.This coverage analysis approach was evaluated on 3 famous Botnet:Zeus,Sdbot and Agobot.The result shows that this approach can accurately and efficiently extract the Botnet control commands.And the completeness of the extracted control commands could be verified by checking whether all available basic blocks in bot are covered by the traces triggered by the control commands.…”
Get full text

EFH:an online unsupervised hash learning algorithm by Zhenyu SHOU, Jiangbo QIAN, Yihong DONG, Huahui CHEN

“…Many unsupervised learning to hash algorithm needs to load all data to memory in the training phase,which will occupy a large memory space and cannot be applied to streaming data.An unsupervised online learning to hash algorithm called evolutionary forest hash (EFH) was proposed.In a large-scale data retrieval scenario,the improved evolution tree can be used to learn the spatial topology of the data.A path coding strategy was proposed to map leaf nodes to similarity-preserved binary code.To further improve the querying performance,ensemble learning was combined,and an online evolving forest hashing method was proposed based on the evolving trees.Finally,the feasibility of this method was proved by experiments on two widely used data sets.…”
Get full text

Research progress in code reuse attacking and defending by Xiangdong QIAO, Rongxiao GUO, Yong ZHAO

“…Code reuse attacks make use of binary code existed in the attacked target to perform attack action,such technique breaks out the traditional assumption that malicious behavior always be introduced from the outside，it is representative sample of the advanced memory corruption techniques and also the focus of attention in the software security research field.The generation background and implementation principle were described firstly,and then the recent progresses of the technique,including improvement and variants,implementation methods under the different architecture platforms,automatic construction and important extension including blind ROP and non-control data attacks based on code reuse attacks,were introduced respectively.Various defense mechanisms and possible counter-defense methods for code reuse attacks were also discussed.Finally a perspective of the future work in this research area was discussed.…”
Get full text

Survey on static software vulnerability detection for source code by Zhen LI, Deqing ZOU, Zeli WANG, Hai JIN

“…Static software vulnerability detection is mainly divided into two types according to different analysis objects:vulnerability detection for binary code and vulnerability detection for source code.Because the source codecontains more semantic information,it is more favored by code auditors.The existing vulnerability detection research works for source code are summarized from four aspects:code similarity-based vulnerability detection,symbolic execution-based vulnerability detection,rule-based vulnerability detection,and machine learning-based vulnerability detection.The vulnerability detection system based on source code similarity and the intelligent software vulnerability detection system for source code are taken as two examples to introduce the process of vulnerability detection in detail.…”
Get full text

Measurements of Periodic Signals Phase Shifts with Application of Direct Digital Synthesis by I. V. Gula, O. I. Polikarovskykh, K. I. Horiashchenko, I. V. Karpova, V. M. Melnychuk

“…The use of statistical accumulation of pulse coincidence in the basis of the work allowed eliminating the restrictions on the duration of pulses of known non-ionic meters.On the basis of the obtained results, a high-bit converter of phase shifts of high-frequency periodic signals into a binary code with high speed for problems of industrial tomography, radar and radionavigation can be developed.…”
Get full text

Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing by Cong PENG, Jiangbo QIAN, Huahui CHEN, Yihong DONG

“…Because of efficiency in query and storage,learning hash is applied in solving the nearest neighbor search problem.The learning hash usually converts high-dimensional data into binary codes.In this way,the similarities between binary codes from two objects are conserved as they were in the original high-dimensional space.In practical applications,a lot of data which have the same distance from the query point but with different code will be returned.How to reorder these candidates is a problem.An algorithm named weighted self-taught hashing was proposed.Experimental results show that the proposed algorithm can reorder the different binary codes with the same Hamming distances efficiently.Compared to the naive algorithm,the F1-score of the proposed algorithm is improved by about 2 times and it is better than the homologous algorithms,furthermore,the time cost is reduced by an order of magnitude.…”
Get full text

Combinatorial polarization, code loops, and codes of high level by Petr Vojtechovský

“…The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.…”
Get full text

Short Blocklength Nonbinary Raptor-Like LDPC Coding Systems Design and Simulation by Jakub Hyla, Wojciech Sulek

“…In conclusion, this investigation shows that the Raptor-Like nonbinary coding, when the code and the transmission scheme are designed with proper optimizations, exhibits a performance improvement over the counterpart binary coding.…”
Get full text

Extending measurement range for three-dimensional structured light imaging with digital exponential fringe pattern by Abel, Kamagara

“…This approach exploits the fact that at low levels of defocusing, exponential binary-coded fringe pattern exhibits a quasi-sinusoidal form having intact binary structures with reduced or negligible errors owing to high-order harmonic robustness during fringe generation. …”
Get full text

Research and development of hash retrieval technology based on deep learning by Mingwen YUAN, Jiangbo QIAN, Yihong DONG, Huahui CHEN

“…In the era of big data,data shows the characteristics of high dimension,large amount and rapid growth.How to efficiently retrieve similar data from a large amount of complex data is a research hotspot.By mapping data to binary codes,the hashing technique can significantly accelerate the similarity calculation and reduce storage and communication overhead during the retrieval process.In recent years,deep learning has shown excellent performance in extracting data features.Deep learning-based hash retrieval technique has the advantages of high speed and accuracy.The methods and advanced development of deep learning hashing were mainly summarized,and the future of research direction was briefly discussed.…”
Get full text

A ranking hashing algorithm based on listwise supervision by Anbang YANG, Jiangbo QIAN, Yihong DONG, Huahui CHEN

“…Recently,learning to hash technology has been used for the similarity search of large-scale data.It can simultaneous increase the search speed and reduce the storage cost through transforming the data into binary codes.At present,most ranking hashing algorithms compare the consistency of data in the Euclidean space and the Hamming space to construct the loss function.However,because the Hamming distance is a discrete integer value,there may be many data points sharing the same Hamming distance result in the exact ranking cannot be performed.To address this challenging issue,the encoded data was divided into several subspaces with the same length.Each subspace was set with different weights.The Hamming distance was calculated according to different subspace weights.The experimental results show that this algorithm can effectively sort the data in the Hamming space and improve the accuracy of the query compared with other learning to hash algorithms.…”
Get full text

A cutting-edge neural network approach for predicting the thermoelectric efficiency of defective gamma-graphyne nanoribbons by Jiayi Guo, Chunfeng Cui, Tao Ouyang, Juexian Cao, Xiaolin Wei

“…Abstract This study predicts the thermoelectric figure of merit (ZT) for defective gamma-graphyne nanoribbons (γ-GYNRs) using binary coding, convolutional neural networks (CNN), long short-term memory networks (LSTM), and multi-scale feature fusion. …”
Get full text

An Experimental Realization of a Chaos-Based Secure Communication Using Arduino Microcontrollers by Mauricio Zapateiro De la Hoz, Leonardo Acho, Yolanda Vidal

“…In the receiver side, the binary-coded message is decrypted using the encrypted key signal that is sent through one of the communication channels. …”
Get full text

A Comparative Study of Genetic and Firefly Algorithms for Sensor Placement in Structural Health Monitoring by Guang-Dong Zhou, Ting-Hua Yi, Huan Zhang, Hong-Nan Li

“…To overcome the drawback related to the inapplicability of the FA in optimization problems with discrete variables, some improvements are proposed, including the one-dimensional binary coding system, the Hamming distance between any two fireflies, and the semioriented movement scheme; also, a simple discrete firefly algorithm (SDFA) is developed. …”
Get full text