Is AES a blockchain algorithm

1. blockchain encryption algorithm
asymmetric encryption algorithm is a function that converts the original plaintext file or data into a series of unreadable ciphertext codes by using an encryption key. The encryption process is irreversible. Only holding the corresponding decryption key can the encrypted information be decrypted into readable plaintext. Encryption enables private data to be transmitted through the public network under the condition of low risk, and protects the data from being stolen and read by the third party
the core advantage of blockchain technology is decentralization, which can realize point-to-point transaction, coordination and cooperation based on decentralized credit in a distributed system without mutual trust by means of data encryption, time stamp, distributed consensus and economic incentive, so as to solve the high cost and low cost of centralized institutions Low efficiency and data storage insecurity provide solutions
the application fields of blockchain include digital currency, token, finance, anti-counterfeiting traceability, privacy protection, supply chain, entertainment, etc. with the popularity of blockchain and bitcoin, many related top domain names have been registered, which has a great impact on the domain name instry.

2. The encryption of jinwowo blockchain can ensure that the privacy of data sources can be better protected when big data is called, so as to eliminate the bad phenomenon of reselling data.

3.

there are about three kinds of currency in currency speculation. one is the base currency, which is similar to the representative of money. CNY and usdt Basic goods with value). One is the mainstream token, BTC, ETH (because of the national restrictions, the exchange can only trade in token, that is, take one kind of virtual currency to buy another kind of virtual currency, I don't know why.) The other is a variety of virtual currencies (commodities)

the purchase process is to first go to the exchange platform to find a personal seller with RMB to exchange for usdt, In the process of using usdt to exchange for the mainstream token BTC or eth used in purchasing various virtual coins, and finally using eth to purchase various virtual coins

A. base currency: CNY, usdt (exchangeable, need to be exchanged in good faith transactions with indivial buyers) B. mainstream token: BTC, ethc, virtual currency: all kinds of money, such as profit, need to be exchanged into usdt again, and then sold into CNY. Learn more about the coin circle

< blockquote >

sharing area network ~ learn more about the coin circle

< / blockquote >

experience: 1. Buy mainstream currency if you can't buy it. 2. If the new currency is not fried in January, it may become a banker to harvest leeks. 3. Just learned an experience, chasing up and killing down, meaning up do not buy, buy must be cut leeks If you have strength and value, you can hold it and wait for salted fish to turn over. 5. If the company is strong, the team is strong, and the executives are strong, you can pay more attention to it. Note: I don't understand the K line at all, and I don't understand the professional words, so I can only make a tentative decision on these purchase principles based on logical thinking

4.

As an emerging technology, blockchain has attracted more and more attention. It is a new application of traditional technology in the Internet era, including distributed data storage technology, consensus mechanism and cryptography. With the establishment of various blockchain research alliances, more and more funds and personnel support related research. Hash algorithm, zero knowledge proof, ring signature and other cryptographic algorithms used in blockchain:

hash algorithm

as the basic technology of blockchain, the essence of hash function is to map a set of data of any length (limited) to a set of defined length data stream. If this function satisfies the following conditions:

(1) the calculation of hash value for any group of data is very simple

(2) it is difficult to find two different data with the same hash value

hash functions satisfying the above two properties are also called encrypted hash functions. In case of no contradiction, hash functions usually refer to encrypted hash functions. For the hash function, finding such that is called a collision. The current popular hash functions are MD5, SHA1, Sha2, Sha3

bitcoin uses sha256, and most blockchain systems use sha256 algorithm. So here's sha256< Step 1: additional filling bits. The length of the message is congruent with that of 448 mod512 (length = 448 mod512). The number of bits to be filled ranges from 1 to 512. The highest bit of the filled bit string is 1, and the rest bits are 0

Step2: additional length value. The bit length of the initial message (before filling) represented by 64 bit is appended to the result of step 1 (the low byte takes precedence)

Step3: initialize cache. A 256 bit cache is used to store the intermediate and final results of the hash function

Step 4: process 512 bit (16 word) packet sequence. The algorithm uses six basic logic functions and consists of 64 steps of iterative operation. Each step takes the 256 bit cache value as the input, and then updates the cache content. Each step uses a 32-bit constant KT and a 32-bit wt. Where WT is the packet after the packet, t = 1,2,..., 16

step5: after all 512 bit packets are processed, the output of the last packet of sha256 algorithm is 256 bit packet< In 2001, Rivest, Shamir and TauMan proposed ring signature for the first time. It is a simplified group signature, only ring members have no manager, and it does not need the cooperation between ring members. In the ring signature scheme, the signer first selects a temporary signer set, which includes signers. Then the signer can generate the signature independently by using his private key and the public key of others in the signature set without the help of others. Members of the signer collection may not know that they are included in it

ring signature scheme consists of the following parts:

(1) key generation. A key pair (public key PKI, private key ski) is generated for each member of the ring

(2) signature. The signer uses his private key and the public keys of any n ring members (including himself) to generate the signature a for the message M

(3) signature verification. According to the ring signature and message M, the verifier verifies whether the signature is signed by the member in the ring. If it is valid, it will be received, otherwise it will be discarded

ring signature satisfies the following properties:

(1) unconditional anonymity: the attacker can not determine which member of the ring generated the signature, even if the private key of the ring member is obtained, the probability is not more than 1 / n

(2) Correctness: the signature must be verifiable by all others

(3) unforgeability: other members of the ring can't forge the real signer's signature, and even if an external attacker obtains a valid ring signature, he can't forge a signature for message M

(1) anonymity. The verifier can verify that the signature is signed by a member of the group, but can't know which member it is, so that the signer can be anonymous< (2) traceability. In group signature, the existence of group administrator ensures the traceability of signature. The group administrator can revoke the signature and expose the real signer. The ring signature itself cannot reveal the signer unless the signer wants to expose or add additional information to the signature. A verifiable ring signature scheme is proposed. In this scheme, the real signer wants the verifier to know his identity. At this time, the real signer can confirm his identity by disclosing his secret information< (3) management system. Group signature is managed by group administrator, ring signature does not need to be managed, signer can only select a set of possible signers, obtain its public key, and then publish the set, all members are equal

the Xueshuo innovation blockchain Technology Workstation of Lianqiao ecation online is the only approved "blockchain Technology Specialty" pilot workstation of "smart learning workshop 2020 Xueshuo innovation workstation" launched by the school planning, construction and development center of the Ministry of ecation of China. Based on providing diversified growth paths for students, the professional station promotes the reform of the training mode of the combination of professional degree research, proction, learning and research, and constructs the applied and compound talent training system< br />

5. There is a big difference
DES algorithm Feistel grid structure. There is no Feistel structure in the round transformation of AES algorithm.

6. AES is the group key, the algorithm input 128 bits of data, the key length is 128 bits. NR is used to represent the number of rounds of encryption for a data packet (the relationship between the number of encryption rounds and the length of the key is listed in Table 1). Each round requires the participation of an expanded key (I) with the same length as the input packet. Because the length of the external key K is limited, a keyexpansion program is used to expand the external key K into a longer bit string to generate the encryption and decryption keys of each round< Each loop transformation of AES consists of three layers:
nonlinear layer: SubByte transformation
line and row mixed layer: perform shiftrow and MixColumn operations
key adding layer - addroundkey operation
① SubByte transformation is a kind of nonlinear byte transformation acting on each byte in the state, which can be mapped by the calculated S-box< (2) shiftrow is a byte transposition. It circulates the rows in the state according to different offsets, which are also selected according to NB [3]

③ in MixColumn transformation, every column in the state is regarded as the result of multiplication of polynomial a (x) and fixed polynomial C (x) on GF (28). The coefficient of B (x) = C (x) * a (x) is calculated in this way:
* operation is not an ordinary multiplication operation, but a special operation, that is, B (x) = C (x) · a (x) (MOD X4 + 1) for this operation, B0 = 02. a0+03 A1 + A2 + a3 let xtime (A0) = 02. A0
Where is the symbol "." It represents the congruence multiplication of an eight degree irrecible polynomial

for the inverse change, the matrix C should be changed to the corresponding D, that is, B (x) = D (x) * a (x)
4. Addround is to XOR the corresponding byte in the state of circle key by bit

⑤ according to the property of linear change [1], decryption operation is the inverse change of encryption change.

7.

AES encryption process involves four operations, which are byte substitution , row shift , column confusion and round key addition

1. Byte replacement: the main function of byte replacement is to complete the mapping from one byte to another through s box

Line shift: the function of line shift is to realize the replacement between bytes in a 4x4 matrix

2. AES: Advanced Encryption Standard (Advanced encryption standard), It is a standard used by National Institute of standards and technology for encrypting electronic data. The algorithm has the advantages of simple design, fast key installation, less memory space, good performance on all platforms, supporting parallel processing and resisting all known attacks. AES is an iterative, symmetric key block cipher, which can use 128, 192 and 256 bit keys, and encrypt and decrypt data with 128 bit (16 byte) blocks< All in all, AES provides more advanced encryption technology than TKIP. Now wireless routers provide these two algorithms, but they prefer AES. The security of TKIP is not as good as AES, and the throughput of router will decrease 30% to 50% when using TKIP algorithm, which greatly affects the performance of router.