SOME OF CERTIFICATES AND PHOTO GRAPHS

London, Nov 22 (ANI): One in five people searching for designer products at low cost actually end up buying counterfeit goods, according to a report.

According to the new consumer report conducted by MarkMonitor, 20 per cent of people shopping from the U.S. and Europe are tricked into purchasing products from fraudulent websites while looking for a good deal on the Internet.

The report also said that most of the time people have absolutely no idea that they are purchasing counterfeit products, the Daily Mail reports.

According to WWD, MarkMonitor surveyed online users in six countries over a period of nine months, monitoring close to 9 million shopping sessions through approximately 9,000 different websites.

The study revealed that for every one customer intentionally purchasing fake goods, 20 were just hoping to find a bargain.

The report pointed out that shoppers taken to scam sites are simply searching terms like 'cheap,' 'discount' and 'outlet' in front of a designer product name.

And the fake sites, which often use real photos of designer items, offer 25 to 50per cent below regular retail prices. (ANI)https://www.google.com.et/search?hl=en&tbo=d&output=search&sclient=psy-ab&q=latest+frauds+on+web&btnG=

WASHINGTON (Reuters) - U.S. and European authorities seized 132 domain names in a counterfeit goods crackdown linked to Cyber Monday, the online bargain day, the head of U.S. Immigration and Customs Enforcement said.

ICE agents seized 101 domain names in the United States and 31 were taken over by officers in Britain, Romania, Belgium, France and Denmark and by Europol, the European Police Office, ICE Director John Morton said.

The sites, many linked to organized crime, were selling fake goods that ranged from National Football League jerseys and Nike Inc shoes to Adobe Systems Inc software, he said.

"There is much money to be made out there duping consumers and that is what is going on," Morton said on a conference call.
Investigations are ongoing and more sites will be seized in coming days.

In the United States, 41 rights owners' merchandise was being sold on the seized sites, Morton said.

ICE said in a statement that one U.S. arrest had been made.

The crackdown marks the third year that ICE has targeted websites selling counterfeit goods on Cyber Monday, the online shopping spree. It is the first time the agency has carried out the operation with European police.

The Cyber Monday seizures raise the total number of U.S. sites taken over to 1,630 since ICE began its anti-counterfeit campaign in June 2010.

PayPal accounts identified with the sites and holding a total of more than $175,000 are being targeted for seizure, the ICE statement said.

Morton put the scale of online piracy in the billions of dollars. Much of the online counterfeiting is in China and other parts of Asia, and U.S. authorities are working with China on the problem, he said.

(Reporting by Ian Simpson; Editing by Dan Grebler)

Diffie-Hellman Example

#include <stdio.h>
#include <math.h>
void main()
{
int q,alpha,xa,xb,ya,yb,ka,kb, x,y,z,count,ai[20][20];
printf("Enter a Prime Number \"q\":");
scanf("%d",&q);
printf("Enter a No \"xa\" which is lessthan value of q:");
scanf("%d",&xa);
printf("Enter a No \"xb\" which is lessthan value of q:");
scanf("%d",&xb);
for(x=0;x<q-1;x++) //Primitive Root Calculation
for(y=0;y<q-1;y++)
ai[x][y] = ((int)pow(x+1,y+1))%q;
for(x=0;x<q-1;x++)
{
count = 0;
for(y=0;y<q-2;y++)
{
for(z=y+1;z<q-1;z++)
if(ai[x][y] == ai[x][z])
{
count = 1;
break;
}
if(count == 1)
break;
}
if (count == 0 )
{
alpha = x+1;
break;
}
}
printf("alpha = %d\n",alpha);
ya = ((int)pow(alpha,xa))%q; yb = ((int)pow(alpha,xb))%q;
ka = ((int)pow(yb,xa))%q; kb = ((int)pow(yb,xb))%q;
printf("ya = %d\nyb = %d\nka = %d\nkb = %d\n",ya,yb,ka,kb);
 

 

if(ka == kb)

 printf("The keys exchanged are same");
else 

printf("The keys exchanged are not same");
}

