AFLplusplus

The fuzzer afl++ is afl with community patches, qemu 5.1 upgrade, collision-free coverage, enhanced laf-intel & redqueen, AFLfast++ power schedules, MOpt mutators, unicorn_mode, and a lot more! (by AFLplusplus)

AFLplusplus Alternatives

Similar projects and alternatives to AFLplusplus

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better AFLplusplus alternative or higher similarity.

Suggest an alternative to AFLplusplus

Reviews and mentions

Posts with mentions or reviews of AFLplusplus. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-09-09.
  • 60x speed-up of Linux “perf”
    news.ycombinator.com | 2021-09-09
    With AFL++ you can even determine exactly where the fork happens:

    https://github.com/AFLplusplus/AFLplusplus/blob/stable/instr...

  • Theoretical PDF Exploit Question
    And as far as finding the vuln, I hear AFL++ is all the rage these days for file-parsing programs.
  • Adventures in Fuzzing Matrix’s Encryption
    news.ycombinator.com | 2021-06-14
    Author here. As one of the other comments mentions, afl++ (and to some extent vanilla afl) already has capability to automatically scrape magic values from arguments to special functions like `strcmp` and the like. The older technique is called libtokencap (https://github.com/AFLplusplus/AFLplusplus/blob/stable/utils...), but afl++ also has a newer feature called AUTODICT (https://github.com/AFLplusplus/AFLplusplus/blob/stable/instr...).

    But this only solves the problem of magic constants expected in the input. If the check depends on dynamic properties of the input or happens deeper in the code after the input's already been through some transformations, it can't be solved like this. There are other techniques to help with this, though. One of the earlier attempts to solve such types of more complex checks is called laf-intel (https://github.com/AFLplusplus/AFLplusplus/blob/stable/instr...) and boils down to transforming a more complex check into a nested series of simpler checks. This makes it more probable that the fuzzer's random mutation will be able to solve the outer check and hence hit new coverage, enabling the fuzzer to detect the mutation as productive.

    afl++ has a more modern variant of this called CmpLog (https://github.com/AFLplusplus/AFLplusplus/blob/stable/instr...) which is based on the RedQueen technique. The paper for RedQueen is a really interesting read: https://www.syssec.ruhr-uni-bochum.de/media/emma/veroeffentl...

    The problem of checksums is at times also solved by simply modifying the binary so that the checksum is neutralized and always succeeds, especially if you have access to source code.

    As for the problem of fuzzing stateful things like the double ratchet, one way of tackling the problem is to think of the input to the fuzzer as not only the raw bytes that you'll be passing to the program you're fuzzing, but as a blueprint specifying which high-level operations you'll be performing on the input. Then you teach your fuzzer to be smarter and be able to perform a bunch of those operations.

    So, let's say you take 512 bytes as the input to the fuzzer. You treat the first 256 bytes as the message to decode and the latter 256 bytes as the high-level cryptographic operations to perform on this message, each byte specifying one of those operations. So you could say a byte of value 1 represents the operation "ENCRYPT WITH KEY K1", 2 represents "ENCRYPT WITH KEY K2", 3 represents "DECRYPT WITH KEY K1", 4 represents "DECRYPT WITH KEY K2", 5 represents "PERFORM SHA2" and so on. Now you can feasibly end up with a sequence which will take a message encrypted with key K1, decrypt it, modify the message, then re-encrypt with key K2. Or, in the case of the double ratchet algorithm, have it perform multiple successive encryption steps to evolve the state of the ratchet and be able to fuzz more deeply.

    Of course, the encoding needs to be rather dense for this to work well so that ideally each low-level bit mutation the fuzzer does on an input still encodes a valid sequence of valid high-level operations.

  • How Fuzzing with QEMU (and AFL) Works
    dev.to | 2021-06-05
    By patching QEMU, TriforceAFL and AFL++ managed to get coverage feedback out of any binary that QEMU can run. How cool is that?!
  • First C++ OSS Project - Liquid Parser/Renderer
    reddit.com/r/cpp | 2021-03-16
    Another alternative seems to be AFL / AFLplusplus (a fork): https://github.com/AFLplusplus/AFLplusplus
  • AFL++ Fuzzing Framework
    news.ycombinator.com | 2021-03-12
  • Fuzzing Part 2 – Fuzzing with AFL
    reddit.com/r/netsec | 2021-02-04
    Instead of vanilla afl, try our fork over at https://github.com/AFLplusplus/AFLplusplus It replaced afl even in Google's oss-fuzz recently, and is pretty good in general :)

Stats

Basic AFLplusplus repo stats
7
2,118
9.8
7 days ago

AFLplusplus/AFLplusplus is an open source project licensed under Apache License 2.0 which is an OSI approved license.

SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
Find remote jobs at our new job board 99remotejobs.com. There are 38 new remote jobs listed recently.
Are you hiring? Post a new remote job listing for free.