nielsutrecht

import javax.crypto.Cipher;
import java.io.InputStream;
import java.security.*;
import java.util.Base64;

import static java.nio.charset.StandardCharsets.UTF_8;

public class RsaExample {
    public static KeyPair generateKeyPair() throws Exception {
        KeyPairGenerator generator = KeyPairGenerator.getInstance("RSA");

bishboria

These links no longer work. Springer have pulled the free plug.

Graduate texts in mathematics

duplicates = multiple editions

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

masterkrang

var numberOfUsers = 3000 // the nubmer of users you want to follow (it will break after about 5000)
function harvest() {
	// keep scrolling the page to the bottom
	$("#search").scrollTop($("#search")[0].scrollHeight);	
	// get all the follow buttons
	var bs = $('*[data-capture="noiseClicked"]')//.length
	// figure out how many follow buttons you have
	var len = bs.length
	// show the number of people you have on the page because you're impatient
	console.log(len)

chklauser

/* 
 * matrix.c - Matrix computations that has been optimized by the students
 *
 * Copyright (c) 2011 Christian Klauser, All rights reserved
 * Author: Christian Klauser <klauserc@student.ethz.ch>,
 * 
 * I used comparatively simple algorithms for both LU-decomposition
 * and the matrix multiplication involved in checking for equality.
 *  - My LU decomposition is based on Gaussian Elimination
 *      - No pivoting, will fail for pivots that are == 0