Patents by Inventor Aaron Sanjaya Benedek

Aaron Sanjaya Benedek 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: 20230394981
    Abstract: An object of the present disclosure is to provide a flight management apparatus capable of improving the safety of flying objects. In one example, a flight management apparatus (10) of the present disclosure includes a determination unit (12) configured to determine whether a specific space cell in a space is already reserved based on a reservation state about the specific space cell, when the flight management apparatus receives a request for permission to move to the specific space cell from a flying object; and a permission unit (13) configured to permit the movement to the specific space cell of the flying object when the determination unit determines the specific space cell is not reserved, and not to permit the movement to the specific space cell of the flying object when the determination unit determines the specific space cell is already reserved.
    Type: Application
    Filed: October 27, 2021
    Publication date: December 7, 2023
    Inventor: Aaron Sanjaya BENEDEK
  • Publication number: 20190095187
    Abstract: A limited memory system uses statically linked code from different entities, with each entity having a fixed code space. Entry points for each code space are located at a fixed external address and referenced to a jump address inside each code space. Dummy code containing relevant entry point addresses is used to simulate the code of other entities for compilation and linking. Each entity is able to update its own code without the need for source code from the other entities that would typically be required in traditional statically-linked code.
    Type: Application
    Filed: September 28, 2017
    Publication date: March 28, 2019
    Inventors: Aaron Sanjaya Benedek, Samir Kumar Mishra
  • Publication number: 20180069841
    Abstract: A method at a terminal in a multiple-node digital communications network, comprising any one or more of: generating at least one symmetric first key(s), across all participating nodes in the multiple-node digital communications network and securely distributing the at least one first key(s) in encrypted form to multiple participating nodes of the multiple-node digital communications network, using at least one asymmetrically established second key(s), the participating nodes including at least one message-transmitting node(s) and at least one message-receiving node(s); generating at least one symmetric third key(s) for one or more communication session that includes one or more communications from the at least one message-transmitting node(s) to the message-receiving node(s); encrypting at least one payload message using the at least one third key(s) at the at least one message-transmitting node(s), sending the encrypted at least one payload message, and receiving the encrypted at least one payload message at
    Type: Application
    Filed: September 4, 2017
    Publication date: March 8, 2018
    Inventor: Aaron Sanjaya Benedek
  • Patent number: 9756024
    Abstract: A method at a terminal in a multiple-node digital communications network, comprising any one or more of: generating at least one symmetric first key(s), across all participating nodes in the multiple-node digital communications network and securely distributing the at least one first key(s) in encrypted form to multiple participating nodes of the multiple-node digital communications network, using at least one asymmetrically established second key(s), the participating nodes including at least one message-transmitting node(s) and at least one message-receiving node(s); generating at least one symmetric third key(s) for one or more communication session that includes one or more communications from the at least one message-transmitting node(s) to the message-receiving node(s); encrypting at least one payload message using the at least one third key(s) at the at least one message-transmitting node(s), sending the encrypted at least one payload message, and receiving the encrypted at least one payload message at
    Type: Grant
    Filed: September 16, 2016
    Date of Patent: September 5, 2017
    Assignee: Trillium Incorporated
    Inventor: Aaron Sanjaya Benedek
  • Publication number: 20170085537
    Abstract: A method at a terminal in a multiple-node digital communications network, comprising any one or more of: generating at least one symmetric first key(s), across all participating nodes in the multiple-node digital communications network and securely distributing the at least one first key(s) in encrypted form to multiple participating nodes of the multiple-node digital communications network, using at least one asymmetrically established second key(s), the participating nodes including at least one message-transmitting node(s) and at least one message-receiving node(s); generating at least one symmetric third key(s) for one or more communication session that includes one or more communications from the at least one message-transmitting node(s) to the message-receiving node(s); encrypting at least one payload message using the at least one third key(s) at the at least one message-transmitting node(s), sending the encrypted at least one payload message, and receiving the encrypted at least one payload message at
    Type: Application
    Filed: September 16, 2016
    Publication date: March 23, 2017
    Inventor: Aaron Sanjaya Benedek