Patents by Inventor Howard S. Lambert
Howard S. Lambert has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7490246Abstract: A method for encryption and decryption of data items is provided by defining a cipher key based on variables in a Chaotic Equation. The method includes selecting a Chaotic Equation from a set of Chaotic Equations, defining starting conditions of the variables of the equation, and applying the equation to each data item. The real and imaginary parts of the result of the iteration of the Chaotic Equation are combined with the data item by an arithmetic operation, for example, an XOR operation. Data items in a continuous stream with a rate dependency can be encrypted and decrypted on an item by item basis. The input or cipher key changes for each byte of the data encryption. Blocks of data can be encrypted using the method with an identifier of the order of the blocks in the data stream. If blocks are received out of sequence, the identifiers can be used to maintain the correct decryption order. The method of encryption and decryption can be used in devices to avoid the need for a session key.Type: GrantFiled: August 30, 2006Date of Patent: February 10, 2009Assignee: International Business Machines CorporationInventor: Howard S. Lambert
-
Patent number: 7266200Abstract: A method and apparatus for encryption of data are provided, in which the data is made up of a series of data items (600). The data items (600) maybe bytes of data or blocks of data. The method includes providing a plurality of encryption algorithms (604), selecting when to change encryption algorithm (601), selecting which encryption algorithm to change to (603), wherein each selection is carried out by applying a Chaotic and/or Catastrophic equation. The plurality of encryption algorithms (604) have index numbers and the generation of an index number by applying the Chaotic or Catastrophic equation selects an encryption algorithm. The selection of when to change encryption algorithm may be determined by a Catastrophic event in the Catastrophic equation and the selection of encryption algorithm may be determined by the surface of a Catastrophic curve on which a point lies, wherein each surface corresponds to an encryption algorithm.Type: GrantFiled: November 14, 2002Date of Patent: September 4, 2007Assignee: International Business Machines CorporationInventor: Howard S. Lambert
-
Patent number: 7174556Abstract: A method for administration in an object-oriented data processing environment is provided, for use in a distributed messaging system comprising a local computer system, a remote computer system having a remote queue object to be administered and a network. A query object is sent to the remote queue object in order to obtain a first copy of the remote queue object. Once the first copy is received, a second copy of the remote queue object is made at the local computer system and an administrator uses this second copy to make one or more updates. The updates and the first copy are then sent to the remote queue object. The remote queue object in its current state is compared to the first copy, in order to determine whether they match. If a match occurs, the administrator's updates are processed and the remote queue object is replaced with the updated version.Type: GrantFiled: December 12, 2002Date of Patent: February 6, 2007Assignee: International Business Machines CorporationInventor: Howard S. Lambert
-
Patent number: 7133522Abstract: A method for encryption and decryption of data items is provided by defining a cipher key based on variables in a Chaotic Equation. The method includes selecting a Chaotic Equation (110) from a set of Chaotic Equations, defining starting conditions of the variables of the equation (140), and applying the equation to each data item (120). The real and imaginary parts of the result of the iteration of the Chaotic Equation are combined with the data item by an arithmetic operation, for example, an XOR operation (120). Data items in a continuous stream with a rate dependency can be encrypted and decrypted on an item by item basis. The input or cipher key changes for each byte of the data encryption. Blocks of data (700, 701, 702, 703, 704) can be encrypted using the method with an identifier of the order of the blocks in the data stream. If blocks are received out of sequence, the identifiers can be used to maintain the correct decryption order.Type: GrantFiled: February 14, 2002Date of Patent: November 7, 2006Assignee: International Business Machines CorporationInventor: Howard S. Lambert
-
Publication number: 20040049775Abstract: A method for administration in an object-oriented data processing environment is provided, for use in a distributed messaging system comprising a local computer system, a remote computer system having a remote queue object to be administered and a network. A query object is sent to the remote queue object in order to obtain a first copy of the remote queue object. Once the first copy is received, a second copy of the remote queue object is made at the local computer system and an administrator uses this second copy to make one or more updates. The updates and the first copy are then sent to the remote queue object. The remote queue object in its current state is compared to the first copy, in order to determine whether they match. If a match occurs, the administrator's updates are processed and the remote queue object is replaced with the updated version.Type: ApplicationFiled: December 12, 2002Publication date: March 11, 2004Applicant: International Business Machines CorporationInventor: Howard S. Lambert
-
Publication number: 20030118185Abstract: A method and apparatus for encryption of data are provided, in which the data is made up of a series of data items (600). The data items (600) maybe bytes of data or blocks of data. The method includes providing a plurality of encryption algorithms (604), selecting when to change encryption algorithm (601), selecting which encryption algorithm to change to (603), wherein each selection is carried out by applying a Chaotic and/or Catastrophic equation. The plurality of encryption algorithms (604) have index numbers and the generation of an index number by applying the Chaotic or Catastrophic equation selects an encryption algorithm. The selection of when to change encryption algorithm may be determined by a Catastrophic event in the Catastrophic equation and the selection of encryption algorithm may be determined by the surface of a Catastrophic curve on which a point lies, wherein each surface corresponds to an encryption algorithm.Type: ApplicationFiled: November 14, 2002Publication date: June 26, 2003Applicant: International Business Machines CorporationInventor: Howard S. Lambert
-
Publication number: 20030007639Abstract: A method for encryption and decryption of data items is provided by defining a cipher key based on variables in a Chaotic Equation. The method includes selecting a Chaotic Equation (110) from a set of Chaotic Equations, defining starting conditions of the variables of the equation (140), and applying the equation to each data item (120). The real and imaginary parts of the result of the iteration of the Chaotic Equation are combined with the data item by an arithmetic operation, for example, an XOR operation (120). Data items in a continuous stream with a rate dependency can be encrypted and decrypted on an item by item basis. The input or cipher key changes for each byte of the data encryption. Blocks of data (700, 701, 702, 703, 704) can be encrypted using the method with an identifier of the order of the blocks in the data stream. If blocks are received out of sequence, the identifiers can be used to maintain the correct decryption order.Type: ApplicationFiled: February 14, 2002Publication date: January 9, 2003Applicant: International Business Machines CorporationInventor: Howard S. Lambert
-
Patent number: 5649105Abstract: A programmable workstation for collaborative working in a network comprises a conventional operating system and a network control program layer. Additionally, the workstation includes a collaborative application support subsystem for interfacing with application programs. The subsystem is responsive to predetermined application program calls to create a logical network model of a collaborative environment. The model comprises sharing sets of application programs, which share data and resources across nodes and logical dedicated data channels connecting members of the sharing set. The subsystem cooperates with the network layer to establish the physical links necessary to implement the model in a physical network, transparently to the application program.Type: GrantFiled: June 27, 1994Date of Patent: July 15, 1997Assignee: IBM Corp.Inventors: Barry Keith Aldred, Gordon William Bonsall, Howard S. Lambert, Harry David Mitchell
-
Patent number: 5539886Abstract: A programmable workstation for collaborative working in a network comprises a conventional operating system and network control layer for controlling physical routing of data between nodes. A collaborative application subsystem which interfaces with application programs is responsive to a predetermined call from a collaboration call manager to establish the call manager at the node to handle incoming events which are not specific to any application program instances at the node.Type: GrantFiled: June 27, 1994Date of Patent: July 23, 1996Assignee: International Business Machines Corp.Inventors: Barry K. Aldred, Gordon W. Bonsall, Howard S. Lambert, Harry D. Mitchell
-
Patent number: 5491798Abstract: A network comprises a set of nodes, each comprising a computer workstation in a computer network and including means responsive to messages from other computers in the network to join or leave a call. Each node maintains a list of calls in which that node is participating, an entry in the list for a call including the identities of all the other nodes in that call. In order to split a single call one node sends messages to a subset of nodes to join a second call, and leave the original call. The remaining parties in the original call then continue in a call of reduced scope. In order to merge two calls together, a node that is common to both calls sends messages to all the nodes in both calls, instructing them to leave the existing call and join a new call.Type: GrantFiled: November 10, 1993Date of Patent: February 13, 1996Assignee: International Business Machines CorporationInventors: Gordon W. Bonsall, Howard S. Lambert, H. David Mitchell, Barry K. Aldred