Ethical Hacking Tech- Basic Concepts

Brute force

An Attacker Can Perform The Hacking Technic Until Broke The Authentications. Like Combinations of username and password For Enter The Site Or Software until Find The Username and Password. In Modern Days It Can Strictly Prohibited But Some Sites Still Run With That Bugs.

SQL Injection

In This Bug May Be Found By Programmer Careless Coding.In The Hacking Technic Must Performed By SQL Query. An Attacker Can Attack The Sites For SQL Queries And Retrieve Required Data From Database or Modify The Data Bases.

shop

Xss(Cross Site Scripting)

Now Popular Sites Are Affected By This Bug.Its Preformed By JavaScript Coding. An Attacker Modify The Client Side Programming It May Be Affect The Entire Web Site.

Phishing

It is Trick. An Attacker Can Be Develop The Front-End Application Look Like Original Web Page . It s a Clone Not Original. Some User Can Provide the Information on That Phishing Site. Hacker Can Using Them.

Key Logger

Which is a Hidden Application on Your Computer.it Tracks The All Keyboard Inputs and stored It self. Then The Hacker Can Retrieve the logs and uses that information.

Cookie Theft

Cookies is a Tiny Information. That Stored In Web Browsers By Some Website For Remember The Basic Information about user. cookie Theft is a Technic to Retrieve the User Cookies.

Comments

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...

Run Length Encoding | Programming In Java

Given a string, Your task is to complete the function encode that returns the run-length encoded string for the given string. eg if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function encode that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function encode() which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity: O(N), N = length of a given string. Expected Auxiliary Space: O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*; class RLEncoding { public static void main(String[] args) ...

Sum Of Given Array Elements

public static void main( String [] args){ int [] arr={ 1 , 2 , 3 , 4 , 5 , 6 }; int n=arr.length; int sum= 0 ; for ( int i= 0 ;i<n;i++){ sum+=arr[i]; } System.out.println(sum); } } Java Programming /* Sum Of Given Array Elements Time Complexity O(n) */ class sumOfArray{

javacpp

Search This Blog