Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Richard Heathfield <rjh@cpax.org.uk> |
|---|---|
| Newsgroups | sci.crypt |
| Subject | Re: Vector Factoring and Vector Cryptography. -ASLEC website - |
| Date | 2021-09-25 11:23 +0100 |
| Organization | Fix this later |
| Message-ID | <simtb5$6hh$1@dont-email.me> (permalink) |
| References | <50836fb9-c53c-4f76-b44f-3b60c9d6ec4fn@googlegroups.com> |
On 25/09/2021 10:08, austin obyrne wrote: > the user of vector cryptography has a vast domain of number-lines to > draw from whereas traditional cryptographers have had only one line > ever that they were bound to use repeatedly for every > encryption/decryption of any number of plaintext characters however > great. Concealing their transformations of plaintext into ciphertext > is extremely difficult and although it gives rise to some very fine > algorithms that were elegant and intelligent they did not really do > the job of complete obfuscation of the plaintext. Yes, they do. Your claim is tantamount to a claim that you can crack a one time pad. It's nonsense. > The ciphers that they produced could never really shake off the > threat of statistical cryptanalysis. OTP can do precisely that. Vector cryptography cannot. We proved that when we broke it. -- Richard Heathfield Email: rjh at cpax dot org dot uk "Usenet is a strange place" - dmr 29 July 1999 Sig line 4 vacant - apply within
Back to sci.crypt | Previous | Next — Previous in thread | Find similar | Unroll thread
Vector Factoring and Vector Cryptography. -ASLEC website - austin obyrne <ao402468@gmail.com> - 2021-09-25 02:08 -0700 Re: Vector Factoring and Vector Cryptography. -ASLEC website - Richard Heathfield <rjh@cpax.org.uk> - 2021-09-25 11:23 +0100
csiph-web