Patents by Inventor Mohammad Ibrahim

Mohammad Ibrahim 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).

  • Publication number: 20240353215
    Abstract: A method for estimating a magnetic center of a motor having a pair of a rotor and a stator comprises: moving the rotor inside the stator axially to multiple axial positions; at each of the multiple axial positions, applying a constant magnitude single phase AC voltage across a stator phase of the stator and calculate a circuit impedance of the stator phase; and determining the magnetic center as one of the multiple axial positions with a maximum value of the circuit impedance. A system for estimating a magnetic center of a motor having a pair of a rotor and a stator comprises a rotor stand, a power supply, a voltmeter, and an ammeter.
    Type: Application
    Filed: April 21, 2023
    Publication date: October 24, 2024
    Applicant: SAUDI ARABIAN OIL COMPANY
    Inventor: Mohammad Ibrahim
  • Publication number: 20210322565
    Abstract: This invention relates to a therapeutic molecule capable of suppressing an immune response against an organ or tissue transplantation in a patient. In particular, the invention relates to a conjugate comprising a first portion connected to a second portion, wherein the first portion binds to an MHC Class I molecule and the second portion has HLA-G activity. This conjugate may be used as a medicament to modulate immune responses and induce immunological tolerance specific to allogenic MHC complexes.
    Type: Application
    Filed: June 7, 2021
    Publication date: October 21, 2021
    Inventor: Mohammad Ibrahim
  • Publication number: 20180311373
    Abstract: This invention relates to a therapeutic molecule capable of suppressing an immune response against an organ or tissue transplantation in a patient. In particular, the invention relates to a conjugate comprising a first portion connected to a second portion, wherein the first portion binds to an MHC Class I molecule and the second portion has HLA-G activity. This conjugate may be used as a medicament to modulate immune responses and induce immunological tolerance specific to allogenic MHC complexes.
    Type: Application
    Filed: April 27, 2018
    Publication date: November 1, 2018
    Inventor: Mohammad Ibrahim
  • Publication number: 20130078243
    Abstract: This invention relates to a therapeutic molecule capable of suppressing an immune response against an organ or tissue transplantation in a patient. In particular, the invention relates to a conjugate comprising a first portion connected to a second portion, wherein the first portion binds to an MHC Class I molecule and the second portion has HLA-G activity. This conjugate may be used as a medicament to modulate immune responses and induce immunological tolerance specific to allogenic MHC complexes.
    Type: Application
    Filed: November 11, 2010
    Publication date: March 28, 2013
    Applicant: King's College Hospital NHS Foundation Trust
    Inventor: Mohammad Ibrahim
  • Publication number: 20060098814
    Abstract: A method for enhancing the security of cryptographic systems against side channel attacks and cryptanalysis is based on the concept of object hopping or dynamic transformation of elements between objects that share the same category and/or floating objects which facilitate object hopping. The use of floating objects and floating finite fields to facilitate field hopping is also disclosed. Further, the use of curve hopping and floating elliptic curves to facilitate curve hopping and/or key floating when keys used in cryptosystems are floated through floating fields are also used for enhancing the security of cryptographic systems.
    Type: Application
    Filed: November 8, 2004
    Publication date: May 11, 2006
    Inventors: Abdulaziz Al-Khoraidly, Mohammad Ibrahim
  • Publication number: 20060029221
    Abstract: Given a set of elliptic points that satisfy an elliptic polynomial equation defined over a finite field, F, which requires N-bits to represent its elements, a new method of cryptographic encryption and decryption is presented which uses more than one quadratic variable that are termed y-coordinates to obtain an elliptic polynomial equation with multi y-coordinates instead of one y-coordinate. The additional y-coordinates are used to embed extra message data bits. A ny-fold increase in the number of embedded message data bits in a single elliptic point can be achieved with the improved method when using ny additional y-coordinates. The reason is that the number of points that satisfy an elliptic polynomial equation defined over F(p) and which can be used in the corresponding cryptosystem is increased by a factor of (#F)ny, where # denotes the size of a field. The use of the additional y-coordinates can be used to reduce computational complexity.
    Type: Application
    Filed: August 5, 2004
    Publication date: February 9, 2006
    Inventor: Mohammad Ibrahim
  • Publication number: 20060029220
    Abstract: Given a set of elliptic points that satisfy an elliptic polynomial equation defined over a finite field F which requires N-bits to represent its elements, a method of cryptographic encryption and decryption is presented which uses more than one cubic variable that are termed x-coordinates to obtain an elliptic polynomial equation with multi x-coordinates instead of one x-coordinate. The additional nx x-coordinates are used to embed extra message data bits. A nx-fold increase in the number of embedded message data bits in a single elliptic point can be achieved with the improved method. The reason is that the number of points that satisfy an elliptic polynomial equation defined over F and which can be used in the corresponding cryptosystem is increased by a factor of (#F)nx, where # denotes the size of a field. The use of additional x-coordinates can be used to reduce computational complexity.
    Type: Application
    Filed: August 5, 2004
    Publication date: February 9, 2006
    Inventor: Mohammad Ibrahim
  • Publication number: 20050267926
    Abstract: The present invention contemplates a method or cryptographic system for communicating securely over an insecure communication channel of the type which communicates a message from a transmitter to a receiver. The method includes the step of providing a finite filed serial-serial multiplication/reduction structure wherein an initial delay and clock-cycle are inherently independent of word length and wherein input operands are serially entered one digit at a time and the output result is computed serially one digit at a time, wherein the digit size can be one bit or more. As disclosed, the multiplication structure is scalable and a serial transfer reduces the bus width needed to transfer data back and forth between memory and a multiplication/reduction step. A finite field multiplication structure in which an operand multiplication and a finite field reduction are formulated as a serial-serial computation is also disclosed.
    Type: Application
    Filed: May 27, 2004
    Publication date: December 1, 2005
    Inventors: Abdulaziz Al-Khoraidly, Mohammad Ibrahim
  • Publication number: 20050195973
    Abstract: Given a set of elliptic curve points defined over a field F(p) and represented in projective coordinate, a method is presented which allows the embedding of data bits in both the X-coordinate and the Z-coordinate of the elliptic curve point when represented in projective coordinate. This makes the number of points that satisfy an elliptic curve equation and which can be used in the corresponding cryptosystem proportional to p2 rather than p. This can be used to either increase security by making the bit positions where data bits are embedded known only to the sender and receiver. Alternatively, it can be used to increase the number of data bits that can be encrypted per single elliptic curve point encryption. In another alternative, it can also be used to reduce p. Also, it can be used as a countermeasure by randomizing the bit positions where data bits are embedded. A similar formulation can be developed for elliptic curves over fields F(2m), as well as special elliptic curves such as Montgomery curves.
    Type: Application
    Filed: March 3, 2004
    Publication date: September 8, 2005
    Inventor: Mohammad Ibrahim