Abstract: Generally described herein are methods and systems for enhanced tamper and malware resistant computer architectures. A system for enhanced tamper and malware resistance can include a harvardizer configured to receive comingled instructions and data and produce separated instructions and data. A data memory can be configured to receive the separated data. An instruction memory that is physically separate from the data memory can be configured to receive the separated instructions. The system can include one or more computer processors that can be configured to execute the separated instructions and data. The system can include one or more encryptors or decryptors to help thwart injection based attacks.

Abstract: Generally discussed herein are systems, apparatuses, or processes to recognize that a cyber threat exists or predict a future track of a cyber threat in a network. According to an example, a process for recognizing a cyber threat can include (1) determining a network layout of a network based on received network layout data, (2) receiving cyber sensor data indicating actions performed on the network, (3) calculating a first score associated with the cyber sensor data indicating that a cyber threat is present in the network by comparing a cyber threat profile of the cyber threat that details actions performed by the cyber threat to actions indicated by the cyber sensor data, (4) determining whether the calculated first score is greater than a specified threshold, or (5) determining that the cyber threat is present in response to determining the calculated first score is greater than the specified threshold.

Abstract: An encoder can convert a stream of data into three or four synchronized 4-PSK signals, for 64-QAM and 256-QAM, respectively. Three or four mixers can combine the three or four synchronized PSK signals with a common local oscillator signal to form three or four respective amplifiable signals, which can all have the same amplitude. One amplifier receives a first of the amplifiable signals and powers one radiator. Two amplifiers both receive a second of amplifiable signals and power two respective radiators. Four amplifiers receive a third of the amplifiable signals and power four respective radiators. The amplifiers can all operate in near or full saturation. Each radiator radiates in one of a plurality of discrete, specified states. The radiated states from the radiators combine through far-field electromagnetic propagation and effectively sum at the receiver to mimic transmission from a single amplifier.

Abstract: A method for data privacy in a distributed communication system including a plurality of client terminals merges encrypted streaming data using tree-like encryption key switching and without sharing any private keys in a distributed communication system. The merged data is then sent to client terminals to be further process by respective client terminals.

Abstract: A system comprising a plurality of nodes forming a network and a link-state packet capable of being transmitted by a source node in the network to a destination node in the network over a communication link; wherein the source node subtracts a transmission cost associated with the communication link from a time-to-live value associated with the link-state packet prior to transmitting the link-state packet to the destination node. Each node in the network may be configured to use a routing protocol, such as a no-sight routing protocol, to assign the transmission cost to the communication link.

Abstract: The invention relates to systems and methods of operating a wireless network including allocating and assigning frequency channels using a dynamic and distributed process. For example, a network node in an ad hoc wireless network will assign frequency channels to one or more of its transceivers based on at least one of a list of allowed frequency channels and a neighbor-frequency channel list.

Abstract: In a computer implemented method for data privacy in a distributed communication system, the method includes: storing a plurality of secret keys, each secret key for a respective one of a plurality of client terminals; identifying a mixer key; generating a plurality of key switch hints for the client terminals, each of the key switch hints generated for a respective client terminal of the client terminals, using the mixer key and a respective secret key for each respective client terminal; sending the key switch hints to a mixer; switching a first encrypted data stream received from a first client terminal of the client terminals to an encrypted output data stream using the key switch hints; and sending the encrypted output data stream to a receiving client terminal of the client terminals to be decrypted by the receiving client terminal.

Abstract: Method for data privacy in a distributed communication system includes: receiving first and second encrypted data from first and second client terminals, each having a different data representation; analyzing the first and second data representations to determine a common data representation; translating the first and second encrypted data to a shared data representation using the common data representation; performing operations on the first encrypted data and second encrypted data to generate a first and second operated encrypted data; reverting the first operated encrypted data back to said first data representation and sending the reverted first encrypted date to the first client terminal for decryption by the first client terminal; and reverting the second operated encrypted data back to said second data representation and sending the reverted second encrypted date to the second client terminal for decryption by the second client terminal.

Abstract: Embodiments for providing a next-time-interval routing parameter to a destination node are generally described herein. In some embodiments, a hopped routing parameter is calculated at a sending node using a static routing parameter of a destination node. The hopped routing parameter and source timing are encoded. The encoded hopped routing parameter and source timing are provided in the address fields of packets.

Abstract: A method for data privacy in a distributed communication system, in which a plurality of client terminals are arranged in a ring configuration merges encrypted streaming data using circular encryption key switching and without sharing any private keys in a distributed communication system. The merged data is then sent to client terminals to be further process by respective client terminals.

Abstract: A method for operating a user communication device (18a, 18b, 19a, 19b), and a program and user communication device that operate in accordance with that method. An interface (2d, 2b, 23, 22) of the communication device (18a, 18b, 19a, 19b) is operated to enter identifiers identifying respective calling sources (18a, 18b, 19a, 19b) from which call signals may be received. The interface also is operated for entering into the device (18a, 18b, 19a, 19b) electrical signals representing corresponding audible signals that are to be individually generated in response to calls being received from the respective calling sources (18a, 18b, 19a, 19b). The identifiers are stored in a memory (2c, 24) in association with respective ones of the electrical signals.

