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: ...

Stack is Linear Data Structure- Basic DSA In Java Programming

/* Stack Is a Linear Data Structure.FIFO(First In First Out) or LIFO(Last In First Out). [ Elements ] [ Elements ] [ Elements ] [ Elements ] */ import java.util.*; class stack{ public static void main( String [] args){ Stack < Integer > s= new Stack < Integer >(); //Push Element To Stack s.push( 10 ); s.push( 5 ); s.push( 2 ); s.push( 1 ); System.out.println(s); /* After Push The Stack Like [ 1 ] <---Push And Pop In Top Of The Statck [ 2 ] [ 5 ] [ 10] */ //Pop Element From Statck s.pop(); System.out.println(s); /* After Pop From Stack [ 1 ]--> Pop From Top Of The Stack [ 5 ] [ 10] */ System.out.println(s.peek()); /* s.peek(); Shows Top Of The Stack */ /* s.empty() returns boolean V...

if control statement - Basic Programming Concepts With psudo Code

if( ) is a control statement. it based on some condition. if the condition can true the block of statements can execute other wise skip the statements. syntax if([condition]) { //statement; } example1, #include<stdio.h> #include<conio.h> main() int num=1; { if(num==1) { printf("\n its true"); } } from the above program we can declare the variable named as num and assign the value as 1. then, check the value 1 equal value of num through if statement.the statement can true.so, the block of statements can executed. example2, #include<stdio.h> #include<conio.h> main() int num=5; { if(num==1) { printf("\n its true"); } } suppose the value of num is 5.the block of if statement can skip to execution.

javacpp

Search This Blog