摘要:
A comcryptor (100) works together with a compressor set (105) and a permutation set (110). The comcryptor (100) performs simulataneous compression and encryption of input source data (115) based on the input key (120). The output of the comcryptor (100) is compressed and encrypted, that is to say comcrypted, data (125). The compressor set (105) includes multiple compression algorithms for use by the comcryptor (100). Typically at least two compression algorithms are available in the compressor set (105), but any number may be present. The larger the number of compression algorithms are available in the compressor set (105), but any number may be present. The larger the number of compression algorithms in the compressor (105) is, the greater the lever of security is.
摘要:
A comcryptor (100) works together with a compressor set (105) and a permutation set (110). The comcryptor (100) performs simulataneous compression and encryption of input source data (115) based on the input key (120). The output of the comcryptor (100) is compressed and encrypted, that is to say comcrypted, data (125). The compressor set (105) includes multiple compression algorithms for use by the comcryptor (100). Typically at least two compression algorithms are available in the compressor set (105), but any number may be present. The larger the number of compression algorithms are available in the compressor set (105), but any number may be present. The larger the number of compression algorithms in the compressor (105) is, the greater the lever of security is.
摘要:
The present invention takes advantage of a quadratic-only ambiguity for x-coordinates in elliptic curve algebra as a means for encrypting plaintext directly onto elliptic curves. The encrypting of plaintext directly onto elliptic curves if refered to herein as 'direct embedding'. When performing direct embedding, actual plaintext is embedded as a '+' or '-' x-coordinate. The sender specifies using an extra bit whether + or - is used so that the receiver can decrypt appropriately. In operation their are two public initial x-coordinates such that two points P1+ and P¿1?- lie respectively on two curves E?+ and E-¿. A parcel of text x¿text? is selected that is no more than q bits in length. The curve (E?+ or E-¿) that contains x¿text? is determined. A random number r is chosen and used to generate a coordinate xq using the public key of a receiving party. An elliptic add operation is used with the coordinate xq and the parcel of text to generate a message coordinate xm. A clue xc is generated using the random number and the point P from the appropriate curve E+/-. The sign that holds for xtext is determined and called g. The message coordinate mm, the clue xc, and the sign g are sent as a triple to the receiving party. The receiving party uses the clue xc and its private key to generate coordinate xq. Using the sign g and coordinate xq, the text can be recovered.