Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

58 results about "Absolute minimum" patented technology

Absolute minimum. absolute minimum A value of a given function that is less than or equal to any value of the given function.

Arithmetic functions in torus and tree networks

Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer. With the method of this invention, every single element is injected into the network only once and it will be stored and forwarded without any further software overhead. In accordance with a second aspect of the invention, methods and systems are provided to efficiently implement global arithmetic operations on a network that supports the global combining operations. The latency of doing such global operations are greatly reduced by using these methods.
Owner:IBM CORP

Improved lattice-based key exchange protocol algorithm

The invention relates to a protocol algorithm, specifically a lattice-based key exchange protocol algorithm improved through utilization of random Gaussian noises. The method comprises the steps that1, it is assumed that a constant m is greater than or equal to 2, lambda is equal to O(n), beta is equal to (square root of n)sigma, and q is equal to O(2<lambda>mn[beta]<2>, wherein the sigma is a security parameter in M-DLWE definition, it is assumed that X is equal to {z which is an element of a set R<m>:||z||<=the beta, wherein the i is the element of the set [m]}, wherein the z is the element of the set R, and the||z|| is a norm z of a coefficient vector, hereinafter, an absolute minimum residual system is employed for R<q>, namely, each coefficient a satisfies |a|<q/2,wherein the a is the element of the set R<q>; S2, an m-order random matrix A is selected, wherein the A is the element of the set R<q><m _ x _ m>, and the A is accepted by a first communication partyand a second communication party, wherein; S3, information is issued, specifically, (1), the first communication party selects x,e<1><- D<R<m,sigma>>, computes a=(Ax+e<1>)mod q, and sends the a to thesecond communication party, and (2), the second communication party selects y,e<2><- D<R<m,sigma>>, computes b<T>=(y<T>A+e<2><T>)mod q and sends the b to the first communication party; and S4, sharedkeys are generated, specifically, (1), the first communication party generates the shared key k<1>=MSB(b<T>x mod q); and (2), the second communication party generates the shared key k2=MSB(y<T>a modq).
Owner:JIANGSU UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products