DER_PACK_STORE | ...,
...,
DER_PACK_LEAVE,
- DER_WALK_END
+ DER_PACK_END
}
Note that `DER_PACK_LEAVE` is an instruction on its own. The other two
DER_PACK_LEAVE,
DER_PACK_STORE | DER_TAG_OCTETSTRING,
DER_PACK_LEAVE,
- DER_WALK_END
+ DER_PACK_END
}
An example ASN.1 structure that could be traversed by this would be
DER_PACK_STORE | DER_TAG_CONTEXT (0),
DER_PACK_STORE | DER_TAG_OCTETSTRING,
DER_PACK_LEAVE,
- DER_WALK_END
+ DER_PACK_END
}
to find `output[0]` set to the DER sequence for `[0] INTEGER`, so in hex
derwalk path_primes [] = {
DER_PACK_STORE | DER_TAG_SET_OF,
- DER_WALK_END
+ DER_PACK_END
}
The result would be stored in `output[0]` as the sequence `02 01 02` and so on,
* **Kerberos in PKIX.** [Certificates wrapping Kerberos Tickets](http://github.com/arpa2/kerberos2pkix) for use with [TLS-KDH](https://tools.ietf.org/html/draft-vanrein-tls-kdh)
* **Miniature LDAP services.** These can help you centralise your data storage under own control; for instance, your PGP key ring or your vCard collection are good canidadates for sharing locally.
+ * **Remote PKCS #11.** The main issue in doing this well is proper encapsulation, but with Quick and Easy DER, and the emphasis of both on security and well-defined sizes, it appears to be a perfect match to wrap PKCS #11 arguments in DER structures.