JSPM

Knuths multiplicative hashing based id obfuscation for javascript (port of https://github.com/jenssegers/optimus).

Map sequential IDs or serial numbers to random-looking strings

Compute the multiplicative inverse for each element in a double-precision floating-point strided array.

Compute the multiplicative inverse of a double-precision floating-point number.

Compute the multiplicative inverse for each element in a single-precision floating-point strided array according to a strided mask array.

Compute the multiplicative inverse of a single-precision floating-point number.

Compute the multiplicative inverse for each element in a double-precision floating-point strided array according to a strided mask array.

Compute the multiplicative inverse for each element in a single-precision floating-point strided array.

Create an iterator which computes the multiplicative inverse of each iterated value.

This is a cypher engine which uses ElGamal cryptosystem internally. besides cryptography, it provide some group functionality such as add 2 members or select a random group member and so on.

Compute the multiplicative inverse for each element in a strided array.

Knuths multiplicative hashing based id obfuscation for javascript (port of https://github.com/jenssegers/optimus).

Basic ciphers