現今網路與雲端系統服務之使用率極龐大，為保護資料之安全性及防止其在網路上被竊取，針對電子資料加密有其必要。因此，本論文即針對此需求進行研究。經探索，加密與資料隱藏兩種方式皆可達到保密之目的，且可針對其演算法之特性應用於不同地方，達到效益。
本論文提出一種加密技術－魔術方塊演算法。首先必須將資料作預處理，定義出子區塊單位之大小，接著將資料分割成六個子區塊，再將分割出來的子區塊分別貼合至魔術方塊的六面上，接著再對資料圖形進行分割（Partition）、位移（Translation）與翻轉（Rotation）處理，並以亂數決定各部份之位移與翻轉的方向和次數，用於數位資料的加密。本論文中所使用的魔術方塊階層以3×3×3為主，每一小方格的大小皆相同，而不足之區塊則以空白資料填補。
另外，本論文對所提出的加密方式與常見之對稱式加密法作差異分析，比較優缺點，以及其加密法可應用之範圍。
Currently, the utilization from Internet and Cloud computing has dramatically emerging. Therefore, to protect the security of the electronic and digital data from being stolen directly on the Internet is a must. After surveying, both of the encryption and data hiding are suitable and adopted to achieve the purpose of information confidentiality in the paper. In addition, these two methods can also be used based on their characteristics of each algorithm in different fields to validate its effectiveness.
This thesis proposes an encryption algorithm - Rubik's Cube algorithm. First, the data are pretreated. With defined size of sub-blocks, we then divide the data into six sub-blocks, and then bind each sub-block to one of six surfaces of Rubik's Cube. Finally, the data on the surfaces are treated with partitions, translations and rotations operations. The algorithm use random numbers to determine the direction of displacements and number of flips for data encryptions. The levels of Rubik's Cube used in this research are 3×3×3. Each small square are with the same size. Empty blocks are padded with blank data
In addition, the thesis compare proposed algorithm with common encryption method, analyzing their strengths, weaknesses and applications.
