- by della" /> " /> "> . . . . .">
This presentation is the property of its rightful owner.
1 / 191

# PowerPoint PPT Presentation

<?xml version="1.0" encoding="UTF-8"?>. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">. <!--138 H=0 LS=0 L=N/A OS=N/A O=N/A T=0-->. <html xmlns="http://www.w3.org/1999/xhtml">. <head>.

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

• if(a>=b){

• a-=b;

• }else{

• n+=b;

• }

• b=b/2;

### if(a>=0x80000000){

• ++n;

• a-=0x80000000;

### if(b>=0x80000000){

• ++n;

• b-=0x80000000;

### if(n==1){

• if(a>=0x80000000){

• a-=0x80000000;

• }else{

• a+=0x80000000;

• }

### for(var i=0;i<s;i++){

• if(a>=0x80000000){

• a-=0x80000000;

• }

• a=a*2;

• if(a%2){

• a-=1;

• }

• a=a/2;

### switch(Math.floor(n/20)){

• case 0:return OR(AND(B,C),AND(NOT(B),D));

• case 2:return OR(OR(AND(B,C),AND(B,D)),AND(C,D));

• default:return XOR(XOR(B,C),D);

### for(i=0,j=0;j<L;i++,j+=4){

• O[j]=AND(RS(I[i],24),0xFF);

• O[j+1]=AND(RS(I[i],16),0xFF);

• O[j+2]=AND(RS(I[i],8),0xFF);

• O[j+3]=AND(I[i],0xFF);

• O[i]=0;

### for(i=16;i<80;i++){

• W[i]=S(XOR(XOR(XOR(W[i-3],W[i-8]),W[i-14]),W[i-16]),1);

### for(i=0;i<80;i++){

• e=AND(d,0xFFFFFFFF);

• d=AND(c,0xFFFFFFFF);

• c=AND(S(b,30),0xFFFFFFFF);

• b=AND(a,0xFFFFFFFF);

• a=AND(t,0xFFFFFFFF);

### for(i=0;i<L;i++){

• d[di+i]=s[si+i];

### if(BL){

• if(64-BL>L){

• i=L;

• }else{

• i=64-BL;

• }

• CA(B,BL,I,0,i);

• BL+=i;

• if(BL<64){

• return;

• }

• TF(B);

• BL=0;

### while(L-i>=64){

• CA(B,0,I,i,64);

• i+=64;

• TF(B);

### if(BL<56){

• CA(B,BL,PD,0,59-BL);

### }else{

• if(BL<64){

• CA(B,BL,PD,0,64-BL);

• }

• TF(B);

• CA(B,0,PD,0,58);

### for(i=0;i<20;i++){

• R+=String(HEX1(D[i]));

• R+=String(HEX2(D[i]));

### for(s=0,d=0;s<C.length;s++){

• u=C.charCodeAt(s);

• if(u<0x80){

• c[d++]=u;

• }else if(u<0x0800){

• c[d++]=OR(RS(u,6),0xC0);

• c[d++]=OR(AND(u,0x0000003F),0x80);

• }else if(u<0x00010000){

• c[d++]=OR(RS(u,12),0xE0);

• c[d++]=OR(AND(RS(u,6),0x0000003F),0x80);

• c[d++]=OR(AND(u,0x0000003F),0x80);

• }else if(u<0x00200000){

• c[d++]=OR(RS(u,18),0xF0);

• c[d++]=OR(AND(RS(u,12),0x0000003F),0x80);

• c[d++]=OR(AND(RS(u,6),0x0000003F),0x80);

• c[d++]=OR(AND(u,0x0000003F),0x80);

• }

### for(s=0,d=0;s<P.length;s++){

• u=P.charCodeAt(s);

• if(u<0x80){

• p[d++]=u;

• }else if(u<0x0800){

• p[d++]=OR(RS(u,6),0xC0);

• p[d++]=OR(AND(u,0x0000003F),0x80);

• }else if(u<0x00010000){

• p[d++]=OR(RS(u,12),0xE0);

• p[d++]=OR(AND(RS(u,6),0x0000003F),0x80);

• p[d++]=OR(AND(u,0x0000003F),0x80);

• }else if(u<0x00200000){

• p[d++]=OR(RS(u,18),0xF0);

• p[d++]=OR(AND(RS(u,12),0x0000003F),0x80);

• p[d++]=OR(AND(RS(u,6),0x0000003F),0x80);

• p[d++]=OR(AND(u,0x0000003F),0x80);

• }

### }else{

• E["savedpw"].value="1";

### if (E["userid"].length==0){

• return false;