324 results about "Random seed" patented technology

Interactive electronic book operating systems and methods for displaying and allowing customization of content of scientific, engineering and other technical and professional digital books. The systems and methods allow for a single screen for displaying digital books covering scientific and technical topics having a classical look and feel on operating platforms(such as portable laptops, desktops, and small handheld displays) that are capable of running the Java Virtual Machine. The display screen can include icon toolbars about the screen and/or directly on the screen to manipulate the pages and content of the digital book. The icons can allow for forward and backward page turning, generating of dynamic indexing and tables of contents, bookmarking, color themes, floating pages, highlighting, adding sticky notes, hiding selected content on the pages, quizzing the reader, lecturing the reader, tutoring the reader, showing the reader additional designs and practical relevance, and allowing the instructor to generate uniform seed numbers for problems and designs and/or allowing the instructor to generate random seed values for problems and designs.

This present application relates to the field of cloud storage security technology, and in particular, relates to a cloud storage data encryption method, apparatus and system. The method comprises: according to the amount of data X expected to be stored within the preset time, the proportion of local storage space R and the security level of data Z, calculating the size H of a random seed that should be generated; according to the amount Y of plaintext data every time, calculating the times u of random seed acquired; according to the times u, acquiring data from the generated random seed with the size of H for several times to generate a plaintext encryption bit identifier data string; by use of the data string, selecting more than one half of the plaintext data for encryption to form a ciphertext. This application also provides a cloud storage data encryption apparatus and system. This invention has reduced the amount of encrypted data to be stored without sacrifice in the degree of data security protection, thus greatly improves the cloud storage data encryption and decryption performance.

A method and system is provided for communicating encrypted user passwords from a client to a server. During new environment negotiations, the server communicates to the client a server random seed value. The client then generates a client random seed value and, using the client random seed value, the server random seed value, and the user variable name, an encrypted user password. The client then communicates to the server the client random seed, the user variable name and the encrypted user password. Then the server validates the encrypted user password using the server random seed, the client random seed and the user variable name.

The present application relates to cloud storage technology and especially relates to a cloud storage data access method, apparatus and system based on OTP. This method includes: generating and storing true random numbers of a predetermined length and a random seed of a predetermined length composed of the true random numbers via a preset method; acquiring data from the random seed for several times and cascading the data acquired each time into a true random data string of no shorter than the length of plaintext; based on the true random data string, generating a true random cryptographic key of no shorter than the length of the plaintext, encrypting the plaintext using this cryptographic key and transmitting ciphertext to a cloud storage data center. This application also provides a cloud storage data access apparatus and system based on OTP. The method, apparatus and system introduced by this invention can generate and store sufficient true random cryptographic key with relatively small physical space occupancy in comparison with that of plaintext, thereby enabling OTP to be applied into cloud storage data security protection.

Method of scrambling signals, transmission point device and user equipment using the method are provided. The method is for scrambling signals assigned on predetermined radio resources of at least one layer of resource blocks with the same time and frequency resources, and comprises the steps of: sending an ID table to a user equipment through higher layer signaling, the ID table being a subset of the whole ID space and containing available IDs for the user equipment; notifying the user equipment an ID in the ID table to be used through physical layer signaling or UE specific higher layer signaling; generating a random seed based on the notified ID; initializing a scrambling sequence by the random seed; and scrambling the signals with the initialized scrambling sequence. The method of the disclosure, by combining physical layer signaling and higher layer signaling, may notify the used group ID and the blind detection space to a UE, the blind detection for the UE is enabled and the signaling overhead is reduced.

A security key, such as an encryption key, is generated so as to make it more difficult for eavesdroppers to identify the key. Specifically, a cryptographically secure random number generator generates a random bit sequence that is included in a seed. This random seed is provided along with a negotiated master secret to a key generation module. The key generation module may implement a pseudo random function that is in accordance with the Transport Layer Security (TLS) protocol or the Wireless Transport Layer Security (WTLS) protocol. This key may then be used to encrypt a plain text message to form an encrypted data packet. The encrypted data packet also includes the random seed in unencrypted form. The encrypted data packet may be transmitted over a public network to a recipient with reduced risk of eavesdropping.

