Hacking for Newbies

This summary is not available. Please click here to view the post.

Cara Membuat USB installer Mac OS lewat windows

Bahan yang di perlukan:

1. File DMG Mac OS X
2. 1 buah FD 8 GB
3. 1 buah FD ukuran bebas :D
4. Laptop/PC yg sudah terinstall Windows
5. Aplikasi Transmac.exe

Langkah-langkah :

1.     Download dulu Transmac, dan Install
2. Setelah itu Masukkan USB 8GB
3. Kemudian Buka Aplikasi Transmac
4. Setelah Transmac terbuka, klik kanan USB, dan pilih “Format Disk for Mac”
5. Pi;ih HFS+ (Extended)
6. Setelah itu, klik kanan USB anda dan pilh “Restore with Disk Image”
7. Kemudian tunggu hingga selesai,
8. Setelah selesai, sediakan 1 USB lagi (ukuran bebas), lalu install Clover Bootable USB(bisa di Download di sini : http://www.osx86.net/files/file/342-bootdiskutility-exe-v2-0-2013-rev-159b// )

Atau di sini : http://cvad-mac.narod.ru/index/0-5

SETELAH SELESAI MENRESTORE OS X KE USB SELANJUTNYA CARA MENGGUNAKAN BOOTDISK UTILITY DAN INSTALL CLOVER BOOTLODER KE USBNYA. 

Solusi dalam Hackintosh

Bagi sobat pemula yang sudah mendengar kata "hackintosh" pasti berfikir tentang Mac Os X Apple,begitu juga dengan saya.

Pada kesempatan kali ini saya akan membagi pengalaman saya mulai dari awal buat bootable FD sampai selesai installasi. Juga dengan masalah-masalah saat booting sampai installasi beserta solusinya yang isyallah berhasil.

Oke,pertama seperti pada tutorial umumnya;

1. Siapkan 2 FD (Flashdisk)
2. Mac OS X (terserah mau versi berapa... :D yang penting compatible sama lepi agan)
3. Siapkan partisi HDD,jika mau di dualboot dengan OS lain. Misal saya dualboot dengan Windows 8.1 pada saat ujicoba ini.
4. Kopi + Cemilan

Kedua,buat bootable Mac OSX nya di FD 8GB dan bootloader di FD 4GB.
1. Untuk membuat bootable Mac OSX bisa gunakan Transmac
2. Download dan install Transmac
3. Klik kanan pada FD kita lalu pilih "Format Disk For Mac"
4. Jika sudah selesai Klik kanan pilih "Restore with Disk Image"
5. Tunggu sampai selesai.
Selagi menunggu kita bisa buat bootloader di FD yang satunya. Buat bootloader bisa pake BootDiskUtility,iBoot atau rBoot. Untuk tutorial bisa cari di dokumen group/google. :D

Jika persiapan sudah kita lanjut ke setting BIOS. Pilih urutan boot priority yang pertama adalah dari FD (terserah klo pke boot yang lain).

*
Problem
- Saat boot di bios udah kedetect tp setelah itu blank hitam.
Solusi
- Cek FD yg dipake om, :D yg di pasang yang FD bootloadernya bukan yang bootablenya.
- Cek settingan bios bagian "OS Legacy" pilih enable atau atur agar menjadi OS Legacy lah intinya,jangan yang auto.

1. Nah jika sudah selesai dan masuk pada bootloadernya (jika menggunakan bootdiskutility,maka akan tampil bootloader CLOVER),masukkan FD bootable Mac OSX nya.
2. Setelah itu pilih boot dari dari FD tersebut (ntar mucul logo baru setelah masukin FD-nya) pada beberapa kejadian komputer akan restart,pada saat ini jangan cabut dulu FD bootloadernya klo dah sampe halaman pilih bahasa/logo apple baru bisa di cabut.
3. Setelah masuk halaman pra-installasi,perhatikan menu bagian atas pilih Disk Utility.
4. Setelah tampil partisi HDD yang akan dipake buat Mac OSX klik menu eraser. Pilih type Mac OSX Journal kemudian beri nama disk klik eraser.
5. Jika sudah ,keluar dari Disk Utility lalu pilih Disk yang tidak ada tanda seru (!) atau silang (X) klik install.
6. Sebelum install,klik Customize. Sesuaikan dengan hardware dan driver yang cocok.
7. Kemudian install.

*
Problem
- Partisi HDD gak kedetect,yang ada cuma FD.
Solusi
- Setting AHCI di bios jadiin "Enable".

Setelah selesai install,komputer akan restart. Masukkan lagi fd bootloadernya gan,lha kok,kenapa???yaa kan tdinya dari windows jadi bootloadernya MBR makanya yg Mac OSX gak kedetect. Sementara booting pake FD dulu... :D
Udah masuk ke bootloadernya lalu pilih partisi HDD yang udah terinstall Mac OSX tadi. Pada defaultnya bootloader Clover akan menjalankan bootflag -v (cek di option).
Bila terjadi stuck/KP saat logo Apple (restart) atau yang ....nanosecond..blablablaa :v ,ulangi lalu di Option edit menjadi -x GraphicsEnabler=No.
Jika berhasil maka akan ada tampilan Wellcom untuk pilih bahasa. *jika tidak bisa klik/enter,coba tunggu aja emang begitu...mungkin lama detect mouse/keyboardny.
Jika sudah,maka lanjutkan dengan mengisi form account apple dan dekstop akan muncul. 

The Unix Time bug

Time is a big topic in our life time. Time has been one of the most

significant elements on our minds as we progressed into the 21st century.

Everyone all over the world knows about the year 2000 problem not due to

its technical significance but due to the large media attention it

recieved. Now don't lie to your self you ph33red the advent of year

2000, your mom bought extra bread and water and you heart was beating like

hell while the clock ticked down, but hey you made it. Now you may ask

what is this article about that y2k bug? Hell no, that bug was mircosoft's

bug, even though Unix systems remained in pretty good shape as time ticked

into the 21st century, it was all due to the way Unix treats time that

made the os immune to that particlular problem. So you ask again what is

this 2038 title and you soon realize the Unix os is in deep trouble, not

in the year 2000, but in 2038. Windows users feared the year 2000, but

Unix users will look on to the future with a dreaded stare, cause 2038

is coming.


To understand what this bug is all about we have to look at the core

of the problem. Unix measures time using a simple method, it counts seconds,

nothing fancy just seconds. Now everything needs a beginning, a birth and

on 12:00:00 AM January 1, 1970 (GMT) the birth of Unix time was born. A

Unix clock contains exactly the number of seconds that has elapsed since

that date. Now filestamps also use this simple counter which is maintained

by the file system code in the kernel. We can't understand those long strings

of seconds, so library functions have been coded to convert that string

and give an output of something we humans could comprehend quickly, like

Mon 12 19:54:19 1998.

<BR>Now the problem arises because the majority of C proggies use a library

of routines called the standard time library (time.h). Time.h establishes

a standard 4-byte format for storing time values. It also does the converting,

displaying and calculations of time values. This 4-byte value believes

the beginning of time was midnight January 1,1970, and at that moment the

value of time was '0'. Now a signed 4-byte integer has a limited value

of 2,147,483,647 , which is the heart of the 2038 problem. The time

value has always been stored as a 32 bit signed numbers. This means that

the maximum value of time before a roll-over to the negative side causing

an invalid time value is achieved in 2,147,483,647 ,which gets converted

to the dreaded January 19, 2038 at 3:14:07 GMT. ( Iam not sure but i think

Eastern US will be the first to experience the problem ) .



Okay so now we know the background behind this problem, lets see how

we can fix it. There are really two ways that could implement a valid fix.


Time could be treated as an unsigned quantity which it already is. This

would allow it to take on values beyond January 19, 2038 and will allows

us to progress to the 22nd century with no problmes.  This theoretical

idea is nice, but it has its drawbacks. Many C programs have already been

compiled with time being a signed quantity. So days in 2039 will be seen

by the Unix box as being older than days in previous years. This will

have to call a recompilation, so that might take a while to do.


The other more logical solution is to replace the 32-bit systems with

64 bit systems. Now like the first solution this solution also has drawbacks.

64-bit systems are still relatively new. Many systems in use still deal

with number values represented by 16/32 bit systems. 64 bit systems are

the future, but at the moment they are still expensive. If we implement

processors that understand 64- bit systems, unix will be able to track

time correctly till all our grandchildren and their children pass away.

This approach is truly the most logical so this plan might be the valid

approach.



Now that we have a good understanding behind this problem, what should

we look foward to when we code programs. Hopefully, if a coder is reading

this article, they should get the idea that system design and software

specifications must be designed with long term goals. Software, unlike

hardware doesn't wear out, so we should code with a goal past our time.

Heh, millions are still using DOS and Windows 3.1 when we see those os's

as obsolete. Code should be flexible, reliable and compatible. We should

foreshadow updates and expansions which should be made to suit the future.

Now don't feel bad, Unix isn't the only os with problems heading its way,

wipe that tear off your eye as we get ready to hear more. Now I won't go

indepth into these listing, but you should now have an idea after reading

this article of how the futue will look like.

Important Future Dates



   o 2030 - A break point in the windows os. The year 2029 will remain 2029

   but 2030 will be interpreted as being 1930.



   o September 30, 2034 - Unix os will experience an overflow in the

   time function.


   o 2038 - See this article


   o 2041 - The IBM mainframe internal clocks will not exceed 2041, but this

   problem has not been confirmed by IBM.


   o January 1, 2046 - Amiga systems will experience date failure.


   o 2116 - IBM PC hardware will experience problems similar to Unix's 32 bit

   interger overlfow.

   o 2184 - Windows NT, which uses 64 bit integer by 100 nanoseconds as its

   increment will fail in 2184.


Now don't be too pessimistic about the future. Technology will hopefully

implement logical corrections for these problems. Hey remain optimistic,

2038 is a long way from now, just remember what the coders 30 years ago

were foreshadowing for the year 2000, nothing! hahahah!


Greetz


Well the greetz goes out to the Blacksun Research Facility

team for always sticking together through all our hard times.

Also lots of greetz goes out to Box Networks [.box.sk]. Also tons

of greetz goes out to the many visitors of bsrf,

from the msg boards to the irc channel, and all the cool people I

forgot to mention

laterz.


If you find any errors or have some more information to add to this

tutorial, please email me at rammal81@hotmail.com

and i'll do what I can to fix it up.

(By Mikkkeee (rammal81@hotmail.com)

RSA: Attacking the cryptosystem

The RSA cryptosystem is the most widely-used Asymmetric Cryptosystem. In this toturial I will

explain some vulnerabilities of this Cryptosystem, for people to learn from and protect themself

or attack others.



I will not explain the Cryptosystem itself, As it is described in many pages in the Internet.

Furthermore, i will expect you to know Cryptosystem yourself.



If you have any questions you can find your answers at the sci.crypt newsgroup, or you can ask

me on the IRC or Email (thedeadh@netvision.net.il)



This part is dealing with one aspect: Finding the factors of the modulus. next parts will deal

other aspects of attacking this Cryptosystem.



The Death





>>>  1.1 Basic Math & Functions Used In This Part  <<<



* Length(N) returns N's number of digits

* The ^ symbol will be used here for Exponent.

* M is the Modulus of the key.

* P & Q are the two primes, which their product is M

* [R] Denotes the greatest integer not exceeding R. Example: [4] = 4, [4.6] = 4, [-2.1] = -3.

* The GCD(a,b) function returns the Greatest Common Divisor of a & b.

  Example: GCD(100, 30) = 10, GCD(7,17) = 1.

* Euler's Phi(N) Function returns the greatest B that comply: B =< N, GCD(B,N) = 1





>>>  1.2 Basic Statements Used Here  <<<



* X^2 - Y^2 = (X+Y)(X-Y)

  Proof:

  (X+Y)(X-Y) = X^2 - XY + XY - Y^2 = X^2 - Y^2



* M is odd, unless P or Q = 2

  Proof:

  M = PQ. P & Q are primes, Therefore are not divisible by 2 unless they are 2.

  The product of two primes is divisible only by these primes.



* Fermat's factoring theorem: Every odd number can be written as the difference of two squares,

  X^2 - Y^2 (X,Y : Natural).

  Proof:

  WTF?! I Don't care what the proof is! Go dig him up and ask him if you wish!



* Conclusions from the Phi function:

  * If P is a prime, then Phi(P^K) = (P^(K-1))*(P-1)

  * If P is a prime, then Phi(P) = P-1

  * If GCD(A,B) = 1 Then Phi(A*B) = Phi(A)*Phi(B)



(Note: Fermat was a jackass guy who enjoyed solving mathematical sentences, then ask his friends

 to solve them themself, just to annoy them)





>>>  1.3 Trial Division  <<<



This is the lesser algorithm there is for attacking the RSA cryptosystem. I put it here because

 hmmm.... hmmmmm..... I am not sure. Maybe i inhaled too much CO2 from the Coke bottle.

Anyways, It is simple:



1) Assign X = 2

2) Is X a divisor of M ?

  * Yes - You found the P factor! Q is M/X, and now you cracked the modulus!

  * No  - Assign X with the next prime and do this step again



