CodePaste.NET

Wed, 30 May 2012 09:50:35 -0700

menu channel* {
  -
  Gather's notice
  .ON { set %gtrntc on }
  .OFF { set %gtrntc off }
  .-
  .Status [[ $+ %gtrntc $+ ]] { halt }
}

Wed, 30 May 2012 09:48:50 -0700

on *:notice:*Gather* *START* *-m*:#vgames.gathers {
  if (%gtrntc == on) && (vG|Gathers iswmcs $nick) {
    if (*7* iswmcs $1-) {
      splay -p vgamesgtr1.mp3
      echo -s Gather #1 is now running !add
    }
    if (*11* iswmcs $1-) {
      splay -p vgamesgtr2.mp3
      echo -s Gather #2 is now running @add
    }
    if (*4* iswmcs $1-) {
      splay -p vgamesgtr3.mp3
      echo -s Gather #3 is now running +add
    }
    if (*9* iswmcs $1-) {
      splay -p vgamesgtr4.mp3
      echo -s Gather #4 is now running *add
    }
    if (*8* iswmcs $1-) {
      splay -p vgamesgtr5.mp3
      echo -s Gather #5 is now running -add
    }
    if (*10* iswmcs $1-) {
      splay -p vgamesgtr6.mp3
      echo -s Gather #6 is now running ^add
    }
    if (*6* iswmcs $1-) {
      splay -p vgamesgtr7.mp3
      echo -s Gather #7 is now running .add
    }
  }
}

Wed, 30 May 2012 09:45:48 -0700

on *:open:? {
  if (-sBNC iswm $nick) || (-psyBNC iswm $nick) {
    splay -p bncpm.mp3
    halt
  }
  elseif (S iswm $nick) {
    splay -p swarning.mp3
    halt  
  }
  elseif (*details* iswm $nick) || (*gathers* iswm $nick) || (*rankbot* iswm $nick) {
    echo -se $1-
    halt
  }
  else {     
    splay -p pm.mp3
  }
}

Wed, 30 May 2012 07:50:11 -0700

package szigorendez;

public class SzigoRendez {

    public static void main(String[] args) {
        int tomb[] = {56 66 13};
        int tomb2[] = {6 7 6};
        int tomb3[] = new int[(tomb.length + tomb2.length)];
        for (int i = 0; i < tomb3.length; i++) {
            if (i < tomb.length) {
                tomb3[i] = tomb[i];
            }
            if (i >= tomb.length) {

                tomb3[i] = tomb2[i - tomb.length];
            }
        }

        for (int i = 0; i < tomb3.length; i++) {
            System.out.print(tomb3[i] + " ");
        }
        System.out.println();
        int csere = -25;
        for (int i = 0; i < tomb3.length - 1; i++) {

            if (tomb3[i] > tomb3[i + 1]) {
                csere = tomb3[i + 1];
                tomb3[i + 1] = tomb3[i];
                tomb3[i] = csere;
                i = 0;
            }

        }
        for (int i = 0; i < tomb3.length; i++) {
            System.out.print(tomb3[i] + " ");
        }
    }
}

Wed, 30 May 2012 07:46:45 -0700

(下午 10:09:42) 竹澤: ....好搜宅一找還蠻多的啊
(下午 10:09:50) 柯神: 真的嗎@@
(下午 10:09:58) 竹澤: http://www.j2h.com.tw/house/8541.html
(下午 10:10:18) 竹澤: 嗯   大概十間左右
(下午 10:10:28) 柯神: 這個沒圖
(下午 10:10:31) 柯神: 有照片嗎
(下午 10:10:42) 竹澤: 他地點很近
(下午 10:10:44) 柯神: 喔
(下午 10:10:44) 竹澤: 超優
(下午 10:11:05) 竹澤: 用走得就到台大醫院了
(下午 10:11:07) 柯神: 余 在幫我找的時候
(下午 10:11:11) 柯神: 因為沒照
(下午 10:11:18) 竹澤: 嗯
(下午 10:11:18) 柯神: 因為沒照片，他就濾掉
(下午 10:11:26) 柯神: 因為他說，兩個女生住的話
(下午 10:11:31) 柯神: 可能安全要考量
(下午 10:11:39) 柯神: 沒照片他直接放棄
(下午 10:11:50) 竹澤: 有沒有圖和安全....沒直接相關吧
(下午 10:11:54) 竹澤: 只是要當場看
(下午 10:12:08) 柯神: 對
(下午 10:12:13) 柯神: 但是通常沒放圖的也是
(下午 10:12:33) 竹澤: http://free.housetube.tw/115765
(下午 10:12:55) 竹澤: 這個也不錯
(下午 10:13:27) 柯神: 這都是中正區嗎
(下午 10:13:44) 柯神: 我看到了
(下午 10:13:44) 竹澤: 他在捷運附近
(下午 10:14:04) 竹澤: http://www.twhg.com.tw/rent/rentobj.php?thID=XA20716353
(下午 10:14:11) 竹澤: 這個不錯，以女性為主
(下午 10:14:51) 柯神: 對
(下午 10:15:00) 柯神: 但是才6坪
(下午 10:15:24) 竹澤: 兩人住  其實六坪我覺得差不多??
(下午 10:15:35) 柯神: 喔
(下午 10:19:29) 柯神: http://citynet.com.tw/free/searchshow.php?freeid=357374&firstrec=1&queryid=12586907&sortorder=6&mode=1&picmode=2&herb=4.9407832
(下午 10:20:04) 竹澤: 叔叔會住那邊嗎
(下午 10:20:09) 柯神: 應該只有嬸嬸
(下午 10:20:13) 柯神: 還有小雨 吧
(下午 10:20:22) 柯神: 因為平常日要上班的
(下午 10:20:27) 竹澤: 啊？   不是小遊+小雨嗎
(下午 10:20:47) 竹澤: 剛好我也看到這間
(下午 10:21:18) 竹澤: 好搜宅，用捷運搜尋，然後套房、限女、可短期
(下午 10:21:21) 竹澤: 這樣找最快
(下午 10:21:24) 柯神: 我中午有看到這間
(下午 10:21:51) 竹澤: 如果確定是女生住的，那我就鎖定限女
(下午 10:21:54) 竹澤: http://citynet.com.tw/free/searchshow.php?freeid=355743&firstrec=1&queryid=12582301&sortorder=6&mode=1&picmode=2&herb=6.714428
(下午 10:22:11) 竹澤: http://citynet.com.tw/free/searchshow.php?freeid=355743&firstrec=1&queryid=12582301&sortorder=6&mode=1&picmode=2&herb=6.714428
(下午 10:22:48) 柯神: 我看了
(下午 10:22:55) 柯神: 永和路二段53巷 
(下午 10:23:00) 柯神: 這多遠?
(下午 10:23:17) 竹澤: 走不到，可是近頂溪捷運站
(下午 10:23:25) 柯神: = =
(下午 10:23:38) 竹澤: 捷運三站
(下午 10:23:47) 竹澤: 到台大醫院站
(下午 10:24:33) 竹澤: 五樓頂樓？
(下午 10:24:46) 柯神: = =
(下午 10:29:29) 柯神: 其實感覺很少
(下午 10:29:47) 柯神: http://citynet.com.tw/free/searchshow.php?freeid=372511&firstrec=1&queryid=12586907&sortorder=6&mode=1&picmode=2&herb=4.9560456

