Simple, independently audited, zero-dependency TypeScript implementation of Shamir's Secret Sharing algorithm
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Detect the indentation of code
Sniff the encoding from a HTML byte stream
Simple “Least Recently Used” (LRU) cache
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
The lightest signal library.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Parse a JSON string that has git merge conflicts, resolving if possible
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Hashing made simple. Get the hash of a buffer/string/stream/file.
A JS library for finding optimal label position inside a polygon
Arbitrary-length shamir implementation
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
SHA1 wrapper for browsers that prefers `window.crypto.subtle`.
graph algorithm
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Text hyphenation in Javascript.
Blockchain Commons Shamir Secret Sharing for TypeScript
oidc-token-hash validates (and generates) ID Token `_hash` claims such as `at_hash` or `c_hash`
Find the longest common subsequence.
Helper cryptography module for Ruby
Split and reconstruct secrets using the shamir's secret sharing algorithm
Implements a special case (k = 2) of Adi Shamir's secret sharing algorithm. This allows secret files to be encrypted on disk and require two secret holders to decrypt it.
4/12/2016 - NO LONGER MAINTAINED - See README.md Shamirs Secret Sharing is an algorithm in cryptography. It is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part, where some of the parts or all of them are needed in order to reconstruct the secret. Holders of a share gain no knowledge of the larger secret.
No description provided.
No description provided.