This algorithm is very slow when dealing high numbers. I still can't recall why did i put it

 here.





>>>  1.4 The Idea Behind The Described Algorithms  <<<



The next algorithms are called specific factorization algorithms. They can theoreticlly factor

 every modulus, but work best on a key with primes that weren't chosen properly.

Each of them has a short description of the element it attacks, and how to avoid it.





>>>  1.5 Fermat's Factoring  <<<



This attack is based on Fermat's Factoring Theorem (No shit...).

If X^2 - Y^2 = M, then X^2 - M = Y^2.

M is known, so we will brute-force X to find a pair X & Y that comply being Integers.



The algorithm is as follows:

1) Assign X with [SquareRoot(M)]

2) Is SquareRoot(X^2 - M) = [SquareRoot(X^2 - M)] ?

  * No - Increase X by 1 and do this step again

  * Yes - Proceed to step 3

3) Assign Y with SquareRoot(X^2 - M)

4) The factorisation of M is (X+Y)(X-Y), meaning P = X-Y and Q = X+Y



This algorithm is very effective against keys with modulus produced from two close primes.

The bigger ((sqrt(P) - sqrt(Q))^2)/2 is, the greater is the number of steps needed for Fermat's

factoring attack to find P and Q.





>>>  1.6 Pollard's P-1  <<<



