Research of Existing Security Problems in E-Commerce Sites and Defense Technology

2013 ◽  
Vol 380-384 ◽  
pp. 2519-2523
Author(s):  
Ji Fan ◽  
Fang Yong
Keyword(s):  
Pattern Matching ◽  
Security Issues ◽  
Commercial Activities ◽  
Defense Technology ◽  
Matching Performance ◽  
Bm Algorithm

With the development of network, e-commerce has gradually become a new mode of human commercial activities. China's e-commerce is just beginning, and there are good prospects for development. However, with a growing number of users, the security issues become increasingly prominent. Now, to protect e-commerce sites and the users' information and property of these websites is a matter of great urgency. The paper analyzes security problems that exist in the e-commerce sites, and brings forward an improved BM-algorithm to solve these threats, which is named BMHSA algorithm. This algorithm can provide significant improvement in pattern matching performance.

A Faster Pattern Matching Algorithm for Intrusion Detection

2012 ◽  
Vol 532-533 ◽  
pp. 1414-1418 ◽  
Author(s):  
Feng Du
Keyword(s):  
Intrusion Detection ◽  
Pattern Matching ◽  
Time Complexity ◽  
Matching Algorithm ◽  
Matching Performance ◽  
Bm Algorithm ◽  
Pattern Matching Algorithm ◽  
Improved Algorithm

In this paper, a Faster algorithm: BMF is proposed, which sets improvements in the time complexity of the BM algorithm. The BMF algorithm defines a new pre-calculation function to increase in the skips of pattern significantly. Experiments indicate that the time complexity is reduced by 63% at most. Therefore, the improved algorithm could provide significant improvement in pattern matching performance when using in an IDS.

scholarly journals Weak factor automata: the failure of failure factor oracles?

2014 ◽  
Vol 53 ◽  
Author(s):  
Loek Cleophas ◽  
Derrick G. Kourie ◽  
Bruce W. Watson
Keyword(s):  
Pattern Matching ◽  
Dna Sequences ◽  
Finite Automata ◽  
Compact Representation ◽  
Data Sets ◽  
Matching Algorithm ◽  
Weak Factor ◽  
Ex Post ◽  
Ex Post Facto ◽  
Matching Performance

In indexing of, and pattern matching on, DNA and text sequences, it is often important to represent all factors of a sequence. One efficient, compact representation is the factor oracle (FO). At the same time, any classical deterministic finite automata (DFA) can be transformed to a so-called failure one (FDFA), which may use failure transitions to replace multiple symbol transitions, potentially yielding a more compact representation. We combine the two ideas and directly construct a failure factor oracle (FFO) from a given sequence, in contrast to ex post facto transformation to an FDFA. The algorithm is suitable for both short and long sequences. We empirically compared the resulting FFOs and FOs on number of transitions for many DNA sequences of lengths 4 − 512, showing gains of up to 10% in total number of transitions, with failure transitions also taking up less space than symbol transitions. The resulting FFOs can be used for indexing, as well as in a variant of the FO-using backward oracle matching algorithm. We discuss and classify this pattern matching algorithm in terms of the keyword pattern matching taxonomies of Watson, Cleophas and Zwaan. We also empirically compared the use of FOs and FFOs in such backward reading pattern matching algorithms, using both DNA and natural language (English) data sets. The results indicate that the decrease in pattern matching performance of an algorithm using an FFO instead of an FO may outweigh the gain in representation space by using an FFO instead of an FO.

An Effective Pattern Matching Algorithm for Intrusion Detection

2014 ◽  
Vol 556-562 ◽  
pp. 3010-3013
Author(s):  
Qing Qing Zhang ◽  
Qian Zhang ◽  
Yue Jiang Feng
Keyword(s):  
Intrusion Detection ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Time Complexity ◽  
Detection System ◽  
Space Complexity ◽  
Experiment Data ◽  
Matching Algorithm ◽  
Bm Algorithm ◽  
Pattern Matching Algorithm

This paper makes a summary of pattern matching algorithm in Intrusion Detection System: KMP algorithm, BM algorithm and BMH algorithm algorithm. The performances of various algorithms are analyzed, and then through the experiment data is verified. Last an improved algorithm based on the BM algorithm: BMD is proposed. BMD algorithm can reduce the space complexity and maintain the time complexity by reducing a pretreatment function and recording the number of times that a bad char found in the pattern.

scholarly journals Secure Biometric Cryptosystem for Distributed System

2011 ◽  
pp. 27-32
Author(s):  
Manish Manoria ◽  
Ajit Kumar Shrivastava ◽  
Satyendra Singh Thakur ◽  
Debu Sinha
Keyword(s):  
Distributed System ◽  
High Performance ◽  
Security Assurance ◽  
Security Issues ◽  
Biometric Security ◽  
Rsa Algorithm ◽  
Matching Performance ◽  
Biometric Cryptosystem ◽  
Biometric Information

Information (biometric) security is concerned with the assurance of confidentiality, integrity, and availability of information in all forms, biometric information is very sophisticated in terms of all, in this work we are focusing on data pattern along with all security assurance, so that we can improve the matching performance with good security assurance, here one of the most effective RSA algorithm use with biometric (fingerprint) data. Our work includes the determination of appropriate key sizes with security issues and determines the matching performance using MATLAB and JDK1.6, performance of this system is more than 86.7% and when combines this with blind authentication techniques then we get all security assurance with high performance biometric cryptosystem.

Automated email answering by text-pattern matching: Performance and error analysis

2017 ◽  
Vol 35 (1) ◽  
pp. e12251 ◽  
Author(s):  
Eriks Sneiders ◽  
Jonas Sjöbergh ◽  
Alyaa Alfalahi
Keyword(s):  
Error Analysis ◽  
Pattern Matching ◽  
Matching Performance
Sign in / Sign up

Export Citation Format

Share Document