Variation in Breaking Times for NTRU and Other Cryptosystems,
Joseph H. Silverman and William Whyte
Comparing average and minimum breaking times for NTRU and other cryptosystems.
Lattice Breaking Times, William Whyte
A survey of known results in lattice breaking times, and how to calculate the breaking times of recommended NTRU lattices.
Choosing NTRUEncrypt Parameters, William WHyte
How to choose NTRUEncrypt parameters. Proposals for slight variations in NTRUEncrypt encryption schemes to allow for greater efficiency. NTRUEncrypt schemes that allow for perfect forward secrecy.
Cryptography and the Variational Stability of Algorithms,
Joseph H. Silverman
Many algorithms exhibit a wide variation of running times when presented with different inputs. For such algorithms, if the goal is simply to solve a single problem instance, then it may be more efficient to set a cutoff time and to start on a new problem instance if the chosen cutoff time is exceeded. Whether or not this cutoff strategy is helpful depends on the extent to which the running time varies. In this note we quantify this notion of algorithmic variability and we define a stability exponent StExp with the property that a cutoff strategy is useful if and only if StExp > 1. We compute the stability exponent exactly for exhaustive searches and for meet-in-the-middle (eg, Pollard rho) searches and we estimate the stability exponent experimentally for an LLL lattice reduction implementation. These three examples have applications, respectively, to symmetric ciphers (DES, AES), elliptic curve cryptosystems (ECC), and lattice cryptosystems (NTRU).
IEEE P1363.2 -- AMP, Taekyoung Kwan
A review of the status of the AMP protocol.
|IEEE Home Page||IEEE Standards||IEEE P1363|