Tracking objects by receiving a dataframe from a detection sensor device, the dataframe containing a timestamp and data corresponding to each detected object, generating new observation nodes for each detected object, propagating group track state parameters to obtain posterior observable positions and projecting them onto the received dataframe, generating gates for the posterior observable positions and projecting them onto the received dataframe, determining feasible track node and feasible observation node assignments based on the proximity of the new observation nodes to the gates, updating track node state parameters and corresponding scores, performing a multi-frame resolution algorithm to resolve group track nodes into subtrack nodes, determining a set of feasible composite assignments for composite sets of track nodes and observation nodes, updating track node state parameters and corresponding scores, and determining a selected set of joint assignments based on the feasible composite assignments and their respective scores.

The invention discloses control method and system for wireless channel access competition. The computing method of the optimal contention window is provided on the basis of an IEEE802.11 standard, and the original back off algorithm of an MAC protocol is improved. The invention is firstly characterized by deeply analyzing the thruput and the delay performance of a wireless network, and provides the method for dynamically computing the optimal contention window in a real-time mode according to the number of active nodes in the wireless network. Moreover, the invention provides a new back off mode which comprises the following steps of firstly, computing the optimal contention window according to the number of the calculated active nodes in the network; secondly, adding a random seed algorithm; and when conflict occurs in the wireless channel, the back off algorithm is increased by a random value on the basis of the optimal contention window instead of doubling the original window. Therefore, the conflict of channel competition by each active node is avoided, the access delay of media is also shortened, and the thruput and the utilization rate of the wireless network are both improved.

A user key management method for a broadcast encryption includes assigning node path identifiers (IDs) to nodes arranged in sequence; assigning random seed value keys to the nodes according to the node path IDs; generating key values by repeatedly applying a hash function to the assigned random seed value keys; and assigning the generated key values to the nodes in sequence. Accordingly, it is possible to reduce the transmission overhead that is most important matter in the broadcast encryption to less than the number of the revoked users. Further, there is an advantage that the transmission overhead of the exemplary embodiments of the present invention is remarkably reduced compared with the Subset Difference method.

In one example, we describe a method and system to solve the following problem for on-line gambling industry or gaming or on-line software or entertainment, which has to deal with two significant issues, as examples: (1) The integrity of the cards, the dice, or any random event generator; and (2) The possibility of cheating. On the first problem, the question is how would one know that the cards are not stacked to either favor the house/dealer in the case of Blackjack, or in the case of poker, the cards are not stacked as to favor betting and increasing the size of the pot and the rake. We have developed a software platform that delivers secure, encrypted cards, or other random seed generated event game, through a process that makes it virtually impossible for the integrity of the game to be compromised without detection. More variations and examples are discussed here.

The present application is directed towards systems and methods for generating and maintaining cookie consistency for security protection across a plurality of cores in a multi-core system. A packet processing engine executing on one core designated as a primary packet processing engine generates and maintains a global random seed. The global random seed may be used as an initial seed for creation of cookie signatures by each of a plurality of packet processing engines executing on a plurality of cores of the multi-core system using a deterministic pseudo-random number generation function such that each core creates an identical set of cookie signatures.

The invention discloses a true random number generating system and a true random number generating method. The method comprises the following steps: initializing a storage space in the internal memory of a computer as a random number seed buffering region; acquiring a random event generated by the computer; converting each random event into a random signal represented by a binary number; allocating an array to each random signal, and storing the binary numbers of the random events into the arrays allocated to the random signals respectively; shifting and mixing the binary numbers in each array and filling the binary numbers into the random number seed buffering region in turn to generate a random number source; intercepting a section of random number seed source from the random number seed buffering region as a random number sequence; and generating true random numbers according to the random number seed sequence. When the system and the method are implemented, the random events generated by the computer in an operation process are used as the seeds and source of the random numbers to generate true random numbers, so the randomness is high.

