Qualcomm Incorporated

Lu Xiao

Gregory Gordon Rose

David Jonathan Julian

Avneesh Agrawal

Chong U Lee

Alexander Gantman

Kamran Moallemi

Manuel Eduardo Jaime

Robert Keith Douglas

Zhanfeng Jia

Satyajit Prabhakar Patne

Rajarshi Gupta

Philip Michael Hawkes

Yong Jin Kim

Bijan Ansari

Michaela Catalina Vanderveen

Edward Harrison Teague

Vidya Narayanan

Ranjith Subramanian Jayaram

Ramachandran Subramanian

Lakshminath Reddy Dondeti

Olivier Jean Benoit

Rosario Cammarota

Brian Michael Buesker

Edward Thomas Lingham Hardie

David Merrill Jacobson

Vito Remo Bica

Justin Yongjin Kim

Michael J T Chan

Saurabh Sabnis

Yin Ling Liong

Manish Mohan

Jing Deng

Steve Millendorf

Tolga Yalcinkaya

David Figueroa

Vito R Bica

Satyajit Patne

A method of implementing security in a modular exponentiation function for cryptographic operations is provided. A key is obtained as a parameter when the modular exponentiation function is invoked. The key may be one of either a public key or a private key of a cryptographic key pair. Within the modular exponentiation function, the method ascertains whether the key is greater than L bits long, where L is a positive integer. A countermeasure against an attack is implemented if the key is greater than L bits long. The countermeasure may include one or more techniques (e.g., hardware and/or software techniques) that inhibit or prevent information about the key from being ascertained through analysis. One or more exponentiation operations may then be performed using the key. The same modular exponentiation function may be used to perform encryption and decryption operations but with different keys.

Modular exponentiation with transparent side channel attack countermeasures

Systems and methods for providing accelerated passphrase verification are disclosed. In one embodiment, a method includes receiving a full security string, generating a full security string hash code, storing the full security string hash code in a memory, determining at least one substring based on an entropy value associated with one or more leading characters in the full security string, generating at least one substring hash code and at least one corresponding character count value, such that the corresponding character count value equals a number of characters in the at least one substring, and storing the at least one substring hash code and the at least one corresponding character count value in the memory.

Accelerated passphrase verification

Techniques for mitigating the transitive data problem using a secure asset manager are provided. These techniques include generating a secure asset manager compliant application by tagging source code for the application with a data tag to indicate that a data element associated with the source code is a sensitive data element, accessing a policy file comprising transitive rules associated with the sensitive data element, and generating one or more object files for the application from the source code. These techniques also include storing a sensitive data element in a secure memory region managed by a secure asset manager, and managing the sensitive data element according to a policy associated with the sensitive data element by an application from which the sensitive data element originates, the policy defining transitive rules associated with the sensitive data element.

Techniques for data monitoring to mitigate transitive problem in object-oriented contexts

One feature pertains to a method for generating a prime number by repeatedly generating a random number seed S having k bits, generating a random number R having n bits based on the seed S, where k is less than n, and determining whether the random number R is prime. The steps are repeated until it is determined that the random number R generated is prime, upon which the random number seed S used to generate the random number R is stored in a memory circuit. Later, the stored random number seed S may be retrieved from the memory circuit, and the prime number is regenerated based on the random number seed S. In one example, the random number R generated is further based on a secret key kthat may be stored in a secure memory circuit.

Methods and apparatuses for prime number generation and storage

A computing device may use machine learning techniques to determine whether a side channel attack is underway and perform obfuscation operations (e.g., operations to raise the noise floor) or other similar operations to stop or prevent a detected side channel attack. The computing device may determine that a side channel attack is underway in response to determining that the computing device is in airplane mode, that the battery of the computing device the battery has been replaced with a stable DC power supply, that the touch-screen display of the computing device has been disconnected, that there are continuous calls to a cipher application programming interface (API) using the same cipher key, that there has been tampering with a behavioral analysis engine of the computing device, or any combination thereof.

Methods and systems for side channel analysis detection and protection

One feature provides a method for a client node to establish a session key with a group node by obtaining an epoch identity value associated with a current epoch, wherein obtaining the epoch identity value includes one of computing the epoch identity value based on a node real time or negotiating the epoch identity value with the group node, computing a restricted key using a shared secret key, the epoch identity value, and a group node identity associated with the group node, and executing a session key establishment protocol with the group node to derive the session key using the restricted key as a master key in the session key establishment protocol. The session key may be established between the group node and the client node even though communications between the group node and the central node is only intermittently available during the current epoch.

