FM / jsbn

/home2/dakshskx/lib/node_modules/pm2/node_modules/jsbn/

/home2/dakshskx/lib/node_modules/pm2/node_modules/jsbn

Name	Size	Mode	Actions
test/	-	0755	rm
.npmignore	22	0644	edit dl rm
CHANGELOG.md	456	0644	edit dl rm
example.html	222	0644	edit dl rm
example.js	137	0644	edit dl rm
index.js	42308	0644	edit dl rm
LICENSE	1544	0644	edit dl rm
package.json	527	0644	edit dl rm
README.md	1635	0644	edit dl rm

Edit: /home2/dakshskx/lib/node_modules/pm2/node_modules/jsbn/README.md (1635B)

# jsbn: javascript big number

[Tom Wu's Original Website](http://www-cs-students.stanford.edu/~tjw/jsbn/)

I felt compelled to put this on github and publish to npm. I haven't tested every other big integer library out there, but the few that I have tested in comparison to this one have not even come close in performance. I am aware of the `bi` module on npm, however it has been modified and I wanted to publish the original without modifications. This is jsbn and jsbn2 from Tom Wu's original website above, with the module pattern applied to prevent global leaks and to allow for use with node.js on the server side.

## usage

var BigInteger = require('jsbn').BigInteger;

var bi = new BigInteger('91823918239182398123');
    console.log(bi.bitLength()); // 67

## API

### bi.toString()

returns the base-10 number as a string

### bi.negate()

returns a new BigInteger equal to the negation of `bi`

### bi.abs

returns new BI of absolute value

### bi.compareTo

### bi.bitLength

### bi.mod

### bi.modPowInt

### bi.clone

### bi.intValue

### bi.byteValue

### bi.shortValue

### bi.signum

### bi.toByteArray

### bi.equals

### bi.min

### bi.max

### bi.and

### bi.or

### bi.xor

### bi.andNot

### bi.not

### bi.shiftLeft

### bi.shiftRight

### bi.getLowestSetBit

### bi.bitCount

### bi.testBit

### bi.setBit

### bi.clearBit

### bi.flipBit

### bi.add

### bi.subtract

### bi.multiply

### bi.divide

### bi.remainder

### bi.divideAndRemainder

### bi.modPow

### bi.modInverse

### bi.pow

### bi.gcd

### bi.isProbablePrime

# jsbn: javascript big number [Tom Wu's Original Website](http://www-cs-students.stanford.edu/~tjw/jsbn/) I felt compelled to put this on github and publish to npm. I haven't tested every other big integer library out there, but the few that I have tested in comparison to this one have not even come close in performance. I am aware of the `bi` module on npm, however it has been modified and I wanted to publish the original without modifications. This is jsbn and jsbn2 from Tom Wu's original website above, with the module pattern applied to prevent global leaks and to allow for use with node.js on the server side. ## usage var BigInteger = require('jsbn').BigInteger; var bi = new BigInteger('91823918239182398123'); console.log(bi.bitLength()); // 67 ## API ### bi.toString() returns the base-10 number as a string ### bi.negate() returns a new BigInteger equal to the negation of `bi` ### bi.abs returns new BI of absolute value ### bi.compareTo ### bi.bitLength ### bi.mod ### bi.modPowInt ### bi.clone ### bi.intValue ### bi.byteValue ### bi.shortValue ### bi.signum ### bi.toByteArray ### bi.equals ### bi.min ### bi.max ### bi.and ### bi.or ### bi.xor ### bi.andNot ### bi.not ### bi.shiftLeft ### bi.shiftRight ### bi.getLowestSetBit ### bi.bitCount ### bi.testBit ### bi.setBit ### bi.clearBit ### bi.flipBit ### bi.add ### bi.subtract ### bi.multiply ### bi.divide ### bi.remainder ### bi.divideAndRemainder ### bi.modPow ### bi.modInverse ### bi.pow ### bi.gcd ### bi.isProbablePrime