Patents by Inventor Philipp Michael Glaser

Philipp Michael Glaser 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).

  • Multiplier cell and method of computing
    Patent number: 6671709
    Abstract: An integrated cryptographic system (24) executes a mathematical algorithm that computes equations for public-key cryptography. An arithmetic processor (22) receives data values stored in a temporary storage memory (14) and computes both the Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) algorithms. Multiplication cells (270 and 280) have an INT/POLY terminal that selects a C-register (246) for computing RSA modular exponentiation or ECC elliptic curve point multiplication.
    Type: Grant
    Filed: March 25, 2002
    Date of Patent: December 30, 2003
    Assignee: Motorola, Inc.
    Inventors: Philipp Michael Glaser, Michael J. Torla
  • Multiplier cell and method of computing
    Publication number: 20030009503
    Abstract: An integrated cryptographic system (24) executes a mathematical algorithm that computes equations for public-key cryptography. An arithmetic processor (22) receives data values stored in a temporary storage memory (14) and computes both the Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) algorithms. Multiplication cells (270 and 280) have an INT/POLY terminal that selects a C-register (246) for computing RSA modular exponentiation or ECC elliptic curve point multiplication.
    Type: Application
    Filed: March 25, 2002
    Publication date: January 9, 2003
    Inventors: Philipp Michael Glaser, Michael J. Torla
  • Multiplier cell and method of computing
    Patent number: 6397241
    Abstract: An integrated cryptographic system (24) executes a mathematical algorithm that computes equations for public-key cryptography. An arithmetic processor (22) receives data values stored in a temporary storage memory (14) and computes both the Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) algorithms. Multiplication cells (270 and 280) have an INT/POLY terminal that selects a C-register (246) for computing RSA modular exponentiation or ECC elliptic curve point multiplication.
    Type: Grant
    Filed: December 18, 1998
    Date of Patent: May 28, 2002
    Assignee: Motorola, Inc.
    Inventors: Philipp Michael Glaser, Michael J. Torla