---

• Here is an example of Duffie-Hellman using small numbers.
  • The eavesdropper monitors what is sent between the sender and the recipient, but does not alter the contents of their communications.

    a = sender's private key		a = 3
    b = recipient's private key		b = 4
    g = public base		g = 1
    p = public (prime) number		p = 5
    s = shared secret key		s = 1

Sender knows does not know p = 5 b = 4 base g = 2 a = 3 23 mod 5 = 3 2b mod 5 = 1 13 mod 5 = 1 3b mod 5 = 1 13 mod 5 = 3b mod 5 s = 1

Recipient knows does not know p = 5 a = 3 base g = 2 b = 4 24 mod 5 = 1 2a mod 5 = 3 34 mod 5 = 1 1a mod 5 = 1 34 mod 5 = 1a mod 5 s = 1

Eavesdropper knows does not know p = 5 a = 3 base g = 2 b = 4 s = 1 2a mod 5 = 3 2b mod 5 = 1 1a mod 5 = s 3b mod 5 = s 1a mod 5 = 3b mod 5

RSA algorithm in C

The RSA algorithm was invented by Ronald L. Rivest, Adi Shamir, and Leonard Adleman in 1977 and released into the public domain on September 6, 2000.

This an example of how a public and private key is used in the encryption process. (Photo credit: Wikipedia)

Public-key systems–or asymmetric cryptography–use two different keys with a mathematical relationship to each other. Their protection relies on the premise that knowing one key will not help you figure out the other. The RSA algorithm uses the fact that it’s easy to multiply two large prime numbers together and get a product. But you can’t take that product and reasonably guess the two original numbers, or guess one of the original primes if only the other is known. The public key and private keys are carefully generated using the RSA algorithm; they can be used to encrypt information or sign it.

 Key generation
1) Pick two large prime numbers p and q, p != q;
2) Calculate n = p × q;
3) Calculate ø (n) = (p − 1)(q − 1);
4) Pick e, so that gcd(e, ø (n)) = 1, 1 < e <  ø (n);
5) Calculate d, so that d · e mod ø (n) = 1, i.e., d is the multiplicative inverse of e in mod  ø (n);
6) Get public key as KU = {e, n};
7) Get private key as KR = {d, n}.

Encryption
For plaintext block P < n, its ciphertext C = P^e (mod n).
Decryption
For ciphertext block C, its plaintext is P = C^d (mod n).

/* C program for the Implementation Of RSA Algorithm Encrypt the text data and Decrypt the same */
#include<stdio.h>
#include<conio.h>
int phi,M,n,e,d,C,FLAG;
int check()
{
int i;
for(i=3;e%i==0 && phi%i==0;i+2)
{
FLAG = 1;
return;
}
FLAG = 0;
}
void encrypt()
{
int i;
C = 1;
for(i=0;i< e;i++)
C=C*M%n;
C = C%n;
printf(“\n\tEncrypted keyword : %d”,C);
}
void decrypt()
{
int i;
M = 1;
for(i=0;i< d;i++)
M=M*C%n;
M = M%n;
printf(“\n\tDecrypted keyword : %d”,M);
}
void main()
{
int p,q,s;
clrscr();
printf(“Enter Two Relatively Prime Numbers\t: “);
scanf(“%d%d”,&p,&q);
n = p*q;
phi=(p-1)*(q-1);
printf(“\n\tF(n) phi value\t= %d”,phi);
do
{
printf(“\n\nEnter e which is prime number and less than phi \t: “,n);
scanf(“%d”,&e);
check();
}while(FLAG==1);
d = 1;
do
{
s = (d*e)%phi;
d++;
}while(s!=1);
d = d-1;
printf(“\n\tPublic Key\t: {%d,%d}”,e,n);
printf(“\n\tPrivate Key\t: {%d,%d}”,d,n);
printf(“\n\nEnter The Plain Text\t: “);
scanf(“%d”,&M);
encrypt();
printf(“\n\nEnter the Cipher text\t: “);
scanf(“%d”,&C);
decrypt();
getch();
}