The algorithm is as follows:

1) Choose a number A that comply 1 < A < M

2) Choose a number K

3) Is GCD(A,M) = 1 ?

  * Yes - You found a factor, GCD(A,M)

  * No - Proceed to step 4

4) Assign L = A^K mod M

5) Assign D = GCD(L-1, M)

6) Is D a factor of M ?

  * Yes - You found a factor, D. P = D, Q = M/D.

  * No  - Change K and/or A and return to step 3



This algorithm is effective on M such that P or Q has small prime factors.





>>>  1.7 Initial Segment Attack  <<<

There is no exact algorithm, but this what i got: (M#3, M#1... will be used to reffer to the

  # digit of M. Say M = 72342, then M#1 = 2, M#5 = 7...)



1) Assign A = 2

2) Assign T with the minimum number of 0s to check the segment

3) Is M#A, M#(A+1)...M#(A+T) = 0 ?

  * Yes - Proceed to step 4

  * No  - If A < Length(M) Then increase A by 1 and return to step 2, else exit

4) Assign B with the segment from M#A to M#1 (Initial segment starting from M#A)

5) Is GCD(B,M) > 1 ?

  * Yes - You found a factor! P = GCD(B,M), Q = M/P

  * No - If A < Length(M) Then increase A by 1 and return to step 2, else exit



