[June 17, 2013] International Business Machines Assigned Patent Tweet (Targeted News Service Via Acquire Media NewsEdge) By Targeted News Service ALEXANDRIA, Va., June 17 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,462,940) developed by Miklos Ajtai, Los Gatos, Calif., for a "public key cryptosystem and associated method utilizing a hard lattice with O(n log n) random bits for security." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A public key cryptosystem utilizes a hard lattice with O(n log n) random bits for security. The system comprises a public-key cryptosystem whose hardness assumption is a clearly stated mathematical problem with a long history and comprises a short key, reaching a balance between the favorable properties of the hardness assumption and the key size. This balance has not been achieved by previously known public-key cryptosystems. The improved efficiency of the present system is achieved by reducing the size of the public key from O(n.sup.2 log n) to O(n log n). The improved security of the system is achieved by reducing the security to the hardness of a clearly stated computational problem, the dipohantine approximation problem of Dirichlet." The patent application was filed on Jan. 11, 2006 (11/330,940). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,462,940&OS=8,462,940&RS=8,462,940 Written by Arpi Sharma; edited by Anand Kumar. AS0617AK0617-890337 (c) 2013 Targeted News Service [ Back To TMCnet.com's Homepage ]