Papers
arxiv:1710.09435

Malware Detection by Eating a Whole EXE

Published on Oct 25, 2017
Authors:
,
,
,
,
,

Abstract

Building neural networks for malware detection from raw byte sequences, involving sequences with over two million steps, poses unique challenges such as batch normalization hindrances; the solution presented has linear complexity and identifies interpretable sub-regions.

AI-generated summary

In this work we introduce malware detection from raw byte sequences as a fruitful research area to the larger machine learning community. Building a neural network for such a problem presents a number of interesting challenges that have not occurred in tasks such as image processing or NLP. In particular, we note that detection from raw bytes presents a sequence problem with over two million time steps and a problem where batch normalization appear to hinder the learning process. We present our initial work in building a solution to tackle this problem, which has linear complexity dependence on the sequence length, and allows for interpretable sub-regions of the binary to be identified. In doing so we will discuss the many challenges in building a neural network to process data at this scale, and the methods we used to work around them.

Community

Sign up or log in to comment

Get this paper in your agent:

hf papers read 1710.09435
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 1

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/1710.09435 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/1710.09435 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.