租出去了
(下午 10:29:52) 竹澤: 因為是用條件搜尋
(下午 10:30:16) 竹澤: 其實一定有隱藏的，就是那些願意租，但是需要用談的
(下午 10:30:32) 柯神: 那個太難找了
(下午 10:30:37) 竹澤: 這種嚴何說起來，會更好一點，過濾成本太高了
(下午 10:31:25) 竹澤: http://citynet.com.tw/free/searchshow.php?freeid=373778&firstrec=29&queryid=12586907&sortorder=6&mode=1&picmode=2&herb=0.2977592
(下午 10:31:41) 柯神: 這沒圖啊= =
(下午 10:32:02) 竹澤: 我覺得   限女生就算有一些保障了
(下午 10:32:07) 竹澤: 所以先選起來
(下午 10:32:09) 柯神: 好
(下午 10:33:45) 柯神: 那找古亭站呢
(下午 10:33:49) 柯神: 會有機會嗎
(下午 10:33:58) 竹澤: 如果是限女的話
(下午 10:34:05) 竹澤: 大多都是沒有照片
(下午 10:34:14) 柯神: ok
(下午 10:34:40) 竹澤: http://citynet.com.tw/free/searchshow.php?freeid=354743&firstrec=1&queryid=12612487&sortorder=6&mode=1&picmode=2&herb=5.6561016
(下午 10:34:44) 竹澤: 這個是四站
(下午 10:34:50) 竹澤: 有圖
(下午 10:37:24) 柯神: 講電話中
(下午 10:37:38) 柯神: 跟 亞同 講電話
(下午 10:37:45) 竹澤: 喔喔
(下午 10:37:52) 竹澤: 越洋電話？
(下午 10:37:59) 柯神: LINE
(下午 10:37:59) 柯神: = =
(下午 10:38:01) 竹澤: Requirement 要確定~
(下午 10:38:06) 竹澤: 這樣才好找~
(下午 10:38:27) 竹澤: 還有  明確回來的時間
(下午 10:39:11) 柯神: 嗯
(下午 10:39:14) 柯神: 時間不好確定
(下午 10:39:19) 柯神: 但是人數的話 應該就2人
(下午 10:39:22) 竹澤: OK
(下午 10:39:24) 柯神: 離交通要點 近一點
(下午 10:39:33) 竹澤: 坐捷運可嗎
(下午 10:39:59) 竹澤: 大半夜應該只能用計程車吧
(下午 10:40:08) 柯神: 電話中
(下午 10:40:33) 竹澤: 偶之~~  幫我有CHECK到就好~
(下午 10:40:43) 柯神: 電話中

Wed, 30 May 2012 07:05:26 -0700


import java.io.IOException;
import java.util.LinkedList;
import java.util.List;

import com.google.gson.stream.JsonReader;
import com.google.gson.stream.JsonToken;


public class ImplementationVisitor implements Visitor {


	private JsonReader reader;
	private String searchLanguage;

	boolean inImplementation = false;
	boolean in = false ;
	boolean in3 = false;

	//XXX to delete
	int i = 0;
	
	List<String> foundImplementation = new LinkedList<String>();
	String interestedImpl = "";

	ReadImplementation readImpl;

	public ImplementationVisitor(JsonReader reader String searchLanguage){
		this.reader = reader;
		this.searchLanguage = searchLanguage;
	}

	@Override
	public void visit(ReadName jname) throws IOException {
		String name = reader.nextName();
		if(name.equals("Feature")){ // Implementation is iterated
			System.out.println("!!! FINISH !!!");
			System.out.println(foundImplementation);
			System.exit(0);
		} else if(inImplementation){
			helpFunction(name);

		} else if(name.equals("Implementation")){ // In Implementation XXX iterate over all of them
			System.out.println("[INFO] IMPLEMENTATION found");
			inImplementation = true;
			nextToken();
		} else  { // Skip all before Implementation
			System.out.println(name);
			reader.skipValue();
			nextToken();
		}
	}

	@Override
	public void visit(ReadString jstring) throws IOException {
		reader.nextString();
		nextToken();
	}

	@Override
	public void visit(ReadBeginObject jBeginObject) throws IOException {
		reader.beginObject();
		nextToken();
	}

	@Override
	public void visit(ReadEndObject jEndObject) throws IOException {
		reader.endObject();
		nextToken();
	}

	@Override
	public void visit(ReadBeginArray jBeginArray) throws IOException {
		reader.beginArray();
		nextToken();
	}

	@Override
	public void visit(ReadEndArray jEndArray) throws IOException {
		reader.endArray();
		nextToken();

	}


	public void visit(ReadImplementation jReadImpl) throws IOException{
		if(jReadImpl instanceof ReadName)
			visit((ReadName)jReadImpl);
		else if(jReadImpl instanceof ReadBeginObject)
			visit((ReadBeginObject)jReadImpl);
		else if(jReadImpl instanceof ReadEndObject)
			visit((ReadEndObject)jReadImpl);
		else if(jReadImpl instanceof ReadString)
			visit((ReadString)jReadImpl);
		else if(jReadImpl instanceof ReadBeginArray)
			visit((ReadBeginArray) jReadImpl);
		else if(jReadImpl instanceof ReadEndArray)
			visit((ReadEndArray) jReadImpl);
		else 
			System.out.println("FAIL");
	}


