近年來在與資訊保密方面的資訊安全有著顯著的進步，但由於要求加解密時間的長短上讓加解密的技術上受到一定的侷限，另一方面由於網路技術迅速發展下，讓提供資訊儲存在網路空間有逐漸增加的趨勢。現今在這兩方面的進步下，其將資訊直接儲存於網路上的方法逐漸受到重視，目前除了加解密的技術也必須考慮資訊放置在網路上的安全問題。
本文提出了一種網路資訊傳輸架構，系統中採用Bluetooth以及視覺授權技術。而網路的自我配置與樹狀拓樸結構也適用於各種網路配置，因為這種配置方式對於管理人員識別是簡單且最適當的配置選擇，而在資訊傳輸安全的方面，由於透過視覺密碼的加密處理所以並不需要擔心加解密的過程耗時與資訊在伺服端遭受竊取，但是如果資訊遭受到管理方面破壞的話在這篇論文中並不加入討論。
本文所探討的視覺加密系統由於經過近年的技術探討讓可以被破壞程度到達接近百分之五十。而在資訊傳輸的方面也因為使用視覺授權，所以在傳輸的過程中被竊聽也無法獲得任何資訊。未來如果本系統被大量使用，則所有的伺服端都可以利用網路來進行資訊的傳輸或封包的交換，那麼資訊便可以不需要擔心遺忘以及遺失或者資訊遭受到竊取的問題。

In recent years the technology of encryption and decryption had great improved, As a result of the rapid development of Internet, the information stored in the network be take seriously gradually. The free web space which available on the Internet has grow up in recently. Not only the security of network resources, but also the technology of encryption and decryption must be considered. But in some special conditions, this technology is not enough to ensure the information security.
This paper presents module of wireless sensor in network information transmission, which used in Bluetooth technology. The tow type: Self-configuration and the tree topology are suitable for every network configuration. Because of this configuration is the simple one and most appropriate option. And it is safety in the information transmission, and un-suffered by thief in the server-side.
This article explored the visual system as a result of encryption technology of recent years, so that the damage can be arrived at close to 50%. And in the information transmission has also authorized the use of visual, so the process of transmission can not be tapped to obtain any information.If the system can be widely used in future, all the sub-server can use the wireless network to transmit information or the packet exchange. And the information will be able to carry easily and saved safety.

摘要
Abstract
目錄
圖目錄
表目錄
第一章導言
1.1概論
1.2視覺密碼的介紹
1.2.1視覺密碼的基本概念
1.2.2(k，n)組合架構
1.2.3存取構造
1.2.4視覺密碼常見的應用
1.3研究特點
1.3.1視覺密碼
1.3.2 量子神經網路
1.3.3 量子神經網路模型的特性
1.3.4藍芽的特性
1.3.5藍芽安全協定
1.4論文組織
第二章量子神經網路模型
2.1導言
2.2神經網路模型
2.2.1量子神經元執行方式
2.2.2系統能量的穩定性
2.3能量函數
2.3.1能量函數的性能
2.3.2干擾範圍的選擇
2.4方法完整性和收斂效率
2.4.1完整性定理
2.4.2收斂效率
2.4.3產生順序
2.4.4電腦模擬
2.5分析
2.5.1使用4位元A/D轉換器避免錯誤
2.5.2隨機發射順序
2.5.3建構一個發射的規則
第三章視覺密碼的技術
3.1導言
3.2半色調技術
3.3使用量子神經網路進行圖像半色調
3.3.1圖像表示
3.3.2圖像再處理與破壞恢復度
3.3.3半色調與恢復的使用
3.4 量子神經網路的(2,2)架構
3.4.1加密圖像架構說明
3.4.2能量函數的建置
3.4.3 量子神經網路(2,2)的規則
3.4.4像素的分配
3.5秘密隱藏
3.6視覺授權
3.7多工加密
3.7.1產生圖像
3.7.2實驗結果
3.8結論
第四章神經網路在視覺密碼上的應用
4.1導言
4.2系統架構
4.2.1系統概敘
4.2.2架設結構
4.2.3傳遞控制
4.2.4鄰近防護
4.3模擬狀況
4.4結果
4.5討論圖像破壞與修復的後的滿意度
第五章結論
參考文獻

