Re: Matrix-Multiplication: Security?
From: Paul Rubin (//phr.cx_at_NOSPAM.invalid)
Date: 05/27/05
- Next message: Andrew: "XOR passphrase with a constant"
- Previous message: Anton: "Re: Matrix-Multiplication: Security?"
- In reply to: Anton: "Re: Matrix-Multiplication: Security?"
- Next in thread: Sebastian Gottschalk: "Re: Matrix-Multiplication: Security?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 27 May 2005 05:06:17 -0700
Anton <antonbischof@web.de> writes:
> Ok, may you give me some further information about how "secure" my
> programm is compared with non-linear systems?
> How can I calculate the security of an algorithm?
Nobody knows how to calculate the security of an algorithm. Nobody
knows if there's even such a thing as a secure algorithm. But there
are many algorithms that we know to definitely be not secure.
You might read a book like "The Code Book" by Simon Singh to get an
easy introduction to the subject. For something more mathematically
serious, try:
http://www-cse.ucsd.edu/users/mihir/cse207/classnotes.html
- Next message: Andrew: "XOR passphrase with a constant"
- Previous message: Anton: "Re: Matrix-Multiplication: Security?"
- In reply to: Anton: "Re: Matrix-Multiplication: Security?"
- Next in thread: Sebastian Gottschalk: "Re: Matrix-Multiplication: Security?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|