	private void helpFunction(String name) throws IOException {
		if(!in){
			System.out.println(name);
			System.out.println("1");
			interestedImpl = name;
			in = true;
			nextToken();
		}
		else if(in && (name.equals("features"))){
			System.out.println(name);
			System.out.println("2");
			in = false;
			nextToken();
		}
		else if(in && name.equals("languages")){
			System.out.println(name);
			System.out.println("3");
			in3 = true;
			System.out.println("[***]" + reader.peek());
			nextToken();
		}
		else if(in3) {
			//nextToken();
			//String nameToProof = reader.nextName();
			//if(reader.peek()==JsonToken.NAME && nameToProof.equals("name"))
			reader.nextString();
				String nameToProof = reader.nextName();
			if(reader.peek()==JsonToken.STRING && nameToProof.equals("name"))
				{
				System.out.println("asd");
				if(proofLanguage()){
					System.out.println("prooflanguage");
					foundImplementation.add(interestedImpl);
					for(int i = 0; i < foundImplementation.size();i++){
			               System.out.println(foundImplementation.get(i));
			            }
					
				}else{
					
				}
				nextToken();
			}
			else if (reader.peek()==JsonToken.END_ARRAY){
				System.out.println("lasd");
				in3 = false;
				System.exit(0);
				nextToken();
			}
		} else {
			System.out.println(name);
			System.out.println("4");
			reader.skipValue();
			nextToken();
		}
	}

//	private boolean findName(String name) throws IOException{
//		if(in && name.equals("name")){
//			return proofLanguage(name);
//		} else if(in && !name.equals("name")){
//			nextToken();
//		}
//		return false;
//	}

	private boolean proofLanguage() throws IOException{
		System.out.println("[5] "+searchLanguage);
		//System.out.println(reader.nextString());
		return reader.nextString().equals(searchLanguage);
	}

	private void nextToken() throws IOException{
		readImpl = ReadImplementation.getInstance(reader.peek());
		readImpl.accept(this);
	}
}

Wed, 30 May 2012 06:47:59 -0700

   else if(in3) {

      //nextToken();   
      reader.nextString();
      String nameToProof = reader.nextName();
      System.out.println(nameToProof+"!!11");
      if(reader.peek()==JsonToken.STRING && nameToProof.equals("name")){
         System.out.println("asd");
         if(proofLanguage()){
            System.out.println("gasdg");
            foundImplementation.add(interestedImpl);
            for(int i = 0; i < foundImplementation.size();i++){
               System.out.println(foundImplementation.get(i));
            }
         }
         else{
            //vielleicht hier was schlaues
            //in3 = false;
            nextToken();
         }
      }
      else if (reader.peek()==JsonToken.END_ARRAY){
         System.out.println("hfghj");
         in3 = false;
         System.exit(0);
         nextToken();
      }
   } else {
      System.out.println(name);
      System.out.println("4");
      reader.skipValue();
      nextToken();
   }
}

Wed, 30 May 2012 06:13:21 -0700

   else if(in3) {

      //nextToken();   
      reader.nextString();
      String nameToProof = reader.nextName();
      System.out.println(nameToProof+"!!11");
      if(reader.peek()==JsonToken.STRING && nameToProof.equals("name")){
         System.out.println("asd");
         if(proofLanguage()){
            System.out.println("gasdg");
            foundImplementation.add(interestedImpl);
         }
         else{
            //vielleicht hier was schlaues
         }
      }
      else if (reader.peek()==JsonToken.END_ARRAY){
         System.out.println("hfghj");
         in3 = false;
         System.exit(0);
         nextToken();
      }
   } else {
      System.out.println(name);
      System.out.println("4");
      reader.skipValue();
      nextToken();
   }
}

Wed, 30 May 2012 04:15:29 -0700

import java.io.*;
import java.net.*;

class IPaddress
{
public static void main(String args[])
{
	try
	{
	InetAddress localaddr = InetAddress.getLocalHost();
	System.out.println("\nLocal IP Addr: "+localaddr);
	System.out.println("Local Host Addr: "+localaddr.getHostName());
	}
	catch(UnknownHostException e)
	{
	System.out.println("Cannot Detect Local Host"+e);
	}
}
}

Wed, 30 May 2012 04:10:20 -0700

import java.net.*;
public class ProtocolTester
{
	public static void main(String args[])
	{
		System.out.println("\n");
		testProtocol("http://www.adc.org"); //hypertext transfer protocol
		testProtocol("https://www.amazon.com/exec/obidos/order2/"); //secure http
		testProtocol("ftp://metalab.unc.edu/pub/languages/java/javafaq/"); //file transfer protocol
		testProtocol("mailto:elharo@metalab.unc.edu"); //simple mail transfer protocol
		testProtocol("telnet://dibner.poly.edu/"); //telnet
		testProtocol("file:///etc/passwd"); //local file access
		testProtocol("gopher://gopher.anc.org.za/"); //gopher
		testProtocol("ldap://ldap.itd.umich.edu/o=University%20of%20Michiganc=US?postalAddress"); //lightweight directory access protocol
		testProtocol("jar:http://cafeaulait.org/books/javaio/ioexamples/javaio.jar!"); //jar
		testProtocol("nfs://utopia.poly.edu/usr/tmp/"); //network file system
		testProtocol("jdbc:mysql://luna.metalab.unc.edu:3306/NEWS"); //jdbc
		testProtocol("rmi://metalab.unc.edu/RenderEngine"); //remote method invocation
		testProtocol("doc:/UsersGuide/release.html"); //hot java
		testProtocol("netdoc:/UserGuide/release.html");
		testProtocol("systemresource://www.adc.org/+/index.html");
		testProtocol("verbatim:http://www.adc.org/");
	}
	private static void testProtocol(String url)
	{
		try
		{
			URL u = new URL(url);
			System.out.println(u.getProtocol()+" is supported");
		}
		catch(MalformedURLException ex)
		{
			String protocol = url.substring(0url.indexOf(':'));
			System.out.println(protocol+" is not supported");
		}
	}
}

Wed, 30 May 2012 04:05:15 -0700

import java.net.*;
 
public class IPCharacteristics 
{
  public static void main(String[] args) 
  {
    try 
    {
      InetAddress address = InetAddress.getByName(args[0]);
 
      if (address.isAnyLocalAddress()) 
      {
        System.out.println(address + " is a wildcard address.");
      }

      if (address.isLoopbackAddress()) 
      {
        System.out.println(address + " is loopback address.");
      }
 
      if (address.isLinkLocalAddress()) 
      {
        System.out.println(address + " is a link-local address.");
      }
      
      else if (address.isSiteLocalAddress()) 
      {
        System.out.println(address + " is a site-local address.");
      }
      
      else 
      {
        System.out.println(address + " is a global address.");
      }
 
      if (address.isMulticastAddress()) 
      {
	if (address.isMCGlobal()) 
	{
          System.out.println(address + " is a global multicast address.");
        }
        
	else if (address.isMCOrgLocal()) 
	{
          System.out.println(address
           + " is an organization wide multicast address.");
        }

        else if (address.isMCSiteLocal()) 
	{
          System.out.println(address + " is a site wide multicast address.");
        }

        else if (address.isMCLinkLocal()) 
	{
          System.out.println(address + " is a subnet wide multicast address.");
        }

        else if (address.isMCNodeLocal()) 
	{
          System.out.println(address
           + " is an interface-local multicast address.");
        }

        else 
	{
          System.out.println(address + " is an unknown multicast address type.");
        }
      }
      else 
      {
	System.out.println(address + " is a unicast address.");
      }
 
    }
    catch (UnknownHostException ex) 
    {
	System.err.println("Could not resolve " + args[0]);
    }
  }
}