The invention discloses a communication key generation method and a secure channel selection method for a cognitive radio system, and belongs to the field of secure communication and information security in radio communication. A common available channel set is established according to a local spectrum pool of received and transmitted nodes, the quantity of channels of the channel set is at least equal to one, beacon signals with random initial phases are received and transmitted multiple times by the aid of channels which are sequentially selected from the available channel set, and phases of the received signals are detected and utilized for generating a random key element matrix according to reciprocity of wireless transmission characteristics of the same channels within a coherent time and differentiation of wireless transmission characteristics of different channels, and finally communication keys are acquired by fusion processing of the matrix. The communication keys are used for encrypting transmitted information and are also used as random seeds for selecting secure communication channels. The communication key generation method and the secure channel selection method have the advantages that interaction of the communication keys among the received and transmitted nodes through the channels is omitted, hidden dangers such as wiretapping, tampering and saturation attack from attackers can be eliminated, and commutation security of the cognitive radio system can be guaranteed.

A method of balancing advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; normalizing an impression value of each node to a predetermined cost range; setting a cost of each arc to each corresponding normalized value; iteratively performing a plurality of times: (a) sampling the nodes or the arcs to create sample nodes and arcs, each time starting from a different random seed; (b) optimally allocating impressions from the sample nodes to the contracts with a minimum-cost network flow algorithm; (c) separately allocating impressions from sample arcs of lowest cost before allocating those from sample arcs of higher cost; averaging allocations from iterations (b) to create a first allocation; averaging allocations from iterations (c) to produce a second allocation; and computing a weighted solution of the first and second allocations.

The invention relates to a variable probability bidirectional rapidly-exploring random tree improved path planning algorithm. Firstly, when importing a state space map, state space preprocessing needsto be performed according to the setting of the vehicle volume, and the state space edge is extended and protected to prevent the node from excessively approaching the state space edge to cause a collision. Secondly, a variable probability target selection strategy based on the node environment is adopted to accelerate the convergence speed. Finally, the bent part in the generated path is removedwhile the straight part in the generated path is retained, that is, whether connection lines between the first node as the start and the subsequent nodes have an obstacle is judged, the redundant nodes are deleted, the path is optimized, and the number of turns and the total path length during the driving of the trolley are reduced. The variable probability optimization algorithm is achieved based on the original bidirectional RRT algorithm, and the target pointing method is used to improve the search speed and reduce the calculation amount. At the same time, the path length and the number ofnodes are reduced, and the passability is ensured.

The invention relates to a data storage method and device, a storage medium and computer equipment. The method comprises the following steps: receiving original data which comprises timestamp; carrying out iterative computation by taking the timestamp as a random seed of a preset random algorithm to generate a random secret key; encrypting portions, which correspond to sensitive field names in a preset sensitive field name database, in the original data by a preset first encryption algorithm according to the random secret key; carrying out transformation treatment on the encrypted original data to generate replacement data; and storing the random secret key and the replacement data to a database table. By the data storage method and device, the storage medium and the computer equipment, safety of data storage is improved.

A random seed scramble for preventing the deterioration of a medium is applied to the next generation optical disk. A seed is stored to a BIS area. ID or an EDC is checked to hold interchangeability before and after scramble release. When no error is generated in data before the scramble release, it is recognized as an unscrambled disk. In contrast to this, when no error is generated in data after the scramble release, it is recognized as a scrambled disk. An information storing area showing an area to be rewritten by performing the scramble and an area to be rewritten without performing the scramble is arranged.

A method of correcting defects in a storage array of a microprocessor, such as a cache memory, by operating the microprocessor to carry out a functional test procedure which utilizes cache memory, collecting fault data in a trace array during the functional test procedure, identifying a location of the defect in the cache memory using the fault data, and repairing the defect by setting a fuse to reroute access requests for the location to a redundant array. The fault data may include an error syndrome and a failing address. The functional test procedure creates random cache access sequences that cause varying loads of traffic in the cache memory using a test pattern based on a random seed. The functional test procedure may be carried out after completion of a nonfunctional, built-in self test of the microprocessor which sets some of the fuses.