Key: Divided into encryption key and decryption key.
Plain text: Information that can directly represent the meaning of the original text without encryption.
Ciphertext: After being encrypted, the meaning of the original text is hidden.
Encryption: the implementation process of converting plaintext into ciphertext
Decryption: The implementation process of converting ciphertext into plaintext.
Cryptographic algorithm: The encryption method and decryption method adopted by the cryptographic system. With the development of cryptographic technology based on mathematics, encryption methods are generally called encryption algorithms, and decryption methods are generally called decryption algorithms.
For a given plaintext m and key k, the encryption transformation Ek turns the plaintext into a ciphertext c=f(m,k)=Ek(m). At the receiving end, use the decryption key k (sometimes k=k,) Complete the decryption operation and restore the ciphertext c to the original plaintext m=Dk, (c). A secure cryptosystem should satisfy: ①It is difficult for illegal interceptors to infer the plaintext m from the ciphertext C; ②The encryption and decryption algorithm should be quite simple and applicable to all key spaces; ③The security strength of the password only depends on Key; ④The legal receiver can verify and verify the integrity and authenticity of the message; ⑤The sender of the message cannot deny the message sent by him, and at the same time cannot forge the legal message of others; ⑥The arbitration agency can make arbitration when necessary.
Hash algorithm:The hash algorithm maps arbitrary-length binary values ​​to shorter fixed-length binary values, and this small binary value is called a hash value. The hash value is a unique and extremely compact numerical representation of a piece of data. If you hash a piece of plaintext and even change only one letter of that paragraph, subsequent hashes will produce different values. It is computationally impossible to find two different inputs that are hashed as the same value, so the hash value of the data can check the integrity of the data. Generally used for fast search and encryption algorithms.
The hash table maps a set of keywords to a limited address range according to the set hash function H (key) and conflict handling method, and uses the image of the keyword in the address range as the storage recorded in the table Location, this kind of table is called a hash table or hash, and the resulting storage location is called a hash address or hash address. As a linear data structure, compared with tables and queues, hash tables are undoubtedly the one with faster search speed.
A fixed-size result obtained by applying a one-way mathematical function (sometimes called a "hash algorithm") to any amount of data. If there is a change in the input data, the hash will also change. Hash can be used for many operations, including authentication and digital signatures. Also called "message digest".
Simple explanation: Hash (Hash) algorithm, that is, hash function. It is a one-way cryptosystem, that is, it is an irreversible mapping from plaintext to ciphertext. There is only an encryption process and no decryption process. At the same time, the hash function can change the input of any length to get a fixed-length output. The one-way feature of the hash function and the fixed length of the output data make it possible to generate messages or data.
Hash table (also called hash table) is a data structure that is directly accessed based on the key value. In other words, it accesses the record by mapping the key code value to a location in the table to speed up the search. This mapping function is called a hash function, and the array storing records is called a hash table.
Given a table M, there is a function f (key). For any given key value key, if the address of the record in the table containing the key can be obtained after substituting the function into the function, then the table M is called a hash (Hash) Table, the function f (key) is a hash (Hash) function.
2 Proper nouns of digital currency
Bitcoin: is an encrypted digital currency that was launched as open source software in 2009 by Satoshi Nakamoto, a pseudonymous developer.
Ethereum: is a public blockchain platform with smart contract functions.
Smart contract: A program that is time-driven, stateful, runs on a replicated, shared ledger, and can keep assets on the ledger.
Public chain: It is a blockchain in which anyone can send transactions anywhere and the transactions can be effectively confirmed, and anyone can participate in the consensus process.
Ethereum Virtual Machine: A virtual machine designed to run on all participant nodes in a peer-to-peer network. It can read and write executable code and data in a blockchain, verify data signatures, and be semi-Turing complete Way to run the code. It executes the code only when it receives a message verified by the data signature, and the information stored on the blockchain distinguishes the appropriate behavior.
Incentive equity proof consensus: Incentive measures are added to the equity proof consensus. It is estimated that the nodes are online and the nodes in the incentive network can be kept online to maintain the stability and security of the network.
Hard fork: The block chain has permanent divergence. After the new formula rules are released, some nodes that have not been upgraded cannot verify the blocks produced by the upgraded nodes. Usually, a hard fork will occur.
Turing completeness: A computing system that can calculate every Turing computable function is called Turing completeness. A language is Turing complete, which means that the computing power of the language is equivalent to that of a general-purpose Turing machine, which is also the highest ability that a modern computer language can have.
Oracle: According to the pre-set judgment conditions, the input data is filtered, and the most suitable data is selected as the input data.
Data feeds: Data feeds provide the blockchain with data sources under the data chain.
POS: Proof of rights consensus mechanism. According to the proportion and time of tokens occupied by each node, the difficulty of mining is reduced in proportion to speed up the speed of finding random numbers.
UTXO: Unspent transaction output. The transaction model used in the Bitcoin network.
POW: Proof-of-work consensus mechanism. One party (usually called the prover) submits a calculation result that is known to be difficult to calculate but easy to verify, and anyone else can verify this answer to be sure that the prover has completed a lot of calculation work in order to obtain the result.
DAO: Distributed Autonomous Organization. Through a series of fair and open rules, an organizational structure that can operate autonomously without human intervention and management.
Brand MIGHTY MAX BATTERY
The battery is composed of nickel -cadmium batteries
Recommended purpose of the product IROBOT
Voltage 14.4 volts
Rechargeable
500-2000Mah Lithium Battery,2000Mah Rechargeable Battery,5000 Mah Power Bank,5000Mah 26650 Battery,Cylindrical Lithium Battery
Langrui Energy (Shenzhen) Co.,Ltd , https://www.langruienergy.com