Wed, 30 May 2012 04:00:09 -0700

import java.net.*;
import java.util.*;
public class InterfaceLister
{
	public static void main(String args[]) throws Exception
	{
		Enumeration interfaces=NetworkInterface.getNetworkInterfaces();
		while(interfaces.hasMoreElements())
		{
			NetworkInterface ni=(NetworkInterface) interfaces.nextElement();
			System.out.println(ni);
		}
	}
}

Wed, 30 May 2012 03:38:15 -0700

void dfs(int iint jint kint t)			//k:floort:time
{
    int l;
    if(a[k][i][j]=='P' || Find==1)			//Find destination
    {
		Find=1;
		return ;
	}
    for(l=0;l<4;l++)
    {
        x=i+dir[l][0];
        y=j+dir[l][1];
        if(x<0 || x==n || j<0 || j==m || a[k][x][y]=='*')
            continue;
        if(a[k][x][y]=='#' && (a[k^1][x][y]=='*' || a[k^1][x][y]=='#'))
            continue;
        a[k][i][j]='*';
        if(a[k][x][y]=='#')
            dfs(xyk^1t+1);
        else dfs(xykt+1);
        a[k][i][j]='.';
    }
    return ;
}

Wed, 30 May 2012 00:21:12 -0700

// cornice.cpp : definisce il punto di ingresso dell'applicazione console.
//

#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#define N 4
void cornice (int [] [N]int);
void print (int [] [N] int);

int _tmain()
{
	int square [N][N]={{00}};
	int anello;

	for(anello=0;anello<N/2;anello++){
		cornice(square anello);
	}

	/*print*/
	print(square N);




	return 0;
	
}





void cornice(int square [] [N] int an)
{
	int ti=1;

	for(t=an;t<N-an-1;t++){
		square[an][t]=i;
		i++;
	}
	for(t=an;t<N-an-1;t++){
		square[t][N-an-1]=i;
		i++;
	}
	for(t=N-an-1;t>an;t--){
		square[N-an-1][t]=i;
		i++;
	}
	for(t=N-an-1;t>an;t--){
		square[t][an]=i;
		i++;
	}
}

void print (int square [] [N] int n)
{
	int ti;
	for (t=0;t<n;t++){
		for(i=0;i<n;i++){
			printf("|_%3d_|"square [t][i]);
		}
		printf("\n");
	}
}

Tue, 29 May 2012 23:47:35 -0700

/// <summary>
/// Synchronizes user records in GlobalLeave database with the ones supplied.
/// </summary>
/// <param name="samAccount">SamAccount name for which to syncronize the records.</param>
private void SyncUserData(string samAccount IList<Person> externalUserData)
{
    foreach (var person in externalUserData)
    {
        if (IsElegibleForGLS(person.LatestContract))
        {
            // Convert person to GLS user record.
            var userData = ConvertToUser(person);

            // Find user with same contract number and person id.
            User user = this.UserRepository.Get(
                u =>
                    u.PersonId == userData.PersonId &&
                    u.ContractId == userData.ContractId);

            // If user record exists.
            if (user != null)
            {
                // If user's IsDeleted flag has changed.
                if (user.IsDeleted != userData.IsDeleted)
                {
                    // Update the IsDeleted flag.
                    user.IsDeleted = userData.IsDeleted;
                    this.UserRepository.Update(user);
                }
            }
            else
            {
                // If user's contract is active.
                if (!userData.IsDeleted)
                {
                    // Add user to the GlobalLeave database.
                    userData.CreatedDate = DateTime.Now;
                    userData.LastLoginDate = DateTime.Now;
                    this.UserRepository.Add(userData);
                }
            }
        }
    }

    this.UserRepository.Save();
}

Tue, 29 May 2012 21:02:10 -0700

CREATE OR REPLACE PROCEDURE search_title 
(
p_title 		VARCHAR2 
p_material_type 	VARCHAR2 DEFAULT NULL
) as v_search varchar2(20);

v_title_id varchar2(30);
v_due_date date;
v_copy_id varchar2(30);
v_status varchar2(30);
v_count number;

cursor c0 is 
select t.title_id t.title t.material_type c.copy_id c.status 
from titles t copies c
WHERE UPPER(t.title) like '%' || UPPER(p_title) ||  '%' and t.title_id = c.title_id
order by t.title c.copy_id;

cursor c1 is 
select t.title_id t.title t.material_type c.copy_id c.status 
from titles t copies c
WHERE UPPER(t.title) like '%' || UPPER(p_title) ||  '%' and t.title_id = c.title_id and t.material_type = p_material_type
order by t.title c.copy_id;

v_count2 number := 0;
v_cur0 c0%rowtype;
v_cur1 c1%rowtype;
begin
dbms_output.put_line('--------------------------------------------');
if p_material_type is null then
select count(*) into v_count from titles WHERE UPPER(title) like '%' || UPPER(p_title) ||  '%';
  if v_count = 0 then
  dbms_output.put_line(v_count || ' results found for ' || p_title || '.');
  else 
  dbms_output.put_line('TITLE               COPY_ID   MATERIAL_TYPE    STATUS     DUE_DATE');
  open c0;
  loop
  fetch c0 into v_cur0;
  exit when c0%notfound;
  v_title_id := v_cur0.title_id;
     select max(due_date) into v_due_date from rentals where copy_id = v_cur0.copy_id;
     if v_cur0.status = 'A' then
     v_status := 'Available';
     else
     v_status := 'Rented';
     end if;
     if v_status = 'Available' then
     v_due_date := null;
     end if;
     dbms_output.put_line(RPAD(v_cur0.title 20) ||  RPAD(v_cur0.copy_id 10)  || RPAD(v_cur0.material_type17) || RPAD(v_status 11) || v_due_date);
     v_count2 := v_count2 + 1;
  end loop;
     if v_count2 = 1 then
     dbms_output.put_line(v_count2 || ' result found for ' || p_title || '.');
     else 
     dbms_output.put_line(v_count2 || ' results found for ' || p_title || '.');
     end if;
  end if;