Overview

Key Generation Generate two large prime numbers, p and q Let n = pq Let m = (p-1)(q-1) Choose a small number e, coprime to m Find d, such that de % m = 1 Publish e and n as the public key. Keep d and n as the secret key.	Encryption C = Pe % n
	Decryption P = Cd % n
	x % y means the remainder of x divided by y

The reasons why this algorithm works are discussed in the mathematics section. Its security comes from the computational difficulty of factoring large numbers. To be secure, very large numbers must be used for p and q - 100 decimal digits at the very least.
I'll now go through a simple worked example.

Key Generation

1) Generate two large prime numbers, p and q

To make the example easy to follow I am going to use small numbers, but this is not secure. To find random primes, we start at a random number and go up ascending odd numbers until we find a prime. Lets have:

p = 7
q = 19

2) Let n = pq

n = 7 * 19
  = 133

3) Let m = (p - 1)(q - 1)

m = (7 - 1)(19 - 1)
  = 6 * 18
  = 108

4) Choose a small number, e coprime to m

e coprime to m, means that the largest number that can exactly divide both e and m (their greatest common divisor, or GCD) is 1. Euclid's algorithm is used to find the GCD of two numbers, but the details are omitted here.

e = 2 => GCD(e, 108) = 2 (no)
e = 3 => GCD(e, 108) = 3 (no)
e = 4 => GCD(e, 108) = 4 (no)
e = 5 => GCD(e, 108) = 1 (yes!)

5) Find d, such that de % m = 1

This is equivalent to finding d which satisfies de = 1 + nm where n is any integer. We can rewrite this as d = (1 + nm) / e. Now we work through values of n until an integer solution for e is found:

n = 0 => d = 1 / 5 (no)
n = 1 => d = 109 / 5 (no)
n = 2 => d = 217 / 5 (no)
n = 3 => d = 325 / 5
           = 65 (yes!)

To do this with big numbers, a more sophisticated algorithm called extended Euclid must be used.

Public Key n = 133 e = 5

Secret Key n = 133 d = 65

Communication

Encryption

The message must be a number less than the smaller of p and q. However, at this point we don't know p or q, so in practice a lower bound on p and q must be published. This can be somewhat below their true value and so isn't a major security concern. For this example, lets use the message "6".

C = P^e % n
  = 6⁵ % 133
  = 7776 % 133
  = 62

Decryption

This works very much like encryption, but involves a larger exponentiation, which is broken down into several steps.

P = C^d % n
  = 62⁶⁵ % 133
  = 62 * 62⁶⁴ % 133
  = 62 * (62²)³² % 133
  = 62 * 3844³² % 133
  = 62 * (3844 % 133)³² % 133
  = 62 * 120³² % 133

We now repeat the sequence of operations that reduced 62⁶⁵ to 120³² to reduce the exponent down to 1.

  = 62 * 36¹⁶ % 133
  = 62 * 99⁸ % 133
  = 62 * 92⁴ % 133
  = 62 * 85² % 133
  = 62 * 43 % 133
  = 2666 % 133
  = 6

And that matches the plaintext we put in at the beginning, so the algorithm worked!
at another example 
 RSA Encryption

• Public Key Encryption
  
• A Worked Example of RSA Encryption

PUBLIC KEY ENCRYPTION

