Abstract: Computer-implemented digital communication using cryptography is disclosed. The computer-implemented methods are used to perform digital communication for minting and transfer of digital commodities using short message service (SMS) messages. The cryptographic system disclosed generates graphical user interfaces and executes operations on a backend apparatus. When the backend apparatus receives the SMS messages, the backend apparatus retrieves the digital commodities and interacts with a storage apparatus to store the digital commodities, identified by a uniform resource locator (URL).
Type:
Application
Filed:
June 17, 2022
Publication date:
June 22, 2023
Inventors:
Lucas Henning, Addison David McKenzie, Yonathan Lapchik
Abstract: An obfuscation process is described for obfuscating a cryptographic parameter of cryptographic operations such as calculations used in elliptical curve cryptography and elliptical curve point multiplication. Such obfuscation processes may be used for obfuscating device characteristics that might otherwise disclose information about the cryptographic parameter, cryptographic operations or cryptographic operations more generally, such as information sometimes gleaned from side channel attacks and lattice attacks.
Abstract: Innovative Innovative techniques over the conventional random number generators and randomization procedures are disclosed. The improved techniques use irrational numbers over the pseudo-random numbers generated by LFSR and use irrational number generators involve floating-point operations over the conventional integer arithmetic and logic operations. These innovative techniques can be applied to various cryptography applications such as hashes, ciphers, and random number generators. Particularly, the cubic root and inverse cubic root are two suitable functions for use in this invention.
Abstract: Secure communications over an insecure channel is provided using symmetric key elliptic curve cryptography. More specifically, a shared secret key and/or data bit string is embedded in the X-coordinate and the Z-coordinate of an elliptic curve point defined in projective coordinates, wherein the embedding process is deterministic and non-iterative. In addition, the base point may be blinded by making the base point dependant on the shared secret key.
Type:
Grant
Filed:
March 7, 2008
Date of Patent:
June 14, 2011
Assignee:
King Fahd University of Petroleum & Minerals
Abstract: A method, integrated circuit chip, and computer program product for cryptographically processing an input value with Elliptic Curve Cryptography (ECC) using ECC scalar multiplication are provided. The ECC scalar multiplication is performed with the use of an enhanced acceleration table (EAT). The EAT uses multiple running totals, at least one of which has a multiplier above 2.
Type:
Grant
Filed:
December 8, 2009
Date of Patent:
April 23, 2013
Assignee:
EMC Corporation
Inventors:
David Paul Makepeace, Sean Parkinson, Mark Hibberd, Peter Alan Robinson
Abstract: A technique for obtaining a key for encryption/decryption/data recovery from an enterprise key management system. In one example embodiment, this is accomplished by connecting a client mobile device to a cryptography key management using a UID, a UDID, the names of one or more data files to encrypt, a password Pswd, and a KeyID to obtain the key for encryption/decryption/data recovery.
Type:
Grant
Filed:
August 5, 2005
Date of Patent:
June 28, 2011
Assignee:
Hewlett-Packard Development Company, L.P.
Abstract: Systems and methods may provide location-based security using multi-point cryptography. The method may include receiving, by a controller, an original message for secure delivery to a mobile terminal. The method may also include generating, by the controller, a plurality of messages to be delivered to the mobile terminal using geographic diversity. The method may further include sending, by the controller, the plurality of messages to geographically diverse transmitters for transmission to the mobile terminal.
Type:
Grant
Filed:
March 16, 2022
Date of Patent:
December 31, 2024
Assignee:
QATAR UNIVERSITY
Inventors:
Tamer Khattab, Mohammed Hafez, Abdullatif Shikfa, Huseyin Arslan
Abstract: Modulus reduction for cryptography is described. An example of an apparatus includes multiplier circuitry to perform integer multiplication; and modulus reduction circuitry to perform modulus reduction based on a prime modulus, wherein the modulus reduction circuitry is to receive a product value, the product value resulting from multiplying a first n-bit value by a second n-bit value to generate the product value and perform modulus reduction to reduce the product value to a result within the prime modulus; and wherein the modulus reduction circuitry is based on shift and add operations.
Abstract: This invention establishes means and protocols to secure data, using large undisclosed amounts of randomness, replacing the algorithmic complexity paradigm. Its security is credibly appraised through combinatorics calculus, and it transfers the security responsibility to the user who determines how much randomness to use. This Trans-Vernam cryptography is designed to intercept the Internet of Things where the ‘things’ operate on limited computing capacity and are fueled by fast draining batteries. Randomness in large amounts may be quickly and conveniently stored in the most basic IOT devices, keeping the network safe.
Abstract: A quantum cryptography system [100] may include a transmitter [110] configured to generate entangled first and second photons, modulate and detect the first photon, and transmit detection information and the second photon. The system [100] may also include a receiver [160] configured to modulate the second photon. The receiver [160] may also be configured to detect the second photon based on the detection information.
Type:
Grant
Filed:
June 16, 2003
Date of Patent:
July 10, 2007
Assignee:
BBN Technologies Corp.
Inventors:
Brig Barnum Elliott, John D. Schlafer, David Spencer Pearson
Abstract: A system and device including reconfigurable physical unclonable functions (‘RPUFs’) and threshold cryptography uses cryptographic and physical means of security. A plurality of reconfigurable physical unclonable functions (‘RPUFs’) and a memory are connected to a processor that is configured to derive information associating the RPUFs with cryptographic shares of a sensitive value, store such information in the memory, and reconfigure a RPUF upon powering up of the device such that information stored in the memory is not valid for the reconfigured RPUF.
Type:
Application
Filed:
June 6, 2017
Publication date:
December 6, 2018
Applicant:
Analog Devices, Inc.
Inventors:
John Ross Wallrabenstein, Thomas Joseph Brindisi
Abstract: NADO is a process for encrypting and decrypting information in a variety of cryptographic devices. The underlying process is a fast stream-like cipher that can be implemented efficiently in analog or digital hardware or in software. The NADO process makes use of three novel methods in cryptography: 1) A sequence of permutations which scrambles and spreads out the encrypted information; (2) A state generator built with a non-autonomous dynamical system to generate an unpredictable sequence of states; (3) One or more perturbators which perturb both the non-autonomous dynamical system and the sequence of permutations in a non-periodic way.
Abstract: An apparatus and method for implementing a secure quantum cryptography system using two non-orthogonal states. For each qubit, the to emitter station prepares a quantum system in one of two non-orthogonal quantum states in the time-basis to code bit values. Intra- and inter-qubit interference is then used to reveal eavesdropping attempts. Witness states are used to help reveal attacks performed across the quantum system separation.
Type:
Application
Filed:
September 1, 2005
Publication date:
November 27, 2008
Applicant:
ID QUANTIQUE S.A.
Inventors:
Nicolas Gisin, Grégoire Ribordy, Hugo Zbinden
Abstract: A method of performing finite field addition and doubling operations in an elliptic curve cryptography (ECC) authentication scheme as a countermeasure to side-channel attack. The addition and doubling operations are executed using atomic patterns that involve the same sequence and number of operation types, so that the noise consumption and electromagnetic emanation profile of circuitry performing the operations is identical regardless of operation. A subtraction operation using such an atomic pattern is also disclosed.
Abstract: A method of performing finite field addition and doubling operations in an elliptic curve cryptography (ECC) authentication scheme as a countermeasure to side-channel attack. The addition and doubling operations are executed using atomic patterns that involve the same sequence and number of operation types, so that the noise consumption and electromagnetic emanation profile of circuitry performing the operations is identical regardless of operation. A subtraction operation using such an atomic pattern is also disclosed.
Abstract: A method of performing finite field addition and doubling operations in an elliptic curve cryptography (ECC) authentication scheme as a countermeasure to side-channel attack. The addition and doubling operations are executed using atomic patterns that involve the same sequence and number of operation types, so that the noise consumption and electromagnetic emanation profile of circuitry performing the operations is identical regardless of operation. A subtraction operation using such an atomic pattern is also disclosed.
Abstract: A cover or components for cellphones or other digital devices featuring physical cryptography to forward and receive encrypted messages on a tamper-proof basis which uses physical encryption to send encrypted messages between two or more users, in which decoding of the forwarded message takes place by overlaying (30) on the cell phone device or digital device (1) a key image cover (20) matching the forwarded matrix image (10).
Abstract: An apparatus and method for implementing a secure quantum cryptography system using two non-orthogonal states. For each qubit, the emitter station prepares a quantum system in one of two non-orthogonal quantum states in the time-basis to code bit values. Intra- and inter-qubit interference is then used to reveal eavesdropping attempts.
Type:
Application
Filed:
June 4, 2010
Publication date:
September 23, 2010
Inventors:
Nicolas GISIN, Grégoire Ribordy, Hugo Zbinden
Abstract: A method of performing finite field addition and doubling operations in an elliptic curve cryptography (ECC) authentication scheme as a countermeasure to side-channel attack. The addition and doubling operations are executed using atomic patterns that involve the same sequence and number of operation types, so that the noise consumption and electromagnetic emanation profile of circuitry performing the operations is identical regardless of operation. A subtraction operation using such an atomic pattern is also disclosed.
Abstract: According to one aspect, provided is a construction and specification for an implementation of a new cryptographic primitive, “Time-Lapse Cryptography”, with which a sender can encrypt a message so that it is guaranteed to be revealed at an exact moment in the future, even if this revelation turns out to be undesirable to the sender. In one embodiment, a Time-Lapse Cryptography Service is provided (“the Service”) based on a network of parties. Senders encrypt their messages with this public key whose secret key is not known to anyone—not even a trusted third party—until a predefined and specific future time T+?, at which point the secret key is constructed and published. In one example, the secret key can only be known after it is constructed. At or after that time, anyone can decrypt the cipher text using this secret key.
Type:
Application
Filed:
November 30, 2007
Publication date:
July 22, 2010
Inventors:
Michael O. Rabin, Christopher A. Thorpe