else
select count(*) into v_count from titles WHERE UPPER(title) like '%' || UPPER(p_title) ||  '%' and material_type = p_material_type;
  if v_count = 0 then
  dbms_output.put_line(v_count || ' results found for ' || p_title || ' (' || p_material_type || ').');
  else
    dbms_output.put_line('TITLE         COPY_ID      MATERIAL_TYPE    STATUS     DUE_DATE');
  open c1;
  loop
  fetch c1 into v_cur1;
  exit when c1%notfound;
  v_title_id := v_cur1.title_id;
     select max(due_date) into v_due_date from rentals where copy_id = v_cur1.copy_id;
     if v_cur1.status = 'A' then
     v_status := 'Available';
     else
     v_status := 'Rented';
     end if;
     if v_status = 'Available' then
     v_due_date := null;
     end if;
     dbms_output.put_line(RPAD(v_cur1.title 20) ||  RPAD(v_cur1.copy_id 10)  || RPAD(v_cur1.material_type17) || RPAD(v_status 11) || v_due_date);
     v_count2 := v_count2 + 1;
  end loop;
     if v_count2 = 1 then
     dbms_output.put_line(v_count2 || ' result found for ' || p_title || ' (' || p_material_type || ').');
     else 
     dbms_output.put_line(v_count2 || ' results found for ' || p_title || ' (' || p_material_type || ').');
     end if;
  end if;
end if;
dbms_output.put_line('--------------------------------------------');
end;

Tue, 29 May 2012 15:45:58 -0700

#ifWinActive Diablo III
F11::
sleep 10
Send 4
sleep 10
Click right 1383917
sleep 10
Click right 1435917
sleep 10
Click right 1489917
sleep 10
Click right 1545917
sleep 10
Click right 1595917
sleep 10
Click right 1650917
sleep 10
Click right 1704917
sleep 10
Click right 1759917
sleep 10
Click right 1813891
sleep 10
Click right 1811944
sleep 10
Click right 1866893
sleep 11
Send !{Click right 1871948}
sleep 100
Send 4
return

Tue, 29 May 2012 13:42:34 -0700



if (document.all.test.action.indexOf("invalid") < 0) 
{
   document.all.test.submit();
}

Tue, 29 May 2012 12:40:08 -0700

/* Copyright (C) 2012 IAIK
 * http://jce.iaik.tugraz.at
 *
 * Copyright (C) 2012 Stiftung Secure Information and
 *                  Communication Technologies SIC
 * http://www.sic.st
 *
 * All rights reserved.
 *
 * This source is provided for inspection purposes and recompilation only
 * unless specified differently in a contract with IAIK. This source has to
 * be kept in strict confidence and must not be disclosed to any third party
 * under any circumstances. Redistribution in source and binary forms with
 * or without modification are <not> permitted in any case!
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES INCLUDING BUT NOT LIMITED TO THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT INDIRECT INCIDENTAL SPECIAL EXEMPLARY OR CONSEQUENTIAL
 * DAMAGES (INCLUDING BUT NOT LIMITED TO PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE DATA OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY WHETHER IN CONTRACT STRICT
 * LIABILITY OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <param.h>

#ifdef ECC_PRIME_FIELD

#include <stdio.h>
#include <stdlib.h>
#include <BI/bi_gen.h>
#include <GFp/gfp_gen.h>
#include "timing.h"


/*
 * verifies whether a private and public key are compatible
 *
 * @param modulus The public modulus.
 * @param pubkey The public key.
 * @param privkey The private key.
 * @param n0 The Montgomery n0 value (aka p').
 * @param r2 The Montgomery r2 value (aka R^2).
 * @return 1 if successful (i.e. private key is correct) 0 else
 */
int verify_privkey(const bigint_t modulus const bigint_t pubkey const bigint_t privkey const bigint_t n0 const bigint_t r2)
{
  // Don't change this!
  bigint_t message result;
  int wordindex;

  for (wordindex = ECC_NUM_WORDS - 1; wordindex >= 0; wordindex--)
    message[wordindex] = rand();

  gfp_gen_montgomery_exp(message pubkey result modulus n0 r2);
  gfp_gen_montgomery_exp(result privkey result modulus n0 r2);

  return !bigint_compare(message result);
}


bool montgomery_mul_attack(const bigint_t a const bigint_t b bigint_t res
    const bigint_t modulo const bigint_t n0)
{
  //---------------------------------------------------------------------------
  /// Special montgomery multiplication to check if reduction
  /// has been performed or not.
  ///
  /// Returns true if a reduction has been performed fals else.
  ///
  /// Formulas (R = 2^(WORDS_PER_BIGINT*BITS_PER_WORD)):
  /// // 1. Multiplication
  /// t = a*b
  ///
  /// // 2. Montgomery Reduction
  /// u = ( t + ((t*n0) mod R)*n ) / R
  /// u = u >= n ? u-n : u
  //---------------------------------------------------------------------------

  int_t d[2*WORDS_PER_BIGINT];

  // helpers
  int_t tmp_2[2*WORDS_PER_BIGINT];
  int_t tmp_4[4*WORDS_PER_BIGINT];

  bigint_clear_var(d2*WORDS_PER_BIGINT);
  bigint_clear_var(tmp_22*WORDS_PER_BIGINT);
  bigint_clear_var(tmp_44*WORDS_PER_BIGINT);

  // d = a*b
  bigint_multiply(abd);

  // reduction
  // R = 2^(WORDS_PER_BIGINT * BITS_PER_WORD)
  // r = [d + (d * n0 mod R) * modulo]/R

  // tmp_2 = d * n0 mod R
  bigint_multiply_var(dn0tmp_42*WORDS_PER_BIGINTWORDS_PER_BIGINT);
  bigint_copy_var(tmp_4tmp_2WORDS_PER_BIGINT);

  // tmp_4 = tmp_2 * modulo
  bigint_clear_var(tmp_44*WORDS_PER_BIGINT);
  bigint_multiply(tmp_2modulotmp_4);

  // tmp_4 + d
  int_t carry = 0;
  carry = bigint_add_var(dtmp_4tmp_42*WORDS_PER_BIGINT);
  bigint_copy_var(&carrytmp_4+2*WORDS_PER_BIGINT1);

  // tmp_4 / R
  bigint_shift_right_var(tmp_4WORDS_PER_BIGINT*BITS_PER_WORDtmp_42*WORDS_PER_BIGINT+1);

  //modulo_temp to perform upcoming comparison and (possible) subtraction with needed length
  // to account for a possible carry bit in the previous addition
  int_t modulo_temp[WORDS_PER_BIGINT+1];
  bigint_clear_var(modulo_tempWORDS_PER_BIGINT+1);
  bigint_copy_var(modulomodulo_tempWORDS_PER_BIGINT);

  bool reduction = false;

  // if tmp_4 >= modulo
  if(bigint_compare_var(tmp_4modulo_tempWORDS_PER_BIGINT+1) >= 0)
  {
    // tmp_4 - modulo
    bigint_subtract_var(tmp_4modulo_temptmp_4WORDS_PER_BIGINT+1);
    reduction = true;
  }

  bigint_copy(tmp_4res);

  return reduction;

}