• RSA encryption is the modern standard for sending secure information.
• RSA is based on the modular arithmetic of primes.
In the mid 1970s, three MIT researchers, Ron Rivest, Adi Shamir, and Leonard Adleman, discovered a new method of encryption that relies on the properties of primes and modular arithmetic. This system, RSA (initials of the discoverers), has remained secure for over 20 years, although countless people have attempted to breach it. In 1982, Rivest, Shamir, and Adleman founded RSA Security, a company that would go on to provide the standard in data encryption used worldwide on the Internet.
RSA encryption relies not on one key, as in our previous Caesar cipher examples, but on two. One of these keys is made public, and the other is kept private. If you wish someone to send you an encrypted message, you simply tell them your public key, and they can then encrypt their message so that only you can read it. They do not need to know your private key for this system to work. Here is a brief, and somewhat simplified, description of the process.
As we have seen throughout this unit, multiplying two primes together is easy to do, but factoring a large number into primes is a nightmarish trial-and-error scenario if the number has only two large primes as factors. This property of primes provides the basis of the RSA encryption scheme.
In general, to encrypt a message using the RSA method, we choose two large primes, p and q, and multiply them to produce a number N. The number N will be the modulus of our system and will be made public. This is fine; because p and q are both large and prime, their product, N, will be practically impossible to factor and can be confidently made public knowledge. We will now use p and q to make our public and private keys.
To make our keys, we first subtract 1 from both p and q and then multiply the results: (p-1)(q-1) = T. At this point, we will choose our public key, which can be any number less than T that shares no factors with it. This public key is what we referred to in the previous section as e. To construct our private key, we need to identify a number, d, such that when it is multiplied by e, the public key, it is congruent to 1 mod T. In other words, the following congruence must hold:
d × e ≡ 1 mod T
Now, if we want someone to send us a message that only we can read, we tell them the modulus, N, and the encryption key, e. They then convert their message from letters to a series of number strings, or "words," just as we have been doing in previous sections of this text. We must be careful that none of the words are larger than the modulus, which would result in some words being indecipherable. Let's say this word is the number M. The encrypter raises each word to the "e^th" power, mod N. This new word, let's call it C, is now encrypted and can be sent to us. In mathematical terms, we have:
C ≡ Me mod N
We receive the coded number C. To decrypt it, all we have to do is raise it to the "d^th" power, mod N. This works because C^d ≡ (M^e)^d mod N, and Rivest, Shamir, and Adleman were able to show that M^ed ≡ M mod N. Recall that we chose e and d such that, d times e triple equal 1 mod T (d × e = 1 mod T), so there is some mathematics hidden in this statement! Thus, our private key, known
only to us, undoes the encryption of the public key. Anyone who knows e and N can send us a message that only we, because we know d, can decrypt. To get a better idea, let's look at an example.

A WORKED EXAMPLE OF RSA ENCRYPTION

Real RSA encryption uses very large numbers, which would be very difficult— not to mention less than illuminating—to use here. In this example, we'll use smaller numbers that are not at all realistic but that illustrate how the method works.
First, let's choose the primes that form the foundation of our scheme, p and q:
p = 17 and q = 19
By multiplying p and q, we get our modulus, N:
N = 17 × 19 = 323
Now, we find T by subtracting 1 from both p and q and multiplying:
T = (p-1) × (q-1) = (16) × (18) = 288
Next, we can select the encryption key, the public key, e, so that it has no common factors with 288. Let's let e = 11.
To find the decryption key, d, we need a number that, multiplied by e, gives a product that is congruent to 1 mod 288. Expressed mathematically, we need to find a number d such that:
11 × d = 1 + n(288)
Using trial and error, we find that 131 works because 11 × 131 = 1 + 5(288).
So, our public key is N = 323 and e = 11.
The private key is d = 131.
If someone wants to send us the message "ABC" securely, using this scheme, we tell them N and e. They first convert "ABC" to "123" and then do the following arithmetic:
123^e = (123)¹¹ mod 323 = 81
The sender could then send the message, "81," over a public line of communication with confidence.
To decrypt the code, "81," we can use N and d as follows:
81^d = (81)¹³¹ mod 323 = 123
The message "81" becomes "123" after decryption, which we can then easily convert to "ABC," which was the intended message.
Notice that in order to break this scheme, a hacker would have to find the two numbers that when multiplied together yield 323. The square root of 323 is a little less than 18, so they would have to try a maximum of 7 divisors before they would be guaranteed to break the modulus into the original primes that were used to find the public and private keys. Using a computer, this would not be difficult, so real RSA encryption uses numbers that are sufficiently large so that even the fastest computers would take longer than a human lifespan to factor them. It is upon this foundation, the difficulty of factoring products of two large prime numbers, that modern data encryption rests.

