Jean-Marc Desperrier wrote:
The QuickDER decoder documentation says it can not decode BER.
Unfortunately, most of the data around is not strictly talking DER.
It's excessively frequent that it breaks the DER rules on some of the most subtle points, and sometimes on not so subtle points.
As this decoder would almost unusable if it understood only DER, I take this to truly mean that there are some mechanisms allowed only by BER it can't decode, and not that it will check that the representation used is the most compact/correct and reject anything incorrect.
So I would like to have some idea about what the restrictions are, and also how the decoder fails when it encounters something it can't handle.
In fact, my guessing is that this incompatibility refers mostly about things like breaking OCTET STRING in several parts that must be reattached together when decoding, and the possibility of outputing an element with no explicit length at the start, but an end of element marker at the end.
You might consider trying the open source ASN.1 compiler: http://lionet.info/asn1c
-- Lev Walkin [EMAIL PROTECTED] _______________________________________________ mozilla-crypto mailing list [email protected] http://mail.mozilla.org/listinfo/mozilla-crypto
