Amol Wagh's Technology Blog

amol wagh test post

noreply@blogger.com (Amol Wagh) — Wed, 06 Oct 2010 05:39:00 +0000

बाबाजिंच्या

Official Gmail Blog: Tasks graduates from Gmail Labs

noreply@blogger.com (amol wagh) — Mon, 27 Jul 2009 17:58:00 +0000

http://www.seobloggingtips.com/general/gmail-introduces-tasks-feature-organizing/

Gmail Introduces Tasks Feature For Organizing Everything

noreply@blogger.com (amol wagh) — Mon, 27 Jul 2009 17:55:00 +0000

Official Gmail Blog: Tasks graduates from Gmail Labs

Free XBOX LIve ! ! !

noreply@blogger.com (Amol Wagh) — Thu, 01 Jan 2009 13:46:00 +0000

Anyone here think about getting xbox live but not have enough money to pay for the starter kit...

WELL GUESS WHAT!!!!!!!!

You can now get it without paying a cent (that is if you have a free 2 month trial)

First go to http://www.xbconnect.com/downloads.php and download the current version of XBConnect...

Secondly you must get a Ethernet cable and connect your X-BOX to your router (if you have, you MUST have one BTW)

Thirdly install and open xbconnect. Create a new account .......

Fourthly go on www.xbox.com/live and sign in your .NET passport and create a profile for xbox live

Fifthly open your xbox with a xbox live supported game and follow the setup for xbox live ....

And YOUR DONE!!!!!

Play Games On PS2 Without ModChip

noreply@blogger.com (Amol Wagh) — Thu, 01 Jan 2009 13:45:00 +0000

Here, you will learn the very easy method of making copies of your PS2 and normal Playstaion games so that they are playable on the PS2. This guide will provide you with all the information you need to burn PS2 games.

You will need the following things to burn PS2 games:
a computer with a cd burner
a blank cd-r (don't use the re-recordable type a.k.a. cd-rw)
CDRWIN – The version in this guide is 3.8D
FireBurner –
PS2 patcher –
GameShark 2 for PS2 - the GameShark 2 is available at most stores that sell video games, a few examples would be Best Buy, Circuit City, or Target. You want version 1.0 of the GameShark 2. I have heard that all other versions work, but I have only tested version 1.0. GameShark2 costs about 29.95. Believe me, its worth it!!!
and a PS2 to play the games.
Burning the PS2

The process of burning ps2 games is easy. It is really only a 3 step process.(read the game, patch the game, and burn the game.)

1) insert game into cd drive.

2) Open up CDRWIN and click on the extract disk/tracks/sectors button.

3) Your settings should be as follows:

For “extract mode” select disk image/ cue sheet
For “read options” select “raw”
For “error recovery” select “abort”
For “jitter correction” select “auto”
For “subcode analysis” select “auto”
Data Speed and Audio Speed should be the same
For “read retry count” type 0
For “subcode threshold” type 300
Make sure you selected the drive that your PS2 game is in

Make sure you typed in the file name (just type the name of the game) and Check the directory that you're putting your file in.

Then just press “start”

If you get an error in the middle of reading the disk that says something like “can't read sections xxxx-xxxxx of disk”, it is becase the disk is scratched and CDRWIN can't read it. Try to clean the disk, if that doesn't work you just have to use a different game (a different copy of the same game)

4) Once CDRWIN is done, click ok and then exit CDRWIN. Open up the PS2 patcher, select the game file you just created and patch it (make sure you select the “RAW” option.

5) Close the PS2 patcher, next open up Fireburner. Click on the visual cue burner button. When you created your .bin file (the game file) in CDRWIN, a .cue file should have automaticly been created. In that case, drag and drop the .cue file into the Fireburner window. If the .cue file was not created, just drag and drop the .bin file into the Fireburner window. After you have done that, right click (click with the right side button on your mouse) on your file in the Fireburner window, and select “Burn/Test burn”.

6) In the options window that appears, select your cdwriter, select your write speed(doesn't really matter), and make sure you select “Track at once (TOA) for the recording method. As for the options on the right side of the options window, make sure only the following are checked: “eject cd” and “close session”.

When you have selected the options, click ok and your PS2 game will burn. That's all you have to do to burn a game.
Burning a Playstion (PSone) game

1) If you want, you can spend 5 minutes using the same method as above to burn your playstation game, but its not necessary. For a playstation game (not PS2) all you need to do is use a program that lets you make an “exact copy” or a “backup disk (CDRWIN)” You don't need any selected options, you just need to start the game on the PS2 the same way you would a PS2 game.
Starting the game on your PS2

1) Now for the fun part (and challenging part the first couple of times) This may sound a little complicated at first, but after you do it 3 or 4 times, it's super easy. First things first, you must remove the front of your game drive on your PS2(not a big deal, it can snap on and off).

2) Now insert your gameshark 2 cd(make sure the gameshark memory card is in one of the 2 slots, doesn't matter which one.)

3) In the gameshark options, choose “start game”, then “without”. Your screen should read “Please insert game disk then press X to continue.”

4) Now this part can be trickey for beginners, so I will provide pictures

-the main purpose of this starting method is to open up the PS2 and swap the gameshark disk with your burned game without the PS2 knowing you did it. DO NOT press the eject button on the PS2!!!

-with the PS2 cd tray cover removed, you will be able to look in and see a while tab inside the PS2. With a credit card (or something like it) gently slide the white tab all the way over to the right, if you did it correctly, this should allow you to manually pull open the PS2 cd tray.

5) Next, take the gameshark disk out of the PS2 and put in your burned game.

6) Gently push the PS2 cd tray fully back into the PS2 (Don't press the eject button).

7) Now you need to slide that white tab all the way back to the left (its origional position). To do this you get a strong papper clip(needs to be a strong one) stick it into the PS2 on the right side of the white tab and push the tab back to the left.

If you pushed the tab all the way back to the left and did every thing else right, you are ready to play your game. Just press X on your PS2 controler and watch as your burned game loads. ( It may load slower than an original game, depending on the cd-r you are using, I use Verbatim cd-r's and have no problems.)

Download Programs Mentioned:
http://rapidshare.de/files/961808/PS2_Play.rar.html

Partitioning your HardDisk With Fdisk

noreply@blogger.com (Amol Wagh) — Thu, 01 Jan 2009 13:44:00 +0000

Partitioning involves creating logical units on your hard drive that are then addressed as different drive letters. Not only does it help to organize your data (program files on one drive, games on another, documents on another) but also to speed up your PC. This is so because the drive head has to move a lesser distance for accessing data within one partition. You can also have different filesystems and OSs on the same hard drive.

Partitioning can be done using ‘fdisk’ in DOS/Windows 9x or ‘disk management’ in Windows 2000/ NT/XP. We will describe the procedure for fdisk, since disk management is GUI driven and the basics otherwise remain the same. While several other commercial packages like Partition Magic are available, these utilities (fdisk, computer management) are bundled with their respective OSs. You need a bootable floppy with fdisk.exe, format.com, and sys. com utilities. Before starting, decide how many partitions you want to create and their sizes. You can create one primary and one extended partition using the DOS fdisk. The extended partition can then have multiple logical partitions. Boot your machine using the bootable disk, and do the following.

Run fdisk. The utility will show you a numbered menu from where you can create, view, or delete partitions
The utility first asks you whether you want to enable large disk support. Type Y (for yes) and press enter if your hard-drive capacity is more than 4 GB. Large disk support creates a FAT32 partition, which can be greater than 2 GB
Select the first option from fdisk menu to create a primary partition. Specify the partition size in megabytes or percentage size when prompted for it
Similarly, create an extended partition. Extended partitions by themselves do not appear as drive letters. Instead, logical partitions must be created in them, which are then assigned drive letters
Exit fdisk and reboot the computer
Fdisk automatically assigns drive letters to all the partitions. You’ll need to format each partition in order to use it. Use format.com for the same
Your hard drive is now ready for taking an OS.

Rapidshare Countdown Elimined

noreply@blogger.com (Amol Wagh) — Thu, 01 Jan 2009 13:43:00 +0000

Rapidshare Hacked, unlimited upload, no countdown

UNLIMITED download/upload
Its very easy to fool Rapid Share server if your IP address is assigned by your ISP. Just follow these simple steps:

clean up IE or netscape or Firefox cookie( In this case the one that belong to rapidshare website)
On Command prompt (open MS-DOS)
type -----> ipconfig /flushdns <---Enter
type -----> ipconfig /release <---Enter
type -----> ipconfig /renew <---Enter
type -----> exit <--------Enter

Or save these commands in a bat file and run it everytime you need to fool Rapidshare server. Remember to clean up rapidshare cookie in your temp Internet files folder.

Now you should be ready to download/upload as many files as you want from their server.

another way, get proxies from the internet and apply to the browser.
some of proxies might not work though...

Note:
If you are on a LAN and behind a router (using NAT, for example)---this will not work.
If you use a fixed proxy--- this will not work.
If you have a fixed IP address from your ISP or college or employer or whatever -- this will not work.
If you happen to get the same IP address from your DHCP server because it's assigned to you -- this will not work

NO waiting
THIS "cheat" for RAPIDSHARE DOWNLOADS eliminates the "WAITING" for the file. No more COUNTDOWNS. So heres what you do:

1. First, Find a rapidshare download.
2. Hit the FREE BUTTON, like always.
3. While your waiting for it to countdown, change the URL in the bar to:
Code:
java script:c(countdown = 0);
and hit ENTER or the GO button over and over. Eachtime you do so, it decreases 10-20 seconds. Few times and the link appears.
or you can simply do the code below ONCE
java script: for (i=0; i<30; i++) { c(); }

SEARCH eBOOK in FTP SEARCH ENGINE

noreply@blogger.com (Amol Wagh) — Thu, 01 Jan 2009 13:17:00 +0000

To find eBook in FTP Search, visit one of this website

http://search.ftphost.net/
http://www.filesearching.com/
http://reliz.ru/
http://www.narlytime.com/
http://amun.serveftp.com/
http://ftpsearch.tomsk.net/

e.g. if you want to search " Sams Teach Yourself " just type Teach Yourself, you will have some eBooks in some FTP servers.

also can be found w

Mozilla Firefox, Speed it up!

noreply@blogger.com (Amol Wagh) — Thu, 01 Jan 2009 13:17:00 +0000

Speed up Mozilla FireFox

--------------------------------------------------------------------------------

1. Type "about :config" in the adress field.
2. Set the value of network.http.pipelining to "true".
3. Set the value of network.http.pipelining.maxrequests to "100".
4. Set the value of network.http.proxy.pipelining to "true"
5. Set the value of nglayout.initialpaint.delay to "0" (not availible in newer versions)

Hide your files - One more secret

noreply@blogger.com (Amol Wagh) — Fri, 09 May 2008 05:18:00 +0000

Hi friends. You always are in the search of various amazing tricks which helps you to hide the important folders. This is a simple but a cool trick which will help you gain command over your data in the folders.
HIDE THE FILE.
a) First open command prompt .
b) Then type ‘attrib +s +h “path of the file”.
E.g. Attrib +s+h c:\ example \Abhijeet.
c) And surprise the file will be hidden.
d) This will hide the file.

UNHIDE THE FILE

a) Again open command prompt.
b) Then type ’attrib –s -h path of the file’.
c) E.g. Attrib –s-h c:\ example \Abhijeet.
d) And you will again gain the file.

This is the small but cool trick by the Abhijeet.

Just check me out

noreply@blogger.com (Amol Wagh) — Sun, 23 Mar 2008 16:39:00 +0000

http://www.magmypic.com/mags/view/६९१११९०

Hey guys Its me . Please tell me how am I looking

Create Fake Magazine Covers with your own picture at MagMyPic.com

Discount Magazine Subscriptions - Save big!

Vote for me:
http://www.magmypic.com/mags/view/6911190

Google - It should be named as garbage search

noreply@blogger.com (Amol Wagh) — Fri, 21 Mar 2008 16:49:00 +0000

You might be noticing me anti google person but if I tell you why you gonna join me too.

Fact is whenever you search anything in google you get so much , which you dont wanted and what you actually needed is on 1000thpage of google

Nobody will surf 1000 search files , Do you?

As an ethical hacker I have studied algorithm of how google make searches and who is on the top search.
Following are the things i noticed

1.Site having maximum frequency of visitors get more top ranking.

2.Most active site means regularly updated site is on top.

3. Frequency of blog if good its on top.

4.Finally more SEO friendly site is on top.

What all above things mean is If a site having very good content but it is not search engine friendly it will not display on google search .

Same case happen when we want something useful , rather than giving that things google gives us searches that we never needed.

So Am I So Angry On Google.com

Despite of all the facts 99% site gets there 60% traffic from google .
Even my blog get 40%% traffic from google.