This algorithm is effective if Length(P) < Length(Q) by much, and Q has alot of 0s in it.





______________________________________________________________________________________________



>>>  2.0 Random Attacks  <<<

These attacks are based some statistic theories which i am not fimilliar with.

The basic idea is taking some algorithms (some described in the 1st section) and adding some

randomness to them.



Additional function used here is Random, which denotes a random number.



>>>  2.1 Basic Randomness Attack  <<<

This is the simplest attack on this field. Like Trial Devision on the 1st section, this is the

most basic algorithms and slow algorithm might be created...



1) Assign A = Random Mod sqrt(N)

2) Is A a divisor of N ?

   * Yes - Well good for you!

   * No  - Go back to step 1...





>>>  2.2 Pollard's RHO  <<<

A better algorithm (for some statistical reasons...)



1) Assign X = Random Mod N

2) Assign Y = Random Mod N

3) Is X - Y a divisor of N ?

   * Yes - Good!

   * No  - You know what to do...



This is the most basic idea. It can be improved using a polynomial. Example:

1) Assign X = Random Mod N

2) Assign Y = Random Mod N

3) Set X = (X^2 +1) Mod N

3) Set Y = (Y^2 +1) Mod N

4) Set Y = (Y^2 +1) Mod N Again

5) Set Z = GCD(X-Y, N)

6) Is 1 < Z < N ?

   * Yes - You found a factor (Z) !

   * No - go back to 1...





*** More to come soon! ***





______________________________________________________________________________________________



>>>  3.0 Real-Life Scenarios  <<<

Here I will show some situations that might occur if the application or person making/using

the RSA Cryptosystem is not fully aware of them.

Sometimes trivial knowledge of an organization's security architecture might reveal some flaws

that can be explotied to crack a key, or find the plaintext of a message.





>>>  3.1 Known phi(N)  <<<

Take a look at the RSA Cryptosystem's Key-Generation proccess. There is a great part relying

on (P-1)(Q-1). The 3rd conclusion of the Phi() function states that Phi(N) is equivalent to

(P-1)(Q-1) (Because N = PQ. P,Q = Primes).

The fact that Phi(N) is used in the proccess is useful to us if the app saves a log of the

proccess, or we can find Phi(N) in any other way.

Once Phi(N) is found, we can find P & Q. Here is how:

Phi(N) = PQ - (P+Q) +1 = N -P -Q +1

Therefore: Q = N -Phi(N) +1 -P

Now, N = PQ. Instead of Q we put the value from the last equation. Therefore:

N = P*(N -Phi(N) +1 -P), thus P^2 -P*(N -Phi(N) +1) +N = 0.

This is a typical quadratic equation, which you can solve using the quadratic formula.

Once solved, P is exposed, Therefore Q is exposed, Therefore key is factored.





>>>  3.2 Common Modulus  <<<

The next scenario will relay on this basic one:

Suppose there is a modulus S which is shared among several people. Each has it's own private/public

exponents set, but all based on the same modulus. None of the men know the factors. (This scenerio

may occur if a company chooses to issue all of the employees with keys, and for optimization uses a

common modulus).

If one sends a message to two people sharing the same modulus, and an evesdropper is listening and

reading the communication, the evesdropper can get the original message out of the two.

* M - The original message

* J, K - The two ciphertexts

* S - The common modulus

* A, B - The public exponents of the two recipents



GCD(J,K) = 1, the evesdropper uses the extended euclidian algorithm to find two numbers such that

a*x + b*y = 1. Using x and y, the evesdropper computes:

M = (J^x)*(K^y) Mod S



And there you go...

Credit Card Fraud

Credit Card Fraud            

For most of you out there, money is hard to come by.  Until now:

With the recent advent of plastic money (credit cards), it is 

easy to use someone else's credit card to order the items you have 

always desired in life.  The stakes are high, but the payoff is 

worth it.

Step One:  Getting the credit card information

First off, you must obtain the crucial item:  someone's credit 