bool gfp_gen_montgomery_exp_attack(const bigint_t a const bigint_t b bigint_t res
    const bigint_t modulo const bigint_t n0 const bigint_t r2)
{

  return false;
}

/*
 * Performs a timing attack to determine the private key.
 *
 * @param messages An array of n_samples messages that were
 * signed with the private key.
 * @param timings An array of n_samples timings corresponding
 * to the runtime of the messages at the same index.
 * @param n_samples The number of timing samples.
 * @param privatekey A buffer to which you write the private
 * key you found.
 * @param modulus The public modulus for the RSA signature.
 * @param pubkey The public exponent for the RSA signature.
 * @param n0 The Montgomery constant n0 (aka p')
 * @param r2 The Montgomery constant r2 (aka R^2)
 * @param privkeylen The exact number of bits of the attacked
 * private key
 * @return true if the attack was successful false else
 */

bool get_private_key(bigint_t *messages int *timings int n_samples bigint_t privatekey const bigint_t modulus const bigint_t pubkey const bigint_t n0 const bigint_t r2 int privkeylen)
{
  //---------------------------------------------------------------------------
  /// @todo (timing attack)
  /// Add your attack code here.
  //---------------------------------------------------------------------------

  bigint_t res;
  bigint_t tmp;
  bigint_t tmp_bit;
  int i = 0;
  int fast_1;
  int slow_1;
  int timings_0_slow = 0;
  double avg_0_slow = 0;
  double avg_1_slow = 0;
  double avg_0_fast = 0;
  double avg_1_fast = 0;
  int timings_1_slow = 0;
  int timings_0_fast = 0;
  int timings_1_fast = 0;
  int fast_0;
  int slow_0;
  int bits = 0;
  double diff_0 = 0;
  double diff_1 = 0;
  int message = 0;
  bool reduction = false;


  std::vector<bigint_t*> x_quer_0_vector;
  std::vector<bigint_t*> x_quer_1_vector;
  std::vector<bigint_t*> a_quer_vector;
  std::vector<bigint_t*> x_quer_vector;

  int_t *x_quer = new bigint_t;
  bigint_clear(x_quer);
  gfp_montgomery_mul(bigint_oner2x_quermodulusn0);

  //initialize x_quer and a_quer for every message
  for (message = 0; message < n_samples; message++) {
      //x_quer init
      int_t *xq0 = new bigint_t;
      int_t *xq1 = new bigint_t;
      int_t *xq = new bigint_t;
      bigint_copy(x_quer xq0);
      bigint_copy(x_quer xq);

      //a_quer init
      int_t *a_quer = new bigint_t;
      gfp_montgomery_mul(messages[message]r2a_quermodulusn0);
      a_quer_vector.push_back((bigint_t*)a_quer);

      //the first mutliplications since the coming for loop starts from the MSB-1 bit
      gfp_montgomery_mul(xq0 a_quer xq0 modulus n0);
      gfp_montgomery_mul(xq0 xq0 xq0 modulus n0);
      bigint_copy(xq0 xq1);


      x_quer_0_vector.push_back((bigint_t*)xq0);
      x_quer_1_vector.push_back((bigint_t*)xq1);
      x_quer_vector.push_back((bigint_t*)xq);


  }

//  int x_quer0_size = x_quer_0_vector.size();
//  int x_quer1_size = x_quer_1_vector.size();

  // set privatekey 0
  bigint_clear(privatekey);
  bigint_clear(tmp);
  bigint_clear(tmp_bit);
  // set first bit of guessed key
  bigint_copy(bigint_one privatekey);
  bigint_shift_left(privatekey privkeylen-1 privatekey);

  // do the attack
  for (bits=privkeylen-2; bits>0; --bits)
  {
    bigint_copy(privatekeytmp);

    //classification of messages (next privatekey bit set 0)
    for (message = 0; message < n_samples; message++)
    {
      //mont-exp algorithm

      reduction = false;

      //get correct x_quer from vector
      x_quer = (int_t*)x_quer_0_vector[message];
      bigint_t *a_quer = a_quer_vector[message];

      reduction = montgomery_mul_attack(x_querx_querx_quermodulusn0);

      if(reduction)
      {
        slow_0 += 1;
        timings_0_slow += timings[message];
      }
      else
      {
        fast_0 += 1;
        timings_0_fast += timings[message];
      }
    }

    //classification of messages (next privatekey bit set 1)
    bigint_copy(bigint_onetmp_bit);
    bigint_shift_left(tmp_bit bits tmp_bit);
    bigint_xor(privatekey tmp_bit privatekey);
    for (message = 0; message < n_samples; message++)
    {
      //mont-exp algorithm

      reduction = false;

      x_quer = (int_t*)x_quer_1_vector[message];
      bigint_t *a_quer = a_quer_vector[message];

      gfp_montgomery_mul(x_quer(int_t*)a_querx_quermodulusn0);
      reduction = montgomery_mul_attack(x_querx_querx_quermodulusn0);

      if(reduction)
      {
        slow_1 += 1;
        timings_1_slow += timings[message];
      }
      else
      {
        fast_1 += 1;
        timings_1_fast += timings[message];
      }
    }

    if(slow_0)
      avg_0_slow = timings_0_slow / slow_0;
    if(fast_0)
      avg_0_fast = timings_0_fast / fast_0;
    if(slow_1)
      avg_1_slow = timings_1_slow / slow_1;
    if(fast_1)
      avg_1_fast = timings_1_fast / fast_1;

    diff_0 = avg_0_slow - avg_0_fast;
    diff_1 = avg_1_slow - avg_1_fast;

    // set current privatekey bit to 0
    if(diff_0 > diff_1)
      bigint_copy(tmpprivatekey);

    //take right x_quer
    for (message = 0; message < n_samples; message++) {
        int_t *xq0 *xq1;
        xq0 = (int_t*)x_quer_0_vector[message];
        xq1 = (int_t*)x_quer_1_vector[message];
        if(diff_0 > diff_1) {
            bigint_copy(xq0 xq1);
        } else {
            bigint_copy(xq1 xq0);
        }
    }

    fast_0 = 0;
    fast_1 = 0;
    slow_0 = 0;
    slow_1 = 0;
    timings_0_slow = 0;
    timings_1_slow = 0;
    timings_0_fast = 0;
    timings_1_fast = 0;

    bigint_clear(tmp);
    bigint_clear(tmp_bit);

  }

  // set last bit of guessed key
  // last bit 0
  if(verify_privkey(modulus pubkeyprivatekeyn0r2))
    return true;
  else
  {
    // last bit 1
    privatekey[0] = privatekey[0] | 1;
    if(verify_privkey(moduluspubkeyprivatekey n0r2))
      return true;
  }

  return false;
}