DEAR RAMANJANEYULU DAYINABOYINA (LOGIN ID: D_RAMU2002@YAHOO.COM), HERE ARE NEW JOBS MATCHING YOUR PROFILE.

	Dear RAMANJANEYULU DAYINABOYINA (Login ID: d_ramu2002@yahoo.com), Here are new jobs matching your profile.
	You last updated your profile on 25th Oct, 2012. Remember, employers prefer recently updated profiles
	Update your profile now Forgot your Password?
	Looking for a different kind of a job? Tell us, and get relevant jobs in your inbox. Set your Job Alert
	Join Cisco Talent Network- Assess Yourself for Free & Get Ahead
	Jobs in your preferred locations Do you find these jobs relevant? Yes | No
	Java / C++ ( SDE / Architect / SDM ) (4-9 yrs.) Pylon Management Consulting Pvt Ltd (Bengaluru/Bangalore, Mumbai, Chennai) View & Apply Openings with Product Based Companies Strong in Java / C++ ( Unix ) technologies, DataStructures, ProblemSolving Skills. Strong in Coding and Designing the Sr. Java Developer (8-12 yrs.) PSM Energy Pvt Ltd (Noida) View & Apply Primary Skill Required: Java/J2ee, with any of(Hibernate/JDO/DataNucleus) ORM tool. 1. Experience on RESTFUL Webservices, JavaScript, AJAX frameworks would be Job || Opening for Filenet Developer || (4-9 yrs.) ABC Consultants Pvt Ltd (Chennai) View & Apply Hi, Greetings of the Day! We have few urgent openings with one of our client for the profile of Filenet Developer.Kindly find the details below for the sam Job Opportunity for Tool Management - HP QC Professional @tcs (3-8 yrs.) Tata Consultancy Services Ltd. (Chennai) View & Apply Greetings from TCS!   We are currently looking out for Tool Management - HP QC for our Chennai Branch. The detailed JD is as follows : Java Developer/ Programmer (4-9 yrs.) Radial HR Solutions (Kolkata) View & Apply * 4+ years of experience in software development in Java platform using J2EE * Preferably knowledge in Flex * Must have experience in development framework Eclipse, Spring, Job Opportunity for Sterling Commerce @ TCS (5-8 yrs.) Tata Consultancy Services Ltd. (Chennai) View & Apply Greetings from TCS!   We are currently looking out for Sterling Commerce for our Chennai Branch. The detailed JD is as follows : &nbs Hiring - Software Developer (c++ & Opengl) @ Mumbai (3-8 yrs.) Rolta India Limited (Mumbai) View & Apply Greetings from Rolta India Ltd, We have an exciting job opening for you. Below is the Job Description pls let me know your interest & availability. Here Dot Net Developer, Biztalk Developer, MNC Pune (3-8 yrs.) Value c Consulting Services Pvt Ltd (Pune) View & Apply For reputed MNC in pune Dot net , biz talk 3-8 yrs experience reqd. 1 consultant role , another senior profile reqd. Pl. email yr cv, annual ctc notice period to consultan Python Engineer (5-10 yrs.) Accolite Software India Pvt Ltd (Bengaluru/Bangalore) View & Apply As a Python Developer on the team, you will lead a team on a release. Own a major module in a release or a minor release from end-to-end delivery. Own end-to-end delivery of Java Developer (5-7 yrs.) Steelwedge Technologies Pvt Limited (Hyderabad / Secunderabad) View & Apply Java,J2ee ATG and J2ee - Immediate Opportunity With UK Based Public Ltd. Company (4-8 yrs.) Quadrangle (Hyderabad / Secunderabad) View & Apply At least 4-6 years experience in building ATG and J2EE applications, particularly enterprise web apps *Experience in working with industry-standard application Senior Software Developer (java) - Front-end / UI (8-12 yrs.) Censhare India Private Limited (Delhi/NCR, Gurgaon) View & Apply Description: Java Developer (eclipse Development -plugin Development ) (3-8 yrs.) TalentAhead India Pvt. Ltd. (Bengaluru/Bangalore) View & Apply Relevant experience of 3.5-6 yrs Maintenance and upgration in Java Eclipse development -plugin development Java developer with experience in Xpath XSL Sr. Software Engineer (4-7 yrs.) Altair Engineering (Bengaluru/Bangalore) View & Apply Altair Engineering is looking for an experienced developer with strong Java/C/C++ skills to work on PBS Pro. PBS Pro is a leading workload management solution, p Ruby on Rails Developer for MNC in Bangalore (3-8 yrs.) Insight Consultancy Services (Bengaluru/Bangalore) View & Apply 3 -10 years of hands on development experience in rich internet applications using HTML/DHTML3+ yrs experience on ROR, Good communication skills, a relevant degree/diploma.- h
	View all matching jobs » Do you find these jobs relevant? Yes | No
	Double your visibility and enhance your job search. Call 1800-102-5557 (toll free) now!
	You last updated your profile on 25th Oct, 2012. Remember, employers prefer recently updated profiles
	Update your profile now Forgot your Password?
	Looking for a different kind of a job? Tell us, and get relevant jobs in your inbox. Set your Job Alert
	Wish you good luck in your job search. Regards, naukri.com team Join us on Facebook & Twitter
	Unsubscribe | Report a problem You have received this mail because your e-mail ID is registered with Naukri.com. This is a system-generated e-mail, please don't reply to this message. The jobs sent in this mail have been posted by the clients of Naukri.com. IEIL has taken all reasonable steps to ensure that the information in this mailer is authentic. Users are advised to research bonafides of advertisers independently. IEIL shall not have any responsibility in this regard. We recommend that you visit our Terms & Conditions and the Security Advice for more comprehensive information

