50 results about "Cryptographic primitive" patented technology

A block encryption method and schemes (modes of operation) that provide both data confidentiality and integrity with a single cryptographic primitive and a single processing pass over the input plaintext string by using a non-cryptographic Manipulation Detection Code function for secure data communication over insecure channels and for secure data storage on insecure media. The present invention allows, in a further aspect, software and hardware implementations, and use in high-performance and low-power applications, and low-power, low-cost hardware devices. The block encryption method and schemes of this invention allow, in yet a further aspect, encryption and decryption in parallel or pipelined manners in addition to sequential operation. In a yet further aspect, the block encryption method and schemes of this invention are suitable for real-time applications.

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. Other embodiments describe other applications of such a service, for example, one embodiment is used in sealed bid auctions, others in insider stock sales, clinical trials, and electronic voting, among a variety of possible implementations. In one embodiment, a method for cryptographic encoding is provided, including generation of cryptographic key components by a plurality of parties, where participation of the parties is verified. A public key is constructed from a plurality of key components,

Techniques are described for enabling authentication and/or key agreement between communications network stations and service networks. The techniques described include the negotiation and use of a cryptographic primitive shared between a service network and a home environment of a station. The techniques described also feature a key usage indicator, such as a sequence number, maintained by the service network and a station. Comparison of the key usage indicators can, for example, permit efficient authentication of the service network.

The invention belongs to the technical field of medical data management, and relates to a medical record storage, sharing and security claim settlement model and method based on a block chain. Firstly, credible sharing of medical data of patients among medical institutions is achieved through the blockchain technology, and a lifelong medical record is established for the patients; based on a Hashchain type storage structure, the medical data cannot be tampered; secondly, an improved CP-ABE-based cryptographic primitive SHDPCPC-CP-ABE is proposed, security encryption and fine-grained access control on the medical data are realized, and a patient can conveniently and efficiently access and authorize a medical institution to read the medical data; and finally, a Paillier homomorphic encryption technology is utilized to realize safe medical insurance claim settlement, and the privacy of the patient is protected when the patient interacts with a third-party non-medical institution. According to the invention, security, confidentiality, reliability and integrity of medical data can be realized, and confidential sharing of private data is supported.

A hash function is applied to a prefix of a VIL input. The output is added to a suffix of the input. A block cipher is applied to results of the addition. An encryption function is performed on the prefix. The final output is the output of the block cipher and the encryption function. In a second encryption technique, a hash function is applied to an input, and the output of the hash function has first and second portions. A block cipher is applied to the second portion. The output of the block cipher is added to the first portion, and a second function is applied to the result of this first addition. The output of the second function is added to the second portion. An inverse hash function is then applied to the output of the first and second additions, creating an encrypted output.

An authentication protocol using a Hardware-Embedded Delay PUF (“HELP”), which derives randomness from within-die path delay variations that occur along the paths within a hardware implementation of a cryptographic primitive, for example, the Advanced Encryption Standard (“AES”) algorithm or Secure Hash Algorithm 3 (“SHA-3”). The digitized timing values which represent the path delays are stored in a database on a secure server (verifier) as an alternative to storing PUF response bitstrings thereby enabling the development of an efficient authentication protocol that provides both privacy and mutual authentication.

A method for secure cryptographic communication comprises transmitting information that identifies a group key from a first device to a second device. The method further comprises, in the first device, using the group key to encrypt an input vector, transmitting the encrypted input vector, encrypting privacy-sensitive information using a device key, an encryption algorithm, and the input vector, and transmitting the encrypted privacy-sensitive information to the second device.

The invention discloses a security protocol analysis method and a security protocol analysis device. The security protocol analysis method mainly comprises the following steps of: initializing a security protocol, generating a subsequent state by adopting a subsequent generation algorithm, judging whether the subsequent state is an insecure state, giving a path from an initial state to the subsequent state if the subsequent state is the insecure state, and finishing a flow if the subsequent state is not the insecure state, wherein an attacker knowledge analysis algorithm introducing special algebraic properties is called by the subsequent generation algorithm for attacker deduction problems. In the security protocol analysis method provided by the invention, the processing of the algebraic properties of password operators is added, and the message processing capability of DY attackers, so attacks caused by the algebraic properties can be detected; and the method is applied to most of current security protocol analysis in which password primitives with the special algebraic properties are used, and the success rate of the analysis is greatly increased.

Embodiments of the present invention are directed to an improved system and method of producing, recording and reporting boot integrity measurements of an Internet of Things (“IoT”) computing device to resource (such as an on-chip software module, an external software module, a printer, a network router, or a server), so the resource can confirm that the IoT computing device can be trusted before access to the resource is granted. Embodiments provide a new and less expensive architecture for reliably collecting and relaying device state information to support trust-sensitive applications. Embodiments leverage crypto-acceleration modules found on many existing microprocessors and microcontroller-based IoT devices, while introducing little additional overhead or additional circuitry. Embodiments provide a Root of Trust module comprising integrated internal control logic that functions as a secure on-chip wrapper for cryptographic primitive modules, which provide secure storage and reporting of the host's platform integrity measurements.