card number.  The best way to get credit card numbers is to take 

the blue carbons used in a credit card transaction at your local 

department store.  These can usually be found in the garbage can 

next to the register, or for the more daring, in the garbage 

dumpster behind the store.  But, due to the large amount of credit 

card fraud, many stores have opted to use a carbonless transaction 

sheet, making things much more difficult.  This is where your 

phone comes in handy.

First, look up someone in the phone book, and obtain as much 

information as possible about them.  Then, during business hours, 

call in a very convincing voice - "Hello, this is John Doe from 

the Visa Credit Card Fraud Investigations Department.  We have 

been informed that your credit card may have been used for 

fraudulent purposes, so will you please read off the numbers 

appearing on your Visa card for verification."  Of course, use 

your imagination!  Believe it or not, many people will fall for 

this ploy and give out their credit information.

Now, assuming that you have your victim's credit card number, you 

should be able to decipher the information given.

Step Two:  Recognizing information from carbon copies

Card examples:

[American Express]

XXXX XXXXXX XXXXX

MM/Y1 THRU MM/Y2

JOE SHMOE

[American Express]

XXXX XXXXXX XXXXX

MM/Y1 THRU MM/Y2

JOE SHMOE

Explanation:

   MM/Y1 is the date the card was issued, and MM/Y2 is the

   expiration date.  The American Express Gold Card has numbers

   XXXXXX XXXXXXXX XXXXXXXX, and is covered for up to $5000.00, 

   even if the card holder is broke. 

   

[Mastercard]

5XXX XXXX XXXX XXXX

XXXX AAA DD-MM-YY MM/YY

JOE SHMOE

Explanation:

   XXXX in the second row may be asked for during the ordering

   process.  The first date is when the card was new, and the 

   second is when the card expires.  The most frequent number 

   combination used is 5424 1800 XXXX XXXX.  There are many of 

   these cards in circulation, but many of these are on wanted

   lists, so check these first.

[Visa]

4XXX XXX(X) XXX(X) XXX(X)

MM/YY    MM/YY*VISA

JOE SHMOE

Explanation:

   Visa is the most abundant card, and is accepted almost 

   everywhere.  The "*VISA" is sometimes replaced with "BWG", or

   followed with a special code.  These codes are as follows:

   [1]  MM/YY*VISA V - Preferred Card

   [2]  MM/YY*VISA CV - Classic Card

   [3]  MM/YY*VISA PV - Premier Card

   

   Preferred Cards are backed with money, and are much safer to 

   use.  Classic Cards are newer, harder to reproduce cards with

   decent backing.  Premier Cards are Classic Cards with Preferred

   coverage.  Common numbers are 4448 020 XXX XXX, 4254 5123 6000

   XXXX, and 4254 5123 8500 XXXX.  Any 4712 1250 XXXX XXXX cards

   are IBM Credit Union cards, and are risky to use, although 

   they are usually covered for large purchases.

Step Three:  Testing credit

You should now have a Visa, Mastercard, or American Express 

credit card number, with the victim's address, zip code, and phone 

number.  By the way, if you have problems getting the address, 

most phone companies offer the Address Tracking Service, which is 

a special number you call that will give you an address from a 

phone number, at a nominal charge.  Now you need to check the 

balance of credit on the credit card (to make sure you don't run 

out of money), and you must also make sure that the card isn't 

stolen.  To do this you must obtain a phone number that 

businesses use to check out credit cards during purchases.  If you 

go to a department store, watch the cashier when someone makes a 

credit card purchase.  He/she will usually call a phone number, 

give the credit information, and then give what is called a 

"Merchant Number".  These numbers are usually written down on or 

around the register.  It is easy to either find these numbers and 

copy them, or to wait until they call one in.  Watch what they 

dial and wait for the 8 digit (usually) merchant number.  Once you 

call the number, in a calm voice, read off the account number, 

merchant number, amount, and expiration date.  The credit bureau 

will tell you if it is ok, and will give you an authorization 

number.  Pretend you are writing this number down, and repeat it 

back to them to check it.  Ignore this number completely, for it 

serves no real purpose.  However, once you do this, the bank 

removes dollars equal to what you told them, because the card was 

supposedly used to make a purchase.  Sometimes you can trick the

operator by telling her the customer changed his mind and decided 

not to charge it.  Of course, some will not allow this.  Remember

at all times that you are supposed to be a store clerk calling to 

check out the card for a purchase.  Act like you are talking with 

a customer when he/she "cancels".

Step Four:  The drop

Once the cards are cleared, you must find a place to have the 

package sent.  NEVER use a drop more than once.  The following are 

typical drop sites:

   [1]  An empty house

        

An empty house makes an excellent place to send things.  Send the 

package UPS, and leave a note on the door saying, "UPS.  I work 

days, 8 to 6.  Could you please leave the package on the back door 

step?"  You can find dozens of houses from a real estate agent by 

telling them you want to look around for a house.  Ask for a list 

of twenty houses for sale, and tell them you will check out the 