WINDOWS 8: DIFFERENT VERSIONS EXPLAINED AND INDIAN PRICING

Ramu dayinaboyina  Oct 26, 2012, 07.51AM IST

• 

(The new OS is significantly…)

NEW DELHI: Windows 8 has been launched. The new OS is significantly different from Windows 7 or Windows XP. It has a number of new features that will -- for good or bad -- change the way you work with computers. We highlighted some of the changes in a feature here as well as talked about how Windows 8 fares in day-to-day usage.

If you are planning to get Windows 8, you should read them and then decide whether you want or not. But just to recap, here are a few points that may help you reach a decision:

1-Windows 8 has some learning curve associated with it, but once you get hang of how it works (it will take around a week or two), you will find that Windows 8 is overall much simpler to use and is much better looking compared to earlier Windows.

2-Windows 8 works best if you have computer or laptop with a touchscreen.

3-If you like the simplicity and user interface of tablets, you will likely love Windows 8.

4-Overall, Windows 8 is faster and smoother compared to Windows 7.

5-Microsoft has tried to simplify the OS. In some cases this means lots of options used by power users are buried deep inside the system. For example, even Start button has been removed. You may not like Windows 8 if you are a power user.

6-Currently, the Windows Store doesn't have many apps that you may use on daily basis. But whatever apps it has are beautiful and simple to use. Though some users may find the apps too simple.

So, after carefully weighing everything you decided to get Windows 8? Ok. But before we talk about availability, let's take a look at different versions of Windows 8.

Windows RT: Pay special attention to this version. A consumer won't be able to buy it in the open market but it is important that you know about it. Windows RT is the most basic version of Windows 8. It is meant ONLY for computers or tablets that run on ARM processors. This means, if a tablet or computer runs on AMD or Intel processor it can't be powered by Windows RT. At least, not at the moment.