But the fact is we belive in google so much that we definately click on its top page searches. And this how we get traffic.

So finally google gives so many databases of websites , opens passwords and cameras can be easily found on google using drawbaks of google.

So many senseitive things I cant discuss here only because of very wrong algorithm of google.
Google should make some limitation for its searches.

I know it will cost very much in time , moiney and intelligence but atleast world's top 2nd website can afford that

Isnt it ??

So I call the google search as garbage search.

Discuss freely whatever you think about my bad words about google.
I Will be pleasured to answer any of your questions.

Amol Wagh

Hacking by PHP exploit

noreply@blogger.com (Amol Wagh) — Fri, 21 Mar 2008 16:42:00 +0000

Blackhat hacker penguinman2100 demonstrates how to hack google to upload any hacker files or pictures to any website using PHP Photo exploits.

Disclaimer : The video content should not be used for illegal purposes . We do not take any responsibility of wrong use of this content.

Turkojan-4.0 Realesed : News

noreply@blogger.com (Amol Wagh) — Thu, 20 Mar 2008 13:32:00 +0000

What is Turkojan ?
-----------------------
Turkojan is a remote administration and spying tool for Microsoft Windows operating systems.

You can use Turkojan for manage computers,employee monitoring and child monitoring...

Features :
------------

Reverse Connection
Remote Desktop(very fast)
Webcam Streaming(very fast)
Audio Streaming
Thumbnail viewer

Remote passwords
MSN Sniffer
Remote Shell
Web-Site Blocking

Chat with server

Send fake messages

Advanced file manager

Zipping files&folders

Find files

Change remote screen resolution

Mouse manager

Information about remote computer

Clipboard manager

IE options

Running Process

Service Manager

Keyboard Manager

Online keylogger

Offline keylogger

Fun Menu

Registry manager

Invisible in Searching Files/Regedit/Msconfig
Small Server (100kb)

http://www.turkojan.com/ Download

Amol Wagh

Launching hackersenigma.com

noreply@blogger.com (Amol Wagh) — Wed, 05 Mar 2008 08:41:00 +0000

Hi all,
I am very pleased today to announce that the commercial version of www.windowsregistryexplained.blogspot.com is going to launch this month Named as Hacker's enigma.

The blog is changing host as well as platform for more convenience of users and me too.

This blog will be names as www.hackersenigma.com .

For all you users I am keeping our blog windows registry explained on the blogger as it is and I ll post on both for you bu all different posts from each other.

I want all of your support for my this step.

Wish me luck for this.

I assure you to serve more good ethical hacking tips at our new blog hackers enigma.

For commercial reasons this blog will stay as it is on blogger.

I will announce as soon as my new blog will be ready .
So wait for my announcements.

Have nice time
and thanks for being the visitor of www.windowsregistryexplained.blogspot.com

Amol Wagh
Ethical hacker

Smorty Post - The Review

noreply@blogger.com (Amol Wagh) — Tue, 04 Mar 2008 17:53:00 +0000

This is a Paid Review on www.smorty.com

Advertisers are always in a search of bloggers to review their products and websites. And in same way blogers wanted to blog for money too. But fat is the finding an advertiser or blogger as we wish is not an easy fact.

blog advertising therefore made an interface where bloggers and advertisers where blogger can easily get exposed to advertisers find relevant advertiser to their blog. Smorty system only accepts quality bloggers who can write professionally and this is why advertisers have no problem at all using smorty.

For bloggers smorty made its own 5 start ranking system with which they get higher possible payment as per their rating. And so it’s also easy for advertisers to select a good blogger from all as per requirement. Bloggers get paid for blogging with satisfactory system of both advertisers and bloggers. And by this way blog advertising also takes place for that blogger means two way earning.

Easy to understand interface for both bloggers and advertisers made system more and more easy. No worries for payment as smorty pays through pay pal as early as possible. No extra waiting for payments. That is why bloggers also prefer to use smorty.

Advertisers take review of post first for 5 days and then only accept it by which advertisers can ensure the quality otherwise they can decline post. So system is also friendly with advertisers.

I am using this system from some days as a blogger and I am getting a very good experience with this site.

If I have to rate this site I will give blog advertising 10/10 for bloggers and advertisers.

Click here for more details : blog advertising

Ashop E-commerce - A Revolutionary Concept

noreply@blogger.com (Amol Wagh) — Mon, 03 Mar 2008 13:32:00 +0000

Review on Ashop Ecommerce System

Scenario for Businessmen in past:

Many businessmen from the long time are facing the problem of creating a good business website for their product. Even after spending lot of their earnings they can’t manage their websites due to lack of knowledge in web designing. And why should not they face the problem? There job is to make good products and do business. Not to learn how to manage websites.

New Concept of web management :

When I came across this website shopping cart software,I think that this place is perfect solution for such businessmen. They have a shopping cart software which is easily accessible.
They have designed the team of web designing and maintaining experts , who work for best design for your products promotion as you client need it.
It’s not like other dead services which gives you software interfaces and expect you can manage your website. Difference is here , Ashop E-commerce gives you technical support and customer service so that they can help you whenever you are in trouble.

Other eye catching features of this e-commerce software are as follows :

Search engine friendly design : So no worries for search engine optimization.

Shopping cart system by which you can select good cost for your product.

Security : Security from all internet threats and fraud alert service which ensures safety of your design.

Customizable design : Designs which can be fully modified as per your product without any restrictions.

Low cost : Affordable cost for all business owners. Then what else anyone need.

Good hosting and free emails.

Final words:

I am an ethical hacker and I think there setup is secure enough to host a business promotional website.
I’ll give this site 9/10 for this site . And appreciate all their team who have designed this revolutionary concept. As I suggest Businessmen should now stop worrying about creating and managing there websites. Trust this E-commerce software without any hassles.

Click here for choosing this service :shopping cart software

Trojans : By Amol Wagh

noreply@blogger.com (Amol Wagh) — Fri, 29 Feb 2008 13:45:00 +0000

Article by : Amol Wagh
Trojans , types of trojan , know trojans, Everything you wanna know about trojans

Trojan horses present more difficulties in definition than at first appears. Whereas viruses are defined primarily by their ability to replicate, Trojans are primarily defined by their payload, or, to use a less emotive term, their function. Replication is an absolute value. Either a program replicates, or it doesn't. Damage and intent, however, are not absolutes, at least in terms of program function.
The first clue to their nature lies in ancient history and classical mythology. Around the 12th century B.C., Greece declared war on the city of Troy.
The dispute arose when Paris, variously described as a shepherd boy and as prince of Troy, abducted Helen, the wife of Menelaus, king of Sparta, and reputed to be the most beautiful woman in the world. The Greeks gave chase and engaged Troy in a 10-year war, but failed to take the city. This, of course, is the central plot of Homer's Iliad. Finally, the Greek army withdrew, leaving behind a huge wooden horse.

Greece's finest soldiers hid silently inside. The people of Troy saw the horse and, thinking with stunning naivete that it was a gift, brought it inside their city. That night, Greek soldiers under the leadership of Odysseus emerged from the horse, and opened the gates to the rest of the Greek army, who destroyed the city. In computing terms, the term Trojan horse is most often applied to an apparently attractive program concealing in some way an unpleasant surprise. Trojans work similar to the client-server model.
Trojans come in two parts, a Client part and a Server part. The attacker deploys the Client to connect to the Server, which runs on the remote machine when the remote user (unknowingly) executes the Trojan on the machine. The typical protocol used by most Trojans is the TCP/IP protocol, but some functions of the Trojans may make use of the UDP protocol as well. When the Server is activated on the remote computer, it will usually try to remain in a stealth mode, or hidden on the computer. This is configurable.
It is usual for Trojans to also modify the registry and/or use some other auto starting method. Many Trojans have configurable features like mailing the victim's IP, for example Pro Rat trojan, as well as messaging the attacker via ICQ or IRC. Also there are websites with ActiveX servers imbedded in them were any one using Internet explorer goes on the site and the attachment installs its self with out any warning.
This is relevant when the remote machine is on a network with dynamically assigned IP address or when the remote machine uses a dial-up connection to connect to the Internet. DSL users on the other hand, have static IPs so the infected IP is always known to the attacker.
Most of the Trojans use auto-starting methods so that the servers are restarted every time the remote machine reboots / starts. This is also notified to the attacker. As these features are being countered, new auto-starting methods are evolving. The start up method ranges from associating the Trojan with some common executable files such as explorer.exe to the known methods like modifying the system files or the Windows Registry.
Some of the popular system files targeted by Trojans are Auto start Folder, Win.ini, System.ini, Wininit.ini, Winstart.bat, Autoexec.bat Config.sys. Could also be used as an auto-starting method for Trojans Explorer Startup.

Registry is often used in various auto-starting methods.

[HKEY_LOCAL_MACHINESoftwareMicrosoftWindowsCurrentVersionRun]
" Info"="c:directoryTrojan.exe"
[HKEY_LOCAL_MACHINESoftwareMicrosoftWindowsCurrentVersionRunOnce]
" Info"="c:directoryTrojan.exe"
[HKEY_LOCAL_MACHINESoftwareMicrosoftWindowsCurrentVersionRunServices]
" Info"="c:directoryTrojan.exe"
[HKEY_LOCAL_MACHINESoftwareMicrosoftWindowsCurrentVersionRunServicesOnce]
" Info="c: directoryTrojan.exe"
[HKEY_CURRENT_USERSoftwareMicrosoftWindowsCurrentVersionRun]
" Info"="c:directoryTrojan.exe"
[HKEY_CURRENT_USERSoftwareMicrosoftWindowsCurrentVersionRunOnce]
" Info"="c:directoryTrojan.exe"

Registry Shell Open methods

[HKEY_CLASSES_ROOTexefileshellopencommand]
[HKEY_LOCAL_MACHINESOFTWAREClassesexefileshellopencommand]

A key with the value "%1 %*" should be placed there and if there is some executable file placed there, it will be executed each time a binary file is opened. It is used like this: trojan.exe "%1 %*"; this would restart the Trojan.
ICQ Net Detect Method
" [HKEY_CURRENT_USERSoftwareMirabilisICQAgentApps]
This key includes all the files that will be executed if ICQ detects Internet connection. This feature of ICQ is frequently abused by attackers as well.
ActiveX Component method
" [HKEY_LOCAL_MACHINESoftwareMicrosoftActiveSetupInstalledComponentsKeyName] StubPath=C: directoryTrojan.exe

These are the most common Auto-Starting methods using Windows system files, and the Windows registry.
The main Transmission of trojans are known to be by ICQ, IRC Attachments, Physical Access Browser And E-mail, Software Bugs with binded trojans, NetBIOS, Fake Programs, Un-trusted Sites, Freeware Software and most common of all is P2P File sharing! Yes that's Kaaza, Bear Share, Limewire and list goes on. Visit stop [bad] ware to learn about many free ware wich are bad and may carry spyware or even trojans!

So how do you go about finding and removing Trojans? Download and lean how to use TCPView. TCPView is a Windows program that will show detailed listings of all TCP and UDP endpoints on the system, including the local and remote addresses and state of TCP connections. On Windows NT, 2000 and XP TCPView also reports the name of the process that owns the endpoint. Best way to check for Trojans is close any open browsers let pc go in state of rest and open TCP view, once you see a connection established when youÒre not using anything and there is no signatures of the process than it might be a trojan. Another method is to view your Process. Simply hit [ALT] [CTRL] [DELETE] and it will list all of your running Process. Look for anything that you know might be suspicious or a trojan.
If you don't have a copy of Ad-Aware that you should go to there website and get one which helps remove many trojans and spyware. www.lavasoft.de/software/adaware/ . Sometimes you may run into trojan (trojans server.exe) that wont allow you to delet it and gives you errors like write protected or its in-use. You will need to run "Unlocker" and remove it that way. What are some other stealth ways Trojans can get on your pc and be remote controlled? The method is called ICMP Tunneling. ICMP tunneling is a method of using ICMP echo-request and echo-reply as a carrier of any payload an attacker may wish to use, in an attempt to stealthily access, or control a compromised system. This method makes it harder to find running server like TCP or UDP. The Internet Control Message Protocol is an adjunct to the IP layer. It is a connectionless protocol used to convey error messages and other information to unicast addresses . ICMP packets are encapsulated inside of IP datagram. The first 4-bytes of the header are same for every ICMP message, with the remainder of the header differing for different ICMP message types. There are 15 different types of ICMP messages.
Covert Channels are methods in which an attacker can hide the data in a protocol that is undetectable. Covert Channels rely on techniques called tunneling, which allows one protocol to be carried over another protocol.
A covert channel is a vessel in which information can pass, but this vessel is not ordinarily used for information exchange. Therefore, as a matter of consequence, covert channels are impossible to detect and deter using a system's normal (read: unmodified) security policy. In theory, almost any process or bit of data can be a covert channel. In practice, it is usually quite difficult to elicit meaningful data from most covert channels in a timely fashion. This makes it an attractive mode of transmission for a Trojan.
The attacker can use the covert channel and install the backdoor on the target machine. The concept of ICMP Tunneling is simple: arbitrary information tunneling in the data portion of ICMP_ECHO and ICMP_ECHOREPLY packets.
This exploits the covert channel that exists inside of ICMP_ECHO traffic. This channel exists because network devices do not filter the contents of ICMP_ECHO traffic. They simply pass them, drop them, or return them. The Trojan packets themselves are masqueraded as common ICMP_ECHO traffic. We can encapsulate (tunnel) any information we want. So what are come counter measure to protect your self from this attack? Configure your firewall to block ICMP incoming and outgoing echo packets. Blocking ICMP will disable ping request and may cause inconvenience to users. Most new firewall have this option. Last thing I want to stress is make sure your not with out a firewall or Anti-Virus and allways updating them.