Abstract: A method for range finding of a target including: generating a first photon and a second photon identical to the first photon; transmitting the first photon towards the target and delaying the second photon by a time delay; receiving the first photon reflected from the target and the delayed second photon; interacting the reflected first photon and the delayed second photon to produce HOM interference; detecting photo-statistics at an output of the HOM interference; when the two photons are output at the same output port, repeating the above processes; when the reflected first single photon and the delayed second single photon are output at different output ports, changing the time delay and repeating the above processes; repeating the above processes for a number of times to arrive at a final estimate for a value of the time delay corresponding to the final estimate of the target range.

Abstract: Embodiments of a system and method for finding optimal routes for simultaneous transmissions over broadcast medium are generally described herein. In some embodiments, nodes are placed into a cost matrix representing a connected graph of nodes, virtual nodes are identified by applying matrix operations to the cost matrix and backtracking is performed incrementally to build candidates of virtual nodes for a solution set from the identified virtual nodes and to eliminate unsuitable candidates.

Abstract: This disclosure addresses systems and methods for the protection of proprietary information by monitoring operational watermarks of an apparatus. A monitoring device may receive logical or physical watermark data from a defended apparatus. Watermark data may include any operational or environmental variable related to the defended apparatus. The monitoring device may maintain a baseline profile for the defended apparatus that includes watermark data. During monitoring of the defended apparatus by the monitor device, changes in the watermark data may be analyzed to determine if the baseline should be dynamically updated, or if the change indicates an anomaly. Anomalies may indicate an attempt to tamper with the defended apparatus. In response to the change that indicates an anomaly, the monitoring device may scrub the contents of the defended apparatus. In an embodiment, the monitoring device may also scrub its own memory in response to an anomaly.

Abstract: A system facilitates the visualization of a network having multiple nodes. The system collects information from at least one of the nodes. The information describes network operation over a period of time. The system then reconstructs the network operation for the time period from the collected information and presents the reconstructed network operation to an operator.

Abstract: Embodiments of an inspection system and method for a collection of information objects, for example, a collection of executable software applications may be inspected for computer viruses, or a collection of genomes may be inspected for common or unique gene sequences. Information objects may contain identified sequences of instructions, each of which may be labeled with a symbol. In the software context, programming languages may include symbols that indicate functionality. In some embodiments, an inspection of the statistical properties of the information objects and their included symbols may allow for the symbols (and thus instruction sequences) to be grouped into logical components. In some embodiments, objects that include individual logical components may be grouped together. These groupings and their dependencies may be used to determine the structure of each object by detailing its constituent components, how they relate or depend on one another, and how the information object may function.

Abstract: In one embodiment, a method of processing seismic data using a single triaxial geophone is disclosed, where the method comprises acts of calibrating the single triaxial geophone sensor to determine a position and an orientation relative to a surrounding environment, configuring the single triaxial geophone sensor to receive seismic data from the surrounding environment along three orthogonal axes, measuring, with the single triaxial geophone sensor, a plurality of time series of seismic data from the surrounding environment for the three orthogonal axes, storing, with a computer system coupled to the single triaxial geophone sensor, the time series of seismic data from the surrounding environment for the three orthogonal axes, and processing, with the computer system, the time series of seismic data to identify a plurality of seismic waves of different polarizations.

Abstract: A system, method and apparatus arranged for efficient usage of network resources. Embodiments include nodes linked together, and the links having differing costs, e.g., bandwidth, frequency, and/or monetary cost, or any combination of these. Embodiments may identify neighboring nodes as either next-hop-neighbors or non-next-hop-neighbors. Next-hop-neighbors lie on the shortest path to any node, while non-next-hop-neighbors are nodes linked directly to a node, but the link is more costly than an alternative multi-hop path to the same node. Accordingly, embodiments may suppress packets to the non-next-hop-neighbors.

Abstract: A modified protocol independent multicast (M-PIM) routing protocol is an improvement to protocol independent multicast (PIM) routing protocol. M-PIM is optimized for use with at least one low bandwidth multi-hop network. The improvement comprises at least one modification to PIM that facilitates the transport of multicast traffic in a multi-layer routing system.

Abstract: Systems and methods are disclosed for detecting covert DNS tunnels using n-grams. The majority of legitimate DNS requests originate from network content itself, for example, through hyperlinks in websites. So, comparing data from incoming network communications to a hostname included in a DNS request can give an indication on whether the DNS request is a legitimate request or associated with a covert DNS tunnel. This process can be made computationally efficient by extracting n-grams from incoming network content and storing the n-grams in an efficient data structure, such as a Bloom filter. The stored n-grams are compared with n-grams extracted from outgoing DNS requests. If n-grams from an outgoing DNS request are not found in the data structure, the domain associated with the DNS request is determined to be associated with a suspected covert DNS tunnel.