About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
STOC 1997
Conference paper
Public-key cryptosystem with worst-case/average-case equivalence
Abstract
We present a probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time: `Find the shortest nonzero vector in an n dimensional lattice L where the shortest vector υ is unique in the sense that any other vector whose length is at most nc∥υ∥ is parallel to υ.'