ASN.1 / DER Explorer
Paste a certificate, key, CSR or any DER blob and read its structure — every tag, length and value, decoded in your browser.
Every certificate, key and CSR you have ever handled is ASN.1 in DER clothing. A chatbot can explain the format, but it cannot open your real file — and a private key is precisely what must never be pasted into a chat. This tool parses any DER or PEM blob locally — a certificate, CSR, PKCS#8 or EC key, CRL, PKCS#7/CMS message or OCSP response — into a full annotated tree, with a best-effort human summary for structures it recognises. For one certificate’s fields, use the SSL certificate parser; to check a key matches a certificate, use the certificate and key matcher; to hash a file before you share it, use the hash generator. The companion article how to read ASN.1/DER structures walks through the same bytes by hand.
Last updated:
Your DER or PEM input
Results
Recognised structure
Summary
Full tree
🔒 Your file never leaves your device. Parsing runs entirely in your browser — no upload, no server call, no account.
How ASN.1 / DER is built (TLV)
Every value is Tag, Length, Value. One byte (or more) says what the value is — the tag — then the length says how many bytes follow, then the value itself. A SEQUENCE is a tag that says “what follows is more TLV values, nested”. That is the whole format: nested boxes, each labelled, each measured. The hand-built demo below — 30 15 02 01 2a 06 09 … — is a SEQUENCE of 21 bytes holding an INTEGER 42, an OID and the string “hello”.
Tags have four classes: UNIVERSAL (the built-in types — INTEGER, OCTET STRING, SEQUENCE, UTCTime and the rest), APPLICATION, CONTEXT-SPECIFIC ([0], [1], [2]… — the numbered slots a structure like a certificate uses for its optional fields) and PRIVATE. A tag is primitive (the value is the data) or constructed (the value is more TLV values). The tree shows the class, number and name of every tag.
DER, BER and PEM are three costumes for the same bytes. BER is the loose parent: it allows indefinite lengths and more than one way to write the same value. DER is the strict child — one canonical encoding, definite lengths only — and it is what certificates, keys and CSRs actually use. PEM is not an encoding at all: it is DER bytes, base64-wrapped, between -----BEGIN …----- lines. This tool parses DER; it refuses indefinite-length BER and says so.
An OID — object identifier — is a dotted address for a meaning: 2.5.4.3 is “common name”, 1.2.840.113549.1.1.11 is “sha256 with RSA”, 2.5.29.17 is “subject alternative name”. The numbers are allocated in a global tree (ITU-T and ISO share the root), so any two implementations that see the same OID mean the same thing. The tree resolves the common arcs to names and always shows the dotted form next to them — an unknown OID is shown as numbers, never silently renamed.
What this parser does — and what it does not
It reads structure: tags, lengths, values, OIDs, times and names, and it recognises the common top-level shapes — certificate, CSR, private key, CRL, PKCS#7/CMS and OCSP response — well enough to summarise them. Recognition is best-effort: an unusual but valid structure still gets its full tree, labelled unrecognised, and the tree is the answer.
It does not verify anything. It does not check signatures, does not validate a chain, does not check dates against a trust store, and does not tell you whether a certificate is trustworthy — only what it says. A beautifully parsed certificate can still be expired, revoked, or issued by someone you should not trust.
It does not open encrypted containers. A PKCS#12 / .pfx file and an encrypted private key need a password; this tool refuses them outright rather than pretending to open them. It also does not accept indefinite-length BER, and it parses exactly one DER value — trailing bytes after the first value are reported, not silently ignored.
Be honest with yourself before you paste a key
A private key is the secret itself. This page parses it in your browser and never uploads it — but the moment you paste a key anywhere, you are trusting that page. Prefer a copy of the key, or a test key, over a production key when you only need to see the structure.
A parsed tree is not a verdict. The summary says what the structure claims — subject, issuer, dates, algorithms — and a claim is not a fact: anyone can mint a self-signed certificate that says it belongs to anyone.
If the tree looks wrong, the file may be fine and the expectation wrong. DER has sharp edges — a long-form length, a multi-byte tag, a BIT STRING with unused bits — and most “corrupt file” reports turn out to be a PEM file pasted with its headers mangled, or a PKCS#12 renamed to .der.
What happens to your file
Nothing leaves your browser. The file or pasted text is parsed by JavaScript on this page: no upload, no server call, no storage, no account. Closing the page discards everything.
Frequently asked questions
What is the difference between PEM and DER?
DER is the binary encoding — the actual bytes of the structure. PEM is those same bytes, base64-encoded, wrapped in -----BEGIN …----- / -----END …----- lines so they survive email and text files. This tool accepts both: it strips the PEM armor and decodes the base64, or reads raw DER bytes directly. If a file ends in .pem it is almost certainly PEM text; if it ends in .der it is almost certainly raw DER bytes.
Why does the tool refuse my .pfx / .p12 file?
PKCS#12 is an encrypted container: the certificate and private key inside are protected by a password, and opening it means decrypting it. This tool never asks for that password and never pretends to open the file. Export the certificate on its own (as .pem or .der) from the tool that created the .pfx, and parse that instead — or use openssl pkcs12 to extract it first.
The tree parsed, but the summary says “unrecognised structure”. Is the file broken?
Probably not. The summary recognises six common shapes — certificate, CSR, private key, CRL, PKCS#7/CMS and OCSP response — and anything else is labelled unrecognised on purpose. The tree below is still the complete, correct parse of your file; the summary is a convenience, not a verdict. If the structure is a standard one the tool missed, the tree will show you exactly where it differs.