Patents by Inventor Jeyavijayan Rajendran

Jeyavijayan Rajendran 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: 10990580
    Abstract: An exemplary system, method and computer-accessible medium for modifying a design of an integrated circuit(s) (ICs), which can include, for example, modifying a logic gate(s) in the design for a protected input pattern(s), and providing a restoration unit(s) into the design, where the restoration unit(s) can be configured to (i) produce an error-free output(s) when a correct secret key can be applied to the restoration unit(s), and (ii) produce an erroneous output(s) when an incorrect key can be applied to the restoration unit(s); and ensure that the modified design along with the restoration unit produces at least one erroneous output with respect to the original design for only a pre-determined constant number of incorrect keys based on at least one input pattern.
    Type: Grant
    Filed: October 25, 2018
    Date of Patent: April 27, 2021
    Assignees: NEW YORK UNIVERSITY, BOARD OF REGENTS, THE UNIVERSITY OF TEXAS SYSTEM
    Inventors: Ozgur Sinanoglu, Jeyavijayan Rajendran, Muhammad Yasin
  • Patent number: 10867937
    Abstract: Disclosed are various embodiments to enhance the security of a circuit design after a global routing of the circuit design and an assignment of wire layers for the circuit design. A tree can be extracted from the circuit design. The tree can include multiple gates and location information for the gates. The tree can be perturbed by moving one or more locations of one or more gates.
    Type: Grant
    Filed: May 23, 2018
    Date of Patent: December 15, 2020
    Assignee: Board of Regents, The University of Texas System
    Inventors: Jeyavijayan Rajendran, Jiang Hu, Yujie Wang, Pu Chen
  • Patent number: 10642947
    Abstract: Exemplary embodiments of the present disclosure can include an exemplary system, method and computer-accessible medium for camouflaging a design of an integrated circuit(s) (IC), can include, for example, receiving information related to a plurality of input combinations to the ICs, and camouflaging the design of the ICs by limiting a discriminating ability of the input combination to a predetermined constant number of incorrect assignments. An incorrect output can be intentionally produced for a predetermined constant number of secret minterms of the ICs. An output of the ICs can be restored for the secret minterms using a CamoFix block. The CamoFix block can include a CamoInputMapping block(s), a CamoSecGen block(s) or a comparator block(s).
    Type: Grant
    Filed: September 6, 2017
    Date of Patent: May 5, 2020
    Assignee: New York University
    Inventors: Ozgur Sinanoglu, Jeyavijayan Rajendran, Muhammad Yasin
  • Patent number: 10614187
    Abstract: An exemplary system, method and computer-accessible medium can be provided which can include, for example, generating a super control dataflow graph(s) (CDFG) by applying a plurality of electronic system level ESL design constraints associated with an integrated circuit, determining an upper bound(s) number and a lower bound(s) number based on a number of CDFGs in the super CDFG(s)—with each number being one metric of a capability of the integrated circuit to resist reverse engineering attack—, and inserting a component(s) into a register transfer level netlist to effectuate a modification of the upper bound(s) and the lower bound(s).
    Type: Grant
    Filed: April 15, 2016
    Date of Patent: April 7, 2020
    Assignee: New York University
    Inventors: Jeyavijayan Rajendran, Ramesh Karri, Ozgur Sinanoglu
  • Publication number: 20190340394
    Abstract: Exemplary embodiment of the present disclosure can include, for example, a logic-locking circuit (“SARLock”), which can include a logic cone(s) receiving a distinguishing input pattern(s) (DIP), a comparator(s) receiving the DIP(s) and a key value(s), and a logic gate(s) connected to an output of the logic cone and to an output of the comparator. A mask(s) can be connected to the comparator(s) and the logic gate(s). The logic gate(s) can be a XOR gate(s). The comparator(s) can be configured to flip a signal(s) based on a combination of the DIP(s) and the key value(s). A mask(s) can be connected to the comparator(s) and the logic gate(s), which can be configured to prevent the flipped signal(s) from being asserted for a correct key value(s).
    Type: Application
    Filed: March 20, 2017
    Publication date: November 7, 2019
    Inventors: OZGUR SINANOGLU, MUHAMMAD YASIN, JEYAVIJAYAN RAJENDRAN
  • Patent number: 10423749
    Abstract: Exemplary systems, methods and computer-accessible mediums can secure split manufacturing of an integrated circuit by modifying a previous location of at least one pin to a further location of the at least one pin based on a fault analysis procedure. A determination of the further location can include an iterative procedure that can be a greedy iterative procedure. The modification of the location of the at least one partition pin can be performed by swapping at least one further partition pin with the at least one partition pin.
    Type: Grant
    Filed: March 14, 2014
    Date of Patent: September 24, 2019
    Assignee: New York University
    Inventors: Jeyavijayan Rajendran, Ozgur Sinanoglu, Ramesh Karri
  • Publication number: 20190129892
    Abstract: An exemplary system, method and computer-accessible medium for modifying a design of an integrated circuit(s) (ICs), which can include, for example, modifying a logic gate(s) in the design for a protected input pattern(s), and providing a restoration unit(s) into the design, where the restoration unit(s) can be configured to (i) produce an error-free output(s) when a correct secret key can be applied to the restoration unit(s), and (ii) produce an erroneous output(s) when an incorrect key can be applied to the restoration unit(s); and ensure that the modified design along with the restoration unit produces at least one erroneous output with respect to the original design for only a pre-determined constant number of incorrect keys based on at least one input pattern.
    Type: Application
    Filed: October 25, 2018
    Publication date: May 2, 2019
    Inventors: Ozgur Sinanoglu, Jeyavijayan Rajendran, Muhammad Yasin
  • Publication number: 20190108348
    Abstract: An exemplary system, method and computer-accessible medium for detecting the presence of a Trojan(s) in a circuit(s), can include, for example, receiving information related to a property(s) configured to determine the presence of the Trojan(s), and determining the presence of the Trojan(s) based on the property(s) and a design(s) of the circuit(s) using a bounded model checking tool.
    Type: Application
    Filed: September 24, 2018
    Publication date: April 11, 2019
    Inventors: VIVEKANANDA VEDULA, JEYAVIJAYAN RAJENDRAN, ARUNSHANKAR DHANDAYUTHAPANY, RAMESH KARRI
  • Patent number: 10153769
    Abstract: Exemplary systems, methods and computer-accessible mediums can encrypting a circuit by determining at least one location to insert at least one gate in the circuit using a fault analysis, and inserting the at least one gate in at least one section of the at least one location. The determination can include an iterative procedure that can be a greedy iterative procedure. The determination can be based on an effect of the particular location on a maximum number of outputs of the circuit.
    Type: Grant
    Filed: July 13, 2015
    Date of Patent: December 11, 2018
    Assignee: New York University
    Inventors: Ozgur Sinanoglu, Youngok Pino, Jeyavijayan Rajendran, Ramesh Karri
  • Publication number: 20180342468
    Abstract: Disclosed are various embodiments to enhance the security of a circuit design after a global routing of the circuit design and an assignment of wire layers for the circuit design. A tree can be extracted from the circuit design. The tree can include multiple gates and location information for the gates. The tree can be perturbed by moving one or more locations of one or more gates.
    Type: Application
    Filed: May 23, 2018
    Publication date: November 29, 2018
    Inventors: Jeyavijayan Rajendran, Jiang Hu, Yujie Wang, Pu Chen
  • Patent number: 10083303
    Abstract: An exemplary system, method and computer-accessible medium for detecting the presence of a Trojan(s) in a circuit(s), can include, for example, receiving information related to a property(s) configured to determine the presence of the Trojan(s), and determining the presence of the Trojan(s) based on the property(s) and a design(s) of the circuit(s) using a bounded model checking tool.
    Type: Grant
    Filed: December 3, 2015
    Date of Patent: September 25, 2018
    Assignee: New York University
    Inventors: Vivekananda Vedula, Jeyavijayan Rajendran, Arunshankar Dhandayuthapany, Ramesh Karri
  • Patent number: 10073728
    Abstract: Exemplary systems, methods and computer-accessible mediums can be provided that can, for example, determine a camouflaging location(s) of the logic gate(s) using a fault analysis procedure, and can camouflage the logic gate(s) at the location(s) based on the determination. The camouflaging procedure can be performed by replacing the logic gate(s) at the camouflaging location(s) with a further camouflaged gate, which can have a dummy contact(s) or a vias.
    Type: Grant
    Filed: September 10, 2014
    Date of Patent: September 11, 2018
    Assignee: New York University
    Inventors: Jeyavijayan Rajendran, Ozgur Sinanoglu, Ramesh Karri
  • Publication number: 20180232479
    Abstract: Exemplary embodiments of the present disclosure can include an exemplary system, method and computer-accessible medium for camouflaging a design of an integrated circuit(s) (IC), can include, for example, receiving information related to a plurality of input combinations to the ICs, and camouflaging the design of the ICs by limiting a discriminating ability of the input combination to a predetermined constant number of incorrect assignments. An incorrect output can be intentionally produced for a predetermined constant number of secret minterms of the ICs. An output of the ICs can be restored for the secret minterms using a CamoFix block. The CamoFix block can include a CamoInputMapping block(s), a CamoSecGen block(s) or a comparator block(s).
    Type: Application
    Filed: September 6, 2017
    Publication date: August 16, 2018
    Inventors: Ozgur Sinanoglu, Jeyavijayan Rajendran, Muhammad Yasin
  • Patent number: 9817980
    Abstract: Exemplary systems, methods and computer-accessible mediums for encrypting at least one integrated circuit (IC) can include determining, using an interference graph, at least one location for a proposed insertion of at least one gate in or at the at least one IC, and inserting the gate(s) into the IC(s) at the location(s). The interference graph can be constructed based at least in part on an effect of the location(s) on at least one further location of the IC(s).
    Type: Grant
    Filed: March 14, 2014
    Date of Patent: November 14, 2017
    Assignee: New York University
    Inventors: Jeyavijayan Rajendran, Youngok Pino, Ozgur Sinanoglu, Ramesh Karri
  • Publication number: 20160306902
    Abstract: An exemplary system, method and computer-accessible medium can be provided which can include, for example, generating a super control dataflow graph(s) (CDFG) by applying a plurality of electronic system level ESL design constraints associated with an integrated circuit, determining an upper bound(s) number and a lower bound(s) number based on a number of CDFGs in the super CDFG(s)—with each number being one metric of a capability of the integrated circuit to resist reverse engineering attack—, and inserting a component(s) into a register transfer level netlist to effectuate a modification of the upper bound(s) and the lower bound(s).
    Type: Application
    Filed: April 15, 2016
    Publication date: October 20, 2016
    Inventors: Jeyavijayan Rajendran, Ramesh Karri, Ozgur Sinanoglu
  • Publication number: 20160224407
    Abstract: Exemplary systems, methods and computer-accessible mediums can be provided that can, for example, determine a camouflaging location(s) of the logic gate(s) using a fault analysis procedure, and can camouflage the logic gate(s) at the location(s) based on the determination. The camouflaging procedure can be performed by replacing the logic gate(s) at the camouflaging location(s) with a further camouflaged gate, which can have a dummy contact(s) or a vias.
    Type: Application
    Filed: September 10, 2014
    Publication date: August 4, 2016
    Inventors: Jeyavijayan RAJENDRAN, Ozgur Sinanoglu, Ramesh Karri
  • Publication number: 20160098565
    Abstract: An exemplary system, method and computer-accessible medium for detecting the presence of a Trojan(s) in a circuit(s), can include, for example, receiving information related to a property(s) configured to determine the presence of the Trojan(s), and determining the presence of the Trojan(s) based on the property(s) and a design(s) of the circuit(s) using a bounded model checking tool.
    Type: Application
    Filed: December 3, 2015
    Publication date: April 7, 2016
    Inventors: VIVEKANANDA VEDULA, JEYAVIJAYAN RAJENDRAN, ARUNSHANKAR DHANDAYUTHAPANY, RAMESH KARRI
  • Publication number: 20160098558
    Abstract: An exemplary system, method and computer-accessible medium for detecting the presence of a Trojan(s) in a circuit(s), can include, for example, receiving information related to a property(s) configured to determine the presence of the Trojan(s), and determining the presence of the Trojan(s) based on the property(s) and a design(s) of the circuit(s) using a bounded model checking tool.
    Type: Application
    Filed: October 5, 2015
    Publication date: April 7, 2016
    Inventors: VIVEKANANDA VEDULA, JEYAVIJAYAN RAJENDRAN, ARUNSHANKAR DHANDAYUTHAPANY, RAMESH KARRI
  • Publication number: 20160049935
    Abstract: Exemplary systems, methods and computer-accessible mediums can encrypting a circuit by determining at least one location to insert at least one gate in the circuit using a fault analysis, and inserting the at least one gate in at least one section of the at least one location. The determination can include an iterative procedure that can be a greedy iterative procedure. The determination can be based on an effect of the particular location on a maximum number of outputs of the circuit.
    Type: Application
    Filed: July 13, 2015
    Publication date: February 18, 2016
    Inventors: OZGUR SINANOGLU, YOUNGOK PINO, JEYAVIJAYAN RAJENDRAN, RAMESH KARRI
  • Publication number: 20160034694
    Abstract: Exemplary systems, methods and computer-accessible mediums for encrypting at least one integrated circuit (IC) can include determining, using an interference graph, at least one location for a proposed insertion of at least one gate in or at the at least one IC, and inserting the gate(s) into the IC(s) at the location(s). The interference graph can be constructed based at least in part on an effect of the location(s) on at least one further location of the IC(s).
    Type: Application
    Filed: March 14, 2014
    Publication date: February 4, 2016
    Inventors: JEYAVIJAYAN RAJENDRAN, YOUNGOK PINO, OZGUR SINANOGLU, RAMESH KARRI