Methods and apparatus for the secure and copy-proof distribution of digital content are disclosed. In a preferred embodiment of the invention cryptographic primitives (encryption algorithms, message-authentication codes, hash functions, random-number generators, etc.) are used in a novel security protocol. The invention may be utilized to protect a first-run movie that has been digitized in accordance with one of the current or forthcoming MPEG standards (e.g., MPEG-7). Content receivers or users first register their boxes. This registration information is stored in a secure database. When a subscriber registers, he then receives a box (interface to his player) that has been initialized to contain a number of tamper-proof secrets that are shared between the station and that particular box. The station stores an encrypted version of the digital content. This encrypted version ultimately arrives at some unprotected storage medium local to the player. Upon demand, the station delivers to the box the use-once computational ability to decrypt the content and display it on the player or terminal.

The invention relates to the technical field of perovskite single-crystal photoelectric devices, in particular to an all-photon cryptographic primitive preparation method based on a high-flux perovskite micro-single-crystal array. The method comprises the following steps of: regulating and controlling the atmosphere of a high-flux micro-droplet evaporation recrystallization solvent to control the environment humidity and the temperature of a hot plate; and by means of a solution method, successfully achieving one-step evaporation self-assembly on a patterned array substrate, so as to efficiently prepare the shape-controllable high-flux perovskite nanorod single crystal array. Laser emission information and characteristics of the crystal array are collected and successfully applied to establishment of the all-photon cryptographic primitive PUF, and encryption and decryption of encrypted transmission information are achieved. The excellent chemical/structural stability of the high-flux all-inorganic perovskite single crystal dot matrix provides innate advantages for stable formation and reading of the password primitive, the preparation method is simple, the operation is flexible, and the high-flux perovskite single crystal array is certainly promoted to enter a new step in the application of the all-photon password primitive.

A tile coalescer within a graphics processing pipeline coalesces coverage data into tiles. The coverage data indicates, for a set of XY positions, whether a graphics primitive covers those XY positions. The tile indicates, for a larger set of XY positions, whether one or more graphics primitives cover those XY positions. The tile coalescer includes coverage data in the tile only once for each XY position, thereby allowing the API ordering of the graphics primitives covering each XY position to be preserved. The tile is then distributed to a set of streaming multiprocessors for shading and blending operations. The different streaming multiprocessors execute thread groups to process the tile. In doing so, those thread groups may perform read-modify-write operations with data stored in memory. Each such thread group is scheduled to execute via atomic operations, and according to the API order of the associated graphics primitives.

The invention relates to a method for preparing cryptographic primitives based on perovskite crystals and application thereof, and the method comprises the steps that different chips with component segregation perovskite crystals are prepared, the fluorescence emission spectrum of a target array on the perovskite crystal chips is scanned and read, according to the number of emission peaks of the target array, array patterns are divided into four types: one emission peak, two emission peaks, three emission peaks, and four or more emission peaks, and the coding rules that the pattern of one emission peak is 00, the pattern of two emission peaks is 01, the pattern of three emission peaks is 10, and the pattern of four or more emission peaks is 11 are set; all patterns on the target array are converted into a binary coding array composed of 0 and 1, namely cryptographic primitives of the target array are formed, and the cryptographic primitives can be used for constructing a computer cryptographic security system. The method for preparing the password primitives based on the perovskite crystals has the technical effects of being high in randomness, unclonable, rapid in coding and capable of being produced on a large scale at low cost.

Techniques are disclosed to enable efficient implementation of secure hash functions and/or stream ciphers. More specifically, a family of graphs is described that has relatively large girth, large claw, and/or rapid mixing properties. The graphs are suitable for construction of cryptographic primitives such as collision resistant hash functions and stream ciphers, which allow efficient software implementation.

A data transmitter is disclosed. The data transmitter includes a digest generator configured in response to receiving a set of data from a data source to generate a digest from the set of data using a cryptographic primitive. The data transmitter further includes a packet generator configured to generate a series of one or more packets carrying the set of data for transmission, wherein each packet in the series includes a header, the set of data, a footer and the digest.

The invention discloses a symbol modeling system of a network security protocol. The system comprises a protocol entity modeling module, an attacker modeling module, a channel modeling module and a password primitive modeling module, so that protocol participation entity behaviors can be described meticulously and accurately, and various attack means of attackers are considered; whether an attackcan be resisted or not is considered under the participation of a secure channel; according to the method, detailed cryptographic primitive modeling is carried out on operations which can be carried out by a protocol participation entity and an attacker, non-formalized description of a protocol can be converted into accurate formalized description sentence by sentence, and a symbol model established by the method is basically consistent with the protocol description. By analyzing and verifying the model, loopholes existing in protocol design can be found, and then the defects existing in design of the network security protocol can be overcome.