i programmed a very simple indexing algorithm, wich results in a alphabetically sorted list of words with their positions (wich file, wich position in the file).
You do not need to remember wicht randomly choosen letters for wich file, because you can save the letter numbers with the encrypted file without giving too much info to the attacker.
think about the following situation: You are working on a foreign system, you have to expect a keylogger, screenshot-archiver and all such things installed on this system and you do not want...
your "proof" does not work for N=2. If you check only all subsequences of the length 3, you do not check anything if there is no subsequence of the length 3. So your proof does tell us nothing...
So my proof would be:
1. as long as you move in the diagonal both (i) and (j) are changing.
2. If you step from one diagonal to another sometimes i or j will...
the whole asymtoticaly and polynominal-thing is much more show than really substance. There are a few Functions between log and polonoms and exp, but almost none of them has some real impact....
for the first problem, searching something like the diff of more than two files is very simple: just take the diff of file1 and file2, remove all changes take this file and do the same with...
for the non-orientable surface, you should look for "Klein Bottle". During my studying the books of Felix Klein have been one of my favourite. So I reccomend to read about higher geometry, a...
if you mean it theoretical, if it is possible to describe an array out of n/2 1's and n/2 0's with 2n/3 bits of Information (2n/3 decisions), then the answer is "no", because n over n/2 is...
1. Given is a data string of m bits length.
2. Derive a checksum of the length k, k as short as possible
3. flip one single bit at randob position in...