area.  Do so, until you find one that suits your needs.

   [2]  Rent A Spot

U-Haul sometimes rents spaces where you can have packages sent and 

signed for.  End your space when the package arrives.

   [3]  People's houses

Find someone you do not know, and have the package sent there.  

Call ahead saying that "I called the store and they sent the 

package to the wrong address.  It was already sent, but can you 

keep it there for me?"  This is a very reliable way if you keep

calm when talking to the people.

Do NOT try post office boxes.  Most of the time, UPS will not 

deliver to a post office box, and many people have been caught in 

the past attempting to use a post office box.  Also, when you have 

determined a drop site, keep an eye on it for suspicious 

characters and cars that have not been there before.

Step Five:  Making the transaction

You should now have a reliable credit card number with all the 

necessary billing information, and a good drop site.

The best place to order from is catalogues, and mail order houses.  

It is in your best interest to place the phone call from a pay 

phone, especially if it is a 1-800 number.  Now, when you call, 

don't try to disguise your voice, thinking you will trick the 

salesperson into believing you are an adult.  These folks are 

trained to detect this, so your best bet is to order in your own 

voice.  They will ask for the following:  name, name as it appears 

on card, phone number, billing address, expiration date, method of 

shipping, and product.  Ask if they offer UPS Red shipping (next 

day arrival), because it gives them less time to research an 

order.  If you are using American Express, you might have a bit of 

a problem shipping to an address other than the billing address.  

Also, if the salesperson starts to ask questions, do NOT hang up.  

Simply talk your way out of the situation, so you won't encourage

investigation on the order.

If everything goes right, you should have the product, free of 

charge.  Insurance picks up the tab, and no one is any wiser.  Be 

careful, and try not to order anything over $500.  In some states, 

UPS requires a signature for anything over $200, not to mention 

that anything over $200 is defined as grand theft, as well as 

credit fraud.  Get caught doing this, and you will bite it for a 

couple of years.  Good luck!

Trojan Ports

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

Speed Up Your Bandwidth By 20% ! Windows uses 20% of your bandwidth

Windows uses 20% of your bandwidth Here's how to Get it back

A nice little tweak for XP. Microsoft reserve 20% of your available bandwidth for their own purposes (suspect for updates and interrogating your machine etc..)

Here's how to get it back:

Click Start-->Run-->type "gpedit.msc" without the "

This opens the group policy editor. Then go to:

Local Computer Policy-->Computer Configuration-->Administrative Templates-->Network-->QOS Packet Scheduler-->Limit Reservable Bandwidth

Double click on Limit Reservable bandwidth. It will say it is not configured, but the truth is under the 'Explain' tab :

"By default, the Packet Scheduler limits the system to 20 percent of the bandwidth of a connection,

 but you can use this setting to override the default."

So the trick is to ENABLE reservable bandwidth, then set it to ZERO.

This will allow the system to reserve nothing, rather than the default 20%.

I have tested on XP Pro, and 2000

other o/s not tested.

Please give me feedback about your results

Improve your dialup modem preformance

You can't assume that just because you connected at a speed like 48.3KBps that you will stay there. Today's modems automatically fall back to a lower speed if the line noise is too high to maintain a faster connection, but sometimes they fall back too soon or too far.

Here's how to do it:

Click Start the button.
Select Settings.
Click Control Panel.
Double-click on the Modems icon.
Select your modem.
Click the Properties button.
Click the Connections tab.
Click the Advanced button.
In the "Extra settings" field, type S36=7
Click OK to save your settings.


This will force your modem to try to stay connected at high speeds in two different ways before dropping back to an asynchronous mode with auto speed buffering.

Easily Find Serial Numbers On Google.., easy to do and works like a charm.

Let's pretend you need a serial number for windows xp pro.

in the search bar type in just like this - "Windows XP Professional" 94FBR

the key is the 94FBR code.. it was included with many MS Office registration codes so this will help you dramatically reduce the amount
 of 'fake' porn sites that trick you.

or if you want to find the serial for winzip 8.1 - "Winzip 8.1" 94FBR

just try it out, it's very quick and it works nicely..

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

here is another trick that works fairly decent for finding mp3's on the web (which is hard to do normally, to say the least)

say you want to get, for example, a Garth Brooks song. type this in the search bar - "index of/" "garth brooks" .mp3 the ones you want to check out first are the ones that say "Index of/" in the title of the search result. this technique allows you to easily pull up web folders with direct downloads. it will look the same as if you were logging into a ftp url.. i'm sure you can be pretty flexible on how you type that in, so long as you include "index of/"