[1] M. Naor and A. Shamir, "Visual Cryptography" Advances in Cryptology-Eurocrypt "94, Lecture Notes in Computer Science, vol. 950, pp. 1-12, 1995.
[2] G. Ateniese, C. Blundo, A. D. Santis, D. R. Stinson,"Visual Cryptography for GeneralAccess Structures", Information and Computation, vol. 129, no. 2, pp. 86-106, 1996.
[3] G. Ateniese, C. Blundo, A. D. Santis, and D. R. Stinson, "Extended Schemes for VisualCryptography," Theoretical Computer Science, 1996.
[4] C. Blundo, A. D. Santis, M. Naor. "Visual cryptography for grey level images," Infor-mation Processing Letters, vol. 75, pp. 255-259, 2000.
[5] L. A. MacPherson, Grey Level Visual Cryptography for General Access Structures, Mas-ter Thesis, Master of Mathematics in Computer Science, Waterloo, Ontario, Canada,2002.
[6] E. Verheul and H. V. Tilborg, "Constructions and Properties Of k out Of n Visual SecretSharing Schemes," Designs, Codes and Cryptography, vol. 11, No. 2, pp. 179-196, 1997.
[7] G. Ateniese, C. Blundo, A. D. Santis, and D. R. Stinson,"Extended Capabilities forVisual Cryptography," Theoretical Computer Science, 1999.
[8] B. Schneier, Applied Cryptography, John Wiley, second ed., 1996.[9] G.S. Vernam, “Ciper Printing Telegraph Systems for Secret Wire and Radio Telegraphic Communications," J. Amer. Inst. Elec. Eng., vol. 55, pp. 109-115, 1926.
[10] M. Naor, B. Pinkas, "Visual Authentication and Identification," CRYPTO, pp. 322-336,1997.
[11] T. W. Yue, A Goal-Driven Neural Network Approach for Combinatorial Optimizationand Invariant Pattern Recognition, Phd''s Thesis, Department of Computer Engineering,National Taiwan University, Taiwan, 1992.
[12] J. J. Hopfield, "Neural Networks and Physical Systems with Emergent Collective Com-putational Abilities," Proc. Natl. Acad. Sci. USA, vol.79, pp. 2554-2558, April 1982.
[13] J. J. Hopfield, "Neural Networks and Physical Systems with Emergent Collective Com-putational Abilities," Proc. Natl. Acad. Sci. USA, vol. 79, pp. 2554-2558, April 1982.
[14] J. J. Hopfield, "Neurons with Graded Response Have Collective Computational Prop-erties Like Those of Two-State Neurons," Proc. Natl. Acad. Sci. USA, vol. 81, pp.3088-3092, May 1984.
[15] R. P. Lippmann,"An Introduction to Computing with Neural Nets," IEEE ASSP Mag-azine, pp. 4-22, April 1987.
[16] K. Tsutsumi and K. Nakajima, "Dynamics and local minima of a simple neural networkfor optimization,", Proceedings. IJCNN, vol. 1 , pp. 353-358, 2001.
[16] E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machine, Wiley and Sons,Chichester, England, 1989.
[17] D. H. Ackley, G. E. Hinton, and T. J. Sejnowski, "A Learning Algorithm for BoltzmannMachine," Cognitive Science, vol. 9, pp. 147-169, 1985.
[18] H. Jeong, J. H. Park, “Lower Bounds of Annealing Schedule for Boltzmann and CauchyMachines," Proceeding IEEE International Joint Conference on Neural Networks, vol.1, pp. 581-586, 18-22 June 1989.
[19] Y. Takefuji and H. Szu, “Design of Parallel Distributed Cauchy Machines," Proceedingsof IEEE International Joint Conference on Neural Networks, vol. 1, pp. 529-532, 1989.
[20] Y. Akiyama, A. Yamashita, M. Kajiura, and H. Aiso, "Combinatorial Optimizationwith Gaussian Machines," Proceedings IEEE International Joint Conference on NeuralNetworks, vol. 1, pp. 533-540, 1989.
[21] B. Hajek, "Cooling schedules for optimal annealing," Mathematics of Operational Re-search, vol 13, pp. 311-329, 1988.
[22] S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, no. 4598, pp. 671-680, May 1983.
[23] M. R. Garey, R. L. Graham, and D. S. Johnson. "Some NP-Complete Geometric Prob-lems," In Conference Record of the Eighth Annual ACM Symposium on Theory of Com-puting, pp. 10-22, Hershey, Pennsylvania, 3-5 May 1976.
[24] M. R. Garey and D. S. Johnson, Computer and Tntractability： A Guide to the Theoryof NP-Completeness, New York, NY： Freeman, 1979.
[25] H. R. Lewis, C. H. Papadimitriou, "Elements of The Theory of Computation," pp. 275-351,Prentice Hall International Editions, 1998.
[26] B. DeBacker and H. Beringer, "Combinatorial Problem Solving in Constraint LogicProgramming with Cooperating Solvers", In C. Beierle and L. Plumer, editors. LogicProgramming： Formal Methods and Practical Applications, pp. 245-272, 1996.
[27] O. Eriksson, Y. Zhou, and A. Elofsson, "Side Chain-Positioning As An Integer Pro-gramming Problem," 1st Workshop on Algorithms in BioInformatics, WABI 2001, Pro-ceedings, Lecture Notes in Computer Science 2149, ISBN 3-540-42516-0, pp. 128-141,Springer 2001.
[28] T. W. Yue and S. C. Chiang, "Quench, Goal-Matching and Converge | The Three-Phase Reasoning Of a Q''tron Neual Network," Proceedings of the IASTED InternationalConference on Arti_cial and Computational Intelligence, pp. 54-59, 2002.
[29] A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11,pp. 612–613, 1979.
[30] M. Tompa and H. Woll, "How to share a secret with cheaters," J.Cryptol., vol. 1, no. 2, pp. 133–138, 1988.
[31] W.-G. Tzeng and C.-M. Hu,"Anewapproach for visual cryptography,"Designs, Codes, Cryptog., vol. 27, no. 3, pp. 207–227, 2002.
[32] E. R. Verheul and H. C. A. Van Tilborg,"Constructions and propertiesof k out of n visual secret sharing schemes," Designs, Codes, Cryptog,,vol. 11, no. 2, pp. 179–196, 1997.
[33] D. Q. Viet and K. Kurosawa, "Almost ideal contrast visual cryptographywith reversing," in Proc, Topics in Cryptology, 2004, vol. 2964,LNCS, pp. 353–365.
[34] C.-N. Yang, "New visual secret sharing schemes using probabilisticmethod,” Pattern Recognit. Lett., vol. 25, no. 4, pp. 481–494, 2004.
[35] C.-N. Yang and C.-S. Laih, "Some new types of visual secret sharingschemes,” in Proc. Nat. Computer Symp., 1999, vol. 3, pp. 260–268.
[36] G.S. Vernam, "Ciper Printing Telegraph Systems for Secret Wire and Radio TelegraphicCommunications," J. Amer. Inst. Elec. Eng., vol. 55, pp. 109-115, 1926.
[37] Y. Zhang, R.E. Webber, "Space Di_usion An Improved Parallel Halftoning TechniqueUsing Space_lling Curves," Proc. of SIGGRAPH 93, ACM Computer Graphics, Annual
Conference Series, pp. 305-312, 1993.
[38] Y. Zhang, "Adaptive Ordered Dither," CVGIP： Graphical Model and Image Processingvol. 59, no. 1, pp. 49-53, 1997.
[39] Y. T. Zhou, R. Chellappa, A. Vaid, and B. K. Jenkins, "Image Resoration Using aNeural Network," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 36, pp.
1141-1151, 1998.
[40] Z. Zhou, G. R. Arce, G. Di Crescenzo, "Halftone Visual Cryptography," Proceedings ofInternational Conference on Image Processings, vol. 1, pp. 521-524, 2003.
[41] R. Ulichney, Digital Halftoning, Cambridge, MA： MIT Press. third ed., 1990.
[42] E. Verheul and H. V. Tilborg, "Constructions and Properties Of k out Of n Visual SecretSharing Schemes," Designs, Codes and Cryptography, vol. 11, No. 2, pp. 179-196, 1997.
[43] Su-Chen Chiang"Visual Cryptography Using Q’tron Neural Networks".
[44] Bluetooth 1.06 Specification
[45] Wireless LAN Medium Accers Control (MAC) and Physical Layer(PHY)specifications: Higher-Spccd Physical Laycr Extension in thc 2.4GHz band, IEEE Std 802.1 Ib-I999
[46]M. Hashimoto, K. Term", T. Saito, 7. Okamoto, "A Home Network