Patents by Inventor Sanu Mathew

Sanu Mathew 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: 20180089642
    Abstract: A Bitcoin mining hardware accelerator is described. A System on Chip implementing a Bitcoin mining hardware accelerator may include a processor core and a hardware accelerator coupled to the processor core, the hardware accelerator to mine digital currency. The hardware accelerator may include a first computational block, including a message digest datapath, wherein the first computational block is to: precompute a first summation of a 32-bit message (Wi), a 32-bit round constant (Ki), and a content of a first shifted state register (Gi?1), and store a result of the first summation in a state register (Hi). The Bitcoin mining hardware accelerator may further include a second computational block comprising a message scheduler datapath.
    Type: Application
    Filed: September 23, 2016
    Publication date: March 29, 2018
    Inventors: Vikram SURESH, Sudhir SATPATHY, Sanu MATHEW
  • Publication number: 20180062829
    Abstract: A hybrid AES-SMS4 hardware accelerator is described. A System on Chip implementing a hybrid AES-SMS4 hardware accelerator may include a processor core and a single hardware accelerator coupled to the processor core, the single hardware accelerator to encrypt or decrypt data. The single hardware accelerator may include a first block cipher to encrypt or decrypt the data according to a first encryption algorithm and a second block cipher to encrypt or decrypt the data according to a second encryption algorithm. The accelerator may further include a combined substitution box (Sbox) coupled to the first block cipher and the second block cipher, the combined Sbox comprising logic to perform Galois Field (GF) multiplications and inverse computations, wherein the inverse computations are common to the first block cipher and the second block cipher.
    Type: Application
    Filed: August 31, 2016
    Publication date: March 1, 2018
    Inventors: Vikram SURESH, Sudhir SATPATHY, Sanu MATHEW
  • Publication number: 20170373839
    Abstract: Encryption of a BIOS using a programmable logic device (PLD) is described. A PLD may include a static random-access memory area including programmable logic in a Lookup Table to receive a request to authenticate a basic input/output system (BIOS) executing on a processor coupled to the PLD. The PLD may calculate a hash value of a message associated with the BIOS using a Secure Hash Algorithm (SHA). The PLD may also include a random-access memory area including a first embedded random access memory block (EBR) to store a first portion of a 256-bit message digest associated with the message, a fifth portion of the 256-bit message digest, and second, third, fourth, sixth, seventh, and eighth EBRs to store second, third, fourth, sixth, seventh, and eighth portions of the 256-bit message digest, respectively.
    Type: Application
    Filed: June 24, 2016
    Publication date: December 28, 2017
    Inventors: Vikram SURESH, Sudhir SATPATHY, Sanu MATHEW, Neeraj UPASANI
  • Patent number: 9852540
    Abstract: Disclosed is an apparatus and method for generating a lighting value based on a number of lighting factors. A lighting accelerator first converts an ambient portion, a diffuse light portion, and a specular light portion of the lighting factors into the log domain. Then, data combination units operate on the lighting factors after they have been converted. Then, the lighting factors are converted back from the log domain using anti-log processing. Converting the lighting factors into the log domain is accomplished by using a series of linear equations using coefficients that are all based on powers of two, and are therefore easily calculable. Further, while in the log domain, the specular light portion of the lighting factor is operated on by a special purpose multiplier that uses a truncated partial product tree, saving area and power with only a negligible amount of error.
    Type: Grant
    Filed: December 31, 2011
    Date of Patent: December 26, 2017
    Assignee: Intel Corporation
    Inventors: Farhana Sheikh, Sanu Mathew, Ram Krishnamurthy
  • Patent number: 9843441
    Abstract: Embodiments of an invention for a compact, low power Advanced Encryption Standard circuit are disclosed. In one embodiment, an apparatus includes an encryption unit having a substitution box and an accumulator. The substitution box is to perform a substitution operation on one byte per clock cycle. The accumulator is to accumulate four bytes and perform a mix-column operation in four clock cycles. The encryption unit is implemented using optimum Galois Field polynomial arithmetic for minimum area.
    Type: Grant
    Filed: September 24, 2013
    Date of Patent: December 12, 2017
    Assignee: Intel Corporation
    Inventors: Sanu Mathew, Vikram Suresh, Sudhir Satpathy, Mark Anders, Himanshu Kaul, Ram Krishnamurthy
  • Patent number: 9699096
    Abstract: Disclosed herein is a router configured for priority-based routing. The router is configured to receive a plurality of packets, wherein each packet is assigned a priority value. The router includes an output circuit configured to select the packet with the highest priority value. The output circuit is configured to forward the priority value of the selected packet to a second router. The output circuit is configured to transfer the selected packet to the second router when the link between the first router and the second router is available.
    Type: Grant
    Filed: December 26, 2013
    Date of Patent: July 4, 2017
    Assignee: Intel Corporation
    Inventors: Sudhir Satpathy, Himanshu Kaul, Mark Anders, Sanu Mathew, Gregory Chen, Ram Krishnamurthy
  • Patent number: 9503256
    Abstract: Embodiments of an invention for SMS4 acceleration hardware are disclosed. In an embodiment, an apparatus includes SMS4 hardware and key transformation hardware. The SMS4 hardware is to execute a round of encryption and a round of key expansion. The key transformation hardware is to transform a key to provide for the SMS4 hardware to execute a round of decryption.
    Type: Grant
    Filed: December 24, 2014
    Date of Patent: November 22, 2016
    Assignee: Intel Corporation
    Inventors: Kirk Yap, Gilbert Wolrich, Sudhir Satpathy, Sean Gulley, Vinodh Gopal, Sanu Mathew, Wajdi Feghali
  • Publication number: 20160191238
    Abstract: Embodiments of an invention for SMS4 acceleration hardware are disclosed. In an embodiment, an apparatus includes SMS4 hardware and key transformation hardware. The SMS4 hardware is to execute a round of encryption and a round of key expansion. The key transformation hardware is to transform a key to provide for the SMS4 hardware to execute a round of decryption.
    Type: Application
    Filed: December 24, 2014
    Publication date: June 30, 2016
    Inventors: Kirk YAP, Gilbert Wolrich, Sudhir Satpathy, Sean Gulley, Vinodh Gopal, Sanu Mathew, Wajdi Feghali
  • Publication number: 20150188829
    Abstract: Disclosed herein is a router configured for priority-based routing. The router is configured to receive a plurality of packets, wherein each packet is assigned a priority value. The router includes an output circuit configured to select the packet with the highest priority value. The output circuit is configured to forward the priority value of the selected packet to a second router. The output circuit is configured to transfer the selected packet to the second router when the link between the first router and the second router is available.
    Type: Application
    Filed: December 26, 2013
    Publication date: July 2, 2015
    Inventors: Sudhir Satpathy, Himanshu Kaul, Mark Anders, Sanu Mathew, Gregory Chen, Ram Krishnamurthy
  • Publication number: 20150086007
    Abstract: Embodiments of an invention for a compact, low power Advanced Encryption Standard circuit are disclosed. In one embodiment, an apparatus includes an encryption unit having a substitution box and an accumulator. The substitution box is to perform a substitution operation on one byte per clock cycle. The accumulator is to accumulate four bytes and perform a mix-column operation in four clock cycles. The encryption unit is implemented using optimum Galois Field polynomial arithmetic for minimum area.
    Type: Application
    Filed: September 24, 2013
    Publication date: March 26, 2015
    Inventors: Sanu MATHEW, Vikram Suresh, Sudhir Satpathy, Mark Anders, Himanshu Kaul, Ram Krishnamurthy
  • Publication number: 20140028677
    Abstract: Disclosed is an apparatus and method for generating a lighting value based on a number of lighting factors. A lighting accelerator first converts an ambient portion, a diffuse light portion, and a specular light portion of the lighting factors into the log domain. Then, data combination units operate on the lighting factors after they have been converted. Then, the lighting factors are converted back from the log domain using anti-log processing. Converting the lighting factors into the log domain is accomplished by using a series of linear equations using coefficients that are all based on powers of two, and are therefore easily calculable. Further, while in the log domain, the specular light portion of the lighting factor is operated on by a special purpose multiplier that uses a truncated partial product tree, saving area and power with only a negligible amount of error.
    Type: Application
    Filed: December 31, 2011
    Publication date: January 30, 2014
    Applicant: Intel Corporation
    Inventors: Farhana Sheikh, Sanu Mathew, Ram Krishnamurthy
  • Patent number: 8265135
    Abstract: In one embodiment, the invention includes a method for compressing video data using redundant binary mathematics. Other embodiments are described and claimed.
    Type: Grant
    Filed: January 29, 2007
    Date of Patent: September 11, 2012
    Assignee: Intel Corporation
    Inventors: Mark Anders, Himanshu Kaul, Sanu Mathew, Steven Hsu, Amit Agarwal, Ram Krishnamurthy
  • Patent number: 8078662
    Abstract: For one disclosed embodiment, an apparatus comprises first circuitry to output encoded data from an addressable location based at least in part on an address corresponding to a first number, wherein the encoded data is based at least in part on data that corresponds to the first number and that is encoded for partial product reduction, and second circuitry to generate a product based at least in part on the encoded data and on data corresponding to a second number. Other embodiments are also disclosed.
    Type: Grant
    Filed: September 29, 2006
    Date of Patent: December 13, 2011
    Assignee: Intel Corporation
    Inventors: Sanu Mathew, Vishak Venkatraman, Steven K. Hsu, Ram Krishnamurthy
  • Patent number: 7860240
    Abstract: A system comprises reception of input data of a Galois field GF(2k), mapping of the input data to a composite Galois field GF(2nm), where k=nm, inputting of the mapped input data to an Advanced Encryption Standard round function, performance of two or more iterations of the Advanced Encryption Standard round function in the composite Galois field GF(2nm), reception of output data of a last of the two or more iterations of the Advanced Encryption Standard round function, and mapping of the output data to the Galois field GF(2k).
    Type: Grant
    Filed: June 29, 2007
    Date of Patent: December 28, 2010
    Assignee: Intel Corporation
    Inventors: Sanu Mathew, Farhana Sheikh, Ram Krishnamurthy
  • Patent number: 7693926
    Abstract: A system to process multiplier X and multiplicand Y may include multiplication of a least-significant bit of X and a least-significant w bits of Y to generate a least-significant w bits of product Z. The system may further include determination of whether a least-significant bit of product Z is 1, addition of a least-significant w bits of modulus M to the least-significant w bits of product Z if the least-significant bit of product Z is 1, multiplication of the least-significant bit of X and bits 2w-1:w of Y to generate bits 2w-1:w of product Z, and addition of bits 2w-1:w of modulus M to bits 2w-1:w of product Z if the least-significant bit of product Z is 1.
    Type: Grant
    Filed: March 30, 2006
    Date of Patent: April 6, 2010
    Assignee: Intel Corporation
    Inventors: Sanu Mathew, Ram Krishnamurthy, Zheng Guo
  • Patent number: 7519646
    Abstract: A system may include M N-bit×N-bit multipliers to output M 2N-bit products in a redundant format, a compressor to receive the M 2N-bit products and to generate an MN-bit product in a redundant format based on the M 2N-bit products, and an adder block to receive the M 2N-bit products and the MN-bit product, to select one from the M 2N-bit products or the MN-bit product, and to resolve the selected one of the M 2N-bit products or the MN-bit product to a non-redundant format.
    Type: Grant
    Filed: October 26, 2006
    Date of Patent: April 14, 2009
    Assignee: Intel Corporation
    Inventors: Himanshu Kaul, Mark A. Anders, Sanu Mathew, Ram Krishnamurthy
  • Publication number: 20090003589
    Abstract: A system comprises reception of input data of a Galois field GF(2k), mapping of the input data to a composite Galois field GF(2nm), where k=nm, inputting of the mapped input data to an Advanced Encryption Standard round function, performance of two or more iterations of the Advanced Encryption Standard round function in the composite Galois field GF(2nm), reception of output data of a last of the two or more iterations of the Advanced Encryption Standard round function, and mapping of the output data to the Galois field GF(2k).
    Type: Application
    Filed: June 29, 2007
    Publication date: January 1, 2009
    Inventors: Sanu Mathew, Farhana Sheikh, Ram Krishnamurthy
  • Publication number: 20080181295
    Abstract: In one embodiment, the invention includes a method for compressing video data using redundant binary mathematics. Other embodiments are described and claimed.
    Type: Application
    Filed: January 29, 2007
    Publication date: July 31, 2008
    Inventors: Mark Anders, Himanshu Kaul, Sanu Mathew, Steven Hsu, Amit Agarwal, Ram Krishnamurthy
  • Publication number: 20080104164
    Abstract: A system may include M N-bit×N-bit multipliers to output M 2N-bit products in a redundant format, a compressor to receive the M 2N-bit products and to generate an MN-bit product in a redundant format based on the M 2N-bit products, and an adder block to receive the M 2N-bit products and the MN-bit product, to select one from the M 2N-bit products or the MN-bit product, and to resolve the selected one of the M 2N-bit products or the MN-bit product to a non-redundant format.
    Type: Application
    Filed: October 26, 2006
    Publication date: May 1, 2008
    Inventors: Himanshu Kaul, Mark A. Anders, Sanu Mathew, Ram Krishnamurthy
  • Publication number: 20080098278
    Abstract: For one disclosed embodiment, an apparatus comprises first circuitry to output encoded data from an addressable location based at least in part on an address corresponding to a first number, wherein the encoded data is based at least in part on data that corresponds to the first number and that is encoded for partial product reduction, and second circuitry to generate a product based at least in part on the encoded data and on data corresponding to a second number. Other embodiments are also disclosed.
    Type: Application
    Filed: September 29, 2006
    Publication date: April 24, 2008
    Inventors: Sanu Mathew, Vishak Venkatraman, Steven K. Hsu, Ram Krishnamurthy