#endif

Tue, 29 May 2012 12:26:04 -0700

/* Copyright (C) 2012 IAIK
 * http://jce.iaik.tugraz.at
 *
 * Copyright (C) 2012 Stiftung Secure Information and
 *                  Communication Technologies SIC
 * http://www.sic.st
 *
 * All rights reserved.
 *
 * This source is provided for inspection purposes and recompilation only
 * unless specified differently in a contract with IAIK. This source has to
 * be kept in strict confidence and must not be disclosed to any third party
 * under any circumstances. Redistribution in source and binary forms with
 * or without modification are <not> permitted in any case!
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES INCLUDING BUT NOT LIMITED TO THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT INDIRECT INCIDENTAL SPECIAL EXEMPLARY OR CONSEQUENTIAL
 * DAMAGES (INCLUDING BUT NOT LIMITED TO PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE DATA OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY WHETHER IN CONTRACT STRICT
 * LIABILITY OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <param.h>

#ifdef ECC_PRIME_FIELD

#include <stdio.h>
#include <stdlib.h>
#include <BI/bi_gen.h>
#include <GFp/gfp_gen.h>
#include "timing.h"


/*
 * verifies whether a private and public key are compatible
 *
 * @param modulus The public modulus.
 * @param pubkey The public key.
 * @param privkey The private key.
 * @param n0 The Montgomery n0 value (aka p').
 * @param r2 The Montgomery r2 value (aka R^2).
 * @return 1 if successful (i.e. private key is correct) 0 else
 */
int verify_privkey(const bigint_t modulus const bigint_t pubkey const bigint_t privkey const bigint_t n0 const bigint_t r2)
{
  // Don't change this!
  bigint_t message result;
  int wordindex;

  for (wordindex = ECC_NUM_WORDS - 1; wordindex >= 0; wordindex--)
    message[wordindex] = rand();

  gfp_gen_montgomery_exp(message pubkey result modulus n0 r2);
  gfp_gen_montgomery_exp(result privkey result modulus n0 r2);

  return !bigint_compare(message result);
}


bool montgomery_mul_attack(const bigint_t a const bigint_t b bigint_t res
    const bigint_t modulo const bigint_t n0)
{
  //---------------------------------------------------------------------------
  /// Special montgomery multiplication to check if reduction
  /// has been performed or not.
  ///
  /// Returns true if a reduction has been performed fals else.
  ///
  /// Formulas (R = 2^(WORDS_PER_BIGINT*BITS_PER_WORD)):
  /// // 1. Multiplication
  /// t = a*b
  ///
  /// // 2. Montgomery Reduction
  /// u = ( t + ((t*n0) mod R)*n ) / R
  /// u = u >= n ? u-n : u
  //---------------------------------------------------------------------------

  int_t d[2*WORDS_PER_BIGINT];

  // helpers
  int_t tmp_2[2*WORDS_PER_BIGINT];
  int_t tmp_4[4*WORDS_PER_BIGINT];

  bigint_clear_var(d2*WORDS_PER_BIGINT);
  bigint_clear_var(tmp_22*WORDS_PER_BIGINT);
  bigint_clear_var(tmp_44*WORDS_PER_BIGINT);

  // d = a*b
  bigint_multiply(abd);

  // reduction
  // R = 2^(WORDS_PER_BIGINT * BITS_PER_WORD)
  // r = [d + (d * n0 mod R) * modulo]/R

  // tmp_2 = d * n0 mod R
  bigint_multiply_var(dn0tmp_42*WORDS_PER_BIGINTWORDS_PER_BIGINT);
  bigint_copy_var(tmp_4tmp_2WORDS_PER_BIGINT);

  // tmp_4 = tmp_2 * modulo
  bigint_clear_var(tmp_44*WORDS_PER_BIGINT);
  bigint_multiply(tmp_2modulotmp_4);

  // tmp_4 + d
  int_t carry = 0;
  carry = bigint_add_var(dtmp_4tmp_42*WORDS_PER_BIGINT);
  bigint_copy_var(&carrytmp_4+2*WORDS_PER_BIGINT1);

  // tmp_4 / R
  bigint_shift_right_var(tmp_4WORDS_PER_BIGINT*BITS_PER_WORDtmp_42*WORDS_PER_BIGINT+1);

  //modulo_temp to perform upcoming comparison and (possible) subtraction with needed length
  // to account for a possible carry bit in the previous addition
  int_t modulo_temp[WORDS_PER_BIGINT+1];
  bigint_clear_var(modulo_tempWORDS_PER_BIGINT+1);
  bigint_copy_var(modulomodulo_tempWORDS_PER_BIGINT);

  bool reduction = false;

  // if tmp_4 >= modulo
  if(bigint_compare_var(tmp_4modulo_tempWORDS_PER_BIGINT+1) >= 0)
  {
    // tmp_4 - modulo
    bigint_subtract_var(tmp_4modulo_temptmp_4WORDS_PER_BIGINT+1);
    reduction = true;
  }

  bigint_copy(tmp_4res);

  return reduction;

}

bool gfp_gen_montgomery_exp_attack(const bigint_t a const bigint_t b bigint_t res
    const bigint_t modulo const bigint_t n0 const bigint_t r2)
{

  return false;
}

/*
 * Performs a timing attack to determine the private key.
 *
 * @param messages An array of n_samples messages that were
 * signed with the private key.
 * @param timings An array of n_samples timings corresponding
 * to the runtime of the messages at the same index.
 * @param n_samples The number of timing samples.
 * @param privatekey A buffer to which you write the private
 * key you found.
 * @param modulus The public modulus for the RSA signature.
 * @param pubkey The public exponent for the RSA signature.
 * @param n0 The Montgomery constant n0 (aka p')
 * @param r2 The Montgomery constant r2 (aka R^2)
 * @param privkeylen The exact number of bits of the attacked
 * private key
 * @return true if the attack was successful false else
 */

