PSEC is a elliptic curve encryption algorithm, and it is mathematically
proven that PSEC cannot be broken under the assumptions that hash function
outputs are random, and that elliptic curve discrete logarithm problems
are difficult. Compared to the RSA encryption algorithm, it yields higher
implementation speed in software since high security is realized even with
shorter length keys. Furthermore, the speed can be improved by the
optimization techniques developed by NTT.