Stolen from http://www.privacy.nb.ca/cryptography/archives/cry ptography/html/1998-03/0004.html
>From the Meganet Web Site:
> 1) Virtual Matrix Encryption (VME) reads Data From the original file
> into memory, and then compares it with an internal random matrix of
> values named "Virtual Matrix" (VM). A set of pointers to the
> location in the matrix is created "Virtual Matrix Pointers"
> (VMP). These pointers are than passed further to be encrypted by
> additional algorithms in VME. The ORIGINAL DATA are never encrypted
> or transferred in any form or shape. Since the data is not
> encrypted, there is no way to decrypt it. The process of Encrypting
> utilizes "Progressive Virtual Matrix" (PVM) and the decryption uses
> "Regressive Virtual Matrix (RVM).
>
> 2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred. A
> "Standard Transaction Key" (STK) is another key created at the size
> of 2,048 bits. That key is transferred with the encrypted VMP on a
> public network. This key is a unique non-redundant key
> per-transaction, assuring that even if the same data is encrypted
> time after time again, it will never yield the same encrypted code
> (hence preventing a possible security breach). A third key "Users
> Key" also a 2,048 bit key is created based on users input
> (Username, Password, Etc.) and used in the encryption process. 2
> Additional 2,048 bit keys are created randomly and are utilized to
> further encrypt the data.
>
> 3) The encrypted pointers are then further encrypted by a variety of
> highly secured algorithms: "Multiplication Matrix Modulo" (MMM) is
> a matrix of mathematically inverse keys utilized to encrypt/decrypt
> the pointers. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size. The overflow actually gives us an
> unpredictable number that is used to further encrypt the
> pointers. "Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers. Since the specific algorithm used at a certain point
> is dependant on the variety of keys and data flow for the specific
> session, there is no way to know which of those algorithms was
> used. Therefore, regardless of the specific strength of a specific
> algorithm, it is impossible to break. "Bit Level Encryption" (BLE)
> is another innovative algorithm that encrypts data one bit at a
> time. A specific bit can have a value of only 0 or 1, and the
> encrypted value is also only either 0 or 1. Considering the fact
> that a single bit is meaningless (versus a byte that can signify a
> character for example) it is impossible to decrypt.
>
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
>
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
>
> 6) After these explanations, we hope that you'll agree with our
> non-compromising statement of: ..
>
> "VME IS THE ONLY UNBREAKABLE ENCRYPTION" . . .
"The ORIGINAL DATA are never encrypted > or transferred in any form or shape."
Umm I would call shuffling data around encrypted wouldn't the rest of us?
2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred.
(based on a secret reference file)!!!!!! Okay here we go there is no 1mbit key at all there is a much smaller key which then generates a random stream of data. Smaller key now the question is how small for all we know it could be 2 bits just like that company is
"Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers.
Okay if these methods were unique they couldn't be simple and the whole process would slow down to a crawl.
The whole key transfer thing is secured by tripple RSA or something similar ( 3 layers of 2048 bit asymeteric keys ) @ 2048 bits so all in all its what like a effective 2049.58 bit encryption this whole thing is a shame when u can do 4096 bit encryption.
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date). Okay this feature is hardly useful requires both ends to have synced times as well as a refernce key to start the pseudo random number generator. The security of this is propontional to the 1/(time ranger it is active ) X average number of time units before activation. So even if it is active for an hour the security gain is almost useless.
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE. This is just means it encrypted with the target users public key big woop dee do da. . Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction > Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size.
Umm yeah my ass it gives a good encryption this is essetionally the simplest form of a hash there is jsut take the last X digits of a number sheez who they think they are kidding. Someone please point them to the SHA algorithim.
Stolen from http://www.privacy.nb.ca/cryptography/archives/cry ptography/html/1998-03/0004.html
>From the Meganet Web Site:
> 1) Virtual Matrix Encryption (VME) reads Data From the original file
> into memory, and then compares it with an internal random matrix of
> values named "Virtual Matrix" (VM). A set of pointers to the
> location in the matrix is created "Virtual Matrix Pointers"
> (VMP). These pointers are than passed further to be encrypted by
> additional algorithms in VME. The ORIGINAL DATA are never encrypted
> or transferred in any form or shape. Since the data is not
> encrypted, there is no way to decrypt it. The process of Encrypting
> utilizes "Progressive Virtual Matrix" (PVM) and the decryption uses
> "Regressive Virtual Matrix (RVM).
>
> 2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred. A
> "Standard Transaction Key" (STK) is another key created at the size
> of 2,048 bits. That key is transferred with the encrypted VMP on a
> public network. This key is a unique non-redundant key
> per-transaction, assuring that even if the same data is encrypted
> time after time again, it will never yield the same encrypted code
> (hence preventing a possible security breach). A third key "Users
> Key" also a 2,048 bit key is created based on users input
> (Username, Password, Etc.) and used in the encryption process. 2
> Additional 2,048 bit keys are created randomly and are utilized to
> further encrypt the data.
>
> 3) The encrypted pointers are then further encrypted by a variety of
> highly secured algorithms: "Multiplication Matrix Modulo" (MMM) is
> a matrix of mathematically inverse keys utilized to encrypt/decrypt
> the pointers. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size. The overflow actually gives us an
> unpredictable number that is used to further encrypt the
> pointers. "Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers. Since the specific algorithm used at a certain point
> is dependant on the variety of keys and data flow for the specific
> session, there is no way to know which of those algorithms was
> used. Therefore, regardless of the specific strength of a specific
> algorithm, it is impossible to break. "Bit Level Encryption" (BLE)
> is another innovative algorithm that encrypts data one bit at a
> time. A specific bit can have a value of only 0 or 1, and the
> encrypted value is also only either 0 or 1. Considering the fact
> that a single bit is meaningless (versus a byte that can signify a
> character for example) it is impossible to decrypt.
>
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
>
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
>
> 6) After these explanations, we hope that you'll agree with our
> non-compromising statement of: . .
>
> "VME IS THE ONLY UNBREAKABLE ENCRYPTION" . . .
"The ORIGINAL DATA are never encrypted > or transferred in any form or shape."
Umm I would call shuffling data around encrypted wouldn't the rest of us?
2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred.
(based on a secret reference file)!!!!!! Okay here we go there is no 1mbit key at all there is a much smaller key which then generates a random stream of data. Smaller key now the question is how small for all we know it could be 2 bits just like that company is
"Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers.
Okay if these methods were unique they couldn't be simple and the whole process would slow down to a crawl.
The whole key transfer thing is secured by tripple RSA or something similar ( 3 layers of 2048 bit asymeteric keys ) @ 2048 bits so all in all its what like a effective 2049.58 bit encryption this whole thing is a shame when u can do 4096 bit encryption.
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date). Okay this feature is hardly useful requires both ends to have synced times as well as a refernce key to start the pseudo random number generator. The security of this is propontional to the 1/(time ranger it is active ) X average number of time units before activation. So even if it is active for an hour the security gain is almost useless.
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE. This is just means it encrypted with the target users public key big woop dee do da. . Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction > Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size.
Umm yeah my ass it gives a good encryption this is essetionally the simplest form of a hash there is jsut take the last X digits of a number sheez who they think they are kidding. Someone please point them to the SHA algorithim.
Stolen from http://www.privacy.nb.ca/cryptography/archives/cry ptography/html/1998-03/0004.html
>From the Meganet Web Site:
> 1) Virtual Matrix Encryption (VME) reads Data From the original file
> into memory, and then compares it with an internal random matrix of
> values named "Virtual Matrix" (VM). A set of pointers to the
> location in the matrix is created "Virtual Matrix Pointers"
> (VMP). These pointers are than passed further to be encrypted by
> additional algorithms in VME. The ORIGINAL DATA are never encrypted
> or transferred in any form or shape. Since the data is not
> encrypted, there is no way to decrypt it. The process of Encrypting
> utilizes "Progressive Virtual Matrix" (PVM) and the decryption uses
> "Regressive Virtual Matrix (RVM).
>
> 2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred. A
> "Standard Transaction Key" (STK) is another key created at the size
> of 2,048 bits. That key is transferred with the encrypted VMP on a
> public network. This key is a unique non-redundant key
> per-transaction, assuring that even if the same data is encrypted
> time after time again, it will never yield the same encrypted code
> (hence preventing a possible security breach). A third key "Users
> Key" also a 2,048 bit key is created based on users input
> (Username, Password, Etc.) and used in the encryption process. 2
> Additional 2,048 bit keys are created randomly and are utilized to
> further encrypt the data.
>
> 3) The encrypted pointers are then further encrypted by a variety of
> highly secured algorithms: "Multiplication Matrix Modulo" (MMM) is
> a matrix of mathematically inverse keys utilized to encrypt/decrypt
> the pointers. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size. The overflow actually gives us an
> unpredictable number that is used to further encrypt the
> pointers. "Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers. Since the specific algorithm used at a certain point
> is dependant on the variety of keys and data flow for the specific
> session, there is no way to know which of those algorithms was
> used. Therefore, regardless of the specific strength of a specific
> algorithm, it is impossible to break. "Bit Level Encryption" (BLE)
> is another innovative algorithm that encrypts data one bit at a
> time. A specific bit can have a value of only 0 or 1, and the
> encrypted value is also only either 0 or 1. Considering the fact
> that a single bit is meaningless (versus a byte that can signify a
> character for example) it is impossible to decrypt.
>
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
>
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
>
> 6) After these explanations, we hope that you'll agree with our
> non-compromising statement of: . .
>
> "VME IS THE ONLY UNBREAKABLE ENCRYPTION" . . .
"The ORIGINAL DATA are never encrypted
> or transferred in any form or shape."
Umm I would call shuffling data around encrypted wouldn't the rest of us?
2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred.
(based on a secret reference file)!!!!!!
Okay here we go there is no 1mbit key at all there is a much smaller key which then generates a random stream of data.
"Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers.
Okay if these methods were unique they couldn't be simple and the whole process would slow down to a crawl.
The whole key transfer thing is secured by tripple RSA or something similar ( 3 layers of 2048 bit asymeteric keys ) @ 2048 bits so all in all its what like a 2049.58 bit encryption this whole thing is a shame when u can do 4096 bit encryption.
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
Okay this feature is hardly useful requires both ends to have synced times as well as a refernce key to start the pseudo random number generator. The security of this is propontional to the 1/(time ranger it is active ) X average number of time units before activation. So even if it is active for an hour the security gain is almost useless.
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
This is just means it encrypted with the target users public key big woop dee do da.
. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size.
Umm yeah my ass it gives a good encryption this is essetionally the simplest form of a hash there is jsut take the last X digits of a number sheez who they think they are kidding. Someone please point them to the SHA algorithim.
"Any form of encryption, OTHER THAN A ONE-TIME PAD, is susceptible to brute force attack if the key size is small enough."
Yeah but the problem with most( if not all ) symeteric encryption is You don't what the original data was so u never know if you have successfully decrypted the data. The follow alphabetical string "aaaa" could be an encrypted piece of data that has had a subtractive encryption applied now can you conclusively tell me that the original message was "time"? no cause it could have just as well been "fire". Now since this has a 1 mbit key it is very likely that there are millions ( raised to lots of powers of 10 ) of possible combinations.
Hmm I click change but it don't work well here is my P.S.
In reality we a cipher that uses little memmory, little keys and is very very fast yet as secure as possible. This has probably two of those it is prolly pretty fast cause it most likely uses that big key to do an xor on the data making it hard to break.
Such a big key is hard to store securely and hard to move but guess what the key is very hard without a LARGE data stream ( or a poor cipher ).
First thing first if this is a 1 mbit key then they are definately not using asymeteric(sp?) encryption or else the time to encrypt the single smallest message would probably years and to decrypt would be even longer thats with a key. ( Assuming the security between the private and public key is reasonable unlike inverse matricies which are 2 different keys but the use of the keys is quick ) so well everyone is still transfer all there credit card info with old encryption so thats down the drain. Even if it was asymeteric encryption then that means when your setting up your secure connection would take a handshake of over 1/4 of a meg but as I said before it is just symeteric. So with this large key how are they gonna transfer it seeing as it is symeteric? the answer is they can't the vernor ( sp? ) was invited a long time ago and its MORE secure then this *new* encryption Meganet created.
Okies now we got a 1 megabit key how are we gonna generate this key if we are gonna try to use entropy from the system its gonna take a long time to generate the data so there are only 2 solutions 1) we use a thermal diode which has to be at the right temperature and shield from RF or else it is statically attackable 2) we use a pseudo random software generator. 1 is not fesiable if we are requiring many keys to be generated at once i.e. as a symeteric component in SSL cause it still isn't fast enough and I won't bother looking at 2.
ARB_vertex_program was design because of the two different current methods of vertex shaders that are out. Nvidia owns GL_NV_vertex_program and ATI owns GL_EXT_vertex_shader. Now ARB_vertex_program sits some where in the middle of these to similar extensions but I cannot see a way that the middle ground could be violating a pending patent and that current other two extensions don't.
Untracable of course it is tracable
on
P2P Streaming Radio
·
· Score: 2, Insightful
damn this thing still uses direct connection you directly connect to the station so you get their IP and then you simple look up their ISP send them a nice letter and get them shut down.
I agree that this is true with many render farms that use generic chips for rendering such as 80x86 proccessor but if you create with flexible pipelines and you create a render farm with these then of course this won't be replaced by the new boards.
Thankfully with 3dlabs OpenGl 2.0 work and M$ work on DX9 the mainstream PC cards are becoming more like these custom chips execpt they won't be employed in render farms and therefore will not have as much as the multipul proccessor that are already out in some places.
Slashdot Mirror
man better then what we get @ uni for the whole year so stop complainging!!
Stolen from http://www.privacy.nb.ca/cryptography/archives/cry ptography/html/1998-03/0004.html .
>From the Meganet Web Site:
> 1) Virtual Matrix Encryption (VME) reads Data From the original file
> into memory, and then compares it with an internal random matrix of
> values named "Virtual Matrix" (VM). A set of pointers to the
> location in the matrix is created "Virtual Matrix Pointers"
> (VMP). These pointers are than passed further to be encrypted by
> additional algorithms in VME. The ORIGINAL DATA are never encrypted
> or transferred in any form or shape. Since the data is not
> encrypted, there is no way to decrypt it. The process of Encrypting
> utilizes "Progressive Virtual Matrix" (PVM) and the decryption uses
> "Regressive Virtual Matrix (RVM).
> > 2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred. A
> "Standard Transaction Key" (STK) is another key created at the size
> of 2,048 bits. That key is transferred with the encrypted VMP on a
> public network. This key is a unique non-redundant key
> per-transaction, assuring that even if the same data is encrypted
> time after time again, it will never yield the same encrypted code
> (hence preventing a possible security breach). A third key "Users
> Key" also a 2,048 bit key is created based on users input
> (Username, Password, Etc.) and used in the encryption process. 2
> Additional 2,048 bit keys are created randomly and are utilized to
> further encrypt the data.
>
> 3) The encrypted pointers are then further encrypted by a variety of
> highly secured algorithms: "Multiplication Matrix Modulo" (MMM) is
> a matrix of mathematically inverse keys utilized to encrypt/decrypt
> the pointers. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size. The overflow actually gives us an
> unpredictable number that is used to further encrypt the
> pointers. "Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers. Since the specific algorithm used at a certain point
> is dependant on the variety of keys and data flow for the specific
> session, there is no way to know which of those algorithms was
> used. Therefore, regardless of the specific strength of a specific
> algorithm, it is impossible to break. "Bit Level Encryption" (BLE)
> is another innovative algorithm that encrypts data one bit at a
> time. A specific bit can have a value of only 0 or 1, and the
> encrypted value is also only either 0 or 1. Considering the fact
> that a single bit is meaningless (versus a byte that can signify a
> character for example) it is impossible to decrypt.
>
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
>
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
>
> 6) After these explanations, we hope that you'll agree with our
> non-compromising statement of: .
>
> "VME IS THE ONLY UNBREAKABLE ENCRYPTION" . . .
"The ORIGINAL DATA are never encrypted > or transferred in any form or shape."
Umm I would call shuffling data around encrypted wouldn't the rest of us?
2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred.
(based on a secret reference file)!!!!!! Okay here we go there is no 1mbit key at all there is a much smaller key which then
generates a random stream of data. Smaller key now the question is how small for all we know it could be 2 bits just like that company is
"Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers.
Okay if these methods were unique they couldn't be simple and the whole process would slow down to a crawl.
The whole key transfer thing is secured by tripple RSA or something similar ( 3 layers of 2048 bit asymeteric keys ) @ 2048
bits so all in all its what like a effective 2049.58 bit encryption this whole thing is a shame when u can do 4096 bit encryption.
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date). Okay this feature is hardly useful requires both ends to have synced
times as well as a refernce key to start the pseudo random number generator. The security of this is propontional to the 1/(time ranger it is active ) X average number of time units before activation. So even if it is active for an hour the
security gain is almost useless.
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE. This is just means it encrypted with the target users public key big woop
dee do da. . Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction > Matrix Modulo" (SMM) is a system that utilizes a
mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size.
Umm yeah my ass it gives a good encryption this is essetionally the simplest form of a hash there is jsut take the last X
digits of a number sheez who they think they are kidding. Someone please point them to the SHA algorithim.
Stolen from http://www.privacy.nb.ca/cryptography/archives/cry ptography/html/1998-03/0004.html
>From the Meganet Web Site:
> 1) Virtual Matrix Encryption (VME) reads Data From the original file
> into memory, and then compares it with an internal random matrix of
> values named "Virtual Matrix" (VM). A set of pointers to the
> location in the matrix is created "Virtual Matrix Pointers"
> (VMP). These pointers are than passed further to be encrypted by
> additional algorithms in VME. The ORIGINAL DATA are never encrypted
> or transferred in any form or shape. Since the data is not
> encrypted, there is no way to decrypt it. The process of Encrypting
> utilizes "Progressive Virtual Matrix" (PVM) and the decryption uses
> "Regressive Virtual Matrix (RVM).
>
> 2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred. A
> "Standard Transaction Key" (STK) is another key created at the size
> of 2,048 bits. That key is transferred with the encrypted VMP on a
> public network. This key is a unique non-redundant key
> per-transaction, assuring that even if the same data is encrypted
> time after time again, it will never yield the same encrypted code
> (hence preventing a possible security breach). A third key "Users
> Key" also a 2,048 bit key is created based on users input
> (Username, Password, Etc.) and used in the encryption process. 2
> Additional 2,048 bit keys are created randomly and are utilized to
> further encrypt the data.
>
> 3) The encrypted pointers are then further encrypted by a variety of
> highly secured algorithms: "Multiplication Matrix Modulo" (MMM) is
> a matrix of mathematically inverse keys utilized to encrypt/decrypt
> the pointers. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size. The overflow actually gives us an
> unpredictable number that is used to further encrypt the
> pointers. "Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers. Since the specific algorithm used at a certain point
> is dependant on the variety of keys and data flow for the specific
> session, there is no way to know which of those algorithms was
> used. Therefore, regardless of the specific strength of a specific
> algorithm, it is impossible to break. "Bit Level Encryption" (BLE)
> is another innovative algorithm that encrypts data one bit at a
> time. A specific bit can have a value of only 0 or 1, and the
> encrypted value is also only either 0 or 1. Considering the fact
> that a single bit is meaningless (versus a byte that can signify a
> character for example) it is impossible to decrypt.
>
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
>
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
>
> 6) After these explanations, we hope that you'll agree with our
> non-compromising statement of: . .
>
> "VME IS THE ONLY UNBREAKABLE ENCRYPTION" . . .
"The ORIGINAL DATA are never encrypted > or transferred in any form or shape."
Umm I would call shuffling data around encrypted wouldn't the rest of us?
2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred.
(based on a secret reference file)!!!!!! Okay here we go there is no 1mbit key at all there is a much smaller key which then generates a random stream of data. Smaller key now the question is how small for all we know it could be 2 bits just like that company is
"Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers.
Okay if these methods were unique they couldn't be simple and the whole process would slow down to a crawl.
The whole key transfer thing is secured by tripple RSA or something similar ( 3 layers of 2048 bit asymeteric keys ) @ 2048 bits so all in all its what like a effective 2049.58 bit encryption this whole thing is a shame when u can do 4096 bit encryption.
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date). Okay this feature is hardly useful requires both ends to have synced times as well as a refernce key to start the pseudo random number generator. The security of this is propontional to the 1/(time ranger it is active ) X average number of time units before activation. So even if it is active for an hour the security gain is almost useless.
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE. This is just means it encrypted with the target users public key big woop dee do da. . Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction > Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size.
Umm yeah my ass it gives a good encryption this is essetionally the simplest form of a hash there is jsut take the last X digits of a number sheez who they think they are kidding. Someone please point them to the SHA algorithim.
Stolen from http://www.privacy.nb.ca/cryptography/archives/cry ptography/html/1998-03/0004.html
>From the Meganet Web Site:
> 1) Virtual Matrix Encryption (VME) reads Data From the original file
> into memory, and then compares it with an internal random matrix of
> values named "Virtual Matrix" (VM). A set of pointers to the
> location in the matrix is created "Virtual Matrix Pointers"
> (VMP). These pointers are than passed further to be encrypted by
> additional algorithms in VME. The ORIGINAL DATA are never encrypted
> or transferred in any form or shape. Since the data is not
> encrypted, there is no way to decrypt it. The process of Encrypting
> utilizes "Progressive Virtual Matrix" (PVM) and the decryption uses
> "Regressive Virtual Matrix (RVM).
>
> 2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred. A
> "Standard Transaction Key" (STK) is another key created at the size
> of 2,048 bits. That key is transferred with the encrypted VMP on a
> public network. This key is a unique non-redundant key
> per-transaction, assuring that even if the same data is encrypted
> time after time again, it will never yield the same encrypted code
> (hence preventing a possible security breach). A third key "Users
> Key" also a 2,048 bit key is created based on users input
> (Username, Password, Etc.) and used in the encryption process. 2
> Additional 2,048 bit keys are created randomly and are utilized to
> further encrypt the data.
>
> 3) The encrypted pointers are then further encrypted by a variety of
> highly secured algorithms: "Multiplication Matrix Modulo" (MMM) is
> a matrix of mathematically inverse keys utilized to encrypt/decrypt
> the pointers. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size. The overflow actually gives us an
> unpredictable number that is used to further encrypt the
> pointers. "Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers. Since the specific algorithm used at a certain point
> is dependant on the variety of keys and data flow for the specific
> session, there is no way to know which of those algorithms was
> used. Therefore, regardless of the specific strength of a specific
> algorithm, it is impossible to break. "Bit Level Encryption" (BLE)
> is another innovative algorithm that encrypts data one bit at a
> time. A specific bit can have a value of only 0 or 1, and the
> encrypted value is also only either 0 or 1. Considering the fact
> that a single bit is meaningless (versus a byte that can signify a
> character for example) it is impossible to decrypt.
>
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
>
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
>
> 6) After these explanations, we hope that you'll agree with our
> non-compromising statement of: . .
>
> "VME IS THE ONLY UNBREAKABLE ENCRYPTION" . . .
"The ORIGINAL DATA are never encrypted
> or transferred in any form or shape."
Umm I would call shuffling data around encrypted wouldn't the rest of us?
2) At that stage, 5 different keys are being created: "Million Bit
> Key" (MBK) is a key of 1 Million Bits in size that is unique in
> concept. Since a million bits equal 128kb, it would be way slow to
> transfer over slow communication lines (2 minutes at 28.8k),
> therefore, it is recreated at both sides (based on a secret
> reference file) of the connection WITHOUT being transferred.
(based on a secret reference file)!!!!!!
Okay here we go there is no 1mbit key at all there is a much smaller key which then generates a random stream of data.
"Multiple Algorithm Matrix" (MAM) is a collection of 256
> UNIQUE encryption/decryption algorithms utilized to further encrypt
> the pointers.
Okay if these methods were unique they couldn't be simple and the whole process would slow down to a crawl.
The whole key transfer thing is secured by tripple RSA or something similar ( 3 layers of 2048 bit asymeteric keys ) @ 2048 bits so all in all its what like a 2049.58 bit encryption this whole thing is a shame when u can do 4096 bit encryption.
> 4) In addition to the previously described algorithms, an additional
> algorithm,known as "Date Limit Algorithm" (DLA), is
> implemented. The DLA allows further encryption of the pointers in
> such a way that they can be decrypted correctly ONLY between a
> defined date range - therefore creating for the first time, an
> encrypted content that is time sensitive. The implementations are
> endless - you can encrypt data for a specific date in the future
> (software vendors who wants to debut a new software on a specific
> future date can distribute the encrypted code months a head and
> give the password on the specific date). DLA also prevent brute
> force attacks - since it reads the date from the real time clock,
> once it goes out of the date range, the decrypted data will never
> be correct, even if the right keys are used (since there will be no
> way to tell if the problem is the key or the date).
Okay this feature is hardly useful requires both ends to have synced times as well as a refernce key to start the pseudo random number generator. The security of this is propontional to the 1/(time ranger it is active ) X average number of time units before activation. So even if it is active for an hour the security gain is almost useless.
> 5) The last stage of encryption consists of "Targeted Delivery System"
> (TDS) which is a system targeted at covering all the scenarios and
> needs for encryption. The "Global" option is as it sounds - anybody
> on the planet with a copy of VME and the right keys & passwords can
> decrypt the data. "Local" means that only people from the same
> organization holding a copy of VME will be able to decrypt the
> data. An outsider, even with a valid copy of VME with all the keys
> and the passwords will not be able to decrypt it. "Private" means -
> your copy of VME is the only copy in the world that will be able to
> decrypt the data, regardless of who aquires the correct keys and
> passwords. "Specific" is targeted at sending specific material a
> specific person, even on the other side of the world - the data is
> encrypted in such a way that only the TARGET user can decrypt
> it. NOT EVEN THE ORIGINATOR CAN DECRYPT THE FILE.
This is just means it encrypted with the target users public key big woop dee do da.
. Since the specific order is random and based on the
> actual pointers encrypted, there is no way to pinpoint the right
> combination, hence any combination can be valid. "Subtraction
> Matrix Modulo" (SMM) is a system that utilizes a mathematical
> algorithm to add multipule numbers together in a register to create
> an overflow of limited size.
Umm yeah my ass it gives a good encryption this is essetionally the simplest form of a hash there is jsut take the last X digits of a number sheez who they think they are kidding. Someone please point them to the SHA algorithim.
"Any form of encryption, OTHER THAN A ONE-TIME PAD, is susceptible to brute force attack if the key size is small enough." Yeah but the problem with most( if not all ) symeteric encryption is You don't what the original data was so u never know if you have successfully decrypted the data. The follow alphabetical string "aaaa" could be an encrypted piece of data that has had a subtractive encryption applied now can you conclusively tell me that the original message was "time"? no cause it could have just as well been "fire". Now since this has a 1 mbit key it is very likely that there are millions ( raised to lots of powers of 10 ) of possible combinations.
Hmm I click change but it don't work well here is my P.S. In reality we a cipher that uses little memmory, little keys and is very very fast yet as secure as possible. This has probably two of those it is prolly pretty fast cause it most likely uses that big key to do an xor on the data making it hard to break. Such a big key is hard to store securely and hard to move but guess what the key is very hard without a LARGE data stream ( or a poor cipher ).
First thing first if this is a 1 mbit key then they are definately not using asymeteric(sp?) encryption or else the time to encrypt the single smallest message would probably years and to decrypt would be even longer thats with a key. ( Assuming the security between the private and public key is reasonable unlike inverse matricies which are 2 different keys but the use of the keys is quick ) so well everyone is still transfer all there credit card info with old encryption so thats down the drain. Even if it was asymeteric encryption then that means when your setting up your secure connection would take a handshake of over 1/4 of a meg but as I said before it is just symeteric. So with this large key how are they gonna transfer it seeing as it is symeteric? the answer is they can't the vernor ( sp? ) was invited a long time ago and its MORE secure then this *new* encryption Meganet created.
Okies now we got a 1 megabit key how are we gonna generate this key if we are gonna try to use entropy from the system its gonna take a long time to generate the data so there are only 2 solutions 1) we use a thermal diode which has to be at the right temperature and shield from RF or else it is statically attackable 2) we use a pseudo random software generator. 1 is not fesiable if we are requiring many keys to be generated at once i.e. as a symeteric component in SSL cause it still isn't fast enough and I won't bother looking at 2.
Same thing happend with Gnucleus and Morphues except morpheus released FAKED source code.
ARB_vertex_program was design because of the two different current methods of vertex shaders that are out. Nvidia owns GL_NV_vertex_program and ATI owns GL_EXT_vertex_shader. Now ARB_vertex_program sits some where in the middle of these to similar extensions but I cannot see a way that the middle ground could be violating a pending patent and that current other two extensions don't.
damn this thing still uses direct connection you directly connect to the station so you get their IP and then you simple look up their ISP send them a nice letter and get them shut down.
I agree that this is true with many render farms that use generic chips for rendering such as 80x86 proccessor but if you create with flexible pipelines and you create a render farm with these then of course this won't be replaced by the new boards.
Thankfully with 3dlabs OpenGl 2.0 work and M$ work on DX9 the mainstream PC cards are becoming more like these custom chips execpt they won't be employed in render farms and therefore will not have as much as the multipul proccessor that are already out in some places.