Patents Examined by Tod R. Swann
  • Patent number: 6081893
    Abstract: A system is disclosed for controlling intelligible access to secured files by means of a user-memorized password in combination with a user-associated passport record. The passport record takes on two forms, one when it is physically secured within the workstation and a different second form when the passport record is in-transit. Log-in privileges are granted after a presented passport record passes a number of tests including digital signature authentication, and the ability to extract two different encrypted keys from the passport record. The in-transit record does not carry one of those two keys.
    Type: Grant
    Filed: May 28, 1997
    Date of Patent: June 27, 2000
    Assignee: Symantec Corporation
    Inventors: David Grawrock, Shawn R. Lohstroh
  • Patent number: 6081600
    Abstract: A system and method provides signaling privacy for communications between nodes of a communications network (30). Multiple logical links exist between distinct network nodes (38-40, 42, 50-53) of the communication network (30). Signaling privacy is achieved by a subscriber unit (80) providing encryption/decryption of signaling data messages at the messaging level. The subscriber unit (80) employs a signaling encryptor/decryptor (86) along the signaling path, which enables the signaling data messages to be separately encrypted from data on the traffic channel. The encrypted signaling data can then be sent along a different logical link from the traffic, while maintaining cipher key synchronization between the signaling encryptor/decryptor (86) and a network encryptor/decryptor (78) at a remote end of the logical link which transports the encrypted signaling data.
    Type: Grant
    Filed: October 3, 1997
    Date of Patent: June 27, 2000
    Assignee: Motorola, Inc.
    Inventors: Scott David Blanchard, Dean Paul Vanden Heuvel, Joseph Olk Lester
  • Patent number: 6081597
    Abstract: The public key encryption system of the present invention has short and easily created encryption keys and wherein the encoding and decoding processes are performed extremely rapidly, and has low memory requirements. The encoding and decoding processes use both the addition and multiplication operations in a ring modulo with two different ideals. The cryptosystem of the present invention allows encryption keys to be chosen essentially at random from a large set of binary vectors, for which key lengths are comparable to the key lengths of the most widely used prior art cryptosystems. The present invention features an appropriate security level (.about.2.sup.80), with encoding and decoding processes ranging from approximately one to two orders of magnitude faster than the prior art, particularly the exponentiation cryptosystems.
    Type: Grant
    Filed: August 19, 1997
    Date of Patent: June 27, 2000
    Assignee: NTRU Cryptosystems, Inc.
    Inventors: Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
  • Patent number: 6078900
    Abstract: A method resolves the problem of projecting future stock levels for multiple stockholding locations in production-distribution networks, and minimizing the total dollar delinquency within given inventory budgets or within given allowable inventory holding costs. The invention communicates process control parameters and production-distribution network parameters, computes priorities for each product held at retail locations of the distribution network. It allocates available global and local budgets among products, sets starting stock levels for each product, computes and displays stock levels and the distribution network performance measures.
    Type: Grant
    Filed: October 23, 1998
    Date of Patent: June 20, 2000
    Assignee: International Business Machines Corporation
    Inventors: Markus Ettl, Grace Yuh-Jiun Lin
  • Patent number: 6078893
    Abstract: A method for tuning a demand model in manner that is stable with respect to fluctuations in the sales history used for the tuning is provided. A market model is selected, which predicts how a subset of the parameters in the demand model depends upon information external to the sales history; this model may itself have a number of parameters. An effective figure-of-merit function is defined, consisting of a standard figure-of-merit function based upon the demand model and the sales history, plus a function that attains a minimum value when the parameters of the demand model are closest to the predictions of the market model. This effective figure-of-merit function is minimized with respect to the demand model and market model parameters. The resulting demand model parameters conform to the portions of the sales history data that show a strong trend, and conform to the external market information when the corresponding portions of the sales history data show noise.
    Type: Grant
    Filed: May 21, 1998
    Date of Patent: June 20, 2000
    Assignee: KhiMetrics, Inc.
    Inventors: Kenneth J. Ouimet, Charu V. Chaubal
  • Patent number: 6079018
    Abstract: A document is digitally signed with a digital signature that is unique to the signer/document pair. A document digest is generated by applying a predefined one-way hash function to the document. A pseudo-random key is generated by combining the document digest with at least one other value in accordance with a predefined computational procedure. The digital signature is then generated as a predefined function of the private key, the document digest, and the pseudo-random key k. A distinct pseudo-random key is generated for each distinct specified document, and for a given value of the private key, a distinct digital signature is generated for each distinct specified document. In a preferred embodiment the pseudo-random key generating step includes combining the document digest with a value corresponding to the private key to generate an intermediate value, and hashing the intermediate value with the predefined one-way hash function to generate the pseudo-random key k.
    Type: Grant
    Filed: October 8, 1997
    Date of Patent: June 20, 2000
    Assignee: Agorics, Inc.
    Inventors: Norman Hardy, Linda L. Vetter, E. Dean Tribble
  • Patent number: 6078664
    Abstract: Z-transform calculations may be used to encode (and/or decode) carrier signal independent data (e.g., digital watermarks) to a digital sample stream. Deterministic and non-deterministic components of a digital sample stream signal may be analyzed for the purposes of encoding carrier signal independent data to the digital sample stream. The carrier signal independent data may be encoded in a manner such that it is restricted or concentrated primarily in the non-deterministic signal components of the carrier signal. The signal components can include a discrete series of digital samples and/or a discreet series of carrier frequency sub-bands of the carrier signal. Z-transform calculations may be used to measure a desirability of particular locations and a sample stream in which to encode the carrier signal independent data.
    Type: Grant
    Filed: December 20, 1996
    Date of Patent: June 20, 2000
    Inventors: Scott A. Moskowitz, Marc S. Cooperman
  • Patent number: 6078898
    Abstract: A system for transactional taxation includes a secure stored data device, such as a smart card, having means for storing purchaser-specific data, an interface device for communicating with the secure stored data device and means for determining a tax rate on a purchase using the purchaser-specific data.
    Type: Grant
    Filed: March 18, 1998
    Date of Patent: June 20, 2000
    Assignee: Schlumberger Technologies, Inc.
    Inventors: Robert R. Davis, Jane B. Walton
  • Patent number: 6076162
    Abstract: The invention relates to a procedure for the certification of cryptographic keys for use in chipcards. In this procedure, a certification key and a certificate are transferred to the chipcard. The first part of the certificate includes the cryptographic key and the second part of the certificate includes a digital signature of the first part of the certificate. The digital certificate is subsequently checked by means of the certification key on the chipcard.
    Type: Grant
    Filed: January 21, 1998
    Date of Patent: June 13, 2000
    Assignee: International Business Machines Corporation
    Inventors: Michael Deindl, Walter Hanel, Albert Schaal
  • Patent number: 6076078
    Abstract: A number of fault-tolerant methods for purchasing digital goods with a digital token over a network in which the token's value resides either with a customer or a merchant are disclosed. One version of the method comprises the steps of establishing a price with a merchant for a digital good. A merchant-signed invoice and the digital good in encrypted form are then sent from the merchant to the customer. The invoice is signed with the customer's signature to produce a countersigned invoice. The countersigned invoice, a token (which can be an anonymous token), and identifying information for the token are sent from the customer to the merchant. The countersigned invoice, the token, and the identifying information are sent from the merchant for verification. The token is verified with the identifying information and the other information in the countersigned purchase order is checked.
    Type: Grant
    Filed: February 14, 1997
    Date of Patent: June 13, 2000
    Assignee: Carnegie Mellon University
    Inventors: Linda Jean Camp, Justin D. Tygar, Michael R. Harkavy
  • Patent number: 6075859
    Abstract: In a communications system, a method of transforming a set of message signals representing a message comprising the steps of first encoding one of the set of message signals in accordance with a first keyed transformation, a second encoding of the one of the set of message signals in accordance with at least one additional keyed transformation, a third encoding of the one of the set of message signals in accordance with a self inverting transformation in which at least one of the set of message signals is altered, a fourth encoding of the one of the set of message signals in accordance with at least one additional inverse keyed transformation wherein each of the at least one additional inverse keyed transformation is a corresponding inverse of at least one additional keyed transformation, and fifth encoding the one of the set of message signals in accordance with first inverse keyed transformation wherein the first inverse keyed transformation is the inverse of the first keyed transformation.
    Type: Grant
    Filed: March 11, 1997
    Date of Patent: June 13, 2000
    Assignee: QUALCOMM Incorporated
    Inventor: Gregory G. Rose
  • Patent number: 6075865
    Abstract: A communication system, which includes an origination space, a communications channel, and a destination space associated with the origination space via the communications channel. The origination space includes an encryption engine for generating an output symbol O.sub.t based on an input symbol I.sub.t and means for receiving an encrypt key, an encrypt text/key relation, and the input symbol. The destination space includes a decryption engine for generating a decrypted symbol I'.sub.t based on the output symbol received from the origination space via the communications channel and means for receiving a decrypt key and a decrypt text/key relation. The encrypt text/key relation controls the encryption engine such that O.sub.t =.alpha..sub.N (t)+.pi..sub.N [.alpha..sub.N-1 (t)+.pi..sub.N-1 [.alpha..sub.N-2 (t)+ . . . +.pi..sub.2 [.alpha..sub.1 (t)+.pi..sub.1 [I.sub.t +.alpha..sub.0 (t)]] . . . ]], mod W, where .alpha..sub.N, .alpha..sub.N-1, . . . , .alpha..sub.1, .alpha..sub.
    Type: Grant
    Filed: July 1, 1998
    Date of Patent: June 13, 2000
    Assignee: TecSec Incorporated
    Inventors: Edward M. Scheidt, C. Jay Wack
  • Patent number: 6076163
    Abstract: Methods and apparatus for providing secure user identification or digital signatures based on evaluation of constrained polynomials. In an exemplary user identification technique, a prover sends a verifier a commitment signal representative of a first polynomial satisfying a first set of constraints. The verifier sends the prover a challenge signal representative of a second polynomial satisfying a second set of constraints. The prover generates a response signal as a function of (i) information used to generate the commitment signal, (ii) a challenge signal, and (iii) a private key polynomial of the prover, such that the response signal is representative of a third polynomial satisfying a third set of constraints. The verifier receives the response signal from the prover, and authenticates the identity of the prover by evaluating a function of information contained in at least a subset of (i) the commitment signal, (ii) the challenge signal, (iii) the response signal and (iv) a public key of the prover.
    Type: Grant
    Filed: October 20, 1997
    Date of Patent: June 13, 2000
    Assignee: RSA Security Inc.
    Inventors: Jeffrey Hoffstein, Burton S. Kaliski, Jr., Daniel Bennett Lieman, Matthew John Barton Robshaw, Yiqun Lisa Yin
  • Patent number: 6073236
    Abstract: Mutual authentication is performed. A reader/writer (R/W) transmits to an IC card a code C.sub.1 that is a random number R.sub.A encrypted using a key K.sub.B. The IC card decrypts the code C.sub.1 into plain text M.sub.1 using the key K.sub.B. The IC card transmits to the R/W a code C.sub.2 that is the plain text M.sub.1 encrypted using a key K.sub.A and a code C.sub.3 that is a random number R.sub.B encrypted using the key K.sub.A. The R/W decrypts the codes C.sub.2 and C.sub.3 into plain text M.sub.2 and plain text M.sub.3, respectively, using the key K.sub.A. When the R/W determines that the plain text M.sub.2 and the random number R.sub.A are the same, it authenticates the IC card. Next, the R/W transmits to the IC card a code C.sub.4 that is the plain text M.sub.3 encrypted using the key K.sub.B. The IC card decrypts the code C.sub.4 into plain text M.sub.4 using the key K.sub.B. When the IC card determines that the plain text M.sub.4 and the random number R.sub.B are the same, it authenticates the R/W.
    Type: Grant
    Filed: June 20, 1997
    Date of Patent: June 6, 2000
    Assignee: Sony Corporation
    Inventors: Susumu Kusakabe, Masayuki Takada
  • Patent number: 6072875
    Abstract: A method and an apparatus are provided for securely identifying a mobile user while avoiding trackability of his/her movements, i.e. it provides a way for a secure user identification in secrecy. The gist is to encrypt the user's identifier, and/or his/her password, and a synchronization indication, preferably a fixed time interval, under a secret one-way function and sending the encrypted message, called a "dynamic user identifier", to the user's "home authority" where he/she is registered. The home authority comprises correspondence tables listing, pre-computed for every time interval (or another chosen synchronization), the dynamic user identifiers and the corresponding true identity of the user and can thus quickly decide whether the received encrypted message originates from a registered user. On the other hand, an intruder is neither able to detect from the encrypted messages the identity of the user nor can he/she track a user's moves.
    Type: Grant
    Filed: April 25, 1997
    Date of Patent: June 6, 2000
    Assignee: International Business Machines Corporation
    Inventor: Gene Tsudik
  • Patent number: 6073119
    Abstract: This invention generally relates to a banking facility layout and a method and system for networked customer and other user interaction with a variety of functions. These functions include access to networks, such as the internet, email capability, options to view information on banking capabilities, access to home banking, and other electronically-related user functions. The invention incorporates a purpose-designed environment that can be integrated into a branch or other banking institution facility. The invention also includes a video wall feature that allows interaction by networked users; users may take control of portions of the wall and add selected information to these portions.
    Type: Grant
    Filed: December 3, 1997
    Date of Patent: June 6, 2000
    Assignee: Citicorp Development Center, Inc.
    Inventors: Sylvia Bornemisza-Wahr, Kevin Sy Lam, Frank McCallick, Roy Sinai, Peter Paradiso, Howard A. Schechtman, Kenneth J. Randall, Peter Tompkins, Teresa A. Petach
  • Patent number: 6072873
    Abstract: In order to implement the Digital Video Broadcasting descrambling algorithm in the context of MPEG compressed data streams containing interleaved sections of scrambled and unscrambled data, at a data rate of 60 MBits/sec with a clock of 2.7 MHz, a stream cipher has an input to receive scrambled video data, and an output coupled to a block cipher for providing descrambled data, the stream cipher comprises shift register means for holding input data coupled to a first mapping logic mechanism comprising at least a first logic means and a second logic means coupled in sequence and arranged to carry out similar logical steps, and the block cipher means comprising shift register means for holding the output of the stream cipher means and a second logic mapping mechanism, comprising at least a first logic means, a second logic means, a third logic means and a fourth logic means coupled in sequence being arranged to carry out similar logical steps.
    Type: Grant
    Filed: March 3, 1998
    Date of Patent: June 6, 2000
    Assignee: LSI Logic Corporation
    Inventor: Simon Bewick
  • Patent number: 6073235
    Abstract: A private broadcasting system includes communication terminals which are coupled to both a broadcasting network and point-to-point network. A private broadcasting device included in the broadcasting system is coupled to a database that contains a pool of encryption keys and a pool of channel numbers. The encryption keys and channel numbers are assigned to a private broadcast request when the communicating partners of the private broadcast request are available for communication. The encryption key and channel number is issued to each of the participating terminals. Each of the participating terminals encrypts and de-encrypts the information transmitted on and received from the broadcasting channel at the assigned channel number. In this way, the terminals communicate with each other privately excluding all other terminals that are not part of the private broadcast communication.
    Type: Grant
    Filed: June 24, 1997
    Date of Patent: June 6, 2000
    Assignee: AT&T Corp.
    Inventors: Mark Jeffrey Foladare, Shelley B. Goldman
  • Patent number: 6069954
    Abstract: A new structure for a secret key cryptography algorithm uses double exclusive-or (XOR) encryption (e.sub.i =k1.sub.i XOR m.sub.i XOR k2.sub.1), analogue to a stream cipher arrangement, but providing data integrity protection. The double XOR encryption creates an inner sequence, for example s.sub.i =k1.sub.i XOR m.sub.i for the encryption process, s.sub.i =k2.sub.i XOR e.sub.i for the decryption process, which is unknown to the adversary and is used as a starting point for feedback on the very key streams used in the encryption of following bits of the message. In its preferred embodiment, this structure is the Frogbit data integrity algorithm which uses 10 independent pseudo-random sources. The Frogbit algorithm is well suited to the design and implementation of "semi-proprietary" ciphers, where the overall design is publicly known and peer-reviewed but a significant amount of the implementation specification is left open to private customization.
    Type: Grant
    Filed: May 9, 1997
    Date of Patent: May 30, 2000
    Inventor: Thierry Moreau
  • Patent number: 6067531
    Abstract: A contract system automates negotiation and generation of contract documents by managing the work flow in a contract approval process. Multiple users, coupled by a computer network, access a contract database containing multiple contracts with multiple contract components therein. The system manages communications and security between a client system and the contract database. A client applet facilitates user input at the client system and assists in a standardization of legal phrasing and contract negotiation. The client applet enforces business rules to qualify a contract for expedited approval. Generalized templates are employed to enable rapid prototyping and creation of new contracts. A method governs the automated contract negotiation and generation process within a business organization with assistance from a graphical user interface.
    Type: Grant
    Filed: July 21, 1998
    Date of Patent: May 23, 2000
    Assignee: MCI Communications Corporation
    Inventors: Daniel M. Hoyt, Robin M. Lee, Alan L. Lickiss