The difference between Windows RT and other versions of Windows 8 is that on the device powered by Windows RT, you will not be able to run legacy apps. If you are a geek, here is a better explanation: Windows RT can't run X86 programmes. Only compatible programmes sold or distributed through Windows Store will run on devices powered by Windows RT. This means if you buy Microsoft Surface, a tablet which is powered by Windows RT, you can't download and run VLC Player or Picasa or Firefox on it.

To be specific, Windows RT is meant for tablets. It will offer probably better battery life and will be much simpler to use, but in terms of functionality, it is likely to be limited compared to a proper computer.

Windows 8 Enterprise: This version is for customers who want volume licencing. The enterprise version has several specific features that are important for system administrators in large companies.

Windows 8: This is the vanilla version of the new OS. And it lacks features like Encryption and Windows-To-Go. Currently, Microsoft has not announced any pricing for it.

Windows 8 Pro: This is the version of Windows that Microsoft is pushing in the market at the moment. It has almost all the features of Windows 8. The only bits missing are the ones used by enterprise customers. If you are buying a computer with Windows 8 or want to update the OS on your existing machine, this is the version you should buy.

Hardware requirements: Microsoft has said that any computer that is running Windows 7 can run Windows 8 with ease. If you want to be specific, the company says that a machine should have:

1GHz or faster processor, 1GB RAM (32-bit) or 2GB RAM (64-bit), 16GB available hard disk space (32-bit) or 20GB (64-bit), DirectX 9 graphics device with WDDM 1.0 or higher driver. For Modern UI apps a screen with a resolution of 1024x768 pixels is mandatory.

Now, let's talk about how you can get Windows 8.

Microsoft believes that most people will get the new OS when they buy a new computer. So, it is focussing a lot on making sure that Windows 8 runs on all new computers sold in the market. According to the company, from today onwards over 250 models of Windows 8-powered computers and tablets will be available in Indian market.

But if you are someone who wants to buy Windows 8 for your existing computer, you have three options at the moment.

If you bought your computer after June 2, 2012 you can pay Rs 699 to upgrade to Windows 8 Pro. This offer will last until January 31, 2013.

If you use Windows XP, Windows Vista or Windows 7, you can upgrade to Windows 8 Pro after paying Rs 1,999. This offer will last until January 31, 2013. One important thing to note here is that this offer is applicable only if you download the installation disk of Windows 8 from Microsoft website.

If for some reason you cannot download the OS and need the retail box, you can buy Windows 8 Pro at a price of around Rs 4,000. This offer too is valid until January 31, 2013. After that the OS is likely to cost above Rs 11,000.

Upgrade to Windows 8 Pro from your pirated Windows 7 Clean installation steps Rate Topic:

Yes, you can get Windows 8 Pro for just $39.99 USD even if you have non-legit pirated version of Windows 7. I'm not encouraging piracy. I'm just stating that it's the right time to convert/upgrade your pirated copy of Windows OS to genuine one.

Here are the steps for the clean installation of Windows 8 with the Upgrade license.

• Download Windows 8 Pro Upgrade Assistant. The file is 5 MB only.
• It will scan your Windows 7 license. SLIC injection passes the test.
• Chose the digital download and make payment via Credit Cards or PayPal.
• You will get your product key after the payment.
• After downloading the setup files, you will be asked to choose how you want the OS.
• It's recommended to build an ISO file and burn it to a DVD with built in DVD burner software, if you are upgrading from Windows 7 (legit or non-legit).
• After burning the DVD, turn off your PC, and set your DVD drive as the primary drive in BIOS.
• Start the PC and the installation will start. You can format the C: drive and recreate the partition at this stage.
• Installation is automated and will take a few minutes only. Enjoy your shiny new OS after the installation.

Remember, you don't have to backup your old copy of Windows 7 and it's product code. Just backup the DVD of Windows 8 and keep your product code at the safe place. Next time, whenever you need to re-install Windows 8, just pop-in the Windows 8 DVD.

This post has been edited by RamuDayinaboyina: 26 October 2012 - 01:12 PM