Lorenzϵͳ»ìãç¼ÓÃÜËã·¨Ñо¿

¡¡¡¡Ìá³öÒ»ÖÖ»ùÓÚ±»ÈŶ¯µÄLorenzϵͳµÄ¼ÓÃÜËã·¨¡£Ê×ÏÈͨ¹ýLegendre¶àÏîʽ¶ÔLorenzϵͳÖеÄϵͳ²ÎÊýb½øÐÐÈŶ¯£¬È»ºóÔÙÀûÓÃLorenz²úÉúµÄËæ»úÐòÁжÔÔ­ÎÄÐÅÏ¢½øÐÐһϵÁеIJÙ×÷±ä»»£¬Ê¹µÃ¼ÓÃܵÄÐÅÏ¢¸ü¼Ó°²È«¡£Í¨¹ýÈŶ¯ÓÐЧµÄ²¹³¥Á˼ÆËã»úÓÐÏÞ¾«¶Èµ¼ÖµĻìãçϵͳÍË»¯ÐÐΪ£¬¾­¶Ô±¾Ëã·¨µÄÄ£ÄâʵÑé¼°ÏêϸÐÔÄÜ·ÖÎö£¬½á¹û±íÃ÷¸Ã¼ÓÃÜËã·¨Äܹ»ÔÚ±£Ö¤¼ÓÃÜËٶȵÄÇ°ÌáÏ£¬Ê¹µÃ»ìãçÐòÁÐËæ»úÐÔ¡¢¼ÓÃÜϵͳ°²È«ÐԵȷ½Ã涼ÓÅÓÚ»ùÓÚÈýά»ìãçÃÜÂëϵͳºÍ»ùÓÚÁªºÏ»ìãç¼ÓÃÜϵͳ¡£

¡¡¡¡Abstract:

¡¡¡¡In this paper£¬ a chaotic encryption algorithm based on the disturbed Lorenz system is proposed. Firstly£¬ the Lorenz system parameters b is disturbed by using the Legendre polynomial in order to compensate the degradation behavior of chaotic systems due to the computer¡¯s finite precision£¬ then the plaintexts are encrypted by using the pseudo-random sequence which are produced by the disturbed Lorenz system. As a result£¬ the algorithm can effectively resist all known attacks and make information more secure. The proposed algorithm is described in detail£¬ along with its security analysis and implementation. Theoretical analyses and computer simulations both confirm that the new algorithm possesses high security and fast encryption speed for practical information encryption.