[Types of Trojans]

Privacy-Invasive Trojans

Privacy-invasive Trojans generally perform some function that reveals to the programmer vital and privileged information about a system or otherwise compromises that system. Passwords are, for obvious reasons, a very common target.

They can also (or instead) conceal some function that either reveals to the programmer vital and privileged information about a system or compromises that system.

Some anti-virus companies have differentiated between PC-specific privacy-invasive Trojans and destructive Trojans by restricting the use of the term Trojan to destructive programs. They use the term password stealers for the most common privacy-invasive programs. In the latter half of the 1990s, password-stealing programs aimed specifically at AOL users seemed to become very common (some estimates at the number of such programs rose to many hundreds). Some anti-virus software uses an APS identifier for such programs, probably standing for AOL Password Stealer. However, AOL is not and never was the only vulnerable service. In their paper Where There's Smoke, There's Mirrors, Sarah Gordon and David Chess describe running user simulations on AOL over a seven-month period. While attempts were made to gain their dummy users'screen passwords, these attempts generally used direct social engineering techniques by correspondents masquerading as AOL staff, rather than indirectly with password stealing programs.

[Back Door Trojans]

Trojans have, from time to time, been planted in legitimate applications. Ken Thompson describes in Reflections on Trusting Trust a number of interesting (not entirely hypothetical) scenarios, the most famous being the Trojanized compiler scenario. In this case, production software offers the means of privileged access to anyone knowing of the back door or trapdoor described.

Back doors and trapdoors offering unauthorized access (and maybe modification) are not the only instances of unauthorized code introduced into legitimate programs, however. Many Mac owners who bought a certain brand of third-party keyboard with a Trojan hardcoded into ROM chip found that the text "Welcome Datacomp" was inserted into their documents at apparently random intervals. PC motherboards with a Trojanized BIOS were characterized by "Happy Birthday" played through the system loudspeaker at boot-up, apparently on the programmer's birthday.

[Remote Access Tools (RATs)]

Though few anti-virus vendors would claim to detect all known Trojans, most do detect at least some on the platforms for which they have products, especially those Trojans that do direct damage. Remote Access Tools (RATs) such as Netbus and Back Orifice, however, straddle a line between legitimate systems administration (similar to that carried out by programs such as PC Anywhere) and covert unauthorized access. When the system owner is persuaded to run the installation program, a server program is installed that can be accessed from a client program on a remote machine without the knowledge of the user. The server is used to manipulate the victim machine.

Functionally, there might be no difference between a RAT and a "legitimate" tool. The difference lies not in the functionality, but in the facilitation of the covert availability of that functionality to unauthorized individuals. As with sniffers and network scanners, it's not what the program does so much as the reason it's being used. Yet if RAT software is willingly installed, opening the system to an attack the user does not expect, does that make it a Trojan? Using Microsoft Word also makes the user vulnerable to attacks he might not have anticipated. It was, for instance, literally years before some computer users realized that using versions of Word and other Microsoft Office applications supporting macro languages made them vulnerable to macro viruses and Trojans. Does that make Bill Gates a Trojan author? No, because the functionality in this case is too generalized to be described as a back door. However, a RAT broadcasting its presence to a hacker, who probes a characteristic range of port numbers, can certainly be described as a back door Trojan. It promotes the intentions of the author and subverts the expectations of the victim.