i'm sure you can use this for more than just mp3's (it's not perfect but it has worked for me on a few occasions)

always make sure to use the quotations where i placed them. they help pinpoint the correct search results more accurately. just try it out, also if you want to learn how to do more with google look up "google hacks"

Remove Linux From Your Pc Safely, ...and restoring your MBR

First of all you need to know where your Linux OS is installed to. that is what drive it is currently living on.

Bear in mind that Linux formats the drive as HFS rather than Fat/Fat32 or NTFS. ( These are the file systems used by various Operating Systems).

So HFS Partitions are not seen by windows, so its hidden.

To remove the partitions of Linux in WindowsXP go to your 'Control panel' > Admistrative Tools > Computer Managment

Speed Up Internet

Windows 2k/XP

1. First, open the Windows Registry using Regedit, and (after backing up) navigate to:

HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\Tcpip\ServiceProvider

2. Note the following lines (all hex dwords):

Class = 008 ( biggrin.gif - indicates that TCP/IP is a name service provider, don't change

LocalPriority = 1f3 (499) - local names cache

HostsPriority = 1f4 (500) - the HOSTS file

DnsPriority = 7d0 (2000) - DNS

Free World Dialup

Free World Dialup - http://www.freeworlddialup.com/

"Use FWD to make real, free phone calls using your favorite telephone, computer or PDA and any broadband connection. 

Call your neighbor or a relative, next door or in another country; all with the same ease, speed, and high quality."

 Thanks to Jeff Pulver and his crew!

Install A New Hard-disk

Running out of hard disk space, yet also want to keep all the files that are currently on the system in perfect order? Install an extra hard disk, and see your available space rise!

Firstly, make backups of your existing system files. You may never know when these may come in handy. If your current hard disk may go down the pan, you'll be glad to have something to start with again. Also, if you want to use all your data that is on this drive, back it up anyway; ready to be transferred to the new drive. Also, create a system disk for your PC. This can be created by going to Control Panel > Add/Remove Programs, and then the "System Disk" tab. The instructions should be there for you.

Trojan Ports

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

Secret Backdoor To Many Websites

Ever experienced this? You ask Google to look something up; the engine returns with a number of finds, 

but if you try to open the ones with the most promising content, you are confronted with a registration page instead,

 and the stuff you were looking for will not be revealed to you unless you agree to a credit card transaction first....

The lesson you should have learned here is: Obviously Google can go where you can't.

Can we solve this problem? Yes, we can. We merely have to convince the site we want to enter, that WE ARE GOOGLE.

In fact, many sites that force users to register or even pay in order to search and use their content,

 leave a backdoor open for the Googlebot, because a prominent presence in Google searches is known to generate sales leads, site hits and exposure.

Examples of such sites are Windows Magazine, .Net Magazine, Nature, and many, many newspapers around the globe.

How then, can you disguise yourself as a Googlebot? Quite simple: by changing your browser's User Agent.

 Copy the following code segment and paste it into a fresh notepad file. Save it as Useragent.reg and merge it into your registry.

Windows Registry Editor Version 5.00

[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Internet Settings\5.0\User Agent]

@="Googlebot/2.1"

"Compatible"="+http://www.googlebot.com/bot.html"

Voila! You're done!

You may always change it back again.... I know only one site that uses you User Agent to establish your eligability to use its services, 

and that's the Windows Update site...

To restore the IE6 User Agent, save the following code to NormalAgent.reg and merge with your registry:

Windows Registry Editor Version 5.00

[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Internet Settings\5.0\User Agent]

@="Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1)"

Ps:

Opera allows for on-the-fly switching of User Agents through its "Browser Identification" function, while for Mozilla/FireFox browsers a switching utility is available as an installable extension from this url:

help://chrispederick.myacen.com/work/firefox/useragentswitcher/download/

Rapidshare hack!!!!! Free premium acount for all

Hi i got the encrypted message if you decode that message you get a link to register premium acount on rappit share but i dont have a decomipler for PKCS7 help me decode this message and we have all free premium acounts.

Code:
<form action="https://www.paypal.com/cgi-bin/webscr" method="post">
<input type="hidden" name="cmd" value="_s-xclick">
<input type="image" src="https://www.paypal.com/en_US/i/btn/x-click-but03.gif" border="0" name="submit" alt="Buy">
<input type="hidden" name="encrypted" value="-----BEGIN PKCS7-----MIIHZwYJKoZIhvcNAQcEoIIHWDCCB1QCAQExggEwMIIBLAIBADCBlDCBjjELMAkGA1UEBhMCVVMxCzAJBgNVBAgTAkNBMRYwFAYDVQQHEw1Nb3VudGFpbiBWaWV3MRQwEgYDVQQKEwtQYXlQYWwgSW5jLjETMBEGA1UECxQKbGl2ZV9jZXJ0czERMA8GA1UEAxQIbGl2ZV9hcGkxHDAaBgkqhkiG9w0BCQEWDXJlQHBheXBhbC5jb20CAQAwDQYJKoZIhvcNAQEBBQAEgYBFFvMfZAjQgAC+fVptRBdFInJp/ffdC8vvIn9b9lYxPyiPnh3TQbfHV6h9aHpWr+E89rf1cxsxUDyPncHL3Jz7P/Yp+06inr+fnmGu4NHTRdEt9cXNmCf3Yoqbht9wv4o/qXoKngObffB5Z7GqiKiYsJtRAqWOugAR/DTFWtCeUTELMAkGBSsOAwIaBQAwgeQGCSqGSIb3DQEHATAUBggqhkiG9w0DBwQILrdCWgWYLR2AgcBf5B1gWq9YGwe+559cgqrZHXvHwkJ1QXhsZJcycA+VbA4aNf3ka4Pkj3jANfUjghGc6Qr4eb1MjRfCEO/Is7gvQ274Js7Itss3mRRAWFspSiryDoXmUTicJ5JBtXU23plTrk66NivF+ZkPbq1sJmB43Do8HHPI0GXoSrER8V1Kl7YGAou4XauHZYllZ2dTQ80/0enLUdRPYdHsyuxFZKXtoaivxoS97ph18RcbM1lqsQZFg3fcGl5R05WM8kS/3ECgggOHMIIDgzCCAuygAwIBAgIBADANBgkqhkiG9w0BAQUFADCBjjELMAkGA1UEBhMCVVMxCzAJBgNVBAgTAkNBMRYwFAYDVQQHEw1Nb3VudGFpbiBWaWV3MRQwEgYDVQQKEwtQYXlQYWwgSW5jLjETMBEGA1UECxQKbGl2ZV9jZXJ0czERMA8GA1UEAxQIbGl2ZV9hcGkxHDAaBgkqhkiG9w0BCQEWDXJlQHBheXBhbC5jb20wHhcNMDQwMjEzMTAxMzE1WhcNMzUwMjEzMTAxMzE1WjCBjjELMAkGA1UEBhMCVVMxCzAJBgNVBAgTAkNBMRYwFAYDVQQHEw1Nb3VudGFpbiBWaWV3MRQwEgYDVQQKEwtQYXlQYWwgSW5jLjETMBEGA1UECxQKbGl2ZV9jZXJ0czERMA8GA1UEAxQIbGl2ZV9hcGkxHDAaBgkqhkiG9w0BCQEWDXJlQHBheXBhbC5jb20wgZ8wDQYJKoZIhvcNAQEBBQADgY0AMIGJAoGBAMFHTt38RMxLXJyO2SmS+Ndl72T7oKJ4u4uw+6awntALWh03PewmIJuzbALScsTS4sZoS1fKciBGoh11gIfHzylvkdNe/hJl66/RGqrj5rFb08sAABNTzDTiqqNpJeBsYs/c2aiGozptX2RlnBktH+SUNpAajW724Nv2Wvhif6sFAgMBAAGjge4wgeswHQYDVR0OBBYEFJaffLvGbxe9WT9S1wob7BDWZJRrMIG7BgNVHSMEgbMwgbCAFJaffLvGbxe9WT9S1wob7BDWZJRroYGUpIGRMIGOMQswCQYDVQQGEwJVUzELMAkGA1UECBMCQ0ExFjAUBgNVBAcTDU1vdW50YWluIFZpZXcxFDASBgNVBAoTC1BheVBhbCBJbmMuMRMwEQYDVQQLFApsaXZlX2NlcnRzMREwDwYDVQQDFAhsaXZlX2FwaTEcMBoGCSqGSIb3DQEJARYNcmVAcGF5cGFsLmNvbYIBADAMBgNVHRMEBTADAQH/MA0GCSqGSIb3DQEBBQUAA4GBAIFfOlaagFrl71+jq6OKidbWFSE+Q4FqROvdgIONth+8kSK//Y/4ihuE4Ymvzn5ceE3S/iBSQQMjyvb+s2TWbQYDwcp129OPIbD9epdr4tJOUNiSojw7BHwYRiPh58S1xGlFgHFXwrEBb3dgNbMUa+u4qectsMAXpVHnD9wIyfmHMYIBmjCCAZYCAQEwgZQwgY4xCzAJBgNVBAYTAlVTMQswCQYDVQQIEwJDQTEWMBQGA1UEBxMNTW91bnRhaW4gVmlldzEUMBIGA1UEChMLUGF5UGFsIEluYy4xEzARBgNVBAsUCmxpdmVfY2VydHMxETAPBgNVBAMUCGxpdmVfYXBpMRwwGgYJKoZIhvcNAQkBFg1yZUBwYXlwYWwuY29tAgEAMAkGBSsOAwIaBQCgXTAYBgkqhkiG9w0BCQMxCwYJKoZIhvcNAQcBMBwGCSqGSIb3DQEJBTEPFw0wNDEyMjgxNzU3MTVaMCMGCSqGSIb3DQEJBDEWBBQnjhigP+EwdfTLyWpgRzpPEmRSRzANBgkqhkiG9w0BAQEFAASBgB4SgJxKDANsuaSu8MgAdRlOTcH1Q376VMe7YMi9jwtAA/34+GCSnCb1xOoQFWrlC15mOfsUxatnrpXv4uwNth+OsZNnjmkpNFslS7U2/wjAScG6Gos0p0TZiVsuwSUTT59D1lKDmZfTv3fn/pSZaG5qgC7sbezsMmo/J2OVo9NV-----END PKCS7-----">
</form>