bool get_private_key(bigint_t *messages int *timings int n_samples bigint_t privatekey const bigint_t modulus const bigint_t pubkey const bigint_t n0 const bigint_t r2 int privkeylen)
{
  //---------------------------------------------------------------------------
  /// @todo (timing attack)
  /// Add your attack code here.
  //---------------------------------------------------------------------------

  bigint_t res;
  bigint_t tmp;
  bigint_t tmp_bit;
  int i = 0;
  int fast_1;
  int slow_1;
  int timings_0_slow = 0;
  double avg_0_slow = 0;
  double avg_1_slow = 0;
  double avg_0_fast = 0;
  double avg_1_fast = 0;
  int timings_1_slow = 0;
  int timings_0_fast = 0;
  int timings_1_fast = 0;
  int fast_0;
  int slow_0;
  int bits = 0;
  double diff_0 = 0;
  double diff_1 = 0;
  int message = 0;
  bool reduction = false;


  std::vector<bigint_t*> x_quer_0_vector;
  std::vector<bigint_t*> x_quer_1_vector;
  std::vector<bigint_t*> a_quer_vector;
  std::vector<bigint_t*> x_quer_vector;

  int_t *x_quer = new bigint_t;
  bigint_clear(x_quer);
  gfp_montgomery_mul(bigint_oner2x_quermodulusn0);

  //initialize x_quer and a_quer for every message
  for (message = 0; message < n_samples; message++) {
      //x_quer init
      int_t *xq0 = new bigint_t;
      int_t *xq1 = new bigint_t;
      int_t *xq = new bigint_t;
      bigint_copy(x_quer xq0);
      bigint_copy(x_quer xq);

      //a_quer init
      int_t *a_quer = new bigint_t;
      gfp_montgomery_mul(messages[message]r2a_quermodulusn0);
      a_quer_vector.push_back((bigint_t*)a_quer);

      //the first mutliplications since the coming for loop starts from the MSB-1 bit
      gfp_montgomery_mul(xq0 a_quer xq0 modulus n0);
      gfp_montgomery_mul(xq0 xq0 xq0 modulus n0);
      bigint_copy(xq0 xq1);


      x_quer_0_vector.push_back((bigint_t*)xq0);
      x_quer_1_vector.push_back((bigint_t*)xq1);
      x_quer_vector.push_back((bigint_t*)xq);


  }

//  int x_quer0_size = x_quer_0_vector.size();
//  int x_quer1_size = x_quer_1_vector.size();

  // set privatekey 0
  bigint_clear(privatekey);
  bigint_clear(tmp);
  bigint_clear(tmp_bit);
  // set first bit of guessed key
  bigint_copy(bigint_one privatekey);
  bigint_shift_left(privatekey privkeylen-1 privatekey);

  // do the attack
  for (bits=privkeylen-2; bits>0; --bits)
  {
    bigint_copy(privatekeytmp);

    //classification of messages (next privatekey bit set 0)
    for (message = 0; message < n_samples; message++)
    {
      //mont-exp algorithm

      reduction = false;

//      bigint_clear(a_quer);
//      bigint_clear(x_quer);
//
//      gfp_montgomery_mul(messages[message]r2a_quermodulusn0);
//      gfp_montgomery_mul(bigint_oner2x_quermodulusn0);

      //get correct x_quer from vector
      x_quer = (int_t*)x_quer_0_vector[message];
      bigint_t *a_quer = a_quer_vector[message];

//      if(i == bits)
//          reduction = montgomery_mul_attack(x_querx_querx_quermodulusn0);
//      else

//          gfp_montgomery_mul(x_querx_querx_quermodulusn0);

      gfp_montgomery_mul(x_querx_querx_quermodulusn0);

      //guess is 0 so no square necessary
//      if(bigint_test_bit(privatekeybits))
//      {
//          gfp_montgomery_mul(x_quer(int_t*)a_querx_quermodulusn0);
//      }

//      gfp_montgomery_mul(x_querbigint_oneresmodulusn0);

      if(reduction)
      {
        slow_0 += 1;
        timings_0_slow += timings[message];
      }
      else
      {
        fast_0 += 1;
        timings_0_fast += timings[message];
      }
    }

    //classification of messages (next privatekey bit set 1)
    bigint_copy(bigint_onetmp_bit);
    bigint_shift_left(tmp_bit bits tmp_bit);
    bigint_xor(privatekey tmp_bit privatekey);
    for (message = 0; message < n_samples; message++)
    {
      //mont-exp algorithm

      reduction = false;

//      bigint_clear(a_quer);
//      bigint_clear(x_quer);
//
//      gfp_montgomery_mul(messages[message]r2a_quermodulusn0);
//      gfp_montgomery_mul(bigint_oner2x_quermodulusn0);
      x_quer = (int_t*)x_quer_1_vector[message];
      bigint_t *a_quer = a_quer_vector[message];


//      if(i == bits)
//          reduction = montgomery_mul_attack(x_querx_querx_quermodulusn0);
//      else
//          gfp_montgomery_mul(x_querx_querx_quermodulusn0);

      gfp_montgomery_mul(x_querx_querx_quermodulusn0);

      if(bigint_test_bit(privatekeybits))
      {
          gfp_montgomery_mul(x_quer(int_t*)a_querx_quermodulusn0);
      }

      gfp_montgomery_mul(x_querbigint_oneresmodulusn0);

      if(reduction)
      {
        slow_1 += 1;
        timings_1_slow += timings[message];
      }
      else
      {
        fast_1 += 1;
        timings_1_fast += timings[message];
      }
    }

    if(slow_0)
      avg_0_slow = timings_0_slow / slow_0;
    if(fast_0)
      avg_0_fast = timings_0_fast / fast_0;
    if(slow_1)
      avg_1_slow = timings_1_slow / slow_1;
    if(fast_1)
      avg_1_fast = timings_1_fast / fast_1;

    diff_0 = avg_0_slow - avg_0_fast;
    diff_1 = avg_1_slow - avg_1_fast;

    // set current privatekey bit to 0
    if(diff_0 > diff_1)
      bigint_copy(tmpprivatekey);

    //take right x_quer
    for (message = 0; message < n_samples; message++) {
        int_t *xq0 *xq1;
        xq0 = (int_t*)x_quer_0_vector[message];
        xq1 = (int_t*)x_quer_1_vector[message];
        if(diff_0 > diff_1) {
            bigint_copy(xq0 xq1);
        } else {
            bigint_copy(xq1 xq0);
        }
    }

    fast_0 = 0;
    fast_1 = 0;
    slow_0 = 0;
    slow_1 = 0;
    timings_0_slow = 0;
    timings_1_slow = 0;
    timings_0_fast = 0;
    timings_1_fast = 0;

    bigint_clear(tmp);
    bigint_clear(tmp_bit);

  }

  // set last bit of guessed key
  // last bit 0
  if(verify_privkey(modulus pubkeyprivatekeyn0r2))
    return true;
  else
  {
    // last bit 1
    privatekey[0] = privatekey[0] | 1;
    if(verify_privkey(moduluspubkeyprivatekey n0r2))
      return true;
  }

  return false;
}

#endif