期刊文献+
共找到53篇文章
< 1 2 3 >
每页显示 20 50 100
Image Encryption Algorithm Based on a Hybrid Model of Novel Memristive Hyperchaotic Systems,DNA Coding,and Hash Functions
1
作者 Zhenglong Chong Cong Wang +2 位作者 Hongli Zhang Ping Ma Xinkai Li 《Complex System Modeling and Simulation》 EI 2024年第3期303-319,共17页
The design of a chaotic image encryption algorithm plays an essential role in enhancing information and communication security.The performance of such algorithms is intricately linked to the complexity of the chaotic ... The design of a chaotic image encryption algorithm plays an essential role in enhancing information and communication security.The performance of such algorithms is intricately linked to the complexity of the chaotic sequence and the underlying encryption algorithm.To additionally enhance the complexity of hyperchaotic systems,this study presents a novel construction of a Five-Dimensional(5D)memristive hyperchaotic system through the introduction of the flux-controlled memristor model.The system's dynamic characteristics are examined through various analytical methods,including phase portraits,bifurcation diagrams,and Lyapunov exponent spectra.Accordingly,the sequences produced by the hyperchaotic system,which passed the National Institute of Standards and Technology(NIST)test,are employed to inform the creation of a novelty image encryption technique that combines hash function,Deoxyribonucleic Acid(DNA)encoding,logistic,and Two-Dimensional Hyperchaotic Map(2D-SFHM).It improves the sensitivity of key and plaintext images to image encryption,expands the algorithm key space,and increases the complexity of the encryption algorithm.Experimental findings and analysis validate the exceptional encryption capabilities of the novel algorithm.The algorithm exhibits a considerable key space 2512,and the ciphertext image demonstrates an information entropy of 7.9994,with inter-pixel correlation approaching zero,etc.,showcasing its resilience against different types of attacks on images. 展开更多
关键词 image encryption memristive system HYPERCHAOTIC hash function deoxyribonucleic acid encoding
原文传递
On the Security of Multivariate Hash Functions 被引量:1
2
作者 罗宜元 来学嘉 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第2期219-222,共4页
Multivariate hash functions are a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations. Billet et al designed the hash function MQ-HASH and Ding et al propose... Multivariate hash functions are a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations. Billet et al designed the hash function MQ-HASH and Ding et al proposed a similar construction. In this paper, we analyze the security of multivariate hash functions and conclude that low degree multivariate functions such as MQ-HASH are neither pseudo-random nor unpredictable. There may be trivial collisions and fixed point attacks if the parameters of the compression function have been chosen. And they are also not computation-resistance, which makes MAC forgery easily. 展开更多
关键词 hash functions MACS MULTIVARIATE
原文传递
A New Black Box Analysis of Hash Functions Based on Block Ciphers
3
作者 达林 多磊 +1 位作者 Matt Henricksen 李超 《Journal of Shanghai Jiaotong university(Science)》 EI 2008年第6期664-669,共6页
For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and pro... For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and proved that 20 schemes are collision resistant.This paper improves the upper and lower bounds and make contrast with a hash constructed from a random oracle.These 20 schemes have only one kind of collision resistance upper and lower bounds.In addition, we present new advantages for finding second preimages. 展开更多
关键词 hash functions block cipher Merkel Damagard construction black box model
原文传递
(Identity-based)dual receiver encryption from lattice-based programmable hash functions with high min-entropy
4
作者 Yanyan Liu Daode Zhang +1 位作者 Yi Deng Bao Li 《Cybersecurity》 CSCD 2019年第1期271-285,共15页
Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primiti... Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols.In this paper,we obtain some results as follows.·Using weak lattice-based programmable hash functions(wLPHF)with high min-entropy(Crypto’16),we give a generic IND-CCA secure DRE construction in the standard model.Furthermore,we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.·For DRE notion in the identity-based setting,identity-based DRE(IB-DRE),basing on lattice-based programmable hash functions(LPHF)with high min-entropy,we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model.When instantiating with concrete LPHFs with high min-entropy,we obtain five concrete IB-DRE schemes. 展开更多
关键词 Dual receiver encryption Identity-based dual receiver encryption Lattice-based programmable hash functions with high min-entropy
原文传递
(Identity-based)dual receiver encryption from lattice-based programmable hash functions with high min-entropy
5
作者 Yanyan Liu Daode Zhang +1 位作者 Yi Deng Bao Li 《Cybersecurity》 2018年第1期559-573,共15页
Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primiti... Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols.In this paper,we obtain some results as follows.·Using weak lattice-based programmable hash functions(wLPHF)with high min-entropy(Crypto’16),we give a generic IND-CCA secure DRE construction in the standard model.Furthermore,we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.·For DRE notion in the identity-based setting,identity-based DRE(IB-DRE),basing on lattice-based programmable hash functions(LPHF)with high min-entropy,we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model.When instantiating with concrete LPHFs with high min-entropy,we obtain five concrete IB-DRE schemes. 展开更多
关键词 Dual receiver encryption Identity-based dual receiver encryption Lattice-based programmable hash functions with high min-entropy
原文传递
Numeric Identifier Transmission Algorithm Using Hash Function
6
作者 Vladyslav Kutsman 《Open Journal of Applied Sciences》 2023年第9期1581-1587,共7页
When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a ma... When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance. 展开更多
关键词 CRYPTOGRAPHY Security CODING hash functions ALGORITHMS Fintech BANKING Golang POSTGRESQL
下载PDF
QBIoT:A Quantum Blockchain Framework for IoT with an Improved Proof-of-Authority Consensus Algorithm and a Public-Key Quantum Signature
7
作者 Ang Liu Qing Zhang +3 位作者 Shengwei Xu Huamin Feng Xiu-bo Chen Wen Liu 《Computers, Materials & Continua》 SCIE EI 2024年第7期1727-1751,共25页
The Internet of Things(IoT)is a network system that connects physical devices through the Internet,allowing them to interact.Nowadays,IoT has become an integral part of our lives,offering convenience and smart functio... The Internet of Things(IoT)is a network system that connects physical devices through the Internet,allowing them to interact.Nowadays,IoT has become an integral part of our lives,offering convenience and smart functionality.However,the growing number of IoT devices has brought about a corresponding increase in cybersecurity threats,such as device vulnerabilities,data privacy concerns,and network susceptibilities.Integrating blockchain technology with IoT has proven to be a promising approach to enhance IoT security.Nevertheless,the emergence of quantum computing poses a significant challenge to the security of traditional classical cryptography used in blockchain,potentially exposing it to quantum cyber-attacks.To support the growth of the IoT industry,mitigate quantum threats,and safeguard IoT data,this study proposes a robust blockchain solution for IoT that incorporates both classical and post-quantum security measures.Firstly,we present the Quantum-Enhanced Blockchain Architecture for IoT(QBIoT)to ensure secure data sharing and integrity protection.Secondly,we propose an improved Proof of Authority consensus algorithm called“Proof of Authority with Random Election”(PoARE),implemented within QBIoT for leader selection and new block creation.Thirdly,we develop a publickey quantum signature protocol for transaction verification in the blockchain.Finally,a comprehensive security analysis of QBIoT demonstrates its resilience against cyber threats from both classical and quantum adversaries.In summary,this research introduces an innovative quantum-enhanced blockchain solution to address quantum security concernswithin the realmof IoT.The proposedQBIoT framework contributes to the ongoing development of quantum blockchain technology and offers valuable insights for future research on IoT security. 展开更多
关键词 IOT quantum blockchain public-key quantum signature quantum hash function
下载PDF
Optimized SHA-1 hash function implemented on FPGA 被引量:2
8
作者 薛也 胡爱群 《Journal of Southeast University(English Edition)》 EI CAS 2014年第1期13-16,共4页
In order to meet the needs of higher operation speed and lower energy consumption an optimized SHA-1 algorithm is proposed.It combines two methods loop-unfolding and pre-processing.In the process intermediate variable... In order to meet the needs of higher operation speed and lower energy consumption an optimized SHA-1 algorithm is proposed.It combines two methods loop-unfolding and pre-processing.In the process intermediate variables are introduced in the iterations and pre-calculated so that the original single-threading operation can perform in a multi-threading way.This optimized algorithm exploits parallelism to shorten the critical path for hash operations.And the cycles of the original algorithm are reduced from 80 to 41 which greatly improves the operation speed.Therefore the shortened iterations of the optimized design require a smaller amount of hardware resource thus achieving a lower energy consumption. The optimized algorithm is implemented on FPGA field programmable gate array .It can achieve a throughput rate of 1.2 Gbit /s with the maximum clock frequency of 91 MHz reaching a fair balance between operation speed and throughput rate.The simulation results show that compared with other optimized SHA-1 algorithms this algorithm obtains higher operation speed and throughput rate without compromising the security of the original SHA-1 algorithm. 展开更多
关键词 FPGA hash function loop unfolding pre-processing FPGA
下载PDF
An efficient hash-based authenticated key agreement scheme for multi-server architecture resilient to key compromise impersonation 被引量:3
9
作者 Inam ul haq Jian Wang +1 位作者 Youwen Zhu Saad Maqbool 《Digital Communications and Networks》 SCIE CSCD 2021年第1期140-150,共11页
During the past decade,rapid advances in wireless communication technologies have made it possible for users to access desired services using hand-held devices.Service providers have hosted multiple servers to ensure ... During the past decade,rapid advances in wireless communication technologies have made it possible for users to access desired services using hand-held devices.Service providers have hosted multiple servers to ensure seamless online services to end-users.To ensure the security of this online communication,researchers have proposed several multi-server authentication schemes incorporating various cryptographic primitives.Due to the low power and computational capacities of mobile devices,the hash-based multi-server authenticated key agreement schemes with offline Registration Server(RS)are the most efficient choice.Recently,Kumar-Om presented such a scheme and proved its security against all renowned attacks.However,we find that their scheme bears an incorrect login phase,and is unsafe to the trace attack,the Session-Specific Temporary Information Attack(SSTIA),and the Key Compromise Impersonation Attack(KCIA).In fact,all of the existing multi-server authentication schemes(hash-based with offline RS)do not withstand KCLA.To deal with this situation,we propose an improved hash-based multi-server authentication scheme(with offline RS).We analyze the security of the proposed scheme under the random oracle model and use the t4Automated Validation of Internet Security Protocols and Applications''(AVISPA)tool.The comparative analysis of communication overhead and computational complexity metrics shows the efficiency of the proposed scheme. 展开更多
关键词 Multi-server architecture Authenticated key agreement Registration server One-way hash function Key compromise impersonation
下载PDF
Security analysis of a one-way hash function based on spatiotemporal chaos 被引量:2
10
作者 王世红 单鹏洋 《Chinese Physics B》 SCIE EI CAS CSCD 2011年第9期79-85,共7页
The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefo... The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions. 展开更多
关键词 COLLISION spatiotemporal chaos hash function
原文传递
One-way hash function construction based on the spatiotemporal chaotic system 被引量:2
11
作者 罗玉玲 杜明辉 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第6期84-93,共10页
Based on the spatiotemporal chaotic system, a novel algorithm for constructing a one-way hash function is proposed and analysed. The message is divided into fixed length blocks. Each message block is processed by the ... Based on the spatiotemporal chaotic system, a novel algorithm for constructing a one-way hash function is proposed and analysed. The message is divided into fixed length blocks. Each message block is processed by the hash compression function in parallel. The hash compression is constructed based on the spatiotemporal chaos. In each message block, the ASCII code and its position in the whole message block chain constitute the initial conditions and the key of the hash compression function. The final hash value is generated by further compressing the mixed result of all the hash compression vulues. Theoretic analyses and numerical simulations show that the proposed algorithm presents high sensitivity to the message and key, good statistical properties, and strong collision resistance. 展开更多
关键词 hash value spatiotemporal chaos hash compression function
原文传递
One-way hash function based on hyper-chaotic cellular neural network 被引量:1
12
作者 杨群亭 高铁杠 《Chinese Physics B》 SCIE EI CAS CSCD 2008年第7期2388-2393,共6页
The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos ... The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability. 展开更多
关键词 one-way hash function HYPER-CHAOS cellular neural network Runge Kutta formula
原文传递
Hash-area-based data dissemination protocol in wireless sensor networks 被引量:1
13
作者 王田 王国军 +1 位作者 过敏意 贾维嘉 《Journal of Central South University of Technology》 EI 2008年第3期392-398,共7页
HashQuery,a Hash-area-based data dissemination protocol,was designed in wireless sensor networks. Using a Hash function which uses time as the key,both mobile sinks and sensors can determine the same Hash area. The se... HashQuery,a Hash-area-based data dissemination protocol,was designed in wireless sensor networks. Using a Hash function which uses time as the key,both mobile sinks and sensors can determine the same Hash area. The sensors can send the information about the events that they monitor to the Hash area and the mobile sinks need only to query that area instead of flooding among the whole network,and thus much energy can be saved. In addition,the location of the Hash area changes over time so as to balance the energy consumption in the whole network. Theoretical analysis shows that the proposed protocol can be energy-efficient and simulation studies further show that when there are 5 sources and 5 sinks in the network,it can save at least 50% energy compared with the existing two-tier data dissemination(TTDD) protocol,especially in large-scale wireless sensor networks. 展开更多
关键词 wireless sensor networks hash function data dissemination query processing mobile sinks
下载PDF
Hash function construction using weighted complex dynamical networks
14
作者 宋玉蓉 蒋国平 《Chinese Physics B》 SCIE EI CAS CSCD 2013年第4期172-177,共6页
A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then... A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency. 展开更多
关键词 hash function weighted complex dynamical networks chaotic map CRYPTOGRAPHY
原文传递
Constructing a one-way hash function based on the unified chaotic system
15
作者 龙敏 彭飞 陈关荣 《Chinese Physics B》 SCIE EI CAS CSCD 2008年第10期3588-3595,共8页
A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way has... A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way hash function algorithm is constructed with three round operations and an initial vector on an input message. In each round operation, the parameters are processed by three different chaotic systems generated from the unified chaotic system. Feed-forwards are used at the end of each round operation and at the end of each element of the message processing. Meanwhile, in each round operation, parameter-exchanging operations are implemented. Then, the hash value of length 160 bits is obtained from the last six parameters. Simulation and analysis both demonstrate that the algorithm has great flexibility, satisfactory hash performance, weak collision property, and high security. 展开更多
关键词 hash function unified chaotic system CRYPTOGRAPHY
原文传递
Message Authentication with a New Quantum Hash Function
16
作者 Yalan Wang Yuling Chen +1 位作者 Haseeb Ahmad Zhanhong Wei 《Computers, Materials & Continua》 SCIE EI 2019年第5期635-648,共14页
To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication sch... To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication schemes are being faced with big challenges.We take the message authentication as an example into a careful consideration.Then,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function.Firstly,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping attack.Secondly,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy implementation.Based on these two points,the message authentication scheme can be much more secure than previous ones.Finally,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the future.Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future. 展开更多
关键词 Message authentication symmetric encryption quantum hash function quantum walk
下载PDF
Hash function based on the generalized Henon map
17
作者 郑凡 田小建 +1 位作者 李雪妍 吴斌 《Chinese Physics B》 SCIE EI CAS CSCD 2008年第5期1685-1690,共6页
A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map... A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key, and it is easy to be realized and extended. 展开更多
关键词 the generalized Henon map hash function CHAOS
原文传递
Secure hash function based on chaotic tent map with changeable parameter
18
作者 Li Yantao Xiao Di Deng Shaojiang 《High Technology Letters》 EI CAS 2012年第1期7-12,共6页
A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position i... A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position index of blocked messages is chosen, and blocked massages translated into ASCII code values are employed as the iteration time of the chaotic tent map. The final 128-bit hash value is generated by logical XOR operation on intermediate hash values. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function. 展开更多
关键词 CHAOS the tent map hash function changeable parameter
下载PDF
The Vulnerability Analysis of Some Typical Hash-Based RFID Authentication Protocols
19
作者 Zhicai Shi Shitao Ren +1 位作者 Fei Wu Changzhi Wang 《Journal of Computer and Communications》 2016年第8期1-9,共9页
The low-cost RFID tags have very limited computing and storage resources and this makes it difficult to completely solve their security and privacy problems. Lightweight authentication is considered as one of the most... The low-cost RFID tags have very limited computing and storage resources and this makes it difficult to completely solve their security and privacy problems. Lightweight authentication is considered as one of the most effective methods to ensure the security in the RFID system. Many light-weight authentication protocols use Hash function and pseudorandom generator to ensure the anonymity and confidential communication of the RFID system. But these protocols do not provide such security as they claimed. By analyzing some typical Hash-based RFID authentication protocols, it is found that they are vulnerable to some common attacks. Many protocols cannot resist tracing attack and de-synchronization attack. Some protocols cannot provide forward security. Gy?z? Gódor and Sándor Imre proposed a Hash-based authentication protocol and they claimed their protocol could resist the well-known attacks. But by constructing some different attack scenarios, their protocol is shown to be vulnerable to tracing attack and de-synchronization attack. Based on the analysis for the Hash-based authentication protocols, some feasible suggestions are proposed to improve the security of the RFID authentication protocols. 展开更多
关键词 RFID Authentication Protocol VULNERABILITY hash Function Security and Privacy
下载PDF
Deployment of Hash Function to Enhance Message Integrity in Wireless Body Area Network (WBAN)
20
作者 Ahmed Alzubi Arif Sari 《International Journal of Communications, Network and System Sciences》 2016年第12期613-621,共10页
Message integrity is found to prove the transfer information of patient in health care monitoring system on the human body in order to collect and communicate the human personal data. Wireless body area network (WBAN)... Message integrity is found to prove the transfer information of patient in health care monitoring system on the human body in order to collect and communicate the human personal data. Wireless body area network (WBAN) applications are the fast growing technology trend but security and privacy are still largely ignored, since they are hard to achieve given the limited computation and energy resources available at sensor node level. In this paper, we propose simple hash based message authentication and integrity code algorithm for wireless sensor networks. We test the proposed algorithm in MATLAB on path loss model around the human body in two scenarios and compare the result before and after enhancement and show how sensors are connected with each other to prove the message integrity in monitoring health environment. 展开更多
关键词 Message Integrity WBAN Security Health Care Monitoring System hash Function Path Loss
下载PDF
上一页 1 2 3 下一页 到第
使用帮助 返回顶部