Methods in this field employing elliptic curves were developed by Koblitz and Miller. A technique named for Cramer and Shoup is useful even if there existed an "oracle" resource that would almost always reverse it; that property is called "malleability." One method employed in this field relies on a property of algorithms like Pollard's lambda for 
Methods in this field employing elliptic curves were developed by Koblitz and Miller. A technique named for Cramer and Shoup is useful even if there existed an "oracle" resource that would almost always reverse it; that property is called "malleability." One method employed in this field relies on a property of algorithms like Pollard's lambda for solving the discrete logarithm problem; that method often uses a "safe prime" to prevent the Pohlig-Hellman algorithm from working too quickly and is the Diffie-Hellman method. The majority of widely used methods in this field adhere to Kerckhoff's principle, which holds that systems should be secure even when their workings are public; such methods include RSA, whose security relies on the difficulty of factoring large primes. Naïve methods in this field include ROT13 and Caesar's cipher. For 10 points, name this study of the practice of hiding information.
Methods in this field employing elliptic curves were developed by Koblitz and Miller.
{cryptography} [accept equivalents]