Binary code search is a technique that involves finding with similarity to given within database. It finds extensive application in scenarios such as vulnerability queries and defect analysis. While many existing methods employ advanced machine learning models for analysis, their lack of interpretability low efficiency dealing large-scale functions still remain challenges. To address these issu...

BinPro: A Tool for Binary Backdoor Accountability in Code Audits Dhaval Miyani Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto 2016 Highly security sensitive organizations often perform source code audits on software they use. However, after the audit is performed, they must still perform a binary code audit to ensure the binary provide...

Studies on the binary block codes generated by some ordered algebraic structures have been interest of many researchers. In this paper, we study code an arbitrary JU-algebra and investigate its properties. For intent, introduce notion a JU function \(\phi\) nonempty set P into X, using that concept, j-functions j-subsets for element j X are investigated. Furthermore, define new order C based sh...

This paper considers two kinds of algorithms. (i) If # is a binary code of length n, a ‘‘soft decision’’ decoding algorithm for # changes an arbitrary point of Rn into a nearest codeword (nearest in Euclidean distance). (ii) Similarly a decoding algorithm for a lattice Λ in Rn changes an arbitrary point of Rn into a closest lattice point. Some general methods are given for constructing such alg...

Recently, (linear) codes over and quasi-cyclic (QC) codes (over fields) have been shown to yield useful results in coding theory. Combining these two ideas we study -QC codes and obtain new binary codes using the usual Gray map. Among the new codes, the lift of the famous Golay code to produces a new binary code, a (92 2 28)-code, which is the best among all binary codes (linear or nonlinear). ...

We present a new algorithm for conversion between binary code and binary{re ected Gray code that requires approximately 2K 3 element transfers in sequence for K elements per node, compared to K element transfers for previously known algorithms. For a binary cube of n = 2 dimensions the new algorithm degenerates to yield a complexity of K 2 + 1 element transfers, which is optimal. The new algori...

Binary code reutilization is the process of automatically identifying the interface and extracting the instructions and data dependencies of a code fragment from an executable program, so that it is selfcontained and can be reused by external code. Binary code reutilization is useful for a number of security applications, including reusing the proprietary cryptographic or unpacking functions fr...