rasha-fork/lib/asn1.js

76 lines
2.3 KiB
JavaScript
Raw Normal View History

2018-11-22 01:44:46 +00:00
'use strict';
var ASN1 = module.exports = function ASN1() {
};
2018-11-22 07:39:43 +00:00
ASN1.ELOOP = "uASN1.js Error: iterated over 15+ elements (probably a malformed file)";
ASN1.EDEEP = "uASN1.js Error: element nested 10+ layers deep (probably a malformed file)";
// Container Types are Sequence 0x30, Octect String 0x04, Array? (0xA0, 0xA1)
// Value Types are Integer 0x02, Bit String 0x03, Null 0x05, Object ID 0x06,
// Sometimes Bit String is used as a container (RSA Pub Spki)
ASN1.VTYPES = [ 0x02, 0x03, 0x05, 0x06 ];
2018-11-22 01:44:46 +00:00
ASN1.parse = function parseAsn1(buf, depth) {
2018-11-22 07:39:43 +00:00
if (depth >= 10) { throw new Error(ASN1.EDEEP); }
2018-11-22 01:44:46 +00:00
var index = 2; // we know, at minimum, data starts after type (0) and lengthSize (1)
var asn1 = { type: buf[0], lengthSize: 0, length: buf[1] };
var child;
var iters = 0;
var adjust = 0;
2018-11-22 01:44:46 +00:00
// Determine how many bytes the length uses, and what it is
if (0x80 & asn1.length) {
asn1.lengthSize = 0x7f & asn1.length;
// I think that buf->hex->int solves the problem of Endianness... not sure
asn1.length = parseInt(buf.slice(index, index + asn1.lengthSize).toString('hex'), 16);
index += asn1.lengthSize;
}
// High-order bit Integers have a leading 0x00 to signify that they are positive.
// Bit Streams use the first byte to signify padding, which x.509 doesn't use.
if (0x00 === buf[index] && (0x02 === asn1.type || 0x03 === asn1.type)) {
index += 1;
adjust = -1;
}
2018-11-22 01:44:46 +00:00
// this is a primitive value type
2018-11-22 07:39:43 +00:00
if (-1 !== ASN1.VTYPES.indexOf(asn1.type)) {
asn1.value = buf.slice(index, index + asn1.length + adjust);
2018-11-22 01:44:46 +00:00
return asn1;
}
asn1.children = [];
2018-11-22 07:39:43 +00:00
while (iters < 15 && index < buf.byteLength) {
2018-11-22 01:44:46 +00:00
iters += 1;
2018-11-22 02:04:49 +00:00
child = ASN1.parse(buf.slice(index, index + asn1.length), (depth || 0) + 1);
2018-11-22 01:44:46 +00:00
index += (2 + child.lengthSize + child.length);
asn1.children.push(child);
}
2018-11-22 07:39:43 +00:00
if (iters >= 15) { throw new Error(ASN1.ELOOP); }
2018-11-22 01:44:46 +00:00
return asn1;
};
2018-11-22 08:46:20 +00:00
/*
ASN1._stringify = function(asn1) {
//console.log(JSON.stringify(asn1, null, 2));
//console.log(asn1);
var ws = '';
function write(asn1) {
console.log(ws, 'ch', Buffer.from([asn1.type]).toString('hex'), asn1.length);
if (!asn1.children) {
return;
}
asn1.children.forEach(function (a) {
ws += '\t';
write(a);
ws = ws.slice(1);
});
}
write(asn1);
};
*/
2018-11-22 01:44:46 +00:00
module.exports = ASN1;