Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^5: Calculating corruption

by LanX (Saint)
on Oct 19, 2014 at 11:03 UTC ( [id://1104297]=note: print w/replies, xml ) Need Help??


in reply to Re^4: Calculating corruption
in thread Calculating corruption

If you can't checksum the file right after encryption then better try Dowsing !

Anyway I expect most encryption methods to detect corruptions by themselves, hence a pretty fruitless discussion.

Cheers Rolf

(addicted to the Perl Programming Language and ☆☆☆☆ :)

PS: Talking about statistics, ignoring users with many trailing digits proofs to be an excellent rule of thumb to avoid "corrupted" (and cryptic) questions.

Thanks! :)

Replies are listed 'Best First'.
Re^6: Calculating corruption
by james28909 (Deacon) on Oct 20, 2014 at 02:59 UTC
    the best thing i can do is provide proofs to what i am saying. tomorrow i will compile a list of outcomes on these files. :) and you can judge for yourself

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1104297]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2024-04-23 06:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found