Subject: [T2TRG] Binary input analysis language -- Fwd: [saag] ASN.1 vs. DER Encoding

From: Carsten Bormann <[email-masked]>
Date: Sat, 30 Mar 2019 21:23:12 +0100

Nice example for a grammar-based binary input analysis language below.
This was apparently used to generate matching rules.

Of course, we also have RFC 4997, which was used for specifying bidirectional transformations (compression/decompression) in RFCs 4996, 5225, 6846.

Besides descriptive approaches, there are imperative ones such as eBPF: https://www.iovisor.org/technology/ebpf <https://www.iovisor.org/technology/ebpf> (and the Berkeley Packet Filter from which this was derived, http://www.tcpdump.org/papers/bpf-usenix93.pdf <http://www.tcpdump.org/papers/bpf-usenix93.pdf>).

Grüße, Carsten

> Begin forwarded message:
> 
> From: Michael Richardson <[email-masked] <mailto:[email-masked]>>
> Subject: Re: [saag] ASN.1 vs. DER Encoding
> Date: March 28, 2019 at 16:04:46 GMT+1
> To: [email-masked] <mailto:[email-masked]>
> Archived-At: <https://mailarchive.ietf.org/arch/msg/saag/4RvKlmZ_aiTaXX1RNDWCxttREnk <https://mailarchive.ietf.org/arch/msg/saag/4RvKlmZ_aiTaXX1RNDWCxttREnk>>
> 
> […]
> It was intended to enable generation of code/rules/tables for NPUs.
>  http://www.sandelman.ca/SSW/ietf/pax-pdl/pax-pdl-00.txt <http://www.sandelman.ca/SSW/ietf/pax-pdl/pax-pdl-00.txt>