Method and apparatus for virtual pairing with a group of semi-connected devices

Various operations may be performed based on a distance-related function associated with two or more devices. For example, an association procedure for two or more devices may be based on one or more determined distances. Similarly, presence management may be based on one or more determined distances. A distance-related function may take various form including, for example, a distance between devices, two or more distances between devices, a rate of change in a relative distance between devices, relative acceleration between devices, or some combination of two or more of the these distance-related functions.

System and method for enabling operations based on distance to and motion of remote device

A computing device may use machine learning techniques to determine the level, degree, and severity of its vulnerability to side channel attacks. The computing device may intelligently and selectively perform obfuscation operations (e.g., operations to raise the noise floor) to prevent side channel attacks based on the determined level, degree, or severity of its current vulnerability to such attacks. The computing device may also monitor the current level of natural obfuscation produced by the device, determining whether there is sufficient natural obfuscation to prevent a side channel attack during an ongoing critical activity, and perform the obfuscation operation during the ongoing critical activity and in response to determining that there is not sufficient natural obfuscation to adequately protect the computing device against side channel attacks.

Methods and systems for thwarting side channel attacks

System and method of associating devices based on actuation of input devices and signal strength

A multi-party commitment method is provided whereby a joining node uses contributions provided by contributor nodes in a peer-to-peer overlay network to generate a node identifier. The joining node generates a first contribution and sends a join request to an introducer node (or a plurality of contributor nodes), where the join request seeks to obtain one or more contributions for generating the node identifier within an identifier space of the overlay network. A hash of the first contribution may be included as part of the join request. In response, the joining node may receive a plurality of contributions, wherein the contributions are bound to each other and the first contribution by a prior external multi-node commitment operation. The joining node can then generate its node identifier as a function of the first contribution and the received contributions. Consequently, collusion between nodes and malicious manipulation during ID generation can be frustrated.

Secure node identifier assignment in a distributed hash table for peer-to-peer networks

A block cipher is provided that secures data by encrypting it based on the memory address where it is to be stored. When encrypting data for storage in the memory address, the memory address is encrypted in a first plurality of block cipher rounds. Data round keys are generated using information from the first plurality of block cipher rounds. Data to be stored is combined with the encrypted memory address and encrypted in a second plurality of block cipher rounds using the data round keys. The encrypted data is then stored in the memory location. When decrypting data, the memory address is again encrypted as before while the encrypted stored data is decrypted in a second plurality of the block cipher rounds using the data round keys to obtain a partially decrypted data. The partially decrypted data is combined with the encrypted memory address to obtain fully decrypted data.

Low latency block cipher

Distance-based presence management

One feature pertains to a method that reduces the computational delay associated with generating prime numbers. The method includes generating a first random number having a plurality of bits. A first primality test is then executed on the first random number. Then, it is determined whether the first random number generated fails or passes the first primality test. If the first random number fails the primality test then a portion but not all of the plurality of bits of the first random number are replaced with an equal number of randomly generated bits to generate a second random number. Next, a primality test is again executed on the second random number. This process is repeated until a prime number is detected.

Methods and devices for prime number generation

Disclosed is a method for visual verification a Captcha's source. In the method, a Captcha is served to a user. The Captcha includes visual information related to a characteristic of a source of the Captcha and related to a puzzle question of the Captcha. The visual information is for visual verification by the user of the Captcha's source. A response is received from the user based on the served Captcha. A determination is made as to whether the received response is a solution of the puzzle question of the served Captcha.

Method and apparatus using a CAPTCHA having visual information related to the CAPTCHA's source

Disclosed is a method for address privacy protection for a first wireless device sharing a privacy key with a second wireless device. In the method, a first resolution tag is generated at the first wireless device using a pseudo-random function with the seed value and the privacy key as input arguments. The privacy key is only known to the first and second wireless devices. A privacy address is generated for the first wireless device based on the seed value and the first resolution tag. A packet is transmitted from the first wireless device to the second wireless device. The packet includes the privacy address and the first resolution tag.

Apparatus and method for address privacy protection in receiver oriented channels

Growing community of inventors

San Diego, CA, United States of America

Lu Xiao