>From "Adam Langley" <agl at linuxpower.org>
>> You mention later that meta data keys are not encrypted. Are they
plaintext?
>
>Yes, metadata keys would have to be (unless someone has a pretty
>interresting idea)
>
>
>AGL
>
You could get substring matching by hashing every length n substring of your
searchable data, and inserting that, then searching against "all of {length n
substrings of search key}"... The effective hash size for reasonable values of
n is pretty small, though, unless somebody has some crazy math that could
combine all the substring hashes into one big number to search against...
(Maybe multiply all the hashes together, and see if PI(all hashes)/PI(search
hashes) is an integer?)
--
Benjamin Coates
_______________________________________________
Devl mailing list
Devl at freenetproject.org
http://lists.freenetproject.org/mailman/listinfo/devl
