• <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片在线观看爽| 村上凉子中文字幕在线| 色av中文字幕| 黄色成人免费大全| 亚洲片人在线观看| 99国产精品一区二区蜜桃av| 精品一区二区三区视频在线 | 欧美黄色淫秽网站| 日日夜夜操网爽| 一级黄色大片毛片| 热99在线观看视频| 叶爱在线成人免费视频播放| 一进一出抽搐动态| 午夜日韩欧美国产| 每晚都被弄得嗷嗷叫到高潮| 日韩 欧美 亚洲 中文字幕| or卡值多少钱| 国产成人av教育| 精品一区二区三区av网在线观看| 午夜福利在线观看免费完整高清在 | 亚洲欧美激情综合另类| 亚洲午夜理论影院| 女人高潮潮喷娇喘18禁视频| 午夜福利免费观看在线| 国产精品美女特级片免费视频播放器 | 日本五十路高清| 亚洲精品美女久久久久99蜜臀| 欧美xxxx黑人xx丫x性爽| 狂野欧美激情性xxxx| 亚洲成av人片在线播放无| ponron亚洲| 国产成年人精品一区二区| 午夜福利在线观看吧| 老司机福利观看| 国产伦在线观看视频一区| 久久精品人妻少妇| 九九热线精品视视频播放| 最近在线观看免费完整版| 国产又黄又爽又无遮挡在线| 夜夜看夜夜爽夜夜摸| 一区福利在线观看| 夜夜爽天天搞| 国产激情久久老熟女| 99久久99久久久精品蜜桃| 在线观看66精品国产| 国产一区在线观看成人免费| 色精品久久人妻99蜜桃| 亚洲欧洲精品一区二区精品久久久| 欧美不卡视频在线免费观看| 久久这里只有精品中国| 成人无遮挡网站| 欧美国产日韩亚洲一区| 中文亚洲av片在线观看爽| 国产精品,欧美在线| 久久久久国内视频| 中文字幕久久专区| 黄色 视频免费看| 亚洲精品美女久久久久99蜜臀| 真人一进一出gif抽搐免费| xxx96com| 97碰自拍视频| 亚洲精品中文字幕一二三四区| 成人鲁丝片一二三区免费| 好看av亚洲va欧美ⅴa在| 国产野战对白在线观看| 91久久精品国产一区二区成人 | 人妻丰满熟妇av一区二区三区| 欧美三级亚洲精品| 久久久久久久午夜电影| 无人区码免费观看不卡| 中文字幕最新亚洲高清| 一级黄色大片毛片| 伊人久久大香线蕉亚洲五| 久久久久久久久久黄片| 久99久视频精品免费| 亚洲av电影不卡..在线观看| 亚洲av成人一区二区三| 亚洲成人免费电影在线观看| 黑人巨大精品欧美一区二区mp4| 亚洲 国产 在线| 亚洲av成人av| 男人的好看免费观看在线视频| 国产单亲对白刺激| 久久精品国产综合久久久| 国产亚洲av高清不卡| 日韩成人在线观看一区二区三区| 少妇裸体淫交视频免费看高清| 久久久色成人| 在线播放国产精品三级| 成年版毛片免费区| 亚洲av成人不卡在线观看播放网| 成在线人永久免费视频| 热99re8久久精品国产| 中文在线观看免费www的网站| 无限看片的www在线观看| 亚洲一区二区三区色噜噜| 亚洲成人中文字幕在线播放| 成在线人永久免费视频| 亚洲欧美日韩高清专用| 欧美大码av| 国产成+人综合+亚洲专区| 无限看片的www在线观看| 国产一区二区三区视频了| 国产精品香港三级国产av潘金莲| 黄频高清免费视频| 欧美丝袜亚洲另类 | 亚洲国产欧美网| 午夜福利在线观看免费完整高清在 | 一边摸一边抽搐一进一小说| 狂野欧美激情性xxxx| 天堂av国产一区二区熟女人妻| 黄色成人免费大全| 亚洲美女视频黄频| а√天堂www在线а√下载| 可以在线观看的亚洲视频| 亚洲第一电影网av| 老熟妇乱子伦视频在线观看| 国产成年人精品一区二区| 亚洲人成电影免费在线| 国产午夜精品论理片| 999久久久精品免费观看国产| 亚洲成人中文字幕在线播放| 51午夜福利影视在线观看| 欧美日韩一级在线毛片| 国产精品电影一区二区三区| 熟女电影av网| 久久99热这里只有精品18| 日本免费a在线| 在线观看日韩欧美| 两个人看的免费小视频| 一个人看的www免费观看视频| 亚洲真实伦在线观看| 九色成人免费人妻av| 久久精品91无色码中文字幕| 国产激情久久老熟女| 免费在线观看视频国产中文字幕亚洲| av在线蜜桃| АⅤ资源中文在线天堂| 后天国语完整版免费观看| 国产精品 欧美亚洲| 亚洲午夜理论影院| 91九色精品人成在线观看| 久久久精品大字幕| 国产av一区在线观看免费| 国产 一区 欧美 日韩| 一卡2卡三卡四卡精品乱码亚洲| 精品一区二区三区四区五区乱码| 在线观看日韩欧美| 成年人黄色毛片网站| 熟女人妻精品中文字幕| 好男人在线观看高清免费视频| 亚洲五月天丁香| 99久久无色码亚洲精品果冻| or卡值多少钱| 亚洲片人在线观看| 精品久久久久久,| av在线蜜桃| 日本成人三级电影网站| 一级毛片高清免费大全| 国产 一区 欧美 日韩| 精品日产1卡2卡| 两人在一起打扑克的视频| 久久久色成人| 午夜精品在线福利| 久久性视频一级片| 黄片大片在线免费观看| 久久久久国内视频| 18禁裸乳无遮挡免费网站照片| 免费看十八禁软件| 久久这里只有精品中国| 2021天堂中文幕一二区在线观| 网址你懂的国产日韩在线| 午夜两性在线视频| 欧美激情久久久久久爽电影| 在线十欧美十亚洲十日本专区| 丁香六月欧美| 亚洲avbb在线观看| 久久这里只有精品19| 国内毛片毛片毛片毛片毛片| 国内揄拍国产精品人妻在线| 国产激情欧美一区二区| 国产欧美日韩一区二区精品| 精品久久久久久久毛片微露脸| 99国产综合亚洲精品| 久久精品综合一区二区三区| 国内揄拍国产精品人妻在线| 国产精品香港三级国产av潘金莲| 欧美高清成人免费视频www| 国产激情欧美一区二区| 国产激情欧美一区二区| 中文字幕久久专区| 欧美另类亚洲清纯唯美| 午夜激情福利司机影院| 毛片女人毛片| 国模一区二区三区四区视频 | 久久中文字幕人妻熟女| 国产三级黄色录像| 国产私拍福利视频在线观看| 亚洲精品美女久久av网站| 一级a爱片免费观看的视频| 国产午夜福利久久久久久| 国产伦在线观看视频一区| 亚洲天堂国产精品一区在线| 久久午夜亚洲精品久久| 动漫黄色视频在线观看| 国产在线精品亚洲第一网站| 久久性视频一级片| 欧美成人一区二区免费高清观看 | 俺也久久电影网| 最近视频中文字幕2019在线8| 香蕉丝袜av| 日本免费a在线| 久久久久久大精品| 亚洲熟妇熟女久久| 日本免费a在线| 久久香蕉国产精品| 亚洲,欧美精品.| 亚洲熟妇熟女久久| 国产三级黄色录像| 色综合站精品国产| 久久亚洲精品不卡| 国产精品,欧美在线| 午夜福利免费观看在线| 两个人视频免费观看高清| 黄片大片在线免费观看| 久久久久性生活片| 手机成人av网站| 国产黄a三级三级三级人| 好男人在线观看高清免费视频| 制服人妻中文乱码| 亚洲电影在线观看av| 欧美黑人欧美精品刺激| 日本撒尿小便嘘嘘汇集6| 亚洲av片天天在线观看| 免费看a级黄色片| 日日干狠狠操夜夜爽| 亚洲精品乱码久久久v下载方式 | 日本成人三级电影网站| 视频区欧美日本亚洲| 免费在线观看成人毛片| 白带黄色成豆腐渣| 亚洲熟妇熟女久久| 最新在线观看一区二区三区| 中文字幕高清在线视频| 欧美黑人欧美精品刺激| x7x7x7水蜜桃| 亚洲专区字幕在线| www日本黄色视频网| 母亲3免费完整高清在线观看| 午夜成年电影在线免费观看| 老汉色∧v一级毛片| 亚洲国产欧美人成| 又爽又黄无遮挡网站| 欧美日韩瑟瑟在线播放| 欧美日本亚洲视频在线播放| 久久亚洲真实| 久久久久免费精品人妻一区二区| 亚洲成人精品中文字幕电影| 色播亚洲综合网| 日本在线视频免费播放| 动漫黄色视频在线观看| 听说在线观看完整版免费高清| 久久草成人影院| 日韩精品中文字幕看吧| 亚洲片人在线观看| 禁无遮挡网站| 窝窝影院91人妻| 国产精品影院久久| 亚洲国产欧美一区二区综合| 免费观看精品视频网站| av中文乱码字幕在线| 90打野战视频偷拍视频| 首页视频小说图片口味搜索| 国产aⅴ精品一区二区三区波| 99视频精品全部免费 在线 | 久久午夜亚洲精品久久| 亚洲午夜理论影院| 久久婷婷人人爽人人干人人爱| 最近最新免费中文字幕在线| 国产精品永久免费网站| 此物有八面人人有两片| 在线观看美女被高潮喷水网站 | 老司机午夜十八禁免费视频| 国产亚洲精品一区二区www| 亚洲成人中文字幕在线播放| 久久午夜亚洲精品久久| 成年女人看的毛片在线观看| 色综合站精品国产| 蜜桃久久精品国产亚洲av| 夜夜看夜夜爽夜夜摸| 亚洲中文av在线| 精品午夜福利视频在线观看一区| 午夜福利在线观看免费完整高清在 | 国产av不卡久久| 午夜激情欧美在线| 国产精品99久久久久久久久| 99热只有精品国产| 18禁黄网站禁片午夜丰满| 久久久久免费精品人妻一区二区| 亚洲激情在线av| bbb黄色大片| 色尼玛亚洲综合影院| 日韩欧美在线乱码| 精品一区二区三区视频在线观看免费| 精品人妻1区二区| 国产黄a三级三级三级人| 免费看十八禁软件| 校园春色视频在线观看| 91在线观看av| 熟女电影av网| 国产不卡一卡二| 天天添夜夜摸| 成人性生交大片免费视频hd| 最近最新中文字幕大全电影3| 99国产精品一区二区三区| 欧美日韩精品网址| 无遮挡黄片免费观看| 综合色av麻豆| 午夜精品久久久久久毛片777| 夜夜躁狠狠躁天天躁| 成年女人看的毛片在线观看| 日本五十路高清| 亚洲av成人av| 久久性视频一级片| 丰满人妻熟妇乱又伦精品不卡| 在线十欧美十亚洲十日本专区| 在线a可以看的网站| 国产又色又爽无遮挡免费看| a级毛片a级免费在线| 香蕉国产在线看| 国产精品 欧美亚洲| 国产欧美日韩精品一区二区| 欧美三级亚洲精品| 精华霜和精华液先用哪个| 18美女黄网站色大片免费观看| 国内精品久久久久精免费| 国产精品影院久久| 嫩草影院入口| 成人欧美大片| 日本 av在线| 欧美色视频一区免费| 精品久久久久久久人妻蜜臀av| 午夜福利欧美成人| 黄色片一级片一级黄色片| 网址你懂的国产日韩在线| 久久精品影院6| 两人在一起打扑克的视频| 一级黄色大片毛片| 噜噜噜噜噜久久久久久91| 婷婷丁香在线五月| ponron亚洲| 99精品久久久久人妻精品| 国产精品一区二区三区四区免费观看 | 叶爱在线成人免费视频播放| 欧美中文日本在线观看视频| 亚洲av成人一区二区三| 精品国产超薄肉色丝袜足j| 美女黄网站色视频| 欧美激情在线99| 国产成人欧美在线观看| 韩国av一区二区三区四区| 欧美激情久久久久久爽电影| 2021天堂中文幕一二区在线观| 精品久久久久久久毛片微露脸| 亚洲人与动物交配视频| 狂野欧美白嫩少妇大欣赏| 日日夜夜操网爽| 国产精品综合久久久久久久免费| 18禁国产床啪视频网站| 久久亚洲真实| 国产激情久久老熟女| 熟女电影av网| 久久天堂一区二区三区四区| 毛片女人毛片| 亚洲国产日韩欧美精品在线观看 | 此物有八面人人有两片| 亚洲精华国产精华精| 中文字幕av在线有码专区| 久久这里只有精品中国| 两人在一起打扑克的视频| 免费看光身美女| 国产精品香港三级国产av潘金莲| 亚洲欧洲精品一区二区精品久久久| 亚洲欧美日韩无卡精品| 可以在线观看的亚洲视频| 亚洲午夜精品一区,二区,三区| 久久精品影院6| 国产精品永久免费网站| 在线视频色国产色| 99在线视频只有这里精品首页| 岛国在线观看网站| 90打野战视频偷拍视频| 亚洲人成网站高清观看| 日韩 欧美 亚洲 中文字幕| 国产精品美女特级片免费视频播放器 | 久久久久亚洲av毛片大全| 欧美xxxx黑人xx丫x性爽| 久久久久免费精品人妻一区二区| 五月玫瑰六月丁香| 欧美日韩亚洲国产一区二区在线观看| 午夜福利在线在线| 欧美色视频一区免费| 国产精品一区二区三区四区免费观看 | 国产精品99久久久久久久久| 九九热线精品视视频播放| 国产综合懂色| 无遮挡黄片免费观看| 后天国语完整版免费观看| 天堂影院成人在线观看| 亚洲专区中文字幕在线| 欧美色视频一区免费| 欧美精品啪啪一区二区三区| 亚洲精华国产精华精| 成人欧美大片| 热99在线观看视频| 亚洲黑人精品在线| 久久久色成人| aaaaa片日本免费| 91在线观看av| 欧美又色又爽又黄视频| 一个人免费在线观看的高清视频| 在线免费观看不下载黄p国产 | 波多野结衣高清作品| 最近最新免费中文字幕在线| 亚洲欧洲精品一区二区精品久久久| 99久久久亚洲精品蜜臀av| 床上黄色一级片| 亚洲精华国产精华精| 国产高清videossex| 无限看片的www在线观看| 亚洲精品一卡2卡三卡4卡5卡| 亚洲av美国av| 嫩草影院入口| 国产1区2区3区精品| 亚洲成人精品中文字幕电影| 给我免费播放毛片高清在线观看| 欧美乱码精品一区二区三区| 日本与韩国留学比较| 91久久精品国产一区二区成人 | 亚洲第一欧美日韩一区二区三区| 久久精品亚洲精品国产色婷小说| 不卡一级毛片| 国产av不卡久久| 美女大奶头视频| 欧美xxxx黑人xx丫x性爽| 国产高清三级在线| 12—13女人毛片做爰片一| 午夜福利免费观看在线| 午夜福利成人在线免费观看| 午夜日韩欧美国产| 在线视频色国产色| 成人无遮挡网站| 久久热在线av| 又粗又爽又猛毛片免费看| 90打野战视频偷拍视频| 欧美日韩亚洲国产一区二区在线观看| 亚洲欧洲精品一区二区精品久久久| 婷婷精品国产亚洲av在线| 精品熟女少妇八av免费久了| 免费无遮挡裸体视频| 欧美乱妇无乱码| 一级黄色大片毛片| 免费看十八禁软件| 小说图片视频综合网站| 中国美女看黄片| 少妇的逼水好多| 成人特级av手机在线观看| 免费观看精品视频网站| 国产欧美日韩一区二区三| aaaaa片日本免费| 人人妻,人人澡人人爽秒播| 99精品久久久久人妻精品| 日韩免费av在线播放| 久9热在线精品视频| 日本黄色视频三级网站网址| 观看美女的网站| 久久人妻av系列| 国产精品影院久久| 麻豆国产av国片精品| 一区二区三区高清视频在线| 久9热在线精品视频| 国产一级毛片七仙女欲春2| 久久久久久久精品吃奶| 两性午夜刺激爽爽歪歪视频在线观看| a级毛片a级免费在线| 窝窝影院91人妻| 天堂√8在线中文| 91麻豆av在线| 色哟哟哟哟哟哟| 国产亚洲欧美在线一区二区| 色av中文字幕| 两个人的视频大全免费| 天天添夜夜摸| 国产又黄又爽又无遮挡在线| 国产精品影院久久| 岛国在线免费视频观看| 看免费av毛片| 欧美又色又爽又黄视频| 天天躁日日操中文字幕| 99精品在免费线老司机午夜| 天天躁狠狠躁夜夜躁狠狠躁| 性欧美人与动物交配| 国产精品亚洲一级av第二区| x7x7x7水蜜桃| 国产av在哪里看| 亚洲人与动物交配视频| 男人舔女人下体高潮全视频| 精品日产1卡2卡| 国产真人三级小视频在线观看| 淫妇啪啪啪对白视频| 国产高清视频在线观看网站| 男女那种视频在线观看| 2021天堂中文幕一二区在线观| 亚洲成a人片在线一区二区| 精品久久久久久,| 亚洲精品456在线播放app | 国产三级黄色录像| 亚洲av成人精品一区久久| 免费看美女性在线毛片视频| 日韩国内少妇激情av| 日韩欧美免费精品| 国产探花在线观看一区二区| 欧美一区二区国产精品久久精品| 亚洲中文日韩欧美视频| 天天添夜夜摸| 欧美绝顶高潮抽搐喷水| 一个人免费在线观看电影 | 两性夫妻黄色片| 午夜福利18| 国产成人啪精品午夜网站| 久久久久久国产a免费观看| 久久这里只有精品19| 色老头精品视频在线观看| 最近最新中文字幕大全免费视频| 无限看片的www在线观看| 日本一二三区视频观看| 动漫黄色视频在线观看| 给我免费播放毛片高清在线观看| 美女大奶头视频| 亚洲av电影不卡..在线观看| 日韩成人在线观看一区二区三区| 亚洲天堂国产精品一区在线| 天堂√8在线中文| 久久午夜综合久久蜜桃| 日韩欧美免费精品| 亚洲在线自拍视频| 国产一区在线观看成人免费| 九色成人免费人妻av| 欧美黑人欧美精品刺激| 女人被狂操c到高潮| 岛国在线观看网站| 国产精品一区二区三区四区久久| 国产成人精品久久二区二区91| 亚洲欧美日韩高清专用| 欧美不卡视频在线免费观看| 精品久久久久久久毛片微露脸| 99热这里只有是精品50| 亚洲欧美日韩无卡精品| 久久性视频一级片| 好看av亚洲va欧美ⅴa在| 国产一区在线观看成人免费| 男人和女人高潮做爰伦理| 亚洲国产日韩欧美精品在线观看 | 欧美日韩一级在线毛片| 国产精品一区二区精品视频观看| 丰满人妻一区二区三区视频av | 搡老熟女国产l中国老女人| 最近最新中文字幕大全免费视频| 国产乱人视频| 99久久国产精品久久久| 男人舔奶头视频| 国产 一区 欧美 日韩| 美女高潮喷水抽搐中文字幕| 亚洲在线自拍视频| 91久久精品国产一区二区成人 | 久久香蕉国产精品| av福利片在线观看| 99在线视频只有这里精品首页| 国产精品一区二区三区四区免费观看 | 91在线观看av| 亚洲中文av在线| 免费av不卡在线播放| 久久九九热精品免费| avwww免费| 天堂影院成人在线观看| 我要搜黄色片| 美女扒开内裤让男人捅视频| 亚洲精品美女久久久久99蜜臀| 网址你懂的国产日韩在线| 97超级碰碰碰精品色视频在线观看| 国产精品一区二区三区四区久久| 国产亚洲精品综合一区在线观看| 日本一二三区视频观看| 国产三级中文精品| aaaaa片日本免费| 久久精品影院6| 国产亚洲精品av在线| 久久久久久大精品| 成人国产综合亚洲| 美女cb高潮喷水在线观看 | 丝袜人妻中文字幕| 亚洲精品一卡2卡三卡4卡5卡| 91久久精品国产一区二区成人 | 欧美最黄视频在线播放免费| 女生性感内裤真人,穿戴方法视频| 亚洲午夜精品一区,二区,三区| 给我免费播放毛片高清在线观看| 欧美日韩综合久久久久久 | 国产成人精品久久二区二区91| 成人国产一区最新在线观看|