I first learned about Adi Shamir's secret sharing scheme in Bruce Schneier's book, Applied Cryptography. Although the coverage was light, I was fascinated by the idea and thought it would make a fun feature in a movie or novel plot. But, as pointed out in the book and elsewhere (1, 2), it has practical application … Continue reading Secret Sharing
Category: Computer Science
Levenshtein Distance
A few years ago, while I was doing research for my Similarity Index paper and prototype, I ran across the idea of the Levenshtein Distance. Basically the Levenshtein Distance (LD) is a metric to determine the minimum cost of edits (i.e., insert, delete, or substitute) required to transform one word (or sequence of characters) into … Continue reading Levenshtein Distance
Random Eklektos 