English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26988/38789
Visitors : 2346218      Online Users : 29
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/28516

Title: Fast Symmetric Keys Generation via Mutual Mirroring Process
Authors: Chun-Shun Tseng;Ya-Yun Jheng;Sih-Yin Shen;Jung-Hua Wang
Contributors: NTOU:Department of Electrical Engineering
Date: 2008
Issue Date: 2011-10-21T02:37:52Z
Publisher: 2008 IEEE World Congress on Computational Intelligence (WCCI 2008)
Abstract: Abstract:This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and receiver adopt a mirroring process based on an improved Hebbian rule that uses identical random inputs to separately train on their reciprocal outputs to generate a pair of exactly identical secret key strings. Important parameters are elaborately characterized to implement a fast information transmission for ephemeral key exchanging. We show that performance optimization can be achieved by coordinating the parameters. One essential feature of the proposed algorithm is that even an eavesdropper who acquires entire structure of the algorithm and the transmission data still has no chance to decrypt the encrypted message, thus ensuring security in the subsequent encryption task. Moreover, computation load is well bounded in an acceptable range despite the increasing key length.
Relation: pp.3162-3166
URI: http://ntour.ntou.edu.tw/handle/987654321/28516
Appears in Collections:[電機工程學系] 演講及研討會

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback