• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    An image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree

    2022-11-21 09:34:34YiningSu蘇怡寧XingyuanWang王興元andShujuanLin林淑娟
    Chinese Physics B 2022年11期
    關鍵詞:興元

    Yining Su(蘇怡寧), Xingyuan Wang(王興元), and Shujuan Lin(林淑娟)

    School of Information Science and Technology,Dalian Maritime University,Dalian 116026,China

    This paper proposes an image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree. Firstly, other programming software is used to perform the middle order traversal, and the plaintext image is sorted according to the middle order traversal sequence on the permutation. Secondly, the chaotic sequence is generated using the coupled map lattice to set the chaotic interference value. Finally,the XOR operation between the adjacent pixel values of the replacement image is completed to generate the ciphertext matrix. The simulation and experimental results show that the proposed algorithm can resist typical attacks and has good robustness.

    Keywords: spatiotemporal chaos,image encryption,middle order traversal,coupled map lattice

    1. Introduction

    With the rapid development of network and communication technology,information based on audio,video and image storage is distributed on various public platforms. Therefore,information security has become an important topic.[1–4]The key to researching information security is to preserve information security during the process of information transmission.

    Chaos has cryptographic characteristics such as parameter sensitivity.[5–7]Recently, many image encryption schemes have been proposed, based on DNA,[8,9]neural networks,[10–12]chaos,[13–16]substitution boxes,[17–20]etc.These encryption schemes are based on the sensitivity of chaos to the initial conditions.In the past 10 years they have attracted widespread attention and achieved positive results in the field of image encryption. Wanget al.proposed the anti-dynamic degradation theorem, which proved that a chaotic stream cipher system is theoretically secure.[21]Therefore, chaotic cryptography has entered a new stage. The recently proposed spatiotemporal chaotic system caused fluctuations in chaotic cryptography with its excellent chaotic dynamics.[21–25]However, for the image encryption algorithm proposed in this paper, space–time chaos alone is not sufficient and it does not meet the standards of information security. Therefore, different mechanisms are needed to jointly resist the destruction of and tampering with information in the transmission process.

    Middle order traversal of a binary tree is a method for traversing a binary tree in a data structure.Its traversal method is to traverse the left subtree first, then access the root node and finally traverse the right subtree. The sequence generated by this method is not sequential nor is it periodic,like cat mapping, and is easy to implement. In this paper, sequential traversal of a binary tree is applied to replace image encryption, which effectively disturbs the original position of plaintext pixels.

    The encryption algorithm proposed in this paper is based on a combination of spatiotemporal chaos and sequential traversal of a binary tree. The key is generated by the plaintext image through the SHA-512 hash function, which increases the sensitivity of the plaintext. The chaotic dynamics of spatiotemporal chaos and the permutation method of order traversal in binary trees effectively increase the image confusion.

    The rest of the paper is summarized as follows. Section 2 introduces the preparation work before the algorithm is implemented. Section 3 introduces the implementation of the encryption algorithm in detail. Section 4 shows the simulation results of the encryption algorithm. Section 5 is a security analysis of the algorithm. Section 6 gives a performance analysis of the algorithm. Section 7 contains our conclusions.

    2. Related work

    2.1. Coupled map lattices

    A coupled map lattice (CML) is a dynamic system with discrete time, discrete space and a continuous state. CMLs are widely used to generate spatiotemporal chaos. A CML consists of a non-linear map located on a grid point called a local map. Each local map is coupled to other local maps according to a certain coupling rule. In fact, in computer implementations,any chaotic system must have periodicity with limited precision,but the actual period of a CML may be large enough to protect information security. CMLs were proposed by Kaneko[26]and can be described as

    whenu ∈(3.5699456,4) andxn ∈(0,1) the system is in a chaotic state.

    2.2. Middle order traversal of a binary tree

    Middle order traversal is a kind of binary tree traversal,also called middle root traversal and middle order travel. In a binary tree,the in-order traversal first traverses the left subtree,then accesses the root node and finally traverses the right subtree.The order traversal process in the binary tree is shown in Fig.1.

    Fig.1. Middle order traversal of a binary tree.

    2.3. Replacement method based on middle order traversal of a binary tree

    In this paper, middle order traversal of a binary tree is applied to the permutation of the image, and the chaos of the ordered traversal sequence in the binary tree is adopted. Due to the large number of pixel values of the image, constructing a binary tree and performing a middle order traversal operation on the pixel values of the image may be difficult to implement and increase the running speed and time of the algorithm. Therefore,this paper adopts the middle order traversal 1–65536 through VC++ 6.0 to generate the sequence.txt document,which stores the middle order traversal sequence of 1–65536 and then traverses the image pixel values according to the order. Sorting is done to complete the image replacement operation. The pseudo code that generates the middle order traversal sequence is as follows:

    3. Encryption algorithm

    3.1. Key structure

    The key system structure of this paper is shown in Fig.2 and consists of four parts. Hereεanduare the control parameters of the CML anda1anda2are the initial values of the two coupled maps. In this paper,the keykis generated by the plaintext image through the SHA-512 hash function,which is divided into 8-bit blocks and converted into 64 decimal numbersk1,k2,...,k64.

    wherea0andb0are control parameters added to increase the sensitivity of the key. The function uses parameters within the range ofu ∈(3.89,4].uis obtained by the following transformationu:

    SHA-512 (512bit)ε u a1 a2

    3.2. Encryption process

    The encryption process based on spatiotemporal chaos and middle order traversal of a binary tree is as follows:

    Step 1: A 512-bit keykis generated by the plaintext image through the SHA-512 hash function.

    Step 2: The sequence.txt file generated in Subsection 2.3 is converted into matrixIaccording to

    Step 3: Since the matrixIis a middle order traversal sequence, the plaintext imagePis converted into a onedimensional sequence,P1, a sequence traversal sequence is used for sortingP1according to Eq.(6)and a permutation matrixBis generated,

    Step 4:Equation(1)is iteratedM×N+500 times according to the key in Subsection 3.1,cancelling the first 500 values and avoiding transient reaction. Finally,chaotic sequencesS1,S2are generated.

    Step 5: According to Eq. (7),S1,S2are integerized to generateS,which is used for the chaotic interference value of the diffusion,

    S(i)=mod(floor(double(S1(i)+S2(i))×256),256).(7)

    Step 6: A ciphertext matrixCis generated by performing a XOR operation between the pixel value and the adjacent pixel value according to

    3.3. Decryption process

    The ciphertext imageCis transmitted to the receiver through the common channel,and the keys are transmitted to the receiver through the key exchange protocol.[27]The decryption process is the reverse of the encryption process. Specific steps are as follows:

    Step 1:The chaotic sequencesS1,S2are obtained by substituting the key iterative chaotic system. SequenceSis obtained according to Step 5 in Subsection 3.2.

    Step 2: The inverse XOR operation is performed according to Eq.(9)to obtainB,

    Step 3: The sequenceIgenerated in Subsection 2.3 is used to inverse scrambleBto getP1. Finally,P1is recombined into plaintext imageP.

    4. Simulation results

    In this paper,Matlab 2017 is used as a simulation tool to test the binary images‘Lena’,‘Cameraman’,and‘House’and a colored‘Lena’image with the encryption method described in this article. The simulation results are shown in Fig.3. Figures 3(a)–3(e) show different plaintext images, figures 3(f)–3(j)are the corresponding ciphertext images,figures 3(k)–3(o)are the corresponding decrypted images,and figures 3(p)–3(r)illustrate the encryption and decryption process for the colored image‘Lena’. We can see that the ciphertext image has completely covered the plaintext information, and the decrypted image is no different from the plaintext image.

    5. Security analysis

    5.1. Key space analysis

    A good encryption algorithm is extremely sensitive to the key,and the key space is large enough to resist typical attacks.In the algorithm described in this paper, the keys used are SHA-512 generated hash value and given keysa0,b0. When the accuracy of the key reaches 10-14, the key space reaches 2512×1028≈2512×293= 2605, which is much larger than 2200. Table 1 compares the key space between this algorithm and other algorithms,and it can be seen from the table that the key space of this algorithm is larger than that of most algorithms. So the key space is large enough to resist a variety of typical attacks.

    Table 1. Comparison of the key spaces of different algorithms.

    5.2. Key sensitivity analysis

    Four sets of experiments were performed to test the sensitivity of the keys,and the color and grayscale‘Lena’images were tested separately. Figure 4 shows the test results. Figures 4(a) and 4(e) show the use of the correct key to decrypt the encrypted image; figures 4(b)–4(d) and figures 4(f)–4(h)show the respective use of the wrong key to decrypt the encrypted image. The wrong key is just a minor change to the correct key. When the plaintext image is not decrypted using the wrong key,the algorithm is sensitive to the key.

    Fig.3. Encrypted image and decrypted image of plaintext image: (a)plaintext‘Lena’;(b)plaintext‘Cameraman’;(c)plaintext‘House’;(d)plaintext white;(e) plaintext black; (f) ciphertext of ‘Lena’; (g) ciphertext of ‘Cameraman’; (h) ciphertext of ‘House’; (i) ciphertext of white; (j) ciphertext of black; (k)decryption of‘Lena’;(l)decryption of‘Cameraman’;(m)decryption of‘House’;(n)decryption of white;(o)decryption of black;(p)plaintext color‘Lena’;(q)ciphertext of color‘Lena’;(r)decryption of color‘Lena’.

    Fig.4. Key sensitivity analysis: (a)decrypted image with the correct key;(b)decrypted image with ε =ε+10-16;(c)decrypted image with u=u+10-16;(d)decrypted image with a1 =a1+10-16; (e)decrypted image with the correct key; (f)decrypted image with a2 =a2+10-16; (g)decrypted image with ε =ε+10-14;(h)decrypted image with u=u+10-14.

    6. Performance analysis

    6.1. Histogram analysis

    A histogram is a graph that shows the frequency at which gray values of a digital image appear.In order to hide the information of the plaintext image,the histogram of the encrypted image tends to be straight. Figure 5 shows the histogram of the plain image and the ciphertext image of the grayscale images ‘Lena’, ‘Cameraman’, and ‘House’ and figure 6 shows the plaintext images of the R,G,and B channels of the color image ‘Lena’ and the histogram of the ciphertext image. It can be seen from Figs.5 and 6 that the histograms of the encrypted images are very similar. In order to better express the encrypted image histograms, we use the chi-square test. The critical values for the 5% and 1% probability of 255 degrees of freedom are 293.2478 and 310.457,respectively. It can be seen from Table 2 that significance levels of 5%and 1%were accepted. Obviously, the histograms of all ciphertext images tend to be flat, so it is difficult to obtain pure image information through statistical analysis.

    Fig.5. Histogram analysis: (a)plaintext‘Lena’;(b)histogram of‘Lena’;(c)ciphertext of‘Lena’;(d)histogram of ciphered‘Lena’;(e)plaintext‘Cameraman’;(f)histogram of‘Cameraman’;(g)ciphertext of‘Cameraman’;(h)histogram of ciphered‘Cameraman’;(i)plaintext‘House’;(j)histogram of‘House’;(k)ciphertext of‘House’;(l)histogram of ciphered‘House’.

    Fig.6. Histogram analysis: (a)plaintext color‘Lena’; (b)histogram for plain R component; (c)histogram for plain G component; (d)histogram for plain B component;(e)ciphertext of color‘Cameraman’;(f)histogram for encrypted R component;(g)histogram for encrypted G component;(h)histogram for encrypted B component.

    6.2. Correlation analysis

    Adjacent pixels have a high correlation between plaintext pixels. In order to hide the information between the plaintext images,the correlation between the pixels is greatly reduced.The formula for calculating the correlation between pixels is as follows:

    Herexandyare the gray values of two adjacent pixels. In this paper, 2000 pairs of pixels were selected to test the ‘Lena’,‘Cameraman’ and ‘House’ gray images and the ‘Lena’ color image in clear images with Eq. (10). Figures 7–12 show the correlation between ciphertext images in the horizontal,vertical and diagonal directions.

    Table 3 shows the correlation coefficients of the three plaintext images ‘Lena’, ‘Cameraman’, and ‘House’ and the three directions of the ciphertext image. When the correlation coefficient is close to zero, the proposed algorithm can resist statistical analysis. Experiments show that the algorithm is feasible.

    Table 4 shows the plaintext image of the three channels of the ‘Lena’ color image and the correlation coefficients in three directions of the ciphertext image. When the correlation coefficient is close to zero, the proposed algorithm can resist statistical analysis. Experiments show that the algorithm is feasible.

    Table 2. The χ2 evaluation results of ciphertext images.

    Table 3. Correlations of the plain-image(PI)and the corresponding cipher image(CCI)between adjacent pixels.

    Table 4. Correlations of the color plain-image(CPI)and the corresponding cipher image(CCI)between adjacent pixels.

    Fig.7. Correlation analysis: (a)plaintext‘Lena’;(b)horizontal correlation of plain image;(c)vertical correlation of plain image;(d)diagonal correlation of plain image; (e)ciphertext of‘Lena’; (f)horizontal correlation of ciphered image; (g)horizontal correlation of ciphered image; (h)diagonal correlation of ciphered image.

    Fig. 8. Correlation analysis: (a) plaintext ‘Cameraman’; (b) horizontal correlation of plain image; (c) vertical correlation of plain image; (d) diagonal correlation of plain image; (e) ciphertext of ‘Cameraman’; (f) horizontal correlation of ciphered image; (g) horizontal correlation of ciphered image; (h)diagonal correlation of ciphered image.

    Fig.9. Correlation analysis: (a)plaintext‘House’;(b)horizontal correlation of plain image;(c)vertical correlation of plain image;(d)diagonal correlation of plain image;(e)ciphertext of‘House’;(f)horizontal correlation of ciphered image;(g)horizontal correlation of ciphered image;(h)diagonal correlation of ciphered image.

    Fig. 10. Correlation analysis: (a) plaintext of R component; (b) horizontal distribution for R component; (c) vertical distribution for R component; (d)diagonal distribution for R component; (e) ciphertext of R component; (f) horizontal distribution for ciphered R component; (g) vertical distribution for ciphered R component;(h)diagonal distribution for ciphered R component.

    Fig.11. Correlation analysis:(a)plaintext of G component;(b)horizontal distribution for G component;(c)vertical distribution for G component;(d)diagonal distribution for G component; (e) ciphertext of G component; (f) horizontal distribution for ciphered G component; (g) vertical distribution for ciphered G component;(h)diagonal distribution for ciphered G component.

    Fig.12. Correlation analysis: (a)plaintext of B component;(b)horizontal distribution for B component;(c)vertical distribution for B component;(d)diagonal distribution for B component; (e) ciphertext of B component; (f) horizontal distribution for ciphered B component; (g) vertical distribution for ciphered B component;(h)diagonal distribution for ciphered B component.

    6.3. Information entropy analysis

    Information entropy is used to reflect the degree of confusion in an image. It is calculated as follows:

    wherep(si)represents the probability of occurrence ofsi. For an image, the ideal value for information entropy is 8. Table 5 shows the plaintext images of the three grayscale images‘Lena’,‘Cameraman’and‘House’and the color image‘Lena’and the information entropy of the ciphertext images. Experiments show that the information entropy of all ciphertext images is close to 8, which means that the cipher image of the algorithm has good randomness.

    6.4. Differential attack analysis

    The number of pixels change rate(NPCR)and unified average changing intensity (UACI) randomness tests are commonly used to evaluate the ability of an encrypted image to resist differential attacks. NPCR and UACI are calculated as follows:

    hereWandHrepresent,respectively,the width and height of the image andc1andc2are the two ciphertext images after the original plaintext image changes by one pixel value. Ifc1(i,j)/=c2(i,j),thenD(i,j)=1,otherwiseD(i,j)=0. Table 6 shows the NPCR and UACI values for the three grayscale images‘Lena’,‘Cameraman’and‘House’and the color image‘Lena’. The ideal value of NPCR is 99.6094%and for UACI it is 33.4635%. It can be seen from Table 7 that the NPCR and UACI values of this algorithm are closer to ideal values than those of most algorithms.

    6.5. Robust analysis

    Images are vulnerable to hijacking, tampering or destruction during transmission,so we usually use noise-adding methods to evaluate whether the encryption algorithm is robust.[34]Figure 13 shows the decryption effect after adding noise to the encrypted image. Experiments show that the image information can still be obtained after adding noise,which shows that the proposed algorithm has good robustness.

    Table 5. Information entropy of the plain-image (PI) and the cipher-image(CI).

    Table 6. The average NPCR and UACI values with various images.

    Table 7. Comparison of NPCR and UACI for different algorithms for the image‘Lena’.

    Fig. 13. Robust analysis. (a) The encrypted image with 0.01 salt and pepper noise. (b) The encrypted image with 0.05 salt and pepper noise. (c) The encrypted image with 0.01 Gaussian noise. (d)The encrypted image with 0.05 Gaussian noise. (e)The encrypted image with 0.01 speckled noise. (f)The decrypted image with 0.01 salt and pepper noise. (g) The decrypted image with 0.05 salt and pepper noise. (h) The decrypted image with 0.01 Gaussian noise. (i)The decrypted image with 0.05 Gaussian noise. (j)The decrypted image with 0.01 speckled noise.

    6.6. Time analysis

    Encryption time is also a necessary condition for evaluating encryption algorithms. The experimental environment is MATLAB R2016a with AMD Ryzen 5 3500H CPU and 8 GB RAM. We encrypt the ‘Lena’ image 50 times, take the average value and compare it with other algorithms to get Table 8.It can be seen from the table that the encryption time of this algorithm is shorter than that of most of the other algorithms,which shows that encryption of this image is faster.

    Not only experimental time analysis but also theoretical time complexity analysis should be carried out. Assuming the size of the image isM×N, Step 1 generates the hash value whose time complexity isO(512). The required binary tree sequence is obtained in Step 2, with the time complexity ofO(M×N). In Step 3, the binary tree sequence is used to scramble the image, whose time complexity isO(M×N).Step 4 is to iterate the chaotic system and generate two chaotic sequences, whose time complexity is 2O(M×N). In Step 5,the required XOR sequence is generated, whose time complexity isO(M×N). In Step 6 the ciphertext image is obtained from the XOR scrambled image,and its time complexity isO(M×N). Therefore, the time complexity of the algorithm is 2O(M×N). Table 9 compares the time complexity between the present algorithm and other algorithms, and shows the present algorithm is superior to most of the other algorithms.

    Table 8. Time comparisons for different algorithms.

    Table 9. Comparison of time complexity for different algorithms.

    7. Conclusion

    The encryption algorithm proposed in this paper is based on a combination of spatiotemporal chaos and sequential traversal of a binary tree. The key is generated by the plaintext image through the SHA-512 hash function, which increases the sensitivity of the plaintext. The chaotic dynamics of spatiotemporal chaos and the permutation method of order traversal in binary trees effectively increase the image confusion.Diffusion uses an adjacent or exclusive XOR based on chaotic interference values, which makes ciphertext images resistant to differential attacks.

    Acknowledgments

    Project supported by the National Natural Science Foundation of China (Grant No. 61672124), the Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund (Grant No. MMJJ20170203), Liaoning Province Science and Technology Innovation Leading Talents Program Project (Grant No. XLYC1802013), Key Research and Development Projects of Liaoning Province,China(Grant No.2019020105-JH2/103),and Jinan City‘20 universities’Funding Projects Introducing Innovation Team Program(Grant No.2019GXRC031).

    猜你喜歡
    興元
    情系鄉(xiāng)村振興的最美老干部——艾興元
    Synchronously scrambled diffuse image encryption method based on a new cosine chaotic map
    Force-constant-decayed anisotropic network model: An improved method for predicting RNA flexibility
    Molecular dynamics simulations on the wet/dry self-latching and electric fields triggered wet/dry transitions between nanosheets:A non-volatile memory nanostructure
    An image encryption algorithm based on improved baker transformation and chaotic S-box?
    劉興元小說二題
    劍南文學(2015年1期)2015-02-28 01:14:51
    国产一区二区在线观看av| 日韩熟女老妇一区二区性免费视频| 美女午夜性视频免费| 老熟妇仑乱视频hdxx| 欧美精品亚洲一区二区| xxxhd国产人妻xxx| av又黄又爽大尺度在线免费看| 久久久国产一区二区| 久久影院123| 少妇的丰满在线观看| √禁漫天堂资源中文www| 国产精品免费大片| 正在播放国产对白刺激| 亚洲精品粉嫩美女一区| 日韩欧美三级三区| 大香蕉久久网| 色94色欧美一区二区| 亚洲性夜色夜夜综合| 中文字幕人妻丝袜制服| 麻豆av在线久日| 久久久国产成人免费| 老司机午夜十八禁免费视频| 狂野欧美激情性xxxx| 久久久精品94久久精品| 两个人看的免费小视频| 日日摸夜夜添夜夜添小说| 国产人伦9x9x在线观看| 午夜福利视频精品| 亚洲va日本ⅴa欧美va伊人久久| www日本在线高清视频| 曰老女人黄片| 欧美精品啪啪一区二区三区| 日本黄色视频三级网站网址 | 757午夜福利合集在线观看| 欧美乱码精品一区二区三区| 天天躁日日躁夜夜躁夜夜| 欧美国产精品va在线观看不卡| 国产成人欧美| 午夜精品国产一区二区电影| 精品人妻在线不人妻| 91av网站免费观看| 亚洲七黄色美女视频| 久久精品国产亚洲av高清一级| 国产精品av久久久久免费| 日本a在线网址| 99久久国产精品久久久| 多毛熟女@视频| 久久午夜综合久久蜜桃| 国产成人免费无遮挡视频| 成人影院久久| 啦啦啦在线免费观看视频4| 大片免费播放器 马上看| 美女福利国产在线| 亚洲专区字幕在线| 超碰成人久久| 大片免费播放器 马上看| 欧美日韩av久久| 777久久人妻少妇嫩草av网站| 久久久久久久大尺度免费视频| 国产深夜福利视频在线观看| 巨乳人妻的诱惑在线观看| 黄片小视频在线播放| 久久精品人人爽人人爽视色| 精品国产一区二区三区久久久樱花| 国产亚洲精品久久久久5区| 电影成人av| 青草久久国产| 亚洲精品国产一区二区精华液| 久久ye,这里只有精品| 老司机午夜十八禁免费视频| 久久久久久久久免费视频了| 热99国产精品久久久久久7| 99国产精品一区二区三区| 热re99久久精品国产66热6| 无限看片的www在线观看| 欧美激情久久久久久爽电影 | 天堂动漫精品| av有码第一页| 69av精品久久久久久 | 欧美激情久久久久久爽电影 | www.自偷自拍.com| 12—13女人毛片做爰片一| 超碰97精品在线观看| 欧美精品啪啪一区二区三区| 不卡av一区二区三区| 亚洲一区中文字幕在线| 水蜜桃什么品种好| 亚洲成人免费电影在线观看| 国产高清视频在线播放一区| 婷婷成人精品国产| 黄色 视频免费看| 亚洲精品久久成人aⅴ小说| 巨乳人妻的诱惑在线观看| 美女高潮喷水抽搐中文字幕| 91av网站免费观看| 久久性视频一级片| 大香蕉久久成人网| 欧美国产精品一级二级三级| 欧美成人午夜精品| 成人亚洲精品一区在线观看| 狂野欧美激情性xxxx| 9热在线视频观看99| 精品人妻在线不人妻| 桃红色精品国产亚洲av| xxxhd国产人妻xxx| 丁香欧美五月| 欧美日韩成人在线一区二区| 我的亚洲天堂| 少妇粗大呻吟视频| 亚洲七黄色美女视频| 国产精品 欧美亚洲| 黑人巨大精品欧美一区二区mp4| 人妻一区二区av| 国产欧美日韩一区二区精品| 高清欧美精品videossex| 精品视频人人做人人爽| 美女主播在线视频| 757午夜福利合集在线观看| 他把我摸到了高潮在线观看 | 99国产精品一区二区蜜桃av | 亚洲欧美激情在线| 国产一区二区三区在线臀色熟女 | 视频区图区小说| 午夜福利影视在线免费观看| 久久狼人影院| 后天国语完整版免费观看| 亚洲中文日韩欧美视频| 亚洲精品久久成人aⅴ小说| 一区二区三区精品91| 久久青草综合色| 韩国精品一区二区三区| 免费观看人在逋| 久久久国产一区二区| 国产精品国产高清国产av | 汤姆久久久久久久影院中文字幕| 777米奇影视久久| 淫妇啪啪啪对白视频| 肉色欧美久久久久久久蜜桃| 高清黄色对白视频在线免费看| 免费观看a级毛片全部| 人人妻人人澡人人看| 两个人看的免费小视频| 国产在视频线精品| 超碰成人久久| 欧美 日韩 精品 国产| 午夜福利乱码中文字幕| 丝袜美腿诱惑在线| 操美女的视频在线观看| 啦啦啦在线免费观看视频4| 欧美 亚洲 国产 日韩一| 自线自在国产av| www.999成人在线观看| 亚洲欧美一区二区三区黑人| a在线观看视频网站| 欧美日韩亚洲国产一区二区在线观看 | 国产精品一区二区免费欧美| 久热爱精品视频在线9| 80岁老熟妇乱子伦牲交| 人成视频在线观看免费观看| 法律面前人人平等表现在哪些方面| 精品国产国语对白av| 老司机靠b影院| 国产精品国产av在线观看| 国产黄色免费在线视频| 丰满人妻熟妇乱又伦精品不卡| 我要看黄色一级片免费的| 国产深夜福利视频在线观看| 亚洲精品美女久久久久99蜜臀| 国产精品久久久久久人妻精品电影 | 亚洲人成伊人成综合网2020| 色播在线永久视频| 18禁美女被吸乳视频| 午夜两性在线视频| 国产精品香港三级国产av潘金莲| 宅男免费午夜| 日韩熟女老妇一区二区性免费视频| 日韩大码丰满熟妇| 国产一区二区在线观看av| 亚洲欧洲精品一区二区精品久久久| 精品国内亚洲2022精品成人 | 久久香蕉激情| 国产在线精品亚洲第一网站| 一区二区三区激情视频| 久久亚洲精品不卡| cao死你这个sao货| 国产一区二区在线观看av| 啦啦啦在线免费观看视频4| 亚洲中文字幕日韩| 日韩欧美一区二区三区在线观看 | 亚洲第一av免费看| 国产午夜精品久久久久久| 欧美亚洲 丝袜 人妻 在线| 首页视频小说图片口味搜索| 精品国内亚洲2022精品成人 | 女警被强在线播放| 成人18禁在线播放| 757午夜福利合集在线观看| 欧美av亚洲av综合av国产av| 老汉色av国产亚洲站长工具| 一级,二级,三级黄色视频| 一区二区av电影网| 丰满人妻熟妇乱又伦精品不卡| 国产精品电影一区二区三区 | 亚洲av成人不卡在线观看播放网| 人妻 亚洲 视频| 国产成人精品无人区| 国产单亲对白刺激| 精品国产乱子伦一区二区三区| 在线观看免费视频日本深夜| 他把我摸到了高潮在线观看 | 麻豆成人av在线观看| 美女午夜性视频免费| videosex国产| 久久精品91无色码中文字幕| 亚洲第一欧美日韩一区二区三区 | 人妻 亚洲 视频| 最黄视频免费看| 黑人操中国人逼视频| 伊人久久大香线蕉亚洲五| 亚洲,欧美精品.| 电影成人av| 在线观看人妻少妇| 九色亚洲精品在线播放| 好男人电影高清在线观看| 国产在线视频一区二区| 在线观看免费日韩欧美大片| 亚洲精品国产色婷婷电影| 黄网站色视频无遮挡免费观看| 免费在线观看完整版高清| 亚洲五月婷婷丁香| 午夜免费鲁丝| 欧美日韩亚洲高清精品| 国产一区二区激情短视频| 日本av免费视频播放| 青青草视频在线视频观看| 女同久久另类99精品国产91| 80岁老熟妇乱子伦牲交| 精品福利永久在线观看| 丰满迷人的少妇在线观看| 天天躁狠狠躁夜夜躁狠狠躁| 国产一区二区在线观看av| 中文亚洲av片在线观看爽 | 91av网站免费观看| 亚洲成国产人片在线观看| 国产亚洲精品一区二区www | 免费黄频网站在线观看国产| 啪啪无遮挡十八禁网站| av电影中文网址| 亚洲精品美女久久久久99蜜臀| 国产亚洲欧美精品永久| 精品亚洲成国产av| 国产成人一区二区三区免费视频网站| 12—13女人毛片做爰片一| 日韩人妻精品一区2区三区| 色播在线永久视频| 国产午夜精品久久久久久| 丰满人妻熟妇乱又伦精品不卡| 精品亚洲成国产av| 日韩一卡2卡3卡4卡2021年| 动漫黄色视频在线观看| 麻豆av在线久日| 又黄又粗又硬又大视频| 人人妻人人澡人人爽人人夜夜| 久久影院123| 国产真人三级小视频在线观看| 一区二区av电影网| 亚洲国产成人一精品久久久| tocl精华| 国产亚洲一区二区精品| 99riav亚洲国产免费| 色婷婷久久久亚洲欧美| 免费观看av网站的网址| 99九九在线精品视频| 捣出白浆h1v1| 9色porny在线观看| 91麻豆精品激情在线观看国产 | 国产极品粉嫩免费观看在线| 悠悠久久av| 男女边摸边吃奶| 99国产精品一区二区三区| 久久精品人人爽人人爽视色| 中文字幕av电影在线播放| a级片在线免费高清观看视频| 久久久久视频综合| 波多野结衣av一区二区av| 超色免费av| 亚洲 欧美一区二区三区| 91字幕亚洲| 亚洲人成77777在线视频| 亚洲成国产人片在线观看| 国产老妇伦熟女老妇高清| 80岁老熟妇乱子伦牲交| 十八禁人妻一区二区| 真人做人爱边吃奶动态| 99精品欧美一区二区三区四区| 美女扒开内裤让男人捅视频| 国产日韩欧美在线精品| 日韩中文字幕视频在线看片| 乱人伦中国视频| 青草久久国产| 亚洲专区字幕在线| 久久久欧美国产精品| a在线观看视频网站| 丝袜美足系列| 国产欧美日韩一区二区三区在线| 欧美日韩中文字幕国产精品一区二区三区 | 好男人电影高清在线观看| 亚洲av电影在线进入| 中文字幕色久视频| 国产精品98久久久久久宅男小说| 午夜福利,免费看| 操美女的视频在线观看| 757午夜福利合集在线观看| 99国产精品免费福利视频| 国产国语露脸激情在线看| 精品卡一卡二卡四卡免费| 国产在线一区二区三区精| 一级,二级,三级黄色视频| 最近最新中文字幕大全电影3 | 亚洲国产av新网站| 99久久99久久久精品蜜桃| 巨乳人妻的诱惑在线观看| 欧美乱妇无乱码| 中文字幕精品免费在线观看视频| 18禁国产床啪视频网站| 在线观看免费午夜福利视频| 一区二区三区乱码不卡18| 在线观看免费视频网站a站| 成年人黄色毛片网站| 9191精品国产免费久久| 精品国产一区二区三区四区第35| 嫁个100分男人电影在线观看| 国产精品一区二区免费欧美| 色视频在线一区二区三区| 黑人巨大精品欧美一区二区mp4| 美女高潮到喷水免费观看| 老司机午夜福利在线观看视频 | 一本一本久久a久久精品综合妖精| 99久久精品国产亚洲精品| 黄色视频在线播放观看不卡| 国产在线免费精品| 多毛熟女@视频| 日韩免费av在线播放| 亚洲av欧美aⅴ国产| 99精品在免费线老司机午夜| 日韩视频在线欧美| 99riav亚洲国产免费| 久久 成人 亚洲| 日韩视频在线欧美| a在线观看视频网站| 咕卡用的链子| 国产欧美日韩一区二区三| 女人精品久久久久毛片| 免费在线观看视频国产中文字幕亚洲| 美女高潮喷水抽搐中文字幕| 亚洲精品国产一区二区精华液| 18禁观看日本| 亚洲精品自拍成人| 窝窝影院91人妻| 亚洲第一av免费看| 中文欧美无线码| www日本在线高清视频| 国产三级黄色录像| 色婷婷av一区二区三区视频| 国产老妇伦熟女老妇高清| 亚洲精品国产精品久久久不卡| 大片电影免费在线观看免费| 新久久久久国产一级毛片| 18在线观看网站| 亚洲va日本ⅴa欧美va伊人久久| 国产一卡二卡三卡精品| 国产一区二区在线观看av| 水蜜桃什么品种好| 五月开心婷婷网| 国产男女内射视频| 亚洲av成人不卡在线观看播放网| 99国产精品一区二区蜜桃av | xxxhd国产人妻xxx| 亚洲成人免费av在线播放| 久久久久国内视频| 男男h啪啪无遮挡| 少妇被粗大的猛进出69影院| 视频区图区小说| 久热爱精品视频在线9| 国产精品.久久久| 91麻豆av在线| 伊人久久大香线蕉亚洲五| 十八禁人妻一区二区| 丰满少妇做爰视频| 美女高潮喷水抽搐中文字幕| 欧美黄色淫秽网站| 久久久久久久大尺度免费视频| 麻豆av在线久日| 一本综合久久免费| 99re6热这里在线精品视频| 中文字幕色久视频| 久久久久久人人人人人| 久久精品91无色码中文字幕| 精品卡一卡二卡四卡免费| 一进一出好大好爽视频| 精品一区二区三区四区五区乱码| 久热爱精品视频在线9| 黄色视频,在线免费观看| 两个人看的免费小视频| 国产日韩欧美在线精品| 国产极品粉嫩免费观看在线| 女同久久另类99精品国产91| 久久人妻福利社区极品人妻图片| 久久久久久久久免费视频了| 在线观看一区二区三区激情| 免费观看a级毛片全部| 亚洲五月色婷婷综合| 中文字幕另类日韩欧美亚洲嫩草| 黑人欧美特级aaaaaa片| 91成人精品电影| 午夜精品久久久久久毛片777| 一边摸一边抽搐一进一出视频| 老司机影院毛片| 精品一区二区三区av网在线观看 | 亚洲av第一区精品v没综合| 我的亚洲天堂| 国产又爽黄色视频| 人人妻人人澡人人看| 国产精品98久久久久久宅男小说| 免费观看人在逋| 一级毛片女人18水好多| 久久精品aⅴ一区二区三区四区| 别揉我奶头~嗯~啊~动态视频| 亚洲五月色婷婷综合| 亚洲一码二码三码区别大吗| 亚洲av片天天在线观看| 久久久欧美国产精品| 亚洲第一欧美日韩一区二区三区 | 亚洲成av片中文字幕在线观看| 亚洲国产中文字幕在线视频| 少妇精品久久久久久久| 男人操女人黄网站| 亚洲熟女毛片儿| 中国美女看黄片| 亚洲午夜精品一区,二区,三区| 亚洲性夜色夜夜综合| 久久99热这里只频精品6学生| 99re在线观看精品视频| 女人精品久久久久毛片| 午夜视频精品福利| 久久精品成人免费网站| 色老头精品视频在线观看| 免费观看人在逋| 男男h啪啪无遮挡| 99精品欧美一区二区三区四区| 多毛熟女@视频| 天天躁狠狠躁夜夜躁狠狠躁| 热99re8久久精品国产| 黄网站色视频无遮挡免费观看| 午夜视频精品福利| 午夜福利在线免费观看网站| 日日爽夜夜爽网站| 亚洲男人天堂网一区| 正在播放国产对白刺激| avwww免费| 91麻豆av在线| 免费黄频网站在线观看国产| 国产欧美日韩综合在线一区二区| 国产无遮挡羞羞视频在线观看| 免费看十八禁软件| 老司机在亚洲福利影院| 天天操日日干夜夜撸| 国产在视频线精品| 亚洲av电影在线进入| 午夜福利视频精品| 免费高清在线观看日韩| 真人做人爱边吃奶动态| 成年人免费黄色播放视频| 久久热在线av| 在线观看免费视频网站a站| 成人三级做爰电影| 欧美精品高潮呻吟av久久| 99热网站在线观看| 婷婷成人精品国产| 又大又爽又粗| 久热爱精品视频在线9| 亚洲黑人精品在线| 激情在线观看视频在线高清 | 国产男女超爽视频在线观看| 一级毛片精品| 亚洲熟妇熟女久久| xxxhd国产人妻xxx| 中文字幕人妻丝袜一区二区| 亚洲欧洲精品一区二区精品久久久| 午夜福利欧美成人| 亚洲欧洲日产国产| 国产一卡二卡三卡精品| 亚洲欧洲精品一区二区精品久久久| 久久精品熟女亚洲av麻豆精品| 在线av久久热| 99久久人妻综合| 一进一出抽搐动态| 丝袜在线中文字幕| 久久久国产成人免费| 久久婷婷成人综合色麻豆| 亚洲一区二区三区欧美精品| 97人妻天天添夜夜摸| 满18在线观看网站| 无限看片的www在线观看| 18禁美女被吸乳视频| av不卡在线播放| 肉色欧美久久久久久久蜜桃| 久久精品亚洲精品国产色婷小说| 国产精品av久久久久免费| 久久精品国产综合久久久| 午夜福利免费观看在线| 两个人看的免费小视频| 亚洲,欧美精品.| 黄色a级毛片大全视频| 十八禁网站免费在线| 免费在线观看日本一区| 美女高潮到喷水免费观看| 大片免费播放器 马上看| 精品久久久久久久毛片微露脸| 啦啦啦视频在线资源免费观看| 欧美日韩中文字幕国产精品一区二区三区 | 亚洲天堂av无毛| 每晚都被弄得嗷嗷叫到高潮| 男人操女人黄网站| 中文字幕制服av| 无人区码免费观看不卡 | 国产成人免费观看mmmm| 女人高潮潮喷娇喘18禁视频| 免费不卡黄色视频| 国产野战对白在线观看| 极品人妻少妇av视频| 免费看a级黄色片| 操美女的视频在线观看| 99国产极品粉嫩在线观看| 国产精品亚洲av一区麻豆| 人人妻,人人澡人人爽秒播| 丝袜人妻中文字幕| 精品久久久精品久久久| 国内毛片毛片毛片毛片毛片| 怎么达到女性高潮| av视频免费观看在线观看| 多毛熟女@视频| 久久久精品免费免费高清| 久久久精品94久久精品| 久久中文看片网| xxxhd国产人妻xxx| 五月开心婷婷网| 免费一级毛片在线播放高清视频 | 久久性视频一级片| 妹子高潮喷水视频| 免费在线观看黄色视频的| 极品少妇高潮喷水抽搐| 两人在一起打扑克的视频| 国产成人系列免费观看| 久久精品国产99精品国产亚洲性色 | 男男h啪啪无遮挡| 国产免费现黄频在线看| 女人爽到高潮嗷嗷叫在线视频| 叶爱在线成人免费视频播放| 不卡av一区二区三区| 久久精品国产亚洲av高清一级| 妹子高潮喷水视频| 大片电影免费在线观看免费| videosex国产| 亚洲欧美激情在线| 亚洲第一欧美日韩一区二区三区 | 伦理电影免费视频| 香蕉丝袜av| 黄色 视频免费看| av网站在线播放免费| 少妇被粗大的猛进出69影院| 怎么达到女性高潮| 人人妻人人澡人人爽人人夜夜| 精品卡一卡二卡四卡免费| 精品国产乱码久久久久久男人| 国产精品久久久久成人av| 亚洲av第一区精品v没综合| 9热在线视频观看99| 国产精品偷伦视频观看了| 国产精品久久久久久精品古装| 成人黄色视频免费在线看| 12—13女人毛片做爰片一| 日本撒尿小便嘘嘘汇集6| 精品人妻1区二区| 首页视频小说图片口味搜索| 国产主播在线观看一区二区| 成人影院久久| av有码第一页| 我要看黄色一级片免费的| 麻豆av在线久日| 午夜视频精品福利| 可以免费在线观看a视频的电影网站| 两个人免费观看高清视频| 高潮久久久久久久久久久不卡| 国产亚洲欧美在线一区二区| 女人爽到高潮嗷嗷叫在线视频| 国产成人精品久久二区二区91| 侵犯人妻中文字幕一二三四区| 国产欧美日韩一区二区精品| www.自偷自拍.com| 亚洲免费av在线视频| av在线播放免费不卡| 黄色a级毛片大全视频| 人人妻人人澡人人爽人人夜夜| 99国产精品一区二区三区| 亚洲av国产av综合av卡| 在线亚洲精品国产二区图片欧美| 十分钟在线观看高清视频www| 国产精品久久久人人做人人爽| 黄色怎么调成土黄色| 亚洲性夜色夜夜综合| 国产精品1区2区在线观看. | 色94色欧美一区二区| 久久精品亚洲熟妇少妇任你| 最新的欧美精品一区二区|