This is a serious issue—not least in that the "Bad Guys" frequently allude to the shortcomings of legitimate software (especially Microsoft's) as if unforeseen bugs in Office justified their own premeditated activities.

Nonetheless, some RAT authors have exploited this ambivalence by producing "Professional" versions of such software and charging for them. This allows the authors to complain of the anti-capitalist, anti-competitive behavior of security vendors who detect their program as a Trojan (or, all too often and inaccurately, a virus). It works, too. Several anti-virus vendors have dropped detection of the Professional version of Netbus, despite the murkiness of its antecedents and its continuing potential for misuse. Others have gone out of their way to distinguish between standard Netbus Pro installations and Trojanized installations.

[Droppers]

A dropper is a program that is not itself a virus, but is intended to install a virus. Curiously, given the popular association of Trojans and viruses, droppers are a comparatively rare entry point for viruses in the wild (see the preceding chapter on viruses). In the PC world, dropper programs are most commonly associated with transporting boot sector viruses across networks, and can be used for that purpose by both pro- and anti-virus researchers. They can be used as a covert means of introducing a virus onto a system, if the victim can be persuaded by social engineering techniques to run the dropper program.

Droppers have been used surprisingly frequently in the Mac world, though. The MacMag virus was introduced via a HyperCard stack called New Apple Products. The Tetracycle game was implicated in the original spread of MBDF. ExtensionConflict is supposed to identify conflicts between extensions (now there's a surprise), but installs the SevenDust virus. Both SevenDust and MBDF are still being reported in the field. Back in the PC world, the Red Team alert muddied the waters by attaching a virus dropper alleged to be a fix for a virus that didn't and couldn't possibly exist.

[Jokes]

Joke programs are almost as old as computing. One venerable example is the PDP Cookie program, which popped up and asked the victim for a cookie. PC and Mac users have both long been delighted or irritated by such programs. Confusion has arisen due to the habit of anti-virus software of alerting (using the word virus) not only on viruses and Trojans, but on joke programs such as CokeGift. This widely distributed program offers the victim their CD tray as a holder for their fizzy drink (or possibly white powder for nasal ingestion or carboniferous fossil fuel). Cute for some, irritating for others, but not exactly life-threatening. However, the practice of alerting on joke programs might have arisen in response to supposed joke programs that threaten to format disks, or claim to have done so, but make no such actual attempt. Indeed, there have been instances when, what one vendor has reported as a Trojan, another vendor reported as a joke.

[Bombs]

Logic bombs are malicious programs that execute their payload when a preprogrammed condition is met. When the trigger condition is a time or date, the term time bomb may be used. A time-out is a logic bomb sometimes used to enforce contract terms. Characteristically, the program stops running unless some action is taken to indicate (for instance) that the license fee has been paid, or the contractor who wrote the code has been paid. It's not unknown for a contractor to introduce some more drastic time bomb to be triggered if a dispute over payment arises.

The use of the word bomb does suggest a destructive payload, but this need not, in fact, be the case. Mail bombs and subscription bombs, which don't really belong in a chapter on Trojans, are DoS (Denial-of-Service) attacks intended to inconvenience the victim by battering his or her mailbox with a barrage of mail. Often this is done by subscribing the victim to large numbers of mailing lists. Email Trojans certainly exist, although email is more commonly an infection vector for viruses and worms.

The term ANSI bomb usually refers to a mail message or other text file that takes advantage of an enhancement to the MS-DOS ANSI.SYS driver. This allows keys to be redefined with an escape sequence, in this case, to echo some potentially destructive command to the console. Such programs were at one time quite frequently reported on Fidonet. However, nowadays few systems run programs that require ANSI terminal emulation, and ANSI.SYS is not normally installed in Windows 9x or later.

There are alternatives to ANSI.SYS that don't support keyboard redefinition, or allow it to be turned off.

[Rootkits]

A rootkit is an example of a set of trojanized system programs that an intruder who manages to root-compromise a system might be able to substitute for the commands'standard equivalents. Examples include modified versions of system utilities such as top and ps, allowing illegitimate processes to run unnoticed; daemons modified to compromise log entries or hide connections; utilities gimmicked to enable escalation to root privileges or to hide rootkit component files or other backdoor functionality (secret passwords to allow privileged access, for instance). Associated programs include packet sniffers and utmp/wtmp editors (used to doctor log files).

Rootkits exist for a number of flavors of UNIX, and are appearing in NT versions. However, one-off Trojanized versions of login (that is, versions not included in a suite of programs such as a rootkit) have been used, for instance, to harvest passwords since Pontius programmed in PILOT.

You can find information on rootkits in the FAQ at http://staff.washington.edu/dittrich/misc/faqs/lrk4.faq.

Sarah Gordon's paper Publication of Vulnerabilities and Tool (Proceedings of the Twelfth World Conference on Computer Security, Audit and Control, 1995) includes a technical analysis of some rootkit components.

[DDoS Agents]

DDoS (Distributed Denial-of-Service) tools like Stacheldraht, TFN2K, and Trinoo are Trojans designed with a very specific purpose. They are intended to bring down Internet servers by remotely coordinating packet-flooding attacks from multiple machines. Typically, the intruder controls a number of master machines. These, in turn, control daemons on remote machines. Covertly installed, their presence is often concealed by the installation of rootkits. Daemons can be installed on many hundreds of remote machines, all directing flooding attacks at the victim system.

Detailed analysis of DDoS attacks and counter-attacks is beyond the scope of this chapter. However, the installation and presence of a DDoS attack tool can be detected by the same means as other malware. That is, recognition of a specific search string (Known Something Detection), heuristic scanning, and change detection. Virus scanners usually detect known DDoS tools. Network traffic can be monitored for characteristics such as IP packets with spoofed source addresses. Intrusion detection systems can be configured to scan for patterns characteristic of communications between master software and daemon software.

[Worms]

In principle, this should probably be the longest subsection in this chapter. Many system administrators now apply the term Trojan to what the author of Chapter 17, "Viruses and Worms," described as worms. While I regard this usage as misleading, it is defensible, common, and can't be ignored.

It's defensible because, as discussed in Chapter 17, most present-day worms are reliant on social engineering to persuade the recipient to execute the malicious code. In other words, they conform to one of the definitions we've previously examined suggesting that Trojans are programs that purport to do one (desirable) thing while actually doing some other (less desirable) thing.

The usage is misleading because it defies the definition of Trojans as non-replicative malware. In the virus business, most people hold the view that viruses and worms replicate. Some believe that the class worm is a subset of the class virus, and many regard Trojans as non-replicative. These distinctions are not just academic. To fight malicious code effectively, we need to understand how it works, and distinctions are particularly important when we come to examine a multipartite threats such as MTX or LoveLetter. Modern mail-borne malware might include components which can be described as parasitic (a file virus), a worm (a network virus that doesn't infect other files by direct attachment), and/or a classic Trojan.

[Trojan Security]

Trojans frequently masquerade as games, joke programs, screensavers, and other programs frequently exchanged by email, especially when strict system policies or security policies are not enforced. If software contains a privacy-invasive Trojan or a destructive Trojan with a delayed payload (a time bomb or other form of logic bomb, for example), the Trojan might be distributed by a victim who is not yet aware that the program is malicious.
Compiled binaries are not the only places you'll find Trojans. Batch files and other shell scripts, Perl programs, and perhaps even code written in JavaScript, VBScript, or Tcl can carry a Trojan. Scripting languages have been described as unsuitable for the creation of Trojans if the code remains humanly readable.
This increases the victim's chances of discovering the offending code. In real life, though, victims often seem quite happy to run unchecked code, even when it's humanly readable.

The LoveLetter virus was executed by countless recipients, even though the cleartext code clearly included a subroutine whose very name indicated that it was intended to infect files. Nesting a Trojan within such code is, however, more feasible if the file is part of a much larger package—for example, if the entire package extracts to many subdirectories.

In such cases, the complexity of the package can reduce the likelihood that a human being, using normal methods of investigation, would uncover the Trojan, especially if it's an easily overlooked short sequence like DELTREE C:\ or rm -rf. Trojans don't usually announce their intent. Worse still, many Trojans masquerade as legitimate, known utilities that you'd expect to find running on the system.
Thus, you cannot rely on detecting a Trojan by listing current processes. In detecting a Trojan by eye, much depends on the user's experience. Users who know little about their operating systems are less likely to venture deep into directory structures, looking for suspicious files. More proficient users are unlikely to have time to examine the complex system structures of modern operating systems, especially on server-class machines. Even experienced programmers can have difficulty identifying a Trojan, even when the code is available for their examination. Identification of malicious code by reverse-engineering can be more difficult and time-consuming by orders of magnitude.

New Trojans are difficult to detect using heuristic detection. (Unless you use the somewhat sweeping heuristic that a change in a file detected automatically is likely to indicate a Trojan substituted for a legitimate file.) There is no absolute test for code to determine whether it is (or is not) a Trojan because author intent and user expectations are not generally susceptible to automated analysis.
In most cases, Trojans are found in binaries, which remain largely in non-human-readable form. However, the fact that the code is largely static does make Trojans at least as susceptible to "known-something" detection as viruses. In other words, when a known malicious program is identified, it can be detected by software updated with an appropriate search string. Remember that, by most definitions, replication is not a characteristic of the Trojan breed. Trojans spread through the action of being copied by an attacker or a victim socially engineered into carrying out the attacker's wishes, not by self-copying.
Thus it is not usually feasible for an attacker to utilize techniques such as polymorphism to reduce the chance of detection. Since the copying of the program is not a function of the program itself, the program has no means of evolving into a nonidentical copy (a morph) of itself.
Nevertheless, undetected Trojans can lead to total system compromise. A Trojan can be in place for weeks or even months before it's discovered. In that time, a cracker with root privileges could alter the entire system to suit his or her needs. Even when the Trojan is discovered, many hidden loopholes might be left behind when it is removed.

More commonly, the process described as object reconciliation is known as change detection, integrity checking, or integrity management. However, these terms are not strictly synonymous.

Change detection simply describes any technique that alerts the user to the fact that an object has been changed in some respect.

Integrity checking has the same core meaning, but is often taken to imply a more sophisticated approach, not only to detecting change in spite of attempts to conceal it, but to ensuring that the reporting software itself is not subverted.

Integrity management is a more general term. It can include not only the detection of unauthorized changes, but other methods of maintaining system integrity. Such methods can include some or all of the following, in no particular order:

- Maintaining trusted backups

- Blocking unknown intrusions at entry

- Maintenance of strict access control

- Careful application of manufacturer patches to block newly discovered loopholes

- A finely engineered change-management system, using only signed (trusted) code.

A simple method of testing file integrity, is based on reports of changes in file state information. Different file integrity tests vary in sophistication. For example, you can crudely test a file's integrity using any of the following indexes:

- Date last modified

- File creation date

- File size

Amol Wagh

Storing passwords securely

noreply@blogger.com (Amol Wagh) — Sun, 17 Feb 2008 05:16:00 +0000

Written By : Amol Wagh

User passwords

When writing an authorisation method for your web site it is important to consider the storage of user passwords. Storing passwords in plain text in your database has to be avoided at all costs, as if your application is ever compromised so are the users passwords and these passwords are often used on different sites thus creating a major security headache.

Hashing

A hash is not encryption but a one way computation of data that cannot be reversed, why is hashing important? Because you can store data such as a password without actually exposing what that password is. For example take a look at this PHP code:-

echo md5('test');

The output of the above code is ‘098f6bcd4621d373cade4e832627b4f6′ which represents the value ‘test’. You obviously need to add PHP tags around the above code but if you didn’t know how to do that then this tutorial is not for you.

Okay so you can see how useful a hashing algorithm is useful, but why use it at all? If your database or website is ever compromised the passwords for all the accounts is also broken so you could expose those users to attack (Users often use the same password on multiple sites). If your passwords are hashed this makes the discovery of their passwords more difficult.

I said difficult not impossible

There are collections of password hashes on the internet available to hackers to search or download, they are usually refered to as rainbow tables and it is important that you understand this concept so you completely understand the last code example. A rainbow table works by storing the computed hash in a database or some other form and linking it to the plain text password. So in other words you can search for ‘098f6bcd4621d373cade4e832627b4f6′ and find ‘test’.

Paranoid android

To be a good web programmer you have go to be paranoid, if other developers start calling you paranoid when they look through some of your source code then consider yourself a better programmer than they are. So if you have got what rainbow tables are, then this is how to protect against it even if your users use stupid common passwords.

Code:
// Some random characters here, change this!
$seed = '892hSDl3290283';
$password = 'test';
$hashedPassword = md5(md5($password . $seed));

So you take the hashedPassword variable and store this in your users table, to check the password you simply reuse your hash creation method. It would be sense to create a function of this method but I thought I’d keep it simple so that everyone could understand what is going on. This way the users password is never stored in your database only the hashed version. The seed is used to prevent a rainbow table attack on your password because in order for a rainbow tree to be successful it would need ‘test892hSDl3290283′ to be stored in it’s database. The reason that md5 is used twice is because I’m paranoid

Amol Wagh

Special Thanks to Ethical hackers club : Youth HAckers Club (YHC)

Trojans - The complete List of ports

noreply@blogger.com (Amol Wagh) — Sun, 17 Feb 2008 05:02:00 +0000

Written By : Amol Wagh
Detailed Trojans Port List, Protocol/Port/Trojan/Version

TCP 1 Breach.2001, SocketsDeTroie.230, SocketsDeTroie.250
TCP 28 Amanda.200
TCP 31 MastersParadise.920
TCP 68 Subseven.100
TCP 142 NetTaxi.180
TCP 146 Infector.141, Intruder.100, Intruder.100
TCP 171 ATrojan.200
TCP 285 WCTrojan.100
TCP 286 WCTrojan.100
TCP 334 Backage.310
TCP 370 NeuroticKat.120, NeuroticKat.130
TCP 413 Coma.109
TCP 420 Breach.450
TCP 555 Id2001.100, PhaseZero.100, StealthSpy.100
TCP 623 Rtb666.160
TCP 660 Zaratustra.100
TCP 661 Noknok.800, Noknok.820
TCP 666 BackConstruction.210, BackConstruction.250, Bla.100, Bla.200, Bla.400, Bla.503, Cain.150, Dimbus.100, Noknok.820, Ripper.100, SatansBackdoor.100, SatansBackdoor.101, SatansBackdoor.102, Unicorn.100, Unicorn.101, Unicorn.110
TCP 667 SniperNet.210, Snipernet.220
TCP 668 Unicorn.101, Unicorn.110
TCP 680 Rtb666.160
TCP 777 Tiny.100, Undetected.230, Undetected.300, Undetected.310, Undetected.320, Undetected.330, Undetected.331, Undetected.332
TCP 785 NetworkTerrorist.100
TCP 800 NeuroticKitten.010
TCP 831 NeuroticKat.100, NeuroticKat.120, NeuroticKat.130
TCP 901 NetDevil.130, NetDevil.140
TCP 1000 DerSpaeher.200
TCP 1001 Silencer.100
TCP 1008 AutoSpy.100
TCP 1010 DerSpaeher.200
TCP 1015 Doly.150
TCP 1111 TPort.100
TCP 1130 Noknok.800, Noknok.820
TCP 1207 SoftWAR.100
TCP 1243 Subseven.100, SubSeven.110, SubSeven.180, SubSeven.190, Subseven.200
TCP 1245 VoodooDoll.006
TCP 1269 Matrix.130
TCP 1480 RemoteHack.130
TCP 1568 RemoteHack.100, RemoteHack.110
TCP 1600 DirectConnection.100
TCP 1601 DirectConnection.100
TCP 1602 DirectConnection.100
TCP 1634 NetCrack.100
TCP 1784 Snid.120, Snid.212
TCP 1999 TransmissionScout.100, TransmissionScout.110
TCP 2000 ATrojan.200, InsaneNetwork.400
TCP 2001 DIRT.220, TrojanCow.100
TCP 2003 TransmissionScout.100, TransmissionScout.110
TCP 2023 RipperPro.100
TCP 2040 InfernoUploader.100
TCP 2115 Bugs.100
TCP 2140 DeepThroat.100, DeepThroat.200, DeepThroat.310
TCP 2332 SilentSpy.202
TCP 2589 Dagger.140
TCP 2600 DigitalRootbeer.100
TCP 2989 Rat.200
TCP 3128 MastersParadise.970
TCP 3129 MastersParadise.920, MastersParadise.970
TCP 3150 DeepThroat.100, DeepThroat.200, DeepThroat.310, MiniBacklash.110
TCP 3215 BlackStar.100, Ghost.230
TCP 3333 Daodan.123
TCP 3410 OptixPro.100, OptixPro.110
TCP 3456 Force.155, TerrorTrojan.100
TCP 3505 AutoSpy.130, AutoSpy.140
TCP 3586 Snid.120, Snid.212
TCP 3700 PortalOfDoom.100
TCP 3723 Mantis.100
TCP 3800 Eclypse.100
TCP 3996 RemoteAnything.364
TCP 4000 SkyDance.220, SkyDance.229
TCP 4201 Wartrojan.160, Wartrojan.200
TCP 4225 SilentSpy.202
TCP 4321 Bobo.100
TCP 4444 AlexTrojan.200, Crackdown.100
TCP 4488 EventHorizon.100
TCP 4523 Celine.100
TCP 4545 InternalRevise.100, RemoteRevise.150
TCP 4567 FileNail.100
TCP 4666 Mneah.100
TCP 4950 ICQTrojan.100
TCP 5005 Aladino.060
TCP 5025 Keylogger.WMRemote.100
TCP 5031 NetMetro.104
TCP 5032 NetMetro.104
TCP 5033 NetMetro.104
TCP 5050 RoxRat.100
TCP 5151 OptixLite.020, OptixLite.030, OptixLite.040
TCP 5190 MBomber.100
TCP 5277 WinShell.400
TCP 5343 WCRat.100
TCP 5400 BackConstruction.120, BackConstruction.150, BladeRunner.080, DeepThroat.300
TCP 5401 BackConstruction.120, BackConstruction.150, BackConstruction.210, BackConstruction.250, BladeRunner.080, DeepThroat.300, Mneah.100
TCP 5402 BackConstruction.210, BackConstruction.250, BladeRunner.080, DeepThroat.300, Mneah.100
TCP 5534 TheFlu.100
TCP 5550 XTCP.200, XTCP.201
TCP 5555 Noxcape.100, Noxcape.200
TCP 5695 Assassin.100
TCP 5714 WinCrash.100
TCP 5741 WinCrash.100
TCP 5742 WinCrash.103
TCP 5802 Y3KRat.160
TCP 5810 Y3KRat.160
TCP 5838 Y3KRat.170
TCP 5858 Y3KRat.110, Y3KRat.120, Y3KRat.140
TCP 5880 Y3KRat.140
TCP 5881 Y3KRat.110, Y3KRat.120, Y3KRat.140
TCP 5882 Y3KRat.100, Y3KRat.110, Y3KRat.120, Y3KRat.140, Y3KRat.150
TCP 5883 Y3KRat.110, Y3KRat.140
TCP 5884 Y3KRat.140, Y3KRat.150
TCP 5885 Y3KRat.110, Y3KRat.120, Y3KRat.140
TCP 5886 Y3KRat.120, Y3KRat.140
TCP 5887 Y3KRat.110, Y3KRat.120, Y3KRat.140
TCP 5888 Y3KRat.100, Y3KRat.110, Y3KRat.120, Y3KRat.140, Y3KRat.150
TCP 5889 Y3KRat.100, Y3KRat.110, Y3KRat.120, Y3KRat.140, Y3KRat.150
TCP 5890 Y3KRat.140
TCP 6400 Thething.100, Thething.150
TCP 6556 AutoSpy.120, AutoSpy.122
TCP 6655 Aqua.020
TCP 6660 LameSpy.095
TCP 6666 LameRemote.100, ProjectMayhem.100
TCP 6669 Vampire.100
TCP 6670 DeepThroat.200, DeepThroat.210
TCP 6671 DeepThroat.310
TCP 6699 HostControl.101
TCP 6711 DeepThroat.300, Noknok.820, SubSeven.180, SubSeven.190
TCP 6712 Subseven.100
TCP 6713 Subseven.100
TCP 6767 NTRC.120
TCP 6776 SubSeven.180, SubSeven.190, Subseven.200
TCP 6789 Doly.200
TCP 6796 SubSeven.214
TCP 6912 ShitHeep.100
TCP 6939 Indoctrination.100
TCP 6953 Lithium.100
TCP 6969 2000Cracks.100, Bigorna.100, Danton.110, Danton.210, Danton.220, Danton.310, Danton.320, Danton.330, GateCrasher.110, NetController.108, Sparta.110, VagrNocker.120
TCP 6970 Danton.330
TCP 7001 Freak88.100
TCP 7119 Massaker.100
TCP 7200 Massaker.110
TCP 7300 Coced.221
TCP 7301 Coced.221
TCP 7306 NetSpy.200, NetSpy.200
TCP 7410 Phoenix.190, Phoenix.200
TCP 7511 Genue.100
TCP 7609 Snid.120, Snid.212
TCP 7614 Wollf.130
TCP 7648 BlackStar.100, Ghost.230
TCP 7788 Last.2000, Matrix.200
TCP 7826 MiniOblivion.010, Oblivion.010
TCP 7887 SmallFun.110
TCP 7891 Revenger.100
TCP 7979 VagrNocker.200
TCP 7997 VagrNocker.200
TCP 8000 XConsole.100
TCP 8011 Way.240
TCP 8012 Ptakks.215, Ptakks.217
TCP 8110 LoseLove.100
TCP 8111 LoseLove.100
TCP 8301 LoseLove.100
TCP 8302 LoseLove.100
TCP 8372 NetBoy.100
TCP 8720 Connection.130
TCP 8734 AutoSpy.110
TCP 8811 Force.155
TCP 8899 Last.2000
TCP 9000 Aristotles.100
TCP 9301 LoseLove.100
TCP 9400 InCommand.100, InCommand.110, InCommand.120, InCommand.130, InCommand.140, InCommand.150, InCommand.153, InCommand.160, InCommand.167, InCommand.170
TCP 9401 InCommand.100, InCommand.110, InCommand.170
TCP 9402 InCommand.100, InCommand.110
TCP 9561 CRatPro.110
TCP 9563 CRatPro.110
TCP 9580 TheefLE.100
TCP 9696 Danton.210, Ghost.230
TCP 9697 Danton.320, Danton.330, Ghost.230
TCP 9870 R3C.100
TCP 9872 PortalOfDoom.100
TCP 9873 PortalOfDoom.100
TCP 9874 PortalOfDoom.100
TCP 9875 PortalOfDoom.100
TCP 9876 Rux.100, SheepGoat.100
TCP 9877 SmallBigBrother.020
TCP 9878 SmallBigBrother.020, TransmissionScout.100, TransmissionScout.110, TransmissionScout.120
TCP 9879 SmallBigBrother.020
TCP 9999 ForcedEntry.100, Infra.100, Prayer.120, Prayer.130, TakeOver.200, TakeOver.300
TCP 10001 DTr.130, DTr.140
TCP 10013 Amanda.200
TCP 10067 PortalOfDoom.100
TCP 10100 Gift.240
TCP 10101 NewSilencer.100
TCP 10167 PortalOfDoom.100
TCP 10528 HostControl.100, HostControl.260
TCP 10607 Coma.109
TCP 10666 Ambush.100
TCP 11011 Amanda.200
TCP 11050 HostControl.101
TCP 11051 HostControl.100, HostControl.260
TCP 11223 AntiNuke.100, Progenic.100, Progenic.110
TCP 11225 Cyn.100, Cyn.103, Cyn.120
TCP 11306 Noknok.800, Noknok.820
TCP 11831 Katux.200, Latinus.140, Latinus.150, Pest.100, Pest.400
TCP 11991 PitfallSurprise.100
TCP 12043 Frenzy.2000
TCP 12345 Fade.100, Netbus.160, Netbus.170, VagrNocker.400
TCP 12346 Netbus.160, Netbus.170
TCP 12348 Bionet.210, Bionet.261, Bionet.280, Bionet.302, Bionet.305, Bionet.311, Bionet.313, Bionet.316, Bionet.317
TCP 12349 Bionet.084, Bionet.261, Bionet.280, Bionet.302, Bionet.305, Bionet.311, Bionet.313, Bionet.314, Bionet.316, Bionet.317, Bionet.401, Bionet.402
TCP 12389 KheSanh.210
TCP 12478 Bionet.210
TCP 12623 Buttman.090, Buttman.100
TCP 12624 Buttman.090, Buttman.100
TCP 12625 Buttman.100
TCP 12904 Akropolis.100, Rocks.100
TCP 13473 Chupacabra.100
TCP 13753 AFTP.010
TCP 14100 Eurosol.100
TCP 14194 CyberSpy.840
TCP 14286 HellDriver.100
TCP 14500 PCInvader.050, PCInvader.060, PCInvader.070
TCP 14501 PCInvader.060, PCInvader.070
TCP 14502 PCInvader.050, PCInvader.060, PCInvader.070
TCP 14503 PCInvader.050, PCInvader.060, PCInvader.070
TCP 14504 PCInvader.050, PCInvader.060
TCP 15092 HostControl.100, HostControl.260
TCP 15382 SubZero.100
TCP 15432 Cyn.210
TCP 15555 ICMIBC.100
TCP 16322 LastDoor.100
TCP 16484 MoSucker.110
TCP 16661 Dfch.010
TCP 16969 Progenic.100
TCP 16982 AcidShiver.100
TCP 17300 Kuang.200
TCP 17499 CrazzyNet.370, CrazzyNet.375, CrazzyNet.521
TCP 17500 CrazzyNet.370, CrazzyNet.375, CrazzyNet.521
TCP 17569 Infector.141, Infector.160, Infector.170, Infector.180, Infector.190, Infector.200, Intruder.100, Intruder.100
TCP 17593 AudioDoor.120
TCP 19191 BlueFire.035, BlueFire.041
TCP 19604 Metal.270
TCP 19605 Metal.270
TCP 19991 Dfch.010
TCP 20000 Millenium.100
TCP 20001 Millenium.100, PshychoFiles.180
TCP 20002 AcidKor.100, PshychoFiles.180
TCP 20005 MoSucker.200, MoSucker.210, MoSucker.220
TCP 21212 Schwindler.182
TCP 21554 Exploiter.100, Exploiter.110, Girlfriend.130, GirlFriend.135
TCP 21579 Breach.2001
TCP 21584 Breach.2001
TCP 21684 Intruse.134
TCP 22068 AcidShiver.110
TCP 22115 Cyn.120
TCP 22222 Prosiak.047, Ruler.141, Rux.300, Rux.400, Rux.500, Rux.600
TCP 22223 Rux.400, Rux.500, Rux.600
TCP 22456 Bla.200, Bla.503
TCP 22457 AcidShiver.120, Bla.200, Bla.503
TCP 22784 Intruzzo.110
TCP 22845 Breach.450
TCP 22847 Breach.450
TCP 23005 Infinaeon.110, NetTrash.100, Oxon.110, WinRat.100
TCP 23006 Infinaeon.110, NetTrash.100, Oxon.110, WinRat.100
TCP 23032 Amanda.200
TCP 23432 Asylum.010, Asylum.012, Asylum.013, Asylum.014, MiniAsylum.110
TCP 23456 EvilFTP.100, VagrNocker.400
TCP 23476 DonaldDick.153, DonaldDick.154, DonaldDick.155
TCP 23477 DonaldDick.153
TCP 24000 Infector.170
TCP 24307 Wildek.020
TCP 25386 MoonPie.220
TCP 25486 MoonPie.220
TCP 25555 FreddyK.100, FreddyK.200
TCP 25556 FreddyK.100
TCP 25685 MoonPie.010, MoonPie.012, MoonPie.130, MoonPie.220, MoonPie.240, MoonPie.400
TCP 25686 MoonPie.135, MoonPie.200, MoonPie.400
TCP 25982 MoonPie.135, MoonPie.200
TCP 26274 Delta.050
TCP 27160 MoonPie.135, MoonPie.200
TCP 27184 Alvgus.100, Alvgus.800
TCP 27374 Muerte.110, Subseven.210, SubSeven.213
TCP 28429 Hack'a'Tack.2000
TCP 28430 Hack'a'Tack.2000
TCP 28431 Hack'a'Tack.2000
TCP 28432 Hack'a'Tack.2000
TCP 28433 Hack'a'Tack.2000
TCP 28434 Hack'a'Tack.2000
TCP 28435 Hack'a'Tack.2000
TCP 28436 Hack'a'Tack.2000
TCP 29559 DuckToy.100, DuckToy.101, Katux.200, Latinus.140, Latinus.150, Pest.100, Pest.400
TCP 29891 Unexplained.100
TCP 30000 Infector.170
TCP 30001 Error32.100
TCP 30003 LamersDeath.100
TCP 30029 AOLTrojan.110
TCP 30100 NetSphere.127, NetSphere.130, NetSphere.131
TCP 30101 NetSphere.127, NetSphere.130, NetSphere.131
TCP 30102 NetSphere.127, NetSphere.130, NetSphere.131
TCP 30103 NetSphere.131
TCP 30947 Intruse.134
TCP 31320 LittleWitch.400, LittleWitch.420
TCP 31337 BackOrifice.120, Khaled.100, OPC.200
TCP 31415 Lithium.101
TCP 31416 Lithium.100, Lithium.101
TCP 31557 Xanadu.110
TCP 31631 CleptoManicos.100
TCP 31745 Buschtrommel.100, Buschtrommel.122
TCP 31785 Hack'a'Tack.100, Hack'a'Tack.112
TCP 31787 Hack'a'Tack.100, Hack'a'Tack.112
TCP 31789 Hack'a'Tack.100, Hack'a'Tack.112
TCP 31791 Hack'a'Tack.100, Hack'a'Tack.112
TCP 31887 BDDT.100
TCP 31889 BDDT.100
TCP 32100 ProjectNext.053
TCP 32418 AcidBattery.100
TCP 32791 Akropolis.100, Rocks.100
TCP 33291 RemoteHak.001
TCP 33333 Blackharaz.100, Prosiak.047, SubSeven.214
TCP 33577 SonOfPsychward.020
TCP 34324 TelnetServer.100
TCP 34763 Infector.180, Infector.190, Infector.200
TCP 35000 Infector.190, Infector.200
TCP 35600 Subsari.140
TCP 36794 BugBear.100
TCP 37237 Mantis.020
TCP 37651 YAT.210
TCP 37653 YAT.310
TCP 40308 Subsari.140
TCP 40412 TheSpy.100
TCP 40421 MastersParadise.970
TCP 40422 MastersParadise.970
TCP 40999 DiemsMutter.110, DiemsMutter.140
TCP 41626 Shah.100
TCP 44444 Prosiak.070
TCP 45673 Akropolis.100, Rocks.100
TCP 47262 Delta.050
TCP 48006 Fragglerock.200
TCP 49683 HolzPferd.210
TCP 50000 Infector.180
TCP 50130 Enterprise.100
TCP 50766 Fore.100
TCP 51234 Cyn.210
TCP 51966 Cafeini.080, Cafeini.110
TCP 54321 PCInvader.010
TCP 57341 NetRaider.100
TCP 57922 Bionet.084
TCP 58008 Tron.100
TCP 58009 Tron.100
TCP 59090 AcidReign.200
TCP 59211 DuckToy.100, DuckToy.101
TCP 59345 NewFuture.100
TCP 60000 DeepThroat.300, MiniBacklash.100, MiniBacklash.101, MiniBacklash.101
TCP 60411 Connection.100, Connection.130
TCP 60412 Connection.130
TCP 60552 RoxRat.100
TCP 63536 InsaneNetwork.500
TCP 63878 AphexFTP.100
TCP 63879 AphexFTP.100
TCP 64969 Lithium.100
TCP 65000 Socket.100
UDP 1 SocketsDeTroie.250
UDP 666 Bla.200, Bla.400, Bla.503, Noknok.820
UDP 1130 Noknok.800, Noknok.820
UDP 2140 DeepThroat.100, DeepThroat.200, DeepThroat.310
UDP 2989 Rat.200
UDP 3128 MastersParadise.970
UDP 3129 MastersParadise.920, MastersParadise.970
UDP 3150 DeepThroat.100, DeepThroat.200, DeepThroat.310, MiniBacklash.110
UDP 3333 Daodan.123
UDP 3800 Eclypse.100
UDP 3996 RemoteAnything.364
UDP 4000 RemoteAnything.364
UDP 5555 Daodan.123
UDP 5881 Y3KRat.110, Y3KRat.140
UDP 5882 Y3KRat.100, Y3KRat.110, Y3KRat.120, Y3KRat.140, Y3KRat.150
UDP 5883 Y3KRat.110, Y3KRat.140
UDP 5884 Y3KRat.140, Y3KRat.150
UDP 5885 Y3KRat.110, Y3KRat.120, Y3KRat.140
UDP 5886 Y3KRat.120, Y3KRat.140
UDP 5887 Y3KRat.110, Y3KRat.120, Y3KRat.140
UDP 5888 Y3KRat.100, Y3KRat.110, Y3KRat.120, Y3KRat.150
UDP 6953 Lithium.100
UDP 8012 Ptakks.217
UDP 10067 PortalOfDoom.100
UDP 10167 PortalOfDoom.100
UDP 10666 Ambush.100
UDP 11225 Cyn.100, Cyn.103, Cyn.120
UDP 11306 Noknok.800, Noknok.820
UDP 12389 KheSanh.210
UDP 12623 Buttman.090, Buttman.100
UDP 12625 Buttman.100
UDP 14100 Eurosol.100
UDP 23476 DonaldDick.155
UDP 26274 Delta.050
UDP 27184 Alvgus.100
UDP 28431 Hack'a'Tack.2000
UDP 28432 Hack'a'Tack.2000
UDP 28433 Hack'a'Tack.2000
UDP 28434 Hack'a'Tack.2000
UDP 28435 Hack'a'Tack.2000
UDP 28436 Hack'a'Tack.2000
UDP 29891 Unexplained.100
UDP 30103 NetSphere.131
UDP 31320 LittleWitch.400, LittleWitch.420
UDP 31337 BackOrifice.120, OPC.200
UDP 31416 Lithium.100, Lithium.101
UDP 31789 Hack'a'Tack.100, Hack'a'Tack.112
UDP 31791 Hack'a'Tack.100, Hack'a'Tack.112
UDP 33333 Blackharaz.100
UDP 47262 Delta.050
UDP 49683 HolzPferd.210
UDP 60000 MiniBacklash.100

Basic Internet Threats - By Amol Wagh

noreply@blogger.com (Amol Wagh) — Thu, 31 Jan 2008 18:02:00 +0000

Internet – How it helps and why it is insecure?
Everything that made for good purpose if used in bad intention becomes a very big destruction. And the latest example is internet. Internet is made by some people to connect the world , It is the place where people can actually meet each other exchange ideas , mails ,services and businesses with each other. The internet created many millions of business opportunities to world, Also made many personal relations which can never be possible without it. Internet made many changes on how people deal with their day to day life. E-business , E-books , E-marketing and many more E’s made routine of person more different than it was. The basic step in the history of internet was e banking which made shopping and exchanging money virtually on the internet. But things goes wrong when some talented programmers turns into hackers , crackers and virus developers. They started destroying email account , personal accounts , bank accounts , companies databases , Important projects and money more things to test their knowledge and earn money obviously. And therefore surfing internet becomes more insecure for common man who is not technically good to prevent them. So Let us now see how can you become the attack of harmful programs and hackers in following section.

Threats - how they comes to you.
This can be passed to you whenever you open any webpage it tries to install program on your PC and if it is done it sends information from your computer to hacker so that he can attack your computer. Also some emails come to you offering you free lottery, greetings, gifts and ask you to click on some link if that link has an executable(.EXE) file attached with it then it can be program as Trojan or spyware or viruses. While you chat some hacker can act as normal person and makes friendship with you and asks for personal information and you will reply it too because you think he is now your friend . NEVER DO THIS. Also he try to send his picture which is not actually a picture but a virus or harmful programs. So verify the file or link you are clicking on is not a .EXE file. Through some CD’s of games and some free games from internet contains a virus attached with it 80% times. Trojan is a most harmful program ever made by hackers by which they can monitor your computer , shut OFF and ON your Pc , Open/Close CD ROM ,Open any file , Send you an message , Steal data from your computers, install program delete files even can format your PC. It sends your every keystroke on keyboard to them by which they identifies your passwords. Also can access your video cam and audio microphones. There is almost nothing can’t accessed by Trojan so Be aware of it . It comes to you by same processes as mentioned above.

Following Precaution can be taken to prevent from all the threats.
Never Give your personal data as Name, address ,Phone number ,Sex ,picture , passwords and any detail until you know the person who you are giving to. Never believe in any free money/gift offers and do not reply them. For such emails never respond spontaneously without thinking about it. Do not click on links or files which have either .EXE extension or file having two extensions e.g. nameoffile.jpg.exe .also do not click on file having unknown extensions. Whenever your firewall ask you to access or denied any file see it carefully and denied if it is giving out some information or try to install any file. Use original Antivirus, Antispyware, Firewalls and Anti-spam programs to be secured. Because original programs let you update latest threats security from internet.

What if you are under attack of any hacker?
You simply disconnect your Pc from internet and run an Antivirus program twice or thrice .Then restart it. When your PC is running in very good condition create system restore point. It will help you when you Get attacked you can simply go back and make your PC Normal.
Final words for you.
Using antivirus program is (90% secured but it is not secured 10% because your attention and changes made in it. If you use your system , internet intelligently you can be secured even without any anti virus program. Yes! It is. So always be alert & Be Safe.

Thank you all for reading. Please help my blog to get better . ask any specific question about securities.

Comment here what you think what more you want in my blog.

Mail me- amolwagh333@gmail.com
Amol Wagh

Hackers - you just can't ignore their talent

noreply@blogger.com (Amol Wagh) — Wed, 30 Jan 2008 05:00:00 +0000

Exclusive article

Hackers from many years are called as cyber criminals by all the world. When the first case of cyber crime took place they termed the criminal as a hacker. And from that day Hackers are criminals is the concept. Why am I telling this to you is because hackers are not the criminals. don't feel amazed , What I mean is all hackers are not cyber criminals.

Today here I am trying to explain exceptional qualities of hackers.
1. Coding skills :

Hackers are generally very talented person whose coding skills , I mean the programming languages are very high quality . His logic is so developed that if any software company wanted to have a programmer like hacker they have to pay him more than CEO of the company .Yes their knowledge is this much of quality. They are hardcore programmers and can make any program in minutes .
They developed their skills by testing method . They gather together and make competitions to make specific program on any topic.They test , they fails , they try again , they fails more the hacker fails more he learns and in like 2-3 years he becomes a successful coder.and then he never fails.
They are masters of C language and UNIX operating system. Combination of both give them a very good programming tool . They are also expert in shell programming of UNIX.
The community crackers are height of talent as they have learned almost all languages , OS , and frameworks too.

2.Maths :
90% students in this world are afraid of maths but hackers are not . Such things makes them standing apart from all.
They study the algorithms of the programs , Find the probabilities of the cases , Matrix make their logic stronger . Solving math problems using programs make them a hardcore
programmer. They use many math applications and use it everywhere to practice. Its the strongest part of hacker.
They literally plays with numbers . They are kind of get psycho when they plays with numbers. If they wanted to solve the problem They will , doesn't matter what it takes to solve it.
And this confidence gives them higher successful rate.

3.They know their weakness :
There is no man in this world who accept all his weaknesses. But hackers they do . By understanding their things and weakness they form a team . The team makes a perfect hacker . One has quality that another don't have. No hacker is perfect and they also avoids working alone. This team work gives them efficiency which is higher than anything else.

4.Criminal works :
Everyone in this world do anything for money . And unfortunately there are many hackers who use their knowledge to steal money credit cards ,bank accounts , programs , Confidential documents and many more things you will never belive.
But while doing this work they are having very much of patience , they have to wait for being successful and not being caught by the police.
Some hackers are also work with real criminals means murderers , gangs and many more criminal groups.

5.Hacker is a very good actor:
The criminal hacker is a very god actor. He lives with normal people but never let anyone know that he is a hacker. He acts as a sober man . Never shows he is very rich . Always help others to let people notice that he is a good person.
One more example of his acting is when he is on a mission.Like he have to break some companies employees account and through which he want to go inside he system.
First he plans. Then he go near that employee for stay. If she is a girl he makes friend ship then love . Get very close too her and when he got her confidence he get what he wants. The girl will never imagine that she is in the case of fraud .The cases like this can happend with men too because girls are also there in hackers group.
So believe it or not , he is a great actor.

6.They know cyber laws more than the judge of the court and COPS :
Yes , they study all the things and know everything what they don't have to do. They find the weaknesses of the laws to perform any crime. Many hackers get caught but system cant punish them due to lack of laws . So its necessary for a hacker to study all
these things.

7. They are different in everything what they do. One hacker is equal to the Whole FBI of USA in his smartness.Its the truth.
Whatever hackers are its because of their dedication in their work.They are talented and you simply can not ignore their talent.
It's a Criminal hacker or a White hat hacker( Ethical hacker) I salute the talent and the dedication they have.

But One more thing is till Bad guys are out there , White hat hackers as me ( And all ethical hackers)are always chasing them .So hackers , Be Aware , We are tracking you always.

Tell me what you think about this article by commenting here
watch out for my articles in next month about : Trojans and Safe banking

Amol Wagh , Nashik (Ethical hacker)

Technorati Profile

10 Best ways to prevent from Hackers

noreply@blogger.com (Amol Wagh) — Wed, 23 Jan 2008 06:49:00 +0000

10 best ways to prevent yourself from hackers

10 Fast and Free Security EnhancementsBefore you spend a dime on security, there are many precautions you can take that will protect you against the most common threats.

1. Check Windows Update and Office Update regularly (_http://office.microsoft.com/productupdates); have your Office CD ready. Windows Me, 2000, and XP users can configure automatic updates. Click on the Automatic Updates tab in the System control panel and choose the appropriate options.

2. Install a personal firewall. Both SyGate (_www.sygate.com) and ZoneAlarm (_www.zonelabs.com) offer free versions.

3. Install a free spyware blocker. Our Editors' Choice ("Spyware," April 22) was SpyBot Search & Destroy (_http://security.kolla.de). SpyBot is also paranoid and ruthless in hunting out tracking cookies.

4. Block pop-up spam messages in Windows NT, 2000, or XP by disabling the Windows Messenger service (this is unrelated to the instant messaging program). Open Control Panel Administrative Tools Services and you'll see Messenger. Right-click and go to Properties. Set Start-up Type to Disabled and press the Stop button. Bye-bye, spam pop-ups! Any good firewall will also stop them.

5. Use strong passwords and change them periodically. Passwords should have at least seven characters; use letters and numbers and have at least one symbol. A decent example would be f8izKro@l. This will make it much harder for anyone to gain access to your accounts.

6. If you're using Outlook or Outlook Express, use the current version or one with the Outlook Security Update installed. The update and current versions patch numerous vulnerabilities.

7. Buy antivirus software and keep it up to date. If you're not willing to pay, try Grisoft AVG Free Edition (Grisoft Inc., w*w.grisoft.com). And doublecheck your AV with the free, online-only scanners available at w*w.pandasoftware.com/activescan and _http://housecall.trendmicro.com.

8. If you have a wireless network, turn on the security features: Use MAC filtering, turn off SSID broadcast, and even use WEP with the biggest key you can get. For more, check out our wireless section or see the expanded coverage in Your Unwired World in our next issue.

9. Join a respectable e-mail security list, such as the one found at our own Security Supersite at _http://security.ziffdavis.com, so that you learn about emerging threats quickly and can take proper precautions.

10. Be skeptical of things on the Internet. Don't assume that e-mail "From:" a particular person is actually from that person until you have further reason to believe it's that person. Don't assume that an attachment is what it says it is. Don't give out your password to anyone, even if that person claims to be from "support."

Google Page Rank Calculations - Amol

noreply@blogger.com (Amol Wagh) — Wed, 23 Jan 2008 05:08:00 +0000

Keywords- google.com, amol wagh nashik, google amol wagh, google page rank, page rank explained

What is PageRank?
PageRank is a numeric value that represents how important a page is on the web. Google figures that when one page links to another page, it is effectively casting a vote for the other page. The more votes that are cast for a page, the more important the page must be. Also, the importance of the page that is casting the vote determines how important the vote itself is. Google calculates a page's importance from the votes cast for it. How important each vote is is taken into account when a page's PageRank is calculated.
PageRank is Google's way of deciding a page's importance. It matters because it is one of the factors that determines a page's ranking in the search results. It isn't the only factor that Google uses to rank pages, but it is an important one.

From here on in, we'll occasionally refer to PageRank as "PR".

Notes:
Not all links are counted by Google. For instance, they filter out links from known link farms. Some links can cause a site to be penalized by Google. They rightly figure that webmasters cannot control which sites link to their sites, but they can control which sites they link out to. For this reason, links into a site cannot harm the site, but links from a site can be harmful if they link to penalized sites. So be careful which sites you link to. If a site has PR0, it is usually a penalty, and it would be unwise to link to it.

How is PageRank calculated?
To calculate the PageRank for a page, all of its inbound links are taken into account. These are links from within the site and links from outside the site.

PR(A) = (1-d) + d(PR(t1)/C(t1) + ... + PR(tn)/C(tn))

That's the equation that calculates a page's PageRank. It's the original one that was published when PageRank was being developed, and it is probable that Google uses a variation of it but they aren't telling us what it is. It doesn't matter though, as this equation is good enough.

In the equation 't1 - tn' are pages linking to page A, 'C' is the number of outbound links that a page has and 'd' is a damping factor, usually set to 0.85.

We can think of it in a simpler way:-

a page's PageRank = 0.15 + 0.85 * (a "share" of the PageRank of every page that links to it)

"share" = the linking page's PageRank divided by the number of outbound links on the page.

A page "votes" an amount of PageRank onto each page that it links to. The amount of PageRank that it has to vote with is a little less than its own PageRank value (its own value * 0.85). This value is shared equally between all the pages that it links to.

From this, we could conclude that a link from a page with PR4 and 5 outbound links is worth more than a link from a page with PR8 and 100 outbound links. The PageRank of a page that links to yours is important but the number of links on that page is also important. The more links there are on a page, the less PageRank value your page will receive from it.

If the PageRank value differences between PR1, PR2,.....PR10 were equal then that conclusion would hold up, but many people believe that the values between PR1 and PR10 (the maximum) are set on a logarithmic scale, and there is very good reason for believing it. Nobody outside Google knows for sure one way or the other, but the chances are high that the scale is logarithmic, or similar. If so, it means that it takes a lot more additional PageRank for a page to move up to the next PageRank level that it did to move up from the previous PageRank level. The result is that it reverses the previous conclusion, so that a link from a PR8 page that has lots of outbound links is worth more than a link from a PR4 page that has only a few outbound links.

Whichever scale Google uses, we can be sure of one thing. A link from another site increases our site's PageRank. Just remember to avoid links from link farms.

Note that when a page votes its PageRank value to other pages, its own PageRank is not reduced by the value that it is voting. The page doing the voting doesn't give away its PageRank and end up with nothing. It isn't a transfer of PageRank. It is simply a vote according to the page's PageRank value. It's like a shareholders meeting where each shareholder votes according to the number of shares held, but the shares themselves aren't given away. Even so, pages do lose some PageRank indirectly, as we'll see later.

Ok so far? Good. Now we'll look at how the calculations are actually done.

For a page's calculation, its existing PageRank (if it has any) is abandoned completely and a fresh calculation is done where the page relies solely on the PageRank "voted" for it by its current inbound links, which may have changed since the last time the page's PageRank was calculated.

The equation shows clearly how a page's PageRank is arrived at. But what isn't immediately obvious is that it can't work if the calculation is done just once. Suppose we have 2 pages, A and B, which link to each other, and neither have any other links of any kind. This is what happens:-

Step 1: Calculate page A's PageRank from the value of its inbound links

Page A now has a new PageRank value. The calculation used the value of the inbound link from page B. But page B has an inbound link (from page A) and its new PageRank value hasn't been worked out yet, so page A's new PageRank value is based on inaccurate data and can't be accurate.

Step 2: Calculate page B's PageRank from the value of its inbound links

Page B now has a new PageRank value, but it can't be accurate because the calculation used the new PageRank value of the inbound link from page A, which is inaccurate.

It's a Catch 22 situation. We can't work out A's PageRank until we know B's PageRank, and we can't work out B's PageRank until we know A's PageRank.

Now that both pages have newly calculated PageRank values, can't we just run the calculations again to arrive at accurate values? No. We can run the calculations again using the new values and the results will be more accurate, but we will always be using inaccurate values for the calculations, so the results will always be inaccurate.

The problem is overcome by repeating the calculations many times. Each time produces slightly more accurate values. In fact, total accuracy can never be achieved because the calculations are always based on inaccurate values. 40 to 50 iterations are sufficient to reach a point where any further iterations wouldn't produce enough of a change to the values to matter. This is precisiely what Google does at each update, and it's the reason why the updates take so long.

One thing to bear in mind is that the results we get from the calculations are proportions. The figures must then be set against a scale (known only to Google) to arrive at each page's actual PageRank. Even so, we can use the calculations to channel the PageRank within a site around its pages so that certain pages receive a higher proportion of it than others.

NOTE:
You may come across explanations of PageRank where the same equation is stated but the result of each iteration of the calculation is added to the page's existing PageRank. The new value (result + existing PageRank) is then used when sharing PageRank with other pages. These explanations are wrong for the following reasons:-

1. They quote the same, published equation - but then change it

from PR(A) = (1-d) + d(......) to PR(A) = PR(A) + (1-d) + d(......)

It isn't correct, and it isn't necessary.

2. We will be looking at how to organize links so that certain pages end up with a larger proportion of the PageRank than others. Adding to the page's existing PageRank through the iterations produces different proportions than when the equation is used as published. Since the addition is not a part of the published equation, the results are wrong and the proportioning isn't accurate.

According to the published equation, the page being calculated starts from scratch at each iteration. It relies solely on its inbound links. The 'add to the existing PageRank' idea doesn't do that, so its results are necessarily wrong.

Internal linking
Fact: A website has a maximum amount of PageRank that is distributed between its pages by internal links.

The maximum PageRank in a site equals the number of pages in the site * 1. The maximum is increased by inbound links from other sites and decreased by outbound links to other sites. We are talking about the overall PageRank in the site and not the PageRank of any individual page. You don't have to take my word for it. You can reach the same conclusion by using a pencil and paper and the equation.

Fact: The maximum amount of PageRank in a site increases as the number of pages in the site increases.

The more pages that a site has, the more PageRank it has. Again, by using a pencil and paper and the equation, you can come to the same conclusion. Bear in mind that the only pages that count are the ones that Google knows about.

Fact: By linking poorly, it is possible to fail to reach the site's maximum PageRank, but it is not possible to exceed it.

Poor internal linkages can cause a site to fall short of its maximum but no kind of internal link structure can cause a site to exceed it. The only way to increase the maximum is to add more inbound links and/or increase the number of pages in the site.

Cautions: Whilst I thoroughly recommend creating and adding new pages to increase a site's total PageRank so that it can be channeled to specific pages, there are certain types of pages that should not be added. These are pages that are all identical or very nearly identical and are known as cookie-cutters. Google considers them to be spam and they can trigger an alarm that causes the pages, and possibly the entire site, to be penalized. Pages full of good content are a must.

What can we do with this 'overall' PageRank?

We are going to look at some example calculations to see how a site's PageRank can be manipulated, but before doing that, I need to point out that a page will be included in the Google index only if one or more pages on the web link to it. That's according to Google. If a page is not in the Google index, any links from it can't be included in the calculations.

For the examples, we are going to ignore that fact, mainly because other 'Pagerank Explained' type documents ignore it in the calculations, and it might be confusing when comparing documents. The calculator operates in two modes:- Simple and Real. In Simple mode, the calculations assume that all pages are in the Google index, whether or not any other pages link to them. In Real mode the calculations disregard unlinked-to pages. These examples show the results as calculated in Simple mode.

Let's consider a 3 page site (pages A, B and C) with no links coming in from the outside. We will allocate each page an initial PageRank of 1, although it makes no difference whether we start each page with 1, 0 or 99. Apart from a few millionths of a PageRank point, after many iterations the end result is always the same. Starting with 1 requires fewer iterations for the PageRanks to converge to a suitable result than when starting with 0 or any other number. You may want to use a pencil and paper to follow this or you can follow it with the calculator.

The site's maximum PageRank is the amount of PageRank in the site. In this case, we have 3 pages so the site's maximum is 3.

At the moment, none of the pages link to any other pages and none link to them. If you make the calculation once for each page, you'll find that each of them ends up with a PageRank of 0.15. No matter how many iterations you run, each page's PageRank remains at 0.15. The total PageRank in the site = 0.45, whereas it could be 3. The site is seriously wasting most of its potential PageRank.

Example 1

Now begin again with each page being allocated PR1. Link page A to page B and run the calculations for each page. We end up with:-
Page A = 0.15
Page B = 1
Page C = 0.15

Page A has "voted" for page B and, as a result, page B's PageRank has increased. This is looking good for page B, but it's only 1 iteration - we haven't taken account of the Catch 22 situation. Look at what happens to the figures after more iterations:-

After 100 iterations the figures are:-
Page A = 0.15
Page B = 0.2775
Page C = 0.15

It still looks good for page B but nowhere near as good as it did. These figures are more realistic. The total PageRank in the site is now 0.5775 - slightly better but still only a fraction of what it could be.

NOTE:
Technically, these particular results are incorrect because of the special treatment that Google gives to dangling links, but they serve to demonstrate the simple calculation.

Example 2

Try this linkage. Link all pages to all pages. Each page starts with PR1 again. This produces:-
Page A = 1
Page B = 1
Page C = 1

Now we've achieved the maximum. No matter how many iterations are run, each page always ends up with PR1. The same results occur by linking in a loop. E.g. A to B, B to C and C to D. View this in the calculator.

This has demonstrated that, by poor linking, it is quite easy to waste PageRank and by good linking, we can achieve a site's full potential. But we don't particularly want all the site's pages to have an equal share. We want one or more pages to have a larger share at the expense of others. The kinds of pages that we might want to have the larger shares are the index page, hub pages and pages that are optimized for certain search terms. We have only 3 pages, so we'll channel the PageRank to the index page - page A. It will serve to show the idea of channeling.

Example 3

Now try this. Link page A to both B and C. Also link pages B and C to A. Starting with PR1 all round, after 1 iteration the results are:-
Page A = 1.85
Page B = 0.575
Page C = 0.575

and after 100 iterations, the results are:-
Page A = 1.459459
Page B = 0.7702703
Page C = 0.7702703

In both cases the total PageRank in the site is 3 (the maximum) so none is being wasted. Also in both cases you can see that page A has a much larger proportion of the PageRank than the other 2 pages. This is because pages B and C are passing PageRank to A and not to any other pages. We have channeled a large proportion of the site's PageRank to where we wanted it.

Example 4

Finally, keep the previous links and add a link from page C to page B. Start again with PR1 all round. After 1 iteration:-
Page A = 1.425
Page B = 1
Page C = 0.575

By comparison to the 1 iteration figures in the previous example, page A has lost some PageRank, page B has gained some and page C stayed the same. Page C now shares its "vote" between A and B. Previously A received all of it. That's why page A has lost out and why page B has gained. and after 100 iterations:-
Page A = 1.298245
Page B = 0.9999999
Page C = 0.7017543

When the dust has settled, page C has lost a little PageRank because, having now shared its vote between A and B, instead of giving it all to A, A has less to give to C in the A-->C link. So adding an extra link from a page causes the page to lose PageRank indirectly if any of the pages that it links to return the link. If the pages that it links to don't return the link, then no PageRank loss would have occured. To make it more complicated, if the link is returned even indirectly (via a page that links to a page that links to a page etc), the page will lose a little PageRank. This isn't really important with internal links, but it does matter when linking to pages outside the site.

Example 5: new pages

Adding new pages to a site is an important way of increasing a site's total PageRank because each new page will add an average of 1 to the total. Once the new pages have been added, their new PageRank can be channeled to the important pages. We'll use the calculator to demonstrate these.

Let's add 3 new pages to Example 3 [view]. Three new pages but they don't do anything for us yet. The small increase in the Total, and the new pages' 0.15, are unrealistic as we shall see. So let's link them into the site.

Link each of the new pages to the important page, page A [view]. Notice that the Total PageRank has doubled, from 3 (without the new pages) to 6. Notice also that page A's PageRank has almost doubled.

There is one thing wrong with this model. The new pages are orphans. They wouldn't get into Google's index, so they wouldn't add any PageRank to the site and they wouldn't pass any PageRank to page A. They each need to be linked to from at least one other page. If page A is the important page, the best page to put the links on is, surprisingly, page A [view]. You can play around with the links but, from page A's point of view, there isn't a better place for them.

It is not a good idea for one page to link to a large number of pages so, if you are adding many new pages, spread the links around. The chances are that there is more than one important page in a site, so it is usually suitable to spread the links to and from the new pages. You can use the calculator to experiment with mini-models of a site to find the best links that produce the best results for its important pages.

Examples summary

You can see that, by organising the internal links, it is possible to channel a site's PageRank to selected pages. Internal links can be arranged to suit a site's PageRank needs, but it is only useful if Google knows about the pages, so do try to ensure that Google spiders them.

Inbound and Outbound links

Examples of these could be given but it is probably clearer to read about them (below) and to 'play' with them in the calculator.

Questions

When a page has several links to another page, are all the links counted?

E.g. if page A links once to page B and 3 times to page C, does page C receive 3/4 of page A's shareable PageRank?

The PageRank concept is that a page casts votes for one or more other pages. Nothing is said in the original PageRank document about a page casting more than one vote for a single page. The idea seems to be against the PageRank concept and would certainly be open to manipulation by unrealistically proportioning votes for target pages. E.g. if an outbound link, or a link to an unimportant page, is necessary, add a bunch of links to an important page to minimize the effect.

Since we are unlikely to get a definitive answer from Google, it is reasonable to assume that a page can cast only one vote for another page, and that additional votes for the same page are not counted.

When a page links to itself, is the link counted?

Again, the concept is that pages cast votes for other pages. Nothing is said in the original document about pages casting votes for themselves. The idea seems to be against the concept and, also, it would be another way to manipulate the results. So, for those reasons, it is reasonable to assume that a page can't vote for itself, and that such links are not counted.

Dangling links
"Dangling links are simply links that point to any page with no outgoing links. They affect the model because it is not clear where their weight should be distributed, and there are a large number of them. Often these dangling links are simply pages that we have not downloaded yet..........Because dangling links do not affect the ranking of any other page directly, we simply remove them from the system until all the PageRanks are calculated. After all the PageRanks are calculated they can be added back in without affecting things significantly." - extract from the original PageRank paper by Google’s founders, Sergey Brin and Lawrence Page.
A dangling link is a link to a page that has no links going from it, or a link to a page that Google hasn't indexed. In both cases Google removes the links shortly after the start of the calculations and reinstates them shortly before the calculations are finished. In this way, their effect on the PageRank of other pages in minimal.

The results shown in Example 1 (right diag.) are wrong because page B has no links going from it, and so the link from page A to page B is dangling and would be removed from the calculations. The results of the calculations would show all three pages as having 0.15.

It may suit site functionality to link to pages that have no links going from them without losing any PageRank from the other pages but it would be waste of potential PageRank. Take a look at this example. The site's potential is 5 because it has 5 pages, but without page E linked in, the site only has 4.15.

Link page A to page E and click Calculate. Notice that the site's total has gone down very significantly. But, because the new link is dangling and would be removed from the calculations, we can ignore the new total and assume the previous 4.15 to be true. That's the effect of functionally useful, dangling links in the site. There's no overall PageRank loss.

However, some of the site's potential total is still being wasted, so link Page E back to Page A and click Calculate. Now we have the maximum PageRank that is possible with 5 pages. Nothing is being wasted.

Although it may be functionally good to link to pages within the site without those pages linking out again, it is bad for PageRank. It is pointless wasting PageRank unnecessarily, so always make sure that every page in the site links out to at least one other page in the site.

Inbound links
Inbound links (links into the site from the outside) are one way to increase a site's total PageRank. The other is to add more pages. Where the links come from doesn't matter. Google recognizes that a webmaster has no control over other sites linking into a site, and so sites are not penalized because of where the links come from. There is an exception to this rule but it is rare and doesn't concern this article. It isn't something that a webmaster can accidentally do.

The linking page's PageRank is important, but so is the number of links going from that page. For instance, if you are the only link from a page that has a lowly PR2, you will receive an injection of 0.15 + 0.85(2/1) = 1.85 into your site, whereas a link from a PR8 page that has another 99 links from it will increase your site's PageRank by 0.15 + 0.85(7/100) = 0.2095. Clearly, the PR2 link is much better - or is it? See here for a probable reason why this is not the case.

Once the PageRank is injected into your site, the calculations are done again and each page's PageRank is changed. Depending on the internal link structure, some pages' PageRank is increased, some are unchanged but no pages lose any PageRank.

It is beneficial to have the inbound links coming to the pages to which you are channeling your PageRank. A PageRank injection to any other page will be spread around the site through the internal links. The important pages will receive an increase, but not as much of an increase as when they are linked to directly. The page that receives the inbound link, makes the biggest gain.

It is easy to think of our site as being a small, self-contained network of pages. When we do the PageRank calculations we are dealing with our small network. If we make a link to another site, we lose some of our network's PageRank, and if we receive a link, our network's PageRank is added to. But it isn't like that. For the PageRank calculations, there is only one network - every page that Google has in its index. Each iteration of the calculation is done on the entire network and not on individual websites.

Because the entire network is interlinked, and every link and every page plays its part in each iteration of the calculations, it is impossible for us to calculate the effect of inbound links to our site with any realistic accuracy.

Outbound links
Outbound links are a drain on a site's total PageRank. They leak PageRank. To counter the drain, try to ensure that the links are reciprocated. Because of the PageRank of the pages at each end of an external link, and the number of links out from those pages, reciprocal links can gain or lose PageRank. You need to take care when choosing where to exchange links.

When PageRank leaks from a site via a link to another site, all the pages in the internal link structure are affected. (This doesn't always show after just 1 iteration). The page that you link out from makes a difference to which pages suffer the most loss. Without a program to perform the calculations on specific link structures, it is difficult to decide on the right page to link out from, but the generalization is to link from the one with the lowest PageRank.

Many websites need to contain some outbound links that are nothing to do with PageRank. Unfortunately, all 'normal' outbound links leak PageRank. But there are 'abnormal' ways of linking to other sites that don't result in leaks. PageRank is leaked when Google recognizes a link to another site. The answer is to use links that Google doesn't recognize or count. These include form actions and links contained in javascript code.

Form actions
A form's 'action' attribute does not need to be the url of a form parsing script. It can point to any html page on any site. Try it.

Example:

Click here

To be really sneaky, the action attribute could be in some javascript code rather than in the form tag, and the javascript code could be loaded from a 'js' file stored in a directory that is barred to Google's spider by the robots.txt file.

Javascript
Example: Click here

Like the form action, it is sneaky to load the javascript code, which contains the urls, from a seperate 'js' file, and sneakier still if the file is stored in a directory that is barred to googlebot by the robots.txt file.

The "rel" attribute
As of 18th January 2005, Google, together with other search engines, is recognising a new attribute to the anchor tag. The attribute is "rel", and it is used as follows:-

link text

The attribute tells Google to ignore the link completely. The link won't help the target page's PageRank, and it won't help its rankings. It is as though the link doesn't exist. With this attribute, there is no longer any need for javascript, forms, or any other method of hiding links from Google.

So how much additional PageRank do we need to move up the toolbar?
First, let me explain in more detail why the values shown in the Google toolbar are not the actual PageRank figures. According to the equation, and to the creators of Google, the billions of pages on the web average out to a PageRank of 1.0 per page. So the total PageRank on the web is equal to the number of pages on the web * 1, which equals a lot of PageRank spread around the web.
The Google toolbar range is from 1 to 10. (They sometimes show 0, but that figure isn't believed to be a PageRank calculation result). What Google does is divide the full range of actual PageRanks on the web into 10 parts - each part is represented by a value as shown in the toolbar. So the toolbar values only show what part of the overall range a page's PageRank is in, and not the actual PageRank itself. The numbers in the toolbar are just labels.

Whether or not the overall range is divided into 10 equal parts is a matter for debate - Google aren't saying. But because it is much harder to move up a toolbar point at the higher end than it is at the lower end, many people (including me) believe that the divisions are based on a logarithmic scale, or something very similar, rather than the equal divisions of a linear scale.

Let's assume that it is a logarithmic, base 10 scale, and that it takes 10 properly linked new pages to move a site's important page up 1 toolbar point. It will take 100 new pages to move it up another point, 1000 new pages to move it up one more, 10,000 to the next, and so on. That's why moving up at the lower end is much easier that at the higher end.

In reality, the base is unlikely to be 10. Some people think it is around the 5 or 6 mark, and maybe even less. Even so, it still gets progressively harder to move up a toolbar point at the higher end of the scale.

Note that as the number of pages on the web increases, so does the total PageRank on the web, and as the total PageRank increases, the positions of the divisions in the overall scale must change. As a result, some pages drop a toolbar point for no 'apparent' reason. If the page's actual PageRank was only just above a division in the scale, the addition of new pages to the web would cause the division to move up slightly and the page would end up just below the division. Google's index is always increasing and they re-evaluate each of the pages on more or less a monthly basis. It's known as the "Google dance". When the dance is over, some pages will have dropped a toolbar point. A number of new pages might be all that is needed to get the point back after the next dance.

The toolbar value is a good indicator of a page's PageRank but it only indicates that a page is in a certain range of the overall scale. One PR5 page could be just above the PR5 division and another PR5 page could be just below the PR6 division - almost a whole division (toolbar point) between them.

Tips
Domain names and Filenames
To a spider, www.domain.com/, domain.com/, and domain.com/index.html are different urls and, therefore, different pages. Surfers arrive at the site's home page whichever of the urls are used, but spiders see them as individual urls, and it makes a difference when working out the PageRank. It is better to standardize the url you use for the site's home page. Otherwise each url can end up with a different PageRank, whereas all of it should have gone to just one url.

If you think about it, how can a spider know the filename of the page that it gets back when requesting www.domain.com/ ? It can't. The filename could be index.html, index.htm, index.php, default.html, etc. The spider doesn't know. If you link to index.html within the site, the spider could compare the 2 pages but that seems unlikely. So they are 2 urls and each receives PageRank from inbound links. Standardizing the home page's url ensures that the Pagerank it is due isn't shared with ghost urls.

Example: Go to my UK Holidays and UK Holiday Accommodation site - how's that for a nice piece of link text ;). Notice that the url in the browser's address bar contains "www.". If you have the Google Toolbar installed, you will see that the page has PR5. Now remove the "www." part of the url and get the page again. This time it has PR1, and yet they are the same page. Actually, the PageRank is for the unseen frameset page.

When this article was first written, the non-www URL had PR4 due to using different versions of the link URLs within the site. It had the effect of sharing the page's PageRank between the 2 pages (the 2 versions) and, therefore, between the 2 sites. That's not the best way to do it. Since then, I've tidied up the internal linkages and got the non-www version down to PR1 so that the PageRank within the site mostly stays in the "www." version, but there must be a site somewhere that links to it without the "www." that's causing the PR1.

Imagine the page, www.domain.com/index.html. The index page contains links to several relative urls; e.g. products.html and details.html. The spider sees those urls as www.domain.com/products.html and www.domain.com/details.html. Now let's add an absolute url for another page, only this time we'll leave out the "www." part - domain.com/anotherpage.html. This page links back to the index.html page, so the spider sees the index pages as domain.com/index.html. Although it's the same index page as the first one, to a spider, it is a different page because it's on a different domain. Now look what happens. Each of the relative urls on the index page is also different because it belongs to the domain.com/ domain. Consequently, the link stucture is wasting a site's potential PageRank by spreading it between ghost pages.

Adding new pages

There is a possible negative effect of adding new pages. Take a perfectly normal site. It has some inbound links from other sites and its pages have some PageRank. Then a new page is added to the site and is linked to from one or more of the existing pages. The new page will, of course, aquire PageRank from the site's existing pages. The effect is that, whilst the total PageRank in the site is increased, one or more of the existing pages will suffer a PageRank loss due to the new page making gains. Up to a point, the more new pages that are added, the greater is the loss to the existing pages. With large sites, this effect is unlikely to be noticed but, with smaller ones, it probably would.

So, although adding new pages does increase the total PageRank within the site, some of the site's pages will lose PageRank as a result. The answer is to link new pages is such a way within the site that the important pages don't suffer, or add sufficient new pages to make up for the effect (that can sometimes mean adding a large number of new pages), or better still, get some more inbound links.

Miscellaneous
The Google toolbar
If you have the Google toolbar installed in your browser, you will be used to seeing each page's PageRank as you browse the web. But all isn't always as it seems. Many pages that Google displays the PageRank for haven't been indexed in Google and certainly don't have any PageRank in their own right. What is happening is that one or more pages on the site have been indexed and a PageRank has been calculated. The PageRank figure for the site's pages that haven't been indexed is allocated on the fly - just for your toolbar. The PageRank itself doesn't exist.

It's important to know this so that you can avoid exchanging links with pages that really don't have any PageRank of their own. Before making exchanges, search for the page on Google to make sure that it is indexed.

Sub-directories
Some people believe that Google drops a page's PageRank by a value of 1 for each sub-directory level below the root directory. E.g. if the value of pages in the root directory is generally around 4, then pages in the next directory level down will be generally around 3, and so on down the levels. Other people (including me) don't accept that at all. Either way, because some spiders tend to avoid deep sub-directories, it is generally considered to be beneficial to keep directory structures shallow (directories one or two levels below the root).

ODP and Yahoo!
It used to be thought that Google gave a Pagerank boost to sites that are listed in the Yahoo! and ODP (a.k.a. DMOZ) directories, but these days general opinion is that they don't. There is certainly a PageRank gain for sites that are listed in those directories, but the reason for it is now thought to be this:-

Google spiders the directories just like any other site and their pages have decent PageRank and so they are good inbound links to have. In the case of the ODP, Google's directory is a copy of the ODP directory. Each time that sites are added and dropped from the ODP, they are added and dropped from Google's directory when they next update it. The entry in Google's directory is yet another good, PageRank boosting, inbound link. Also, the ODP data is used for searches on a myriad of websites - more inbound links!

Listings in the ODP are free but, because sites are reviewed by hand, it can take quite a long time to get in. The sooner a working site is submitted, the better. For tips on submitting to DMOZ, see this this DMOZ article.

Comments and suggestions are welcomed.

Keywords- google.com, amol wagh nashik, google amol wagh, google page rank, page rank explained

22 articles in 2007 archives are deleted But We have it with us

noreply@blogger.com (Amol Wagh) — Sun, 09 Dec 2007 03:52:00 +0000

All Thw Archives are deleted and stored to a partner site
If any of our visitors any articles from the old 22 articles on this blog please send the request WITH SUBJECT 2007 ARCHIVE .
I am really sorry for your incovinience but dont worry all posts are stores.

Have nice time all of you
And thank you for being my regular visitor.

Amol Wagh