Low-Density Parity Check Binary Codes
MATLAB software by Igor Kozintsev.
Index Introduction About Resume Projects Publications Patents Software Links Contact Matlab programms for encoding and decoding of LDPC codes over GF(2^m).(600 KB) There is an example of how to use the LDPC encode decode with AWGN channel model in files .\ldpc_decode.m and .\GFq\ldpc_decode.m. There are a few parity check matrices available in the code but you can use other matrices provided you have enough memory to load them. I suggest checking out matrices in Alist format available on David MacKay's web site .You will need to have access to a MEX compiler to be able to use a few functions written in C. A sample code of LDPC encode decode is shown below: % Example: % We assume G is systematic G=[A|I] and therefore mod(G*H',2)=0 sigma = 1; % AWGN noise deviation x = (sign(randn(1,size(G,1)))+1) 2; % random bits y = mod(x*G,2); % coding z = 2*y-1; % BPSK modulation z=z + sigma*randn(1,size(G,2)); % AWGN transmission f1=1. (1+exp(-2*z sigma^2)); % likelihoods f0=1-f1; [z_hat, success, k] = ldpc_decode(z,f0,f1,H); x_hat = z_hat(size(G,2)+1-size(G,1):size(G,2)); x_hat = x_hat'; % result of decoding Matlab programms for Wavelet image denoising(670 KB) The matlab functions (dn1, dn2, dn3 and dn4) implement ML and MAP procedures for image denoising in wavelet domain using local Gaussian model for an image (and exponential prior in the case of MAP). For details refer to the paper, our ICASSP 1999 presentation and Kivanc's webpage. Low-Complexity Image Denoising Based on Statistical Modeling of Wavelet Coefficients Kivanc Mihcak, M .; Kozintsev, I.; Ramchandran, K.; Moulin, P., IEEE Signal Processing Letters, Volume: 6 Issue: 12, Dec. 1999 PDF I recommend trying dn2. This denoising method uses several sizes for estimation window to predict the local variance and chooses the smallest one. You will need to implement your favorite wavelet transform and create function fwt_image.m or email me and I will forward you my version. Other assumptions: grayscale 512x512 image (a few examples are provided) in raw format and 6 level orthogonal wavelet transform. Please see headers and test.m for example usage. About | Resume | Projects | Publications | Patents | Software | Contact Webmaster: alexaindesign@hotmail.com Copyright 2003, Igor V. Kozintsev, All Rights Reserved
Error-Correcting Codes in MAPLE
Basic procedures for Cyclic, Hamming, Binary Reed-Muller, BCH and Golay codes.
Error-correcting codes in MAPLE Basic procedures for Cyclic, Hamming, Binary Reed-Muller, BCH and Golay codes This web page assumes you know a little about MAPLE syntax. Using MAPLE, we construct the parity-check matrix and generator matrix of the cyclic code of length n over Fp, the binary Hamming code over F2 (which is perfect and 1-error-correcting), the ternary (11,6)-Golay (which is perfect, minimum distance 5, and 2-error-correcting), and the binary (23,12)-Golay codes (which is perfect, distance 7, and 3-error-correcting). (The parity check matrix of the binary Hamming code is the generator matrix of the 1st order Reed-Muller code, so these codes are included as a consequence. Also, the (12,6)-Golay code and the (24,12)-Golay code are also included.) We give a program which returns all the codewords in a code and all the codewords in its dual code, provided the prime p and the generator matrix are given. Another program uses this to give the minimum distance of a code. We give a program which decodes a received word into a codeword using the nearest neighbor algorithm, provided the prime p, the distance d, and the generator matrix are given. We give a decoder for p-ary Hamming codes. We construct some BCH codes. There are several other procedures of minor importance which we leave to the partially documented code, codes.mpl . This worksheet is codes0.mws . References: F. MacWilliams and N. Sloane, The theory of error-correcting codes , North-Holland, 1977 R. Hill, A first course in coding theory , Oxford Univ. Press, 1986 There are also coding theory packages in GAP3 and MAGMA . See, for example, GAP3 and the Higman-Sims group (which uses the GAP coding theory package guava ) and linear codes in MAGMA . codes0.mws,wdj,6-2-98 and 10-98 and 1-1-99 and 10-99 restart; with(linalg): with(padic): Warning, new definition for norm Warning, new definition for trace read(`e: maplestuff bin.win codes.mpl`); Hamming codes Parity check matrices of the binary Hamming code of length 2^2-1=3: hamming_check_binary(2); H:=hamming_check(3,5); hamming_check_nonstandard(3,5); Parity check matrices (in standard and non-standard form) of the 5-ary Hamming code of length (5^3-1) (5-1)=31 H:=hamming_check_binary(3); Parity check matrices of the binary Hamming code of length 2^3-1=7: H:=hamming_check(3,2); A generator matrix of the binary Hamming code of length 3: hamming_generator(2,2); G1:=hamming_generator(3,2); A generator matrix of the binary Hamming code of length 7 (sometimes the transpose of this matrix is called the generator matrix): The dual code of this Hamming (7,4) code is a simplex (7,3) code. dual_code_list(G1,2); C1:=code_list(G1,2): C1:=sort(C1,weight_order); We can print out the list of all codewords, sorted according to weight: weight_enumerator_vector(G1,2); There are 7 code words of weight 3, 7 code words of weight 4, and no code words of weights 1,2, 5 or 6. weight_enumeration_polynomial(G1,2,x,y); This is the weight enumerator polynomial of the Hamming (7,4,3)-code. min_distance(G1,2); The minimum distance of the binary Hamming code of length 3 v1:=[1,1,1,0,0,0,0]; matrix_times_vector_modp(H,v1,2); This received word v1 has an error since H*v1 is non-zero. decode_hamming_binary(v1); This command only works for binary Hamming codes. decode(v1,G1,2,3); This command works for any linear code (2 is the prime residue, 3 is the distance of the code). H:=hamming_check(3,3); G:=hamming_generator(3,3); size_of_code:=3^(10); parity check and generator matrix of Hamming ((p^k-1) (p-1),(p^k-1) (p-1)-k,3)-code with k=3,p=3 v1:=convert(row(H,1),list)+[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; matrix_times_vector_modp(H,v1,3); This received word v1 has an error since H*v1 is non-zero decode_hamming(v1,3); Reed-Muller codes G:=RM_generator(3); This is a generator matrix of the binary 1st order Reed-Muller code of length 8. The matrix for the RM code of length 16 is: G_RM:=RM_generator(4); C:=code_list(G_RM,2): C_RM:=sort(C,weight_order); nops(C); Cyclic codes One can test if g(x) is the generating polynomial of a cyclic code of length n over F_p using iscyclic(g(x),n,p) iscyclic(x+1,7,2); iscyclic(x^2+1,7,2); iscyclic(x^3+x+1,7,2); Enter the generator polynomial of cyclic code and generator_matrix will return the corresponding generator matrix. G:=generator_matrix(x+1,7,2); min_distance(G,2); The following generator matrix is the same size as that of the above Hamming code. Do they yield the same code? G2:=generator_matrix(x^3+x^2+1,7,2); C2:=code_list(G2,2): C2:=sort(C2,weight_order); evalb(C1=C2); This cyclic code generated by x^3+x^2+1 is not the Hamming code of length 7 and distance 3, over F_2, given above. min_distance(G2,2); There is some built-in error checking in generator_matrix : generator_matrix(x^2+1,7,2); Error, (in generator_matrix) the polynomial doesn't generate a cyclic code Enter the generator polynomial of cyclic code and check_matrix will return the corresponding parity check matrix. H:=check_matrix(x^3+x^2+1,7,2); v1:=[1,1,1,1,0,0,0]; matrix_times_vector_modp(H,v1,2); The word v1 is not in the cyclic code generated by x^3+x^2+1 since H*v1 is non-zero. decode(v1,G2,2,2); check_matrix(x^3+y^2+1,7,2); check_matrix(x^3+1,7,2); check_matrix has some built-in error checking Error, (in check_matrix) g should be a polynomial in x Error, (in check_matrix) the polynomial doesn't generate a cyclic code Golay codes The generator matrix for the ternary (12,6) code: G:=golay12(); min_distance(G,3); This is very time-consuming on some machines (about 15 seconds on a 300Mhz pentium). The parity check matrix for the ternary (12,6) code: H:=golay_check12(); v1:=[1, 2, 2, 2, 2, 1, 0, 1, 0, 0, 1, 2]; matrix_times_vector_modp(H,v1,3); v1 is not a codeword in the (12,6)-Golay code. It has only 1 error (in the first position). decode(v1,G,3,5); The decoding: v2:=[1, 1, 2, 2, 2, 1, 0, 1, 0, 0, 1, 2]; decode(v2,G,3,5); Another example, with 2 errors. The generator matrix for the perfect ternary (11,6) code: G:=golay11(); min_distance(G,3); This is very time-consuming. The parity check matrix for the ternary (11,6) code: H:=golay_check11(); The generator matrix for the perfect binary (23,12) code: G:=golay23(); The parity check matrix for the perfect binary (23,12) code: H:=golay_check23(); v1:=[0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1]; matrix_times_vector_modp(H,v1,2); v1 is not a codeword in the (23,12)-Golay code. It has only 1 error (in the first position). decode(v1,G,2,7); This is time-consuming to decode than the above Hamming code since the Golay code is larger. v2:=[0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0]; matrix_times_vector_modp(H,v2,2); decode(v2,G,2,7); This "string" has 3 errors G:=golay24(); The generator matrix for the (24,12)-Golay code H:=golay_check24(); The parity check matrix for the (24,12)-Golay code. coldim(G);coldim(H); BCH codes We shall construct by hand some BCH codes. A BCH code is a cyclic code which included the binary Hamming codes as a special case. To construct a (binary, narrow) BCH code, you must have a primitive element alpha of degree k over F=GF(2). You must know the minimal polynomials of a sequence of powers of alpha: alpha, alpha^2, ..., alpha^(2t). Take the lcm of these. This new polynomial is the generating polynomial of the BCH code. It has minimum distance 2t+1. readlib(lattice): minpoly_lattice:=minpoly; caution: linalg has a minpoly command too, you may need to restart; with(numtheory): readlib(GF): Warning, new definition for order f:=x^4+x+1; alias(beta=RootOf(f)): Factor(f) mod 2; Factor(f,beta) mod 2; Roots(f,beta) mod 2; for i from 1 to 19 do pp[i]:=unapply(minpoly_lattice(beta^i,4),_X): print(beta^i,pp[i](x)); od: GenPoly:=x- Lcm(seq(pp[j](x),j=1..4)) mod 2: GenPoly(x); Quo(x^(15)-1,GenPoly(x),x) mod 2; iscyclic(GenPoly(x),15,2); In other words, GenPoly(x) is indeed the generating polynomial for some cyclic code over F_2. G:=generator_matrix(GenPoly(x),15,2); linalg[rowdim](G); linalg[coldim](G); H:=check_matrix(GenPoly(x),15,2); linalg[rowdim](H); linalg[coldim](H); This code is 2-error correcting. f:=x^6+x^3+1; alias(beta=RootOf(f)): Irreduc(f) mod 2; Factor(f,beta) mod 2; Roots(f,beta) mod 2; for i from 1 to 12 do pp[i]:=unapply(minpoly_lattice(beta^i,6),_X): print(beta^i,pp[i](x)); od: GenPoly:=x- Lcm(seq(pp[j](x),j=1..8)) mod 2: GenPoly(x); iscyclic(GenPoly(x),63,2); In other words, GenPoly(x) is indeed the generating polynomial for some cyclic code over F_2. This code is 4-error correcting. G:=generator_matrix(GenPoly(x),63,2): linalg[rowdim](G); linalg[coldim](G); H:=check_matrix(GenPoly(x),63,2); Last updated 10-21-99 by W D Joyner, wdj@usna.edu
Basic Procedures for Cyclic, Hamming, Binary Reed-Muller, BCH, Golay codes
Maple procedures for standard operations with various families of codes.
Basic procedures for Cyclic, Hamming, Binary Reed-Muller, BCH, Golay codes Basic procedures for Cyclic, Hamming, Binary Reed-Muller, BCH, and Golay codes We construct the parity-check matrix and generator matrix of the cyclic code of length n over GF(p), the Hamming code over GF(p), the binary 1st order Reed-Muller code (which is length n=2m, dimension m+1, minimum distance 2m-1), the ternary (11,6)-Golay (which is perfect, minimum distance 5, and 2-error-correcting), and the binary (23,12)-Golay codes (which is perfect, distance 7, and 3-error-correcting). (The parity check matrix of the binary Hamming code is related to the generator matrix of the 1st order Reed-Muller code. Also, the (12,6)-Golay code and the (24,12)-Golay codes are also included.) We give a program which returns all the codewords in a code and all the codewords in its dual code, provided the prime p and the generator matrix are given. Another program uses this to give the minimum distanceof a code. We give a program which decodes a received word into a codeword using the nearest neighbor algorithm, provided the prime p, the distance d, and the generator matrix are given. We give a program for decoding binary and p-ary Hamming codes. We construct some BCH codes ("by hand"). We give a program to determine if two binary linear codes are equivalent. We give a program to compute the automorphism group of a binary linear code. There are several other procedures of minor importance which we leave to the partially documented code. References: F. MacWilliams and N. Sloane, The theory of error-correcting codes , North-Holland, 1977 R. Hill, A first course in coding theory , Oxford Univ. Press, 1986 There are also coding theory packages in GAP and MAGMA . See, for example, GAP3 and the Higman-Sims group (which uses the GAP coding theory package guava ) and linear codes in MAGMA . restart; with(linalg): with(padic): Warning, new definition for fibonacci read(`d: maplestuff codes codes.mpl`); Hamming codes Parity check matrices of the binary Hamming code of length 2^2-1=3: hamming_check_binary(2); H:=hamming_check(3,5); hamming_check_nonstandard(3,5); Parity check matrices (in standard and non-standard form) of the 5-ary Hamming code of length (5^3-1) (5-1)=31 H:=hamming_check_binary(3); Parity check matrices of the binary Hamming code of length 2^3-1=7: H:=hamming_check(3,2); A generator matrix of the binary Hamming code of length 3: hamming_generator(2,2); G1:=hamming_generator(3,2); A generator matrix of the binary Hamming code of length 7 (sometimes the transpose of this matrix is called the generator matrix): The dual code of this Hamming (7,4) code is a simplex (7,3) code. dual_code_list(G1,2); C1:=code_list(G1,2): C1:=sort(C1,weight_order); We can print out the list of all codewords, sorted according to weight: weight_enumerator_vector(G1,2); There are 7 code words of weight 3, 7 code words of weight 4, and no code words of weights 1,2, 5 or 6. weight_enumeration_polynomial(G1,2,x,y); This is the weight enumerator polynomial of the Hamming (7,4,3)-code. min_distance(G1,2); The minimum distance of the binary Hamming code of length 3 v1:=[1,1,1,0,0,0,0]; matrix_times_vector_modp(H,v1,2); This received word v1 has an error since H*v1 is non-zero. decode_hamming_binary(v1); This command only works for binary Hamming codes. decode(v1,G1,2,3); This command works for any linear code (2 is the prime residue, 3 is the distance of the code). H:=hamming_check(3,3); G:=hamming_generator(3,3); size_of_code:=3^(10); parity check and generator matrix of Hamming ((p^k-1) (p-1),(p^k-1) (p-1)-k,3)-code with k=3,p=3 v1:=convert(row(H,1),list)+[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; matrix_times_vector_modp(H,v1,3); This received word v1 has an error since H*v1 is non-zero decode_hamming(v1,3); Reed-Muller codes G:=RM_generator(3); This is a generator matrix of the binary 1st order Reed-Muller code of length 8. The matrix for the RM code of length 16 is: G_RM:=RM_generator(4); C:=code_list(G_RM,2): C_RM:=sort(C,weight_order); nops(C); Cyclic codes One can test if g(x) is the generating polynomial of a cyclic code of length n over F_p using iscyclic(g(x),n,p) iscyclic(x+1,7,2); iscyclic(x^2+1,7,2); iscyclic(x^3+x+1,7,2); Enter the generator polynomial of cyclic code and generator_matrix will return the corresponding generator matrix. G:=generator_matrix(x+1,7,2); min_distance(G,2); The following generator matrix is the same size as that of the above Hamming code. Do they yield the same code? G2:=generator_matrix(x^3+x^2+1,7,2); C2:=code_list(G2,2): C2:=sort(C2,weight_order); evalb(C1=C2); This cyclic code generated by x^3+x^2+1 is not the Hamming code of length 7 and distance 3, over F_2, given above. min_distance(G2,2); There is some built-in error checking in generator_matrix : generator_matrix(x^2+1,7,2); Error, (in generator_matrix) the polynomial doesn't generate a cyclic code Enter the generator polynomial of cyclic code and check_matrix will return the corresponding parity check matrix. H:=check_matrix(x^3+x^2+1,7,2); v1:=[1,1,1,1,0,0,0]; matrix_times_vector_modp(H,v1,2); The word v1 is not in the cyclic code generated by x^3+x^2+1 since H*v1 is non-zero. decode(v1,G2,2,2); check_matrix(x^3+y^2+1,7,2); check_matrix(x^3+1,7,2); check_matrix has some built-in error checking Error, (in check_matrix) g should be a polynomial in x Error, (in check_matrix) the polynomial doesn't generate a cyclic code Golay codes The generator matrix for the ternary (12,6) code: G:=golay12(); min_distance(G,3); This is very time-consuming on some machines (about 15 seconds on a 300Mhz pentium). The parity check matrix for the ternary (12,6) code: H:=golay_check12(); v1:=[1, 2, 2, 2, 2, 1, 0, 1, 0, 0, 1, 2]; matrix_times_vector_modp(H,v1,3); v1 is not a codeword in the (12,6)-Golay code. It has only 1 error (in the first position). decode(v1,G,3,5); The decoding: v2:=[1, 1, 2, 2, 2, 1, 0, 1, 0, 0, 1, 2]; decode(v2,G,3,5); Another example, with 2 errors. The generator matrix for the perfect ternary (11,6) code: G:=golay11(); min_distance(G,3); This is very time-consuming. The parity check matrix for the ternary (11,6) code: H:=golay_check11(); The generator matrix for the perfect binary (23,12) code: G:=golay23(); The parity check matrix for the perfect binary (23,12) code: H:=golay_check23(); v1:=[0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1]; matrix_times_vector_modp(H,v1,2); v1 is not a codeword in the (23,12)-Golay code. It has only 1 error (in the first position). decode(v1,G,2,7); This is time-consuming to decode than the above Hamming code since the Golay code is larger. v2:=[0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0]; matrix_times_vector_modp(H,v2,2); decode(v2,G,2,7); This "string" has 3 errors G:=golay24(); The generator matrix for the (24,12)-Golay code H:=golay_check24(); The parity check matrix for the (24,12)-Golay code. coldim(G);coldim(H); BCH codes We shall construct by hand some BCH codes. A BCH code is a cyclic code which included the binary Hamming codes as a special case. To construct a (binary, narrow) BCH code, you must have a primitive element alpha of degree k over F=GF(2). You must know the minimal polynomials of a sequence of powers of alpha: alpha, alpha^2, ..., alpha^(2t). Take the lcm of these. This new polynomial is the generating polynomial of the BCH code. It has minimum distance 2t+1. WARNING: persistent store makes one-argument readlib obsolete readlib(lattice): minpoly_lattice:=minpoly; linalg has a minpoly command too with(numtheory): WARNING: persistent store makes one-argument readlib obsolete readlib(GF): Warning, new definition for order f:=x^4+x+1; alias(beta=RootOf(f)): Factor(f) mod 2; Factor(f,beta) mod 2; Roots(f,beta) mod 2; for i from 1 to 19 do pp[i]:=unapply(minpoly_lattice(beta^i,4),_X): print(beta^i,pp[i](x)); od: GenPoly:=x- Lcm(seq(pp[j](x),j=1..4)) mod 2: GenPoly(x); Quo(x^(15)-1,GenPoly(x),x) mod 2; iscyclic(GenPoly(x),15,2); In other words, GenPoly(x) is indeed the generating polynomial for some cyclic code over F_2. G:=generator_matrix(GenPoly(x),15,2); linalg[rowdim](G); linalg[coldim](G); H:=check_matrix(GenPoly(x),15,2); linalg[rowdim](H); linalg[coldim](H); This code is 2-error correcting. f:=x^6+x^3+1; alias(beta=RootOf(f)): Irreduc(f) mod 2; Factor(f,beta) mod 2; Roots(f,beta) mod 2; for i from 1 to 12 do pp[i]:=unapply(minpoly_lattice(beta^i,6),_X): print(beta^i,pp[i](x)); od: GenPoly:=x- Lcm(seq(pp[j](x),j=1..8)) mod 2: GenPoly(x); iscyclic(GenPoly(x),63,2); In other words, GenPoly(x) is indeed the generating polynomial for some cyclic code over F_2. This code is 4-error correcting. G:=generator_matrix(GenPoly(x),63,2): linalg[rowdim](G); linalg[coldim](G); H:=check_matrix(GenPoly(x),63,2); When are linear codes equivalent? We must load the group21_v5.mpl package (see http: web.usna.navy.mil ~wdj symm_gp.htm ) with(combinat): with(group): read(`d: maplestuff group group21_v5.mpl`); Warning, new definition for fibonacci G1:=hamming_generator(3,2); C1:=code_list(G1,2): C1:=sort(C1,weight_lexorder); Gausselim(G1) mod 2; G2:=generator_matrix(x^3+x^2+1,7,2); C2:=code_list(G2,2): C2:=sort(C2,weight_lexorder); The following program (on a 350Mz pentium II) returns true , if the binary linear code C1 with generator matrix G1 is equivalent to the binary linear code C2 with gen matrix G2 plus an associated column permutation for the second matrix, and returns false otherwise. t0:=time(): isequivalent(G1,G2); time()-t0; The following program does the same thing as the program above but uses a different algorithm. (Usually this second algorithm seems to be faster but obviously not in this case.) t0:=time(): isequivalent2(G1,G2); time()-t0; Next, we compute the automorphism group of a binary linear code. G1:=matrix([[1,1,0,1,0],[1,1,1,0,1],[1,1,0,1,0]]); t0:=time(): automorphismgroup(G1); time()-t0; Based on the worksheet codes.mws and the maple package codes.mpl . Maple7 version: codes_v7.mpl . Created wdj,6-2-98, last updated 8-2001.
Grotex Lab. - Complex calculations systems
The site represents two programs: " StringMath 1.0" - the ultraprecise calculator; " UlDi 2.0 Pro "- development and realization of methods of coding, decoding and compression (archiving) of data.
Grotex laboratory
Counterpane Labs: Publications
Contains papers on algorithm and protocol analysis and design as well as links to Bruce Schneier essays.
Counterpane Internet Security - Managed Security Services Enterprise Protection Suite Managed Security Monitoring Managed Vulnerability Scanning Device Management Active Response Email Scanning DDoS Prevention Log Retention Security Consulting Compliance Banking, Finance, Insurance Government Health Care Retail Utilities, Energy, and Power Small Medium Enterprise Literature Crypto-Gram Newsletter Book: Beyond Fear Book: Secrets Lies VARs Resellers Strategic Alliances Our Team Careers Investors Media Releases In the News Events Contact 11.02.2005 Oracle Voyager Worm 10.21.2005 Oracle Product Vulnerabilities 10.19.2005 SNORT Back Orifice Pre-Processor Vulnerability (Updated 10.24) more Enterprise Protection Suite How Enterprises are Gaining Strategic Advantage Through Protected Networks request pdf 11.15.2005 Counterpane Threat Intelligence Identifies Financial Industry as the Vertical Most Exposed to Targeted Scans and Probing Attacks 10.07.2005 Identity management in action (InfoWorld) 09.28.2005 Security Outsourcing Grabs Hold 09.12.2005 WilTel Enhances Managed Security Portfolio with Counterpane 08.24.2005 Counterpane Joins Sourcefire Certified Snort Integrator Program 07.27.2005 Managing the Digital Identity Crisis (Financial Times IT Review) 07.24.2005 Avoid Online ID Theft (Washington Post) 07.15.2005 Counterpane Continues Momentum with Record Revenue Growth; Expands Core Services For a Truly Integrated Managed Security Solution more media releases more news stories privacy policy site map terms of use 2005 Counterpane Internet Security, Inc.
General Hash Function Algorithms
General hash function algorithm implementations for string hashing in the object pascal, c and c++ programming languages.
.:: General Purpose Hash Function Algorithms - By Arash Partow ::. General Purpose Hash Function Algorithms www.partow.net .: Home :. .: Links :. .: Search :. .: Contact :. Main Menu About Projects Programming Miscellaneous Secure Login Topics String Tokenizer Argument Loader Configuration Loader POSIX Threading and Synchronous Wrappers POSIX Thread Test Simple Database Algorithms Callbacks In C++ General Purpose Hash Function Algorithms Delphi Standard Libraries Description Hashing Methodologies Hash Functions and Prime Numbers Various Forms Of Hashing String Hashing Cryptographic Hashing Geometric Hashing Bloom Filters Available Hash Functions RS Hash Function JS Hash Function PJW Hash Function ELF Hash Function BKDR Hash Function SDBM Hash Function DJB Hash Function DEK Hash Function AP Hash Function General Hash Function License Compatability Download Description Hash functions are by definition and implementation pseudo random number generators (PRNG). From this generalization its generally accepted that the performance of hash functions and also comparisons between hash functions can be achieved by treating hash function as PRNGs. Analysis techniques such a Poisson distribution can be used to analyze the collision rates of different hash functions for different groups of data. In general there is a theoretical hash function known as the perfect hash function for any group of data. The perfect hash function by definition states that no collisions will occur meaning no repeating hash values will arise from different elements of the group. In reality its very difficult to find a perfect hash function, in practice it is recognized that a perfect hash function is the hash function that produces the least amount of collisions for a particular set of data. The problem is that there are so many permutations of types of data, some highly random, others containing high degrees of patterning that its difficult to generalize a hash function for all data types or even for specific data types. All one can do is via trial and error find the hash function that best suites their needs. Some dimensions to analyze for choosing hash functions are: Data Distribution This is the measure of how well the hash function distributes the hash values of elements within a set of data. Analysis in this measure requires knowing the number of collisions that occur with the data set meaning non-unique hash values, If chaining is used for collision resolution the average length of the chains (which would in theory be the average of each bucket's collision count) analyzed, also the amount of grouping of the hash values within ranges should be analyzed. Hash Function Efficiency This is the measure of how efficiently the hash function produces hash values for elements within a set of data. When algorithms which contain hash functions are analyzed it is generally assumed that hash functions have a complexity of O(1), that is why look-ups for data in a hash-table are said to be of O(1) complexity, where as look-ups of data in maps (Red-Black Trees) are said to be of O(logn) complexity. A hash function should in theory be a very quick, stable and deterministic operation. A hash function may not always lend itself to being of O(1) complexity, however in general the linear traversal through a string of data to be hashed is so quick and the fact that hash functions are generally used on primary keys which by definition are supposed to be much smaller associative identifiers of larger blocks of data implies that the whole operation should be quick and to a certain degree stable. The hash functions in this essay are known as simple hash functions. They are typically used for data hashing (string hashing). They are used to create keys which are used in associative containers such as hash-tables. These hash functions are not cryptographically safe, they can easily be reversed and many different combinations of data can be easily found to produce identical hash values for any combination of data. Hashing Methodologies Hash functions are typically defined by the way they create hash values from data. There are two main methodologies for a hash algorithm to implement, they are: Addative Hashing This is where the hash value is constructed by traversing through the data and continually incrementing an initial value by a calculated value relative to an element within the data. The calculation done on the element value is usually in the form of a multiplication by a prime number. Rotative Hashing Same as additive hashing in that every element in the data string is used to construct the hash, but unlike additive hashing the values are put through a process of bitwise shifting. Usually a combination of both left and right shifts, the shift amounts as before are prime. The result of each process is added to some form of accumulating count, the final result being the hash value is passed back as the final accumulation. Hash Functions and Prime Numbers There isn't much real mathematical work which can definitely prove the relationship between prime numbers and pseudo random number generators. Nevertheless, the best results have been found to include the use of prime numbers. PRNGs are currently studied as a statistical entity, they are not study as deterministic entities hence any analysis done can only bare witness to the overall result rather than to determine how and or why the result came into being. If a more discrete analysis could be carried out, one could better understand what prime numbers work better and why they work better, and at the same time why other prime numbers don't work as well, answering these questions with stable, repeatable proofs can better equip one for designing better PRNGs and hence eventually better hash functions. Deciding what is the right or even better yet the best possible combination of hashing methodologies and use of prime numbers is still very much a black art. No single methodology can lay claim to being the ultimate general purpose hash function. The best one can do is to evolve via trial and error and statistical analysis methods for obtaining suitable hashing algorithms that meet their needs. Various Forms Of Hashing Hashing as a tool to associate one set or bulk of data with an identifier has many different forms of application in the real-world. Below are some of the more common uses of hash functions. String Hashing Used in the area of data storage access. Mainly within indexing of data and as a structural back end to associative containers(ie: hash tables) Cryptographic Hashing Used for data user verification and authentication. A strong cryptographic hash function has the property of being very difficult to reverse the result of the hash and hence reproduce the original piece of data. Cryptographic hash functions are used to hash user's passwords and have the hash of the passwords stored on a system rather than having the password itself stored. Cryptographic hash functions are also seen as irreversible compression functions, being able to represent large quantities of data with a signal ID, they are useful in seeing whether or not the data has been tampered with, and can also be used as data one signes in order to prove authenticity of a document via other cryptographic means. Geometric Hashing Used in visual recognition for classifying parameter objects within an associative container such as a hash-table. Bloom Filters A Bloom filter allows for the state of existance of a very large set of possible type values to be represented with a much smaller piece of memory. This is achieved through the use of multiple distinct hash functions and also by allowing the result of a query for the existance of a particular type to have a certain amount of error. This error can be control by either increasing or decreasing the size of the table used for the Bloom filter and also by increasing the number of hash functions. Available Hash Functions The General Hash Functions Library has the following mix of additive and rotative general purpose string hashing algorithms. RS Hash Function A simple hash function from Robert Sedgwicks Algorithms in C book. I've added some simple optimizations to the algorithm in order to speed up its hashing process. JS Hash Function A bitwise hash function written by Justin Sobel PJW Hash Function This hash algorithm is based on work by Peter J. Weinberger of ATT Bell Labs. ELF Hash Function Similar to the PJW Hash function, but tweaked for 32-bit processors. Its the hash function widely used on most UNIX systems. BKDR Hash Function This hash function comes from Brian Kernighan and Dennis Ritchie's book "The C Programming Language". It is a simple hash function using a strange set of possible seeds which all constitute a pattern of 31....31...31 etc, it seems to be very similar to the DJB hash function. SDBM Hash Function This is the algorithm of choice which is used in the open source SDBM project. The hash function seems to have a good over-all distribution for many different data sets. It seems to work well in situations where there is a high variance in the MSBs of the elements in a data set. DJB Hash Function An algorithm produced by Professor Daniel J. Bernstein and shown first to the world on the usenet newsgroup comp.lang.c. It is one of the most efficient hash functions ever published. DEK Hash Function An algorithm proposed by Donald E. Knuth in The Art Of Computer Programming Volume 3, under the topic of sorting and search chapter 6.4. AP Hash Function An algorithm produced by me Arash Partow. I took ideas from all of the above hash functions making a hybrid rotative and additive hash function algorithm based around four primes 3,5,7 and 11. There isn't any real mathematical analysis explaining why one should use this hash function instead of the others described above other than the fact that I tired to resemble the design as close as possible to a simple LFSR. An empirical result which demonstrated the distributive abilities of the hash algorithm was obtained using a hash-table with 100003 buckets, hashing The Project Gutenberg Etext of Webster's Unabridged Dictionary, the longest encountered chain length was 7, the average chain length was 2, the number of empty buckets was 4579. General Hash Function License Free use of the General Hash Functions Algorithm Library available on this site is permitted under the guidelines and in accordance with the most current version of the "Common Public License." Compatability The General Hash Functions Algorithm Library C\C++ implementation is compatible with the following C\C++ compiler: GNU Compiler Collection (3.3.1-x+) Intel C++ Compiler (8.x+) Borland C++ Builder (5,6) Borland C++ BuilderX Borland Turbo C++ The General Hash Functions Algorithm Library Object Pascal and Pascal implementations are compatible with the following Object Pascal and Pascal compilers: Borland Delphi (1,2,3,4,5,6,7,8) Free Pascal Compiler (1.9.x) Borland Turbo Pascal (5,6,7) The General Hash Functions Algorithm Library Java implementation is compatible with the following Java compilers: Sun Microsystems Javac (J2SE1.4+) GNU Java Compiler (GCJ) IBM Java Compiler Download General Hash Function Source Code (C++) General Hash Function Source Code (C) General Hash Function Source Code (Pascal Object Pascal) General Hash Function Source Code (Java) General Hash Function Source Code (All Languages) General Hash Function Algorithm Test Framework Bloom Filter Source Code (C++) Bloom Filter Source Code (Object Pascal) Selecting a Hashing Algorithm (Bruce J. McKenzie, R. Harries, Timothy C. Bell) Copyright Arash Partow
Teutoburgo: OTP4U
Contains a Java crypto-tool that allows the users to easily exchange a random key between them and then use it as a key for a One Time Pad cipher.
Teutoburgo - Java - OTP4U Java Home OTP4U One Time Pad for you! OTP4U is a tool that allows users to easily exchange a random key between them and then use it as a key for a One Time Pad cipher (if the key comes from a true random number generator, the One Time Pad is an unbreakable cipher). See how it works . Download OTP4U 0.9 for free: it's open source! ( GNU GPL license) (size: 145 KB) OTP4U is an open project and is under development: if you want to participate, here are some things to do: developing the GUI, adding a CSPRNG (possibly an existing one), improving the performance. If you are interested, or have any proposal, please contact me . Send your bug report here . If you'd like to implement an open source version of the OTP4U algorithm in a language different from Java, please send it to me! I'll publish it here. Take a look at Sysepub : it gave me the idea for OTP4U Take also a look at my applets: JSiteMap ( Site Map Generator ) JaVi (Java Vigenere) Note: OTP4U is NOT a well known and established cipher, but rather a proposal. If you want, read a public discussion about it, that took place on the Usenet (January 2003). Please note also that OTP4U comes with the GNU GPL license, then WITHOUT ANY WARRANTY of any kind. Teutoburgo Home Copyright Pierre Blanc 2003 geovisit();
Stubblebine Research Labs
List of current and past projects and publications.
Stubblebine Research Labs Stubblebine Research Labs Home Projects Jobs Contact PROJECTS Project Information Electronic Commerce and Privacy Secure Distributed Human Computation Countering Identity Theft On Securing Distributed Computing With Payout. Privacy and Location Based Services. Person-2-Person E-commerce. Authentic Attributes with Fine-Grained Anonymity Protection. (Anonymity without profiling and with revocation capabilities.) Fair On-line Auctions Without Special Trusted Parties Publicly Verifiable Lotteries: Applications of Delaying Functions Unlinkable Serial Transactions for consumer privacy and protection against subscription sharing. Formal Methods and Methods for Analysis, Verification and Design of Cryptographic Protocols On Generalized Authorization Problems Group Principals and Formalization of Anonymity Analysis Protocols for Known and Chosen Plaintext-Ciphertext Pairs Authentication logic for Reasoning about Synchronization, Revocation and Recency Analysis and Design of Message Integrity in Cryptographic Protocols Virtues and Limitations of Authentication Logics Revocation, Key Distribution, and Authentication Addressing Online Diectionary Attacks with Login Histories and Humans-in-the-Loop Recent-Secure Authentication, Revocation, and Trusted Third-Party Revocation Services PathServer service for assuring key authenticity using multiple authentication paths Metrics of Authentication Timestamps as Nonces for Authentication and Key Distribution Secure Software Engineering Techniques and Protocols Authentic Data Publication for Databases A General Model for Authentic Data Publication Authentic Data Publication over the Internet Certifying Data from Muliple Sources Authenticating query responses on XML documents without extra signatures and trusted publishers Authentic Third-party Data Publication Software Engineering for Security: a roadmap Security for Automated, Distributed Configuration Management Stack and Queue Integrity on Hostile Platforms Cryptographic Verification of Test Coverage Claims Mobile Code Analysis and Configuration Management using Revocation Techniques 2000-2004 Stubblebine Research Labs, LLC. All rights reserved.
North American Cryptography Archives
A comprehensive archive for cryptography source code, software, liturature and links.
Welcome to Cryptography.org Welcome to Cryptography.org The old North American Cryptography Archives are being restructured into an international (as much as law allows) open source cryptography resource. This is because the law has changed since the reason for the existence of this site came about, and because the operator of this site no longer lives in North America (except for relatively brief visits). Due to the nature of my job and the limitations of my network connection, this hobby process may take a significant amount of time. We also still have a listing of interesting cryptographic sites outside of North America and some information about where to get PGP and Gnu Privacy Guard. This site is maintained by Michael Paul Johnson , who also maintains a neat Bible links site .
Cryptography, Security and Linux
A site with cryptography related material (still under construction).
This Account Has Been Suspended Dear Valued Customer, On November 11th LeHost.networks (http: www.lehost.net ) a Canadian based company has recently made the acquisition of SB-Host.com (http: www.sb-host.com ) a US based company. If you see this page it is because you failed to submit your information to us, as explained in our previous e-mail to you, we needed to receive your information concerning your account with sb-host.com to add you to our Billing and Support . You are asked to take immediately contact with Pierre Boutinon (pierreb@lehost.net ) to have your account re-activated. All customers that already received their welcome e-mail from LeHost.networks should contact us if your account was suspended. Regards, Pierre Boutinon LeHost.networks
Neil Johnson's Cryptography Site
A quality resource website featuring current news and introductions to virtually every aspect of cryptography.
Cryptography and Encryption Cryptography and Encryption Security Related Books Security Privacy Resources Steganography Digital Watermarking Cryptography Encryption The Codebreakers Research in Cryptography Related Systems Issues Red Tape White Flags Documents, News Publications Security Newsgroups Security Tools Archives Organizations in Security Privacy Selected Bibliographies Other Security Links Neil's Page JJTC Home Page Hot Sites Amazon Recommends: Information Hiding : Steganography and Watermarking - Attacks and Countermeasures Neil F. Johnson, et al SSH, the Secure Shell Daniel J. Barrett High Technology Crime Investigator's Handbook Gerald L. Kovacich Special Edition Using Microsoft Access 2000 Roger Jennings Cracking DES Electronic Frontier Foundation Body of Secrets James Bamford The C Programming Language Brian W. Kernighan Java in a Nutshell David Flanagan Bombs, Bugs, Drugs, and Thugs Loch K. Johnson Decrypted Secrets Friedrich Ludwig Bauer Privacy Information Documentation and Information (intro to crypto) PGP - Pretty Good Privacy (includes PEM - Privacy Enhanced Mail) Internet Phone Security File Encryption Disk or File System Encryption Society and Cryptography (includes politics) Other cryptography information and links Steganography and Digital Watermarking Special Events and Announcements Cryptography and Encryption The Codebreakers Research in Cryptography Related Topics and Issues Documents, News and Publications Security Newsgroups Security Tools and Archives Organizations in Security and Privacy Other Security Links -------------------------------------------- Main Security Page Neil's GMU Page Neil's Home Page JJTC Home Page Center for Secure Information Systems Site Map -------------------------------------------- Cryptanalysis Cryptography and Encryption Documents, News and Publications Government Agencies Interest and User Groups Journals Network Security Newsletters Organizations in Security and Privacy Related Security Topics and Issues Research in Cryptography Security Page Security Applications Security Newsgroups Security Software Security Tools and Archives Special Events and Announcements Steganography and Digital Watermarking Steganography Document Usenet Security Newsgroups Vendors Other Security Links | Main Page | Security and Privacy Documentation and Information Introduction to Cryptography and General Information Classical Cryptography Course Volumes I and II by Randy Nichols (LANAKI) | Main Page | Security and Privacy PGP - Pretty Good Privacy Pretty Good Privacy (PGP Homepage) PGP home page EFH Pretty Good Privacy Workshop (very large but very informative) ( Mirror in Germany ) Cryptography, PGP, and Your Privacy page Using PGP PEM encryption - NCSA httpd Mosaic MacPGP Control - MPGPC Documentation, Books and FAQs on PGP EFH Pretty Good Privacy Workshop (very large but very informative) ( Mirror in Germany ) PGP: Pretty Good Privacy by Garfinkel (Amazon.com) The Official PGP User's Guide by Phil Zimmermann (Amazon.com) PGP: Source Code and Internals by Phil Zimmermann (Amazon.com) PGP Tools and FTP Sites Mailcrypt: An Emacs PGP Interface PGP Site Also look in Security Related Tools and Archives . | Main Page | Security and Privacy File Encryption DES is a standard in some flavors of UNIX. Implementations can be found in Security Related Tools and Archives under libraries. CRYPT is available on many Unix systems. This encryption tool can be broken easily and is therefore not very secure. Crypt Breaker's Workbench is such a tool that is freely available to crack CRYPT. Also see PGP for file encryption. | Main Page | Security and Privacy Disk or File System Encryption (Google) | Main Page | Security and Privacy Other cryptography Cryptography: The Study of Encryption Quadralay Cryptology Archive Research in Cryptography Researchers in Cryptography, Security and Steganography RSA Data Security The Cryptography Project (Dorothy Denning at Georgetown University) Ronald L. Rivest's Cryptography and Security page CDT Cryptography Policy Issues Page - Center for Democracy and Technology Steganography TEA, a Tiny Encryption Algorithm. Security and Privacy Cryptography Theory and Practice International Cryptography Electronic Frontier Foundation | Main Page | Security and Privacy | Neil's Homepage | Security and Privacy | Steganography | JJTC Main Page | Send comments to nfj(at)jjtc(dot)com. Copyright, 1995-2005, Neil F. Johnson . All Rights Reserved. FastCounter by LinkExchange
Kremlin by Mach 5 Software
A description of various cryptographic algorithms and their strength.
KremlinEncrypt Home Press Center Partners About Us Contact Us Kremlin KremlinApplications KremlinEncrypt Decrypt KremlinText KremlinSentry KremlinWipe KremlinSecureDelete Pricing KremlinSDK Cryptography Resources Concepts Algorithms TechnicalSupport CustomerSupport KremlinEncrypt announces version 3 of its popular security suite, Kremlin! Have you ever thought that your computer can be a perfect spy? It traces all your activities: the web sites you have visited - web pages, pictures, movies, videos, cookies. Your keystrokes, which might contain a sensitive passphrase, are carefully stored. Your word processor leaks scraps of your sensitive documents all over your hard drive. And you are confident that these file scraps and keyboard strokes are "deleted" automatically by your operating system or application and completely gone, aren't you? Windows and Mac OS were not designed to be secure. Removed files are just marked as unused space. The actual contents of these files are available for anyone with a low-level disk utility and the desire to view then. Furthermore, if you transfer sensitive data via the Internet, nobody can guarantee its security. Your secret e-mail can be intercepted and your competitor can use it against you and ruin your business or love. Are you still sure that your private life is private? nobody can get access to the secret data on your computer? intruders cannot break into your system and steal your information? your competitors cannot steal your trade secrets? nobody can get aware what you use the Internet for? secret emails to your partner or friend are not read by anybody else? information from deleted files is completely purged from your system? No? Do you want to protect your data from intruders? to keep anybody out of your private files? to be sure that all the traces of your sensitive data are erased? to secure your documents and e-mails? to store your data in encrypted compressed archives? Then Security Suite is for you Not only does Kremlin feature secure encryption with such algorithms as Blowfish , and RC4 , Kremlin does more: Kremlin builds a wall around your computer. In its most secure setting, Kremlin uses 160 bits of encryption key. It means that if one billion computers were each searching one trillion keys per second, it would take over 1019 years to recover a file encrypted with Kremlin. That's 10,000,000,000,000,000,000 years, much more than the life of the universe! Kremlin is so secure that the U.S. Government considers it a munition! To snoops, Kremlin is a deadly weapon. Kremlin builds a wall around your data When you log off, Kremlin clears sensitive areas of your hard disk and wipes all records of your activities. Kremlin automates the process of securing your computer by scheduling itself to secure portions of your hard disk and all used memory when you log off your computer or your computer becomes idle. Kremlin can automatically encrypt files and directories when you log off your computer and decrypt them when you log back on, providing a transparent way to protect your files from nosy intruders. Kremlin provides a full-featured and secure text editor that automatically encrypts your documents. You can e-mail a secret memo to a co-worker from within Kremlin Text. You can securely remove files from your computer by dragging them to the Kremlin Secure Recycle Bin (Windows) ot Kremlin Secure Delete (Mac OS). Kremlin is cross-platform. You can encrypt your information on the PC and decrypt and use it on the Mac and vice versa. Click here to know what comes with Kremlin Current Special: just $35 US! Create an encrypted archive with just one button click... Send an encrypted e-mail... Wipe your sensitive data completely... KremlinEncrypt.com
SSH and Cryptographic Algorithms
A brief survey of some commonly used cryptographic algorithms.
SSH : Support : Cryptography A-Z English | Deutsch | Sitemap | Purchase Download Resources Contact Home Company Solutions Products Services Support Partners Investors Product Support User Documentation Downloads FAQ Cryptography A-Z Contact Cryptography A-Z Introduction to Cryptography Algorithms Protocols and Standards References Online Resources In today's information society, cryptography has become one of the main tools for privacy, trust, access control, electronic payments, corporate security, and countless other fields. The use of cryptography is no longer a privilege reserved for governments and highly skilled specialists, but is becoming available for everyone. As the inventor and developer of the Secure Shell technology, SSH Communications Security has been involved in research and development in cryptography since 1995. ALL INFORMATION HERE IS PROVIDED AS IS, AND THERE IS NO WARRANTY OF ANY KIND, INCLUDING BUT NOT LIMITED TO THE ACCURACY OF THE INFORMATION OR THE LEGALITY OF THE REFERENCED SOFTWARE IN ANY PARTICULAR COUNTRY. Knowledge Base and FAQ contains extensive technical information about SSH products including howtos and troubleshooting tips. support.ssh.com Home | Company | Products | Solutions | Support | Partners | Investors || Feedback Copyright 2005 SSH Communications Security. Read our legal notice and privacy policy .
Cryptix Standard Cryptographic Algorithm Naming
Introduces a system to enumerate and give standard reference identifiers for cryptographic algorithms with sufficient detail that independent implementations will be able to interoperate.
Standard Cryptographic Algorithm Naming Contents MessageDigest Mac (Message Authentication Codes) Cipher (symmetric) Block Cipher Modes Block Cipher Padding KeyGenerator PRF (Pseudo Random Functions) * PassphraseHash * SecureRandom Cipher (asymmetric) Asymmetric Cipher Encoding Methods Signature Signature Encoding Methods Signature Output Formats KeyAgreement KeyPairGenerator KeyFactory AlgorithmParameterGenerator AlgorithmParameters * Experimental; not in JCE 1.2. Author: David Hopwood david.hopwood@zetnet.co.uk Current maintainer: David Hopwood david.hopwood@zetnet.co.uk Copyright 1995-2001 The Cryptix Foundation Limited and David Hopwood. All rights reserved. Cryptix is a trademark of The Cryptix Foundation Limited.
Bibliography on Secret Sharing Schemes
List maintained by Douglas Stinson and Ruizhong Wei.
Bibliography on Secret Sharing Schemes Bibliography on Secret Sharing Schemes maintained by Douglas Stinson and Ruizhong Wei version 4.1 October 13, 1998 In the late 1980's, Gus Simmons compiled a bibliography of papers on secret sharing schemes. As far as we know, the most recent version of his bibliography was published in his book Contemporary Cryptology in 1992. At that time he had a list of 68 papers. We are not aware if Gus has continued to maintain his bibliography, but we felt it would be useful to create an up-to-date bibliography and make it available on the WWW ... so that is what we are doing here. The current version of this bibliography has 216 entries. In general, we are including papers that are published in conference proceedings and journals (but not unpublished technical reports, preprints or dissertations). We would appreciate knowing of any errors in this list, as well as any papers that should be added, updates to unpublished papers, etc. Please e-mail us. See also the bibliography on authentication codes . R. Ahlswede and I. Csiszar, Common randomness in information theory and cryptography I: secret sharing, IEEE Transactions on Information Theory 39 (1993), 1121-1132. N. Alon, Z. Galil and M. Yung, Efficient dynamic-resharing "verifiable secret sharing" against mobile adversary, in "European Symposium on Algorithms 95", Lecture Notes in Computer Science979, 523-537. C. A. Asmuth and G. R. Blakley, Pooling, Splitting and reconstituting information to overcome total failure of some channels of communication, in "Proceedings of the 1982 Symposium on Security and Privacy", IEEE Press, 1982, 156-169. C. A. Asmuth and J. Bloom, A modular approach to key safeguarding, IEEE Transactions on Information Theory 29 (1983), 208-210. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, Visual cryptography for general access structures, Information and Computation 129 (1996), 86-106. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, Constructions and bounds for visual cryptography, in "23rd International Colloquium on Automata, Languages and Programming", F. M. auf der Heide and B. Monien, eds., Lecture Notes in Computer Science 1099 (1996), 416-428. S. Barwick, Y. Desmedt and P. Wild, Homomorphic threshold schemes, k-arcs and Lenstra's constant, in "Cryptography and Coding IV", Oxford University Press, 1995, 95-102. P. Beguin and A. Cresti, General short computational secret sharing schemes, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 194-208. A. Beimel and B. Chor, Universally ideal secret sharing schemes, IEEE Transactions on Information Theory 40 (1994), 786-794. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 183-195.] A. Beimel and B. Chor, Secret sharing with public reconstruction, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 353-366. J. Cohen Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret, in "Advances in Cryptology -- CRYPTO '86", A. M. Odlyzko, ed., Lecture Notes in Computer Science 263 (1987), 251-260. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, in "Advances in Cryptology -- CRYPTO '88", S. Goldwasser, ed., Lecture Notes in Computer Science 403 (1989), 27-35. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in "20th Annual Symposium on Theory of Computing", ACM Press, 1988, 1-10. M. Bertilsson and I. Ingemarsson, A construction of practical secret sharing schemes using linear block codes, in "Advances in Cryptology -- AUSCRYPT '92", J. Seberry and Y. Zheng, eds., Lecture Notes in Computer Science 718 (1993), 67-79. T. Beth, H. J. Knobloch and M. Otten, Verifiable secret sharing for monotone access structures, in "1st ACM Conference on Computer and Communications Security", ACM Press, 1993, 189-194. A. Beutelspacher, Enciphered geometry: some applications of geometry to cryptography, in "Combinatorics '86", A. Barlotti, M. Marchi and G. Tallini, eds., Discrete Applied Mathematics 37 (1988), 59-68. A. Beutelspacher, How to say "no", in "Advances in Cryptology -- EUROCRYPT '89", J.-J. Quisquater and J. Vandewalle, eds., Lecture Notes in Computer Science 434 (1990), 491-496. A. Beutelspacher, Applications of finite geometry to cryptography, in "Geometries, Codes and Cryptography", G. Longo, M. Marchi and A. Sgarro, eds., CISM Courses and Lectures No. 313 , Springer-Verlag, 1990, 161-186. A. Beutelspacher and K. Vedder, Geometric structures as threshold schemes, in "Cryptography and Coding", H. J. Beker and F. C. Piper, eds., Oxford University Press, 1989, 255-268. A. Beutelspacher and F. Wettl, On 2-level secret sharing, Designs, Codes and Cryptography 3 (1993), 127-134. I. Biehl and S. Wetzel, Traceable visual cryptography, in" Information and Communications Security, Lecture Notes in Computer Science 1334 (1997), 61-71. S. R. Blackburn, M. Burmester, Y. Desmedt and P. R. Wild, Efficient multiplicative sharing schemes, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 107-118. B. Blakley, G. R. Blakley, A. H. Chan and J. Massey, Threshold schemes with disenrollment, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 540-548. G. R. Blakley, Safeguarding cryptographic keys, in "Proceedings of the National Computer Conference, 1979", American Federation of Information Processing Societies Proceedings 48 (1979), 313-317. G. R. Blakley, One-time pads are key safeguarding schemes, not cryptosystems: fast key safeguarding schemes (threshold schemes) exist, in "Proceedings of the 1980 Symposium on Security and Privacy", IEEE Press, 1980, 108-113. G. R. Blakley and R. D. Dixon, Smallest possible message expansion in threshold schemes, in "Advances in Cryptology -- CRYPTO '86", A. M. Odlyzko, ed., Lecture Notes in Computer Science 263 (1987), 266-274. G. R. Blakley and G. A. Kabatianski, Linear algebra approach to secret sharing schemes, in "Error Control, Cryptology, and Speech Compression", Lecture Notes in Computer Science 829 (1994), 33-40. G. R. Blakley and G. A. Kabatianski, On general perfect secret sharing schemes, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 367-371. G. R. Blakley and C. Meadows, Security of ramp schemes, in "Advances in Cryptology -- CRYPTO '84", G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196 (1985), 242-268. G. R. Blakley and L. Swanson, Security proofs for information protection systems, in "Proceedings of the 1981 Symposium on Security and Privacy", IEEE Press, 1981, 75-82. G. R. Blakley and L. Swanson, Infinite structures in information theory, in "Advances in Cryptology -- CRYPTO '82", D. Chaum, R. L. Rivest and A. T. Sherman, eds., Plenum Press, 1983, 39-50. R. G. Bleuikli and G. A. Kabatyanskiuli, Generalized ideal secret sharing schemes and matroids, Problems Infrom. Transmission, 33(1997), 277-284. C. Blundo, A note on dynamic threshold schemes, Information Processing Letters 55 (1995), 189-193. C. Blundo, A. Cresti, A. De Santis and U. Vaccaro, Fully dynamic secret sharing schemes, Theoretical Computer Science 155 (1996), 407-410. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 110-125.] C. Blundo and A. De Santis, On the construction of secret sharing schemes, in "Structure: From Physics to General Systems, Festschrift in honour of E. Caianiello", M. Marinaro and G. Scarpetta, eds., World Scientific, 1992, 245-261. C. Blundo and A. De Santis, Lower bounds for robust secret sharing schemes, Inform. Process. Lett., 63(1997), 317-321. C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Designs, Codes and Cryptography 11 (1997), 107-122. C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia and U. Vaccaro, Multi-secret sharing schemes, in "Advances in Cryptology -- CRYPTO '94", Y. G. Desmedt, ed., Lecture Notes in Computer Science 839 (1994), 150-163. C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, New bounds on the share's size in secret sharing schemes, in "PRAGOCRYPT'96", CTU Publishing House, (1996), 349-358. C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes, Theoretical Computer Science 154 (1996), 283-306. [Preliminary version appeared in ``Advances in Cryptology -- CRYPTO '92'', E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 148-167.] C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, Secret sharing with veto capabilities, in "Algebraic Coding, First French-Israeli Workshop", G. Cohen, S. Litsyn, A. Lobstein and G. Zemor, eds., Lecture Notes in Computer Science 781 (1993), 82-89. C. Blundo, A. De Santis, A. Giorgio Gaggia, and U. Vaccaro, Lower Bounds in Secret Sharing Schemes, in " ISIT '94 ", (1994),491- C. Blundo, A. De Santis, A. Giorgio Gaggia and U. Vaccaro, New bounds on the information rate of secret sharing schemes, IEEE Transactions on Information Theory 41 (1995), 549-554. C. Blundo, A. De Santis and U. Vaccaro, On secret sharing schemes, Information Processing Letters, to appear. C. Blundo, A. De Santis and D. R. Stinson, On the contrast in visual cryptography schemes, Journal of Cryptology , to appear. C. Blundo, A. De Santis, D. R. Stinson and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology 8 (1995), 39-64. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '92", R. A. Rueppel, ed., Lecture Notes in Computer Science 658 (1993), 1-24.] C. Blundo, A. De Santis and U. Vaccaro, Efficient sharing of many secrets, in "10th Annual Symposium on Theoretical Aspects of Computer Science", P. Enjalbert, A. Finnkel and K. Wagner, eds., Lecture Notes in Computer Science 665 (1993), 692-703. C. Blundo, A. De Santis and U. Vaccaro, Randomness in distribution protocols, Information and Computation 131 (1996), 111-139. [Preliminary version appeared in "Automata, Languages and Programming, 21st International Colloquium", S. Abiteboul and E. Shamir, eds., Lecture Notes in Computer Science 820 (1994), 568-579.] C. Blundo, A. De Santis and U. Vaccaro, On secret sharing schemes, Inform. Process. Lett. 65 (1998), 25-32. C. Blundo, A. Giorgia Gaggia and D. R. Stinson, On the dealer's randomness required in secret sharing schemes, Designs, Codes and Cryptography 11 (1997), 107-122. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 35-46.] C. Blundo and D. R. Stinson, Anonymous secret sharing schemes, Discrete Applied Mathematics, 77 (1997), 13-28. E. F. Brickell, Some ideal secret sharing schemes, Journal of Combinatorial Mathematics and Combinatorial Computing 6 (1989), 105-113. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '89", J.-J. Quisquater and J. Vandewalle, eds., Lecture Notes in Computer Science 434 (1990), 468-475.] E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 4 (1991), 123-134. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 278-285.] E. F. Brickell and D. R. Stinson, The detection of cheaters in threshold schemes, SIAM Journal of Discrete Mathematics 4 (1991), 502-510. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '88", S. Goldwasser, ed., Lecture Notes in Computer Science 403 (1989), 564-577.] E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology 5 (1992), 153-166. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '90", A. J. Menezes and S. A. Vanstone, eds., Lecture Notes in Computer Science 537 (1991), 242-252.] M. Burmester, Homomorphisms of sharing schemes: a tool for verifiable signature sharing, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 96-106. C. Cachin, On-line secret sharing, in "Cryptography and Coding V", C. Boyd, ed., Lecture Notes in Computer Science 1025 (1996), 190-198. Z. Cao, Finite set theory and its application to cryptology, Journal of Statistical Planning and Inference 51 (1996), 129-136. R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, On the size of shares in secret sharing schemes, J. Cryptology 6 (1993), 157-167. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 101-113.] R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, A note on secret sharing schemes, in "Sequences II: Methods in Communication, Security and Computer Science", R. Capocelli and A. De Santis, eds., Springer Verlag, 1993, 335-344. M. Carpentieri, A perfect threshold secret sharing scheme to identify cheaters, Designs, Codes and Cryptography 5 (1995), 183-188. M. Carpentieri, Some democratic secret sharing schemes, Discrete Applied Mathematics 59 (1995), 293-298. M. Carpentieri, A. De Santis and U. Vaccaro, Size of shares and probability of cheating in threshold schemes, in "Advances in Cryptology -- EUROCRYPT '93", T. Helleseth, ed., Lecture Notes in Computer Science 765 (1994), 118-125. C. Charnes, K. M. Martin, J. Pieprzyk and R. Safavi-Naini, Sharing secret information in Hierarchical groups, in "Information and Communications Security", Lecture Notes in Computer Science, 1334(1997) 81-86. C. Charnes and J. Pieprzyk, Cumulative arrays and generalised Shamir secret sharing schemes, in "17th Australasian Computer Science Conference", Australian Computer Science Communications 16 (1994), 519-528. C. Charnes and J. Pieprzyk, Generalised cumulative arrays and their application to secret sharing schemes, in "18th Australasian Computer Science Conference", Australian Computer Science Communications 17 (1995), 61-65. C. Charnes, J. Pieprzyk and R. Safavi-Naini, Conditionally secure secret sharing scheme with disenrollment capability, in "2nd ACM Conference on Computer and Communications Security", ACM Press, 1994, 89-95. G. R. Chaudry and J. Seberry, Secret sharing schemes based on Room squares, in "Combinatorics, Complexity and Logic", Springer-Verlag, 1997, 158-167. D. Chaum, How to keep a secret alive, extensible partial key, key safeguarding, and threshold systems, in "Advances in Cryptology -- CRYPTO '84", G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196 (1985), 481-485. D. Chaum, C. Crepeau and I. Damgard, Multiparty unconditionally secure protocols, in: " Proc. 20th Annual Symp. on Theory of Computing", ACM, (1988), 11-19. D. Chen and D. R. Stinson, Recent results on combinatorial constructions for threshold schemes, Australasian Journal of Combinatorics 1 (1990), 29-48. L. Chen, D. Gollmann, C. J. Mitchell and P. Wild, Secret sharing with reusable polynomials, in "Information Security and Privacy -- ACISP '97", V. Varadharajan, J. Pieprzyk and Y. Mu, eds., Lecture Notes in Computer Science 1270 (1997), 183-193. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, in "Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science", IEEE Press, 1985, 383-395. B. Chor and E. Kushilevitz, Secret sharing over infinite domains, J. Cryptology 6 (1993), 87-95. [Prelimionary version appeared in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 299-306.] J. Cooper, D. Donovan and J. Seberry, Secret sharing schemes arising from latin squares, Bulletin of the Institute of Combinatorics and its Applications 12 (1994), 33-43. R. Cramer, I. Damgard and B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, in "Advances in Cryptology -- CRYPTO '94", Y. G. Desmedt, ed., Lecture Notes in Computer Science 839 (1994), 174-187. R. A. Croft and S. P. Harris, Public-key cryptography and re-usable shared secrets, in "Cryptography and Coding", H. J. Beker and F. C. Piper, eds., Oxford University Press, 1989, 189-201. L. Czirimaz, The size of a share must be large, Journal of Cryptology 10 (1997), 223-231. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 13-22.] L. Czirimaz, The dealer's random bits in secret sharing schemes, Studia Sci. Math. Hungar. 32 (1996), 429-437. G. I. Davida, R. DeMillo and R. Lipton, Protecting shared cryptographic keys, in "Proceedings of the 1980 Symposium on Security and Privacy", IEEE Press, 1980, 100-102. E. Dawson and D. Donovan, Shamir's scheme says it all, in "Computer Security", E. G. Dougall, ed., North-Holland, 1993, 91-102. E. Dawson and D. Donovan, The breadth of Shamir's secret sharing scheme, Computers and Security 13 (1994), 69-78. E. Dawson, E. S. Mahmoodian and A. Rahilly, Orthogonal arrays and ordered threshold schemes, Australasian Journal of Combinatorics 8 (1993), 27-44. J. Denes and A. D. Keedwell, On Golomb-Posner codes and a remark of W. W. Wu about secret-sharing systems, IEEE Trans. Comm. 38 (1990), 261-262. A. De Santis, Y. Desmedt and Y. Frankel, How to share a function securely, in "26th Annual Symposium on Theory of Computing", ACM Press, 1994, 522-533. A. De Santis, G. Di Crescenzo and G. Persiano, Secret sharing and perfect zero knowledge, in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 73-84. Y. Desmedt, Threshold cryptography, European Transactions on Telecommunications 5 (1994), 449-457. Y. Desmedt and Y. Frankel, Threshold cryptosystems, in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 307-315. Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatires, in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 457-469. Y. Desmedt and Y. Frankel, Homomorphic zero-knowledge threshold schemes over any finite abelian group, SIAM Journal of Discrete Mathematics 7 (1994), 667-679. [Preliminary version appeared in "Sequences II: Methods in Communication, Security and Computer Science", R. Capocelli and A. De Santis, eds., Springer Verlag, 1993, 369-378.] Y. Desmedt, Y. Frankel and M. Yung, Multi-reciever multi-sender network security: efficient authenticated multicast feedback, in "IEEE INFOCOM '92", IEEE Press, 1992, 2045-2054. Y. Desmedt, G. di Crescenzo and M. Burmester, Multiplicative non-abelian sharing schemes and their application to threshold cryptography, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science 917 (1995), 21-32. M. De Soete, Geometric threshold schemes, in "Geometries, Codes and Cryptography", G. Longo, M. Marchi and A. Sgarro, eds., CISM Courses and Lectures No. 313 , Springer-Verlag, 1990, 201-212. M. De Soete and K. Vedder, Some new classes of geometric threshold schemes, in "Advances in Cryptology -- EUROCRYPT '88", C. G. Gunther, ed., Lecture Notes in Computer Science 330 (1988), 389-401. M. van Dijk, On the information rate of perfect secret sharing schemes, Designs, Codes and Cryptography 6 (1995), 143-169. M. van Dijk, More information theoretical inequalities to be used in secret sharing?, Information Processing Letters 63 (1997), 41-44. M. van Dijk, A linear construction of secret sharing schemes, Designs, Codes and Cryptography 12 (1997), 161-201. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 23-34. ] M. van Dijk, W.-A. Jackson and K. M. Martin, A note on duality in linear secret sharing schemes, Bulletin of the Institute of Combinatorics and its Applications 19 (1997), 93-101. D. Donovan, Some interesting constructions for secret sharing schemes, Australasian Journal of Combinatorics 9 (1994), 37-65. S. Droste, New results on visual cryptography, in "Advances in Cryptology -- CRYPTO '96", N. Koblitz, ed., Lecture Notes in Computer Science 1109 (1996), 401-415. C. Dwork, On verification in secret sharing, in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 114-128. C. Dwork, Strong verifiable secret sharing, in "Proceedings of the 4th International Workshop on Distributed Algorithms", Lecture Notes in Computer Science 486 (1991), 213-227. T. Etzion, On threshold schemes from large sets, J. Combin. Des. 4 (1996), 323-338. P. Feldman, A practical scheme for non-interactive verifiable secret sharing, in "Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science", IEEE Press, 1987, 427-437. P. Feldman and S. Micali, Optimal algorithms for Byzantine agreement, in:" Proc. 20th Annual Symp. on Theory of Computing, ACM, (1988), 148-161. Y. Frankel and Y. Desmedt, Classification of ideal homomorphic threshold schemes over finite abelian groups, in "Advances in Cryptology -- EUROCRYPT '92", R. A. Rueppel, ed., Lecture Notes in Computer Science 658 (1993), 25-34. Y. Frankel, Y. Desmedt and M. Burmester, Non-existence of homomorphic general sharing schemes for some key spaces, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 549-557. M. K. Franklin and M. K. Reiter, Verifiable signature sharing, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 50-63. R. Gennaro and S. Micali, Verifiable secret sharing as secure computation, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 168-182. R. Gennaro M. O. Rabin, and T. Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, in: " Proc. of 1998 ACM Symp. on Priciples of Distributed Computing", to appear. H. Ghodosi, J. Pieprzyk and Safavi-Naini, Remarks on the multiple assignment secret sharing scheme, Lecture Notes in Computer Science 1334 (1997), 72-82. O. Goldreich, S. Micali and A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J. ACM 38(1991), 691-729. J. Dj. Golic, On matroid characterization of ideal secret sharing schemes, J. Cryptology 11 (1998), 75-86. S. Harari, Secret sharing systems, in "Secure Digital Communications", G. Longo, ed., CISM Courses and Lectures No. 279 , Springer-Verlag, 1983, 105-110. S. Harari, Application des codes correcteurs au partage du secret, Traitement Signal 4 (1987), 353-356. L. Harn and H.-Y. Lin, An l-span generalized secret sharing scheme, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 558-565. J. He and E. Dawson, Multistage secret sharing based on one-way function, Electronics Letters 30 (1994), 1591-1592. J. He and E. Dawson, Multisecret-sharing scheme based on one-way function, Electronics Letters 31 (1995), 93-95. J. He and E. Dawson, How to fairly reconstruct a shared secret, in "Cryptography: Policy and Algorithms", Lecture Notes in Computer Science 1029 (1996), 115-124. A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, Proactive secret sharing or how to cope with perpetual leakage, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 339-352. T. Hofmeister, M. Krause and H. U. Simon, Contrast-optimal k out of n secret sharing schemes in visual cryptography, to be presented at "COCOON '97". S.-J. Hwang and C.-C. Chang, A dynamic secret sharing scheme with cheater detection, in "Information Security and Privacy '96", J. Pieprzyk and J. Seberry, eds., Lecture Notes in Computer Science 1172 (1996), 48-55. T. Hwang, Protocols for group oriented secret sharing, Information Processing Letters 42 (1992), 179-182. I. Ingemarsson and G. J. Simmons, A protocol to set up shared secret schemes without the assistance of a mutually trusted party, in "Advances in Cryptology -- EUROCRYPT '90", I. B. Damgard, ed., Lecture Notes in Computer Science 473 (1991), 266-282. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, in "Proceedings of the IEEE Global Telecommunications Conference, Globecom '87", IEEE Press, 1987, 99-102. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, Electron. Comm. Japan Part III Fund. Electron. Sci. 72 (1989), 56-63. M. Ito, A. Saito and T. Nishizeki, Multiple assignment scheme for sharing secret, J. Cryptology 6 (1993), 15-20. W.-A. Jackson and K. M. Martin, Cumulative arrays and geometric secret sharing schemes, in "Advances in Cryptology -- AUSCRYPT '92", J. Seberry and Y. Zheng, eds., Lecture Notes in Computer Science 718 (1993), 48-55. W.-A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Designs, Codes and Cryptography 4 (1994), 83-95. W.-A. Jackson and K. M. Martin, Combinatorial models for perfect secret sharing schemes, to appear in Journal of Combinatorial Mathematics and Combinatorial Computing. W.-A. Jackson and K. M. Martin, Efficient constructions for one sharing of many secrets, Australasian Journal of Combinatorics 14 (1996), 283-296. W.-A. Jackson and K. M. Martin, A combinatorial interpretation of ramp schemes, Australasian Journal of Combinatorics 14 (1996), 51-60. W.-A. Jackson and K. M. Martin, Perfect secret sharing schemes on five participants, Designs, Codes and Cryptography 9 (1996), 267-286. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Multisecret threshold schemes, in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 126-135. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, On sharing many secrets, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science 917 (1995), 42-54. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Efficient secret sharing without a mutually trusted authority, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 183-193. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, A construction for multisecret threshold schemes, Designs, Codes and Cryptography 9 (1996), 287-303. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Ideal secret sharing schemes with multiple secrets, Journal of Cryptology 9 (1996), 233-250. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Mutually trusted authority-free secret sharing schemes, Journal of Cryptology 10 (1997), 261-289. E. D. Karnin, J. W. Greene and M. E. Hellman, On secret sharing systems, IEEE Transactions on Information Theory 29 (1983), 35-41. S. C. Kothari, Generalized linear threshold scheme, in "Advances in Cryptology -- CRYPTO '84", G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196 (1985), 231-241. K. Koyama, Cryptographic key sharing methods for multi-groups and security analysis, Transactions of the IECE Japan E66 (1983), 13-20. H. Krawczyk, Secret sharing made short, in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 136-146. K. Kurosawa, S. Obana and W. Ogata, t-cheater identifiable (k,n) threshold secret sharing schemes, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 410-423. K. Kurosawa and K. Okada, Combinatorial interpretation of secret sharing schemes, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science 917 (1995), 55-64. K. Kurosawa and K. Okada, Combinatorial lower bounds for secret sharing schemes, Information Processing Letters 60 (1996), 301-304. [This is a revised version of the previous paper.] K. Kurosawa, K. Okada, K. Sakano, W. Ogata and S. Tsujii, Nonperfect secret sharing schemes and matroids, in "Advances in Cryptology -- EUROCRYPT '93", T. Helleseth, ed., Lecture Notes in Computer Science 765 (1994), 126-141. C.-S. Laih, L. Harn, J.-Y. Lee and T. Hwang, Dynamic threshold scheme based on the definition of a cross-product in an n-dimensional linear space, in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 286-298. C. Laih, J. Lee and L. Harn, A new threshold scheme and its applications in designing the conference key distribution cryptosystem, Information Processing Letters 32 (1989), 95-99. H.-Y. Lin and L. Harn, A generalized secret sharing scheme with cheater detection, in "Advances in Cryptology -- ASIACRYPT '91", H. Imai, R. L. Rivest and T. Matsumoto, eds., Lecture Notes in Computer Science 739 (1993), 149-158. H.-Y. Lin and L. Harn, Fair reconstruction of a secret, Information Processing Letters 55 (1995), 45-48. P. L. Lin and J. G. Dunham, A secret sharing model: GS^3, IEE Electronics Letters 30 (1994), 2116-2118. W. Mao, Necessity and relization of universally verifiable secret sharing, in: "IEEE Symp. on Security and Privacy", to appear. K. M. Martin, Untrustworthy participants in perfect secret sharing schemes, in "Cryptography and Coding III", M. J. Ganley, ed., Oxford University Press, 1993, 255-264. K. M. Martin, New secret sharing schemes from old, Journal of Combinatorial Mathematics and Combinatorial Computing 14 (1993), 65-77. J. L. Massey, Minimal codewords and secret sharing, in "Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory", (1993), 276-279. J. L. Massey, Some applications of coding theory in cryptography, in "Cryptography and Coding IV", Oxford University Press, 1995, 33-47. A. Mayer and M. Yung, Generalized secret sharing and group-key distribution using short keys, Pro. Sequences '97. R. J. McEliece and D. Sarwate, On sharing secrets and Reed-Solomon codes, Communications of the ACM 24 (1981), 583-584. C. Meadows, Some threshold schemes without central key distributors, Congressus Numerantium 46 (1985), 187-199. S. Micali, Fair public-key cryptosystems, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 113-138. S. Micali and T. Rabin, Collective coin tossing without assumptions nor broadcasting, in "Advances in Cryptology -- CRYPTO '90", A. J. Menezes and S. A. Vanstone, eds., Lecture Notes in Computer Science 537 (1991), 253-266. M. Mignotte, How to share a secret, in "Cryptography Proceedings, Burg Feuerstein 1982", T. Beth, ed., Lecture Notes in Computer Science 149 (1983), 371-375. C. J. Mitchell, F. C. Piper, M. Walker and P. Wild, Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes, Designs, Codes and Cryptography 7 (1996), 101-110. M. Naor and B. Pinkas, Visual authentication and identification, in "Advances in Cryptology -- CRYPTO '97", B. Kaliski, Jr., ed., Lecture Notes in Computer Science 1294 (1997), 322-336. M. Naor and A. Shamir, Visual cryptography, in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 1-12. M. Naor and A. Shamir, Visual cryptography II: improving the constrast via the cover base, in "Security Protocols", M. Lomas, ed., Lecture Notes in Computer Science 1189 (1997), 197-202. M. Naor and A. Wool, Access control and signatures via quorum secret sharing, in "3rd ACM Conference on Communication and Computer Security", 1996. S. Obana and K. Kurosawa, Veto is impossible in secret sharing schemes, Information Processing Letters 58 (1996), 293-295. W. Ogata and K. Kurosawa, Optimum secret sharing scheme secure against cheating, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 200-211. W. Ogata, K. Kurosawa and S. Tsujii, Nonperfect secret sharing schemes, in "Advances in Cryptology -- AUSCRYPT '92", J. Seberry and Y. Zheng, eds., Lecture Notes in Computer Science 718 (1993), 56-66. K. Okada and K. Kurosawa, Lower bound on the size of shares of nonperfect secret sharing schemes, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science (1995), 33-41. K. Okada, W. Ogata, K. Sakano and K. Kurosawa, Analysis on secret sharing schemes with non-graphical access structures, IEICE Transactions Fundamentals, E80-A (1997), 85-89. C. M. O'Keefe, Applications of finite geometries to information security, Australasian Journal of Combinatorics 7 (1993), 195-212. R. Ostrosky and M. Yung, How to withstand mobile virus attacks, in: " ACM Symp. on Priciples of Distributed Computing", (1991), 51-59. T. P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 129-140. S. J. Phillips and N. C. Phillips, Strongly ideal secret sharing schemes, J. Cryptology 5 (1992), 185-191. R. G. E. Pinch, On-line multiple secret sharing, Electronics Letters 32 (1996), 1087-1088. T. Rabin, Robust sharing of secrets when the dealer is honest or cheating, Journal of the ACM 41 (1994), 1089-1109. T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, in "21st Annual Symposium on Theory of Computing", ACM Press, 1989, 73-85. A. Renvall and C. Ding, A nonlinear secret sharing scheme, in "Information Security and Privacy '96", J. Pieprzyk and J. Seberry, eds., Lecture Notes in Computer Science 1172 (1996), 56-66. A. Renvall and C. Ding, The access structure of some secret sharing schemes, in "Information Security and Privacy '96", J. Pieprzyk and J. Seberry, eds., Lecture Notes in Computer Science 1172 (1996), 67-78. J. Rifa-Coma, How to avoid the cheaters succeeding in the key sharing scheme, Designs, Codes and Cryptography 3 (1993), 221-228. P. J. Schellenberg and D. R. Stinson, Threshold schemes from combinatorial designs, Journal of Combinatorial Mathematics and Combinatorial Computing 5 (1989), 143-160. P. D. Seymour, On secret sharing matroids, Journal of Combinatorial Theory B 56 (1992), 69-73. A. Shamir, How to share a secret, Communications of the ACM 22 (1979), 612-613. S. P. Shieh and H. M. Sun, On constructing secret sharing schemes, in "Infocom '94 Proceedings", IEEE Press, 1994, 1288-1292. G. J. Simmons, How to (really) share a secret, in "Advances in Cryptology -- CRYPTO '88", S. Goldwasser, ed., Lecture Notes in Computer Science 403 (1989), 390-448. G. J. Simmons, Prepositioned shared secret and or shared control schemes, in "Advances in Cryptology -- EUROCRYPT '89", J.-J. Quisquater and J. Vandewalle, eds., Lecture Notes in Computer Science 434 (1990), 436-467. G. J. Simmons, Robust secret sharing schemes or "How to be sure you have the right answer even though you don't know the question", Congressus Numerantium 68 (1989), 215-248. G. J. Simmons, Geometric shared secret and or shared control schemes, in "Advances in Cryptology -- CRYPTO '90", A. J. Menezes and S. A. Vanstone, eds., Lecture Notes in Computer Science 537 (1991), 216-241. G. J. Simmons, An introduction to shared secret and or shared control schemes and their application, in "Contemporary Cryptology, The Science of Information Integrity", G. J. Simmons, ed., IEEE Press, 1992, 441-497. G. J. Simmons, The consequences of trust in shared secret schemes, in "Advances in Cryptology -- EUROCRYPT '93", T. Helleseth, ed., Lecture Notes in Computer Science 765 (1994), 448-452. G. J. Simmons, W.-A. Jackson and K. M. Martin, The geometry of shared secret schemes, Bulletin of the Institute of Combinatorics and its Applications 1 (1991), 71-88. G. J. Simmons and C. Meadows, The role of trust in information security protocols, Journal of Computer Security 3 (1994 1995), 71-84. M. Stadler, Publicly verifiable secret sharing, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 190-199. D. R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography 2 (1992), 357-390. D. R. Stinson, New general lower bounds on the information rate of perfect secret sharing schemes, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 168-182. D. R. Stinson. Combinatorial designs and cryptography, in "Surveys in Combinatorics, 1993", K. Walker, ed., Cambridge University Press, 1993, 257--287. D. R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Transactions on Information Theory 40 (1994), 118-125. D. R. Stinson, Visual cryptography and threshold schemes, Dr. Dobb's Journal,,(1998), 36-43. D. R. Stinson and S. A. Vanstone, A combinatorial approach to threshold schemes, SIAM Journal of Discrete Mathematics 1 (1988), 230-236. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO 87", C. Pomerance, ed., Lecture Notes in Computer Science 293 (1988), 330-339.] H.-M. Sun and B.-L. Chen, On the decomposition constructions for perfect secret sharing schemes, in "Information and Communications Security, Lecture Notes in Computer Science, 1334 (1997), 50-60. H.-M. Sun and S.-P. Shieh, On dynamic threshold schemes, Information Processing Letters 52 (1994), 201-206. H.-M. Sun and S.-P. Shieh, An efficient construction of perfect secret sharing schemes for graph-based access structures, Computers and Mathematics with Applictions 31 (1996), 129-135. M. Tompa and H. Woll, How to share a secret with cheaters, J. Cryptology 1 (1988), 133-138. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '86", A. M. Odlyzko, ed., Lecture Notes in Computer Science 263 (1987), 261-265.] T. Uehara, T. Nishizeki, E. Okamoto and K. Nakamura, A secret sharing system with matroidal access structure, Transactions of the IECE Japan J69-A 9 (1986), 1124-1132. H. Unterwalcher, A department threshold scheme based on algebraic equations, Contributions to General Algebra 6 (1988), 287-298. E. R. Verheul and H. C. A. van Tilborg, Constructions and properties of k out of n visual secret sharing schemes, Designs, Codes and Cryptography 11 (1997), 179-196. W. D. Wallis, Not all perfect extrinsic secret sharing schemes are ideal, Australasian Journal of Combinatorics 2 (1990), 237-238. T.-C. Wu and W.-H. He, A geometric approach for sharing secrets, Computers and Security 14 (1995), 135-146. T.-C. Wu and T.-S. Wu, Cheating detection and cheater identification in secret sharing schemes, IEE Transactions on Computers and Digital Techniques 142 (1995), 367-369. H. Yamamoto, On secret sharing systems using (k,L,n)-threshold scheme, Transactions of the IECE Japan J68-A (1985), 945-952. H. Yamamoto, Secret sharing system using (k,L,n)-threshold scheme, Electron. Comm. Japan Part I Comm. 69 (1986), 46-64. X. B. Zhang, Constructions for perfect threshold schemes, in "Combinatorics and Graph Theory", H. P. Yap, T. H. Ku, E. K. Lloyd and Z. M. Wang, eds., World Scientific, 1993, 87-90. Y. Zheng, T. Hardjono and J. Seberry, Reusing shares in secret sharing schemes, The Computer Journal 37 (1994), 199-205. Y. Zheng, T. Hardjono and J. Seberry, How to recycle shares in secret sharing schemes, Austral. Comput. Sci. Comm. 14 (1992), 1053-1064. Back to Doug Stinson's home page: click here FirstInitialLastName@uwaterloo.ca
Boolean Function Nonlinearity
A detailed discussion of cryptographic nonlinearity, what it means and how it is computed, with active JavaScript panels to perform the computation.
Active Boolean Function Nonlinearity Measurement in JavaScript Active Boolean Function Nonlinearity Measurement in JavaScript A detailed discussion of cryptographic nonlinearity, what it means and how it is computed, with active JavaScript panels to perform the computation. A Ciphers By Ritter Page Terry Ritter Nonlinearity is the number of bits bits which must change in the truth table of a Boolean function to reach the closest affine function . If we believe that cryptosystems based on linear or affine functions are inherently weak, the ability to measure nonlinearity is the ability to measure one form of strength . Nonlinearity measurement is particularly useful to quantify the strength of invertible substitution tables . This is important when pre-defined tables are a part of a cipher definition. But nonlinearity measurement can be even more important in the context of scalable ciphers: When ciphers can be down to experimental size, it becomes possible to talk about the overall nonlinearity (for each key ) of the cipher itself. This is far more information than we usually have on cipher designs. Affine Boolean Functions A Boolean function produces a single- bit result for each possible combination of values from perhaps many Boolean variables. The Boolean field consists of the values {0,1}, with XOR as "addition" and AND as "multiplication." An affine Boolean function has the form: f = anxn + an-1xn-1 + ... + a1x1 + a0 In the Boolean field, a constant or a0 value of '1' inverts or reverses the result, while a constant of '0' has no effect. The coefficients ai simply enable or disable the associated variable xi. And if we consider the collected coefficients to be a counting binary value, we have a unique ordering for affine Boolean functions: Affine Boolean Functions f0 = 0*x[2] + 0*x[1] + 0 = 0 f1 = 0*x[2] + 0*x[1] + 1 = 1 f2 = 0*x[2] + 1*x[1] + 0 = x[1] f3 = 0*x[2] + 1*x[1] + 1 = x[1] + 1 f4 = 1*x[2] + 0*x[1] + 0 = x[2] f5 = 1*x[2] + 0*x[1] + 1 = x[2] + 1 f6 = 1*x[2] + 1*x[1] + 0 = x[2] + x[1] f7 = 1*x[2] + 1*x[1] + 1 = x[2] + x[1] + 1 . . . In this way, we can write 16 different forms for 3 variables. But it is convenient to pair the functions which are the same except for the value of the constant, and then we have exactly 8 affine Boolean functions of 3 variables. Each of these has a particular value for every possible combination of variable value, which we can show in a truth table : The 3-Variable Affine Boolean Functions affine truth table 1 1 1 1 1 1 1 1 1 x0 0 1 0 1 0 1 0 1 x1 0 0 1 1 0 0 1 1 x1+x0 0 1 1 0 0 1 1 0 x2 0 0 0 0 1 1 1 1 x2+ x0 0 1 0 1 1 0 1 0 x2+x1 0 0 1 1 1 1 0 0 x2+x1+x0 0 1 1 0 1 0 0 1 Unexpected Distance One way to measure a sort of "correlation" between two Boolean functions is to compare their truth tables and count the number of bits which differ; this is their Hamming distance . Since we expect about half the bit positions to differ (on average), we can subtract that expected distance and come up with what I am calling -- for lack of a better term -- the "unexpected distance" (UD). The magnitude of the UD relates to just how unexpected the distance is, while the sign indicates the direction. Consider two functions and their difference: Distance to an Affine Function f 1 0 0 1 1 1 0 0 x2+x1+x0 0 1 1 0 1 0 0 1 diff 1 1 1 1 0 1 0 1 Here we have a Hamming distance of 6 between the two functions. This is an unexpected distance or UD of 6 - 4 = +2, which means that 2 more bits differ than we would expect. Another way to compute Boolean correlation is to accumulate the bits of one function (as integers) by addition or subtraction as selected by the other function. For example: Distance to an Affine Function f 1 0 0 1 1 1 0 0 x2+x1+x0 + - - + - + + - (operation select) accum +1 -0 -0 +1 -1 +1 +0 -0 = +2 This technique yields the UD value directly. With some work, we can now compare a Boolean function to each possible affine Boolean function, and develop both a distance and an unexpected distance to each: Unexpected Distance to Affine Boolean Function affine truth table distance ud c 0 0 0 0 0 0 0 0 4 0 x0 0 1 0 1 0 1 0 1 4 0 x1 0 0 1 1 0 0 1 1 6 +2 x1+x0 0 1 1 0 0 1 1 0 6 +2 x2 0 0 0 0 1 1 1 1 4 0 x2+ x0 0 1 0 1 1 0 1 0 4 0 x2+x1 0 0 1 1 1 1 0 0 2 -2 x2+x1+x0 0 1 1 0 1 0 0 1 6 +2 f 1 0 0 1 1 1 0 0 Nonlinearity Nonlinearity is the number of bits which must change in the truth table of a Boolean function to reach the closest affine function. But every affine Boolean function also has a complement affine function which has every truth table bit value reversed. This means that no function possibly can be more than half its length in bits away from both an affine Boolean function and its complement. So a zero UD value is not only what we expect, it is in fact the best we can possibly do. A non-zero UD value is that much closer to some affine function, and that much less nonlinear. So the nonlinearity value is half the length of the function, less the maximum absolute value of the unexpected distance to each affine function. The function f in the previous section has a length of 8 bits, and an absolute value maximum unexpected distance of 2. This is a nonlinearity of 4 - 2 = 2; so f has a nonlinearity of 2. Nonlinearity is always positive, and also even (divisible by 2) if we have a balanced function. The Hadamard Matrix and Affine Functions A Hadamard matrix H is an n x n matrix with all entries +1 or -1, such that all rows are orthogonal and all columns are orthogonal (see, for example, [HED78]). The usual development (see, for example [SCH87]) starts with a defined 2 x 2 Hadamard matrix H2 which is ((1,1),(1,-1)). Each step consists of multiplying each element in H2 by the previous matrix, thus negating all elements in the bottom-right entry: Hadamard Matrix Development H2 = | 1 1 | H4 = H2 * H2 = | H2 H2 | | 1 -1 | | H2 -H2 | H4 = | | 1 1 | | 1 1 | | = | 1 1 1 1 | | | 1 -1 | | 1 -1 | | | 1 -1 1 -1 | | | | 1 1 -1 -1 | | | 1 1 | |-1 -1 | | | 1 -1 -1 1 | | | 1 -1 | |-1 1 | | H8 = | H4 H4 | = | 1 1 1 1 1 1 1 1 | | H4 -H4 | | 1 -1 1 -1 1 -1 1 -1 | | 1 1 -1 -1 1 1 -1 -1 | | 1 -1 -1 1 1 -1 -1 1 | | 1 1 1 1 -1 -1 -1 -1 | | 1 -1 1 -1 -1 1 -1 1 | | 1 1 -1 -1 -1 -1 1 1 | | 1 -1 -1 1 -1 1 1 -1 | Now compare H8 from this strange Hadamard development to the affine functions: The 3-Variable Affine Boolean Functions c 0 0 0 0 0 0 0 0 x0 0 1 0 1 0 1 0 1 x1 0 0 1 1 0 0 1 1 x1+x0 0 1 1 0 0 1 1 0 x2 0 0 0 0 1 1 1 1 x2+ x0 0 1 0 1 1 0 1 0 x2+x1 0 0 1 1 1 1 0 0 x2+x1+x0 0 1 1 0 1 0 0 1 So if we map the values in the affine truth table: {0,1} - {1,-1}, we find the same functions as in the Hadamard development. These are the Walsh functions, and here both developments produce the same order, which is called "natural" or "Hadamard." Walsh functions have fast transforms which reduce the cost of correlation computations from n*n to n log n, which can be a very substantial reduction. The Fast Walsh-Hadamard Transform A Fast Walsh Transform (FWT) essentially computes the correlations which we have been calling the "unexpected distance" (UD). It does this by calculating the sum and difference of two elements at a time, in a sequence of particular pairings, each time replacing the elements with the calculated values. It is easy to do a FWT by hand. (Well, I say "easy," then always struggle when I actually do it.) Let's do the FWT of function f: (1 0 0 1 1 1 0 0): First note that f has a binary power length, as required. Next, each pair of elements is modified by an "in-place butterfly"; that is, the values in each pair produce two results which replace the original pair, wherever they were originally located. The left result will be the two values added; the right result will be the first value less the second. That is, (a',b') = (a+b, a-b) So for the values (1,0), we get (1+0, 1-0) which is just (1,1). We start out pairing adjacent elements, then every other element, then every 4th element, and so on until the correct pairing is impossible: An 8-Element Fast Walsh Transform (FWT) original 1 0 0 1 1 1 0 0 ^---^ ^---^ ^---^ ^---^ first 1 1 1 -1 2 0 0 0 ^-------^ ^-------^ ^-------^ ^-------^ second 2 0 0 2 2 0 2 0 ^---------------^ ^---------------^ ^---------------^ ^---------------^ final 4 0 2 2 0 0 -2 2 Now compare these results to the UD values we found earlier: Unexpected Distance to the Affine Functions affine ud 1 0 x0 0 x1 +2 x1+x0 +2 x2 0 x2+ x0 0 x2+x1 -2 x2+x1+x0 +2 Note that all FWT elements -- after the zeroth -- map the U.D. results exactly in both magnitude and sign, and in the exact same order. (This ordering means that the binary index of any result is also the recipe for expressing the affine function being compared in that position.) The zeroth element in the FWT is the number of 1-bits in the function when we use the real values {0,1} to represent the function. So to find the "unexpected distance" from any balanced function to every affine Boolean function, just compute the FWT. Clearly, the closest affine function has the absolute value maximum UD value of all the transformed elements past the zeroth. Just subtract this value from half the function length (which is the zeroth FWT value in a balanced function) to get the nonlinearity. Understanding the FWT To understand how the FWT works, suppose we label each bit-value with a letter, and then perform a symbolic FWT: An 8-Element Fast Walsh Transform (FWT) a b c d e f g h ^------^ ^------^ ^------^ ^------^ a+b a-b c+d c-d e+f e-f g+h g-h ^-------------^ ^-------------^ ^-------------^ ^-------------^ a+b a-b a+b a-b e+f e-f e+f e-f c+d c-d -c-d -c+d g+h g-h -g-h -g+h ^---------------------------^ ^---------------------------^ ^---------------------------^ ^---------------------------^ a+b a-b a+b a-b a+b a-b a+b a-b c+d c-d -c-d -c+d c+d c-d -c-d -c+d e+f e-f e+f e-f -e-f -e+f -e-f -e+f g+h g-h -g-h -g+h -g-h -g+h g+h g-h Each of these columns is the symbolic description of one element in the FWT result. Since each uses the same input variables in the same order, we can represent the uniqueness of each result simply by the sign applied to each variable: Symbolic FWT Results by Column a+b+c+d+e+f+g+h = + + + + + + + + a-b+c-d+e-f+g-h = + - + - + - + - a+b-c-d+e+f-g-h = + + - - + + - - a-b-c+d+e-f-g+h = + - - + + - - + a+b+c+d-e-f-g-h = + + + + - - - - a-b+c-d-e+f-g+h = + - + - - + - + a+b-c-d-e-f+g+h = + + - - - - + + a-b-c+d-e+f+g-h = + - - + - + + - Which we can compare to: The 3-Variable Affine Boolean Functions c 0 0 0 0 0 0 0 0 x0 0 1 0 1 0 1 0 1 x1 0 0 1 1 0 0 1 1 x1+x0 0 1 1 0 0 1 1 0 x2 0 0 0 0 1 1 1 1 x2+ x0 0 1 0 1 1 0 1 0 x2+x1 0 0 1 1 1 1 0 0 x2+x1+x0 0 1 1 0 1 0 0 1 So not only do we once again find the affine functions, we also find them implicit in a way appropriate for computing add subtract correlations, thus producing UD values directly with high efficiency. A Fast Walsh-Hadamard Transform Routine The fast transform by hand is automated in Borland Pascal: TYPE Lwd = LongInt; LintArray = ARRAY[ 0..16380 ] of LONGINT; PROCEDURE LintHadFmSeqWalsh( VAR DatLintAr; lastel: Lwd ); { Hadamard Walsh from sequential data, in-place } VAR Dat: LintArray ABSOLUTE DatLintAr; a, b: LONGINT; stradwid, { distance between pair of elements } blockstart, block, pair, el1, el2: Lwd; BEGIN stradwid := 1; blockstart := lastel; REPEAT el1 := 0; blockstart := blockstart DIV 2; FOR block := blockstart DOWNTO 0 DO BEGIN el2 := el1 + stradwid; FOR pair := 0 TO PRED(stradwid) DO BEGIN a := Dat[ el1 ]; b := Dat[ el2 ]; Dat[ el1 ] := a + b; Dat[ el2 ] := a - b; Inc( el1 ); Inc( el2 ); END; el1 := el2; END; stradwid := (stradwid + stradwid) AND lastel; UNTIL (stradwid = 0); END; {LintHadFmSeqWalsh} LintHadFmSeqWalsh takes an array of 32-bit integers, and changes the array data into the Walsh-Hadamard transform of that data. For nonlinearity measures, the input data are {0,1} or {1,-1}; the results are potentially bipolar in either case. (The "lastel" parameter is the last index in the data array which starts at index 0; it is thus always 2n - 1 for some n. The ABSOLUTE attribute forces Borland Pascal to treat the parameter as a LongInt array of arbitrary size.) Using {0,1} Versus {1,-1} It is common to consider a Boolean function as consisting of the real values {0,1}, but it is also common to use the transformation x' = (-1)x (negative 1 to the power x) where x is {0,1}. This transforms {0,1} into {1,-1}, and for some reason looks much cooler than doing the exact same thing with x' = 1 - 2x This transformation has some implications: Using real values {1,-1} doubles the magnitude and changes the sign of the FWT results, but can simplify nonlinearity for unbalanced functions, because the zeroth term need not be treated specially. But if the Boolean function is balanced, as it will be in the typical invertible substitution table, the zeroth element need not be used at all, so using real values {1,-1} seems to provide no particular benefit in this application. Nonlinearity in Invertible Substitution Tables An invertible substitution table is an array of values in which any particular value can occur at most once. If the range of the output values is the same as the input values, then every value occurs in the table exactly once. Typically the table has a power-of-2 number of elements, which is related to size in bits of its input (and output) value. For example, an "8-bit" table has 28 = 256 elements, in which each value from 0 though 255 occurs exactly once. Even these relatively small tables have remarkable keying potential. Each invertible table differs from every other only in the arrangement of the values it holds, but there is typically an incredible number of possible permutations . A 2-bit table with 22 = 4 elements is one of are 4! (4-factorial) or just 24 different tables. But a 4-bit table with 24 = 16 elements is one of 16! or 2.09 x 1013 tables, a 44-bit number, and potentially a 44-bit keyspace. The usual 8-bit tables have a 1648-bit keyspace, per table. When a table is used alone as Simple Substitution , these entries are easily resolved. But as part of a more complex block cipher , the entries may be hidden so that the keying potential of the table can be realized. Nonlinearity applies to Boolean functions, and so does not apply directly to substitution tables. But each output bit from such a table can be considered a Boolean function. So we can run through the table extracting all the bits in a given bit position, and then measure the nonlinearity of the function represented by those bits. Clearly, if we measure a nonlinearity value for each output bit position, we do not have a single nonlinearity for the table. Several ways have been suggested to combine these values, including the sum or the average of all values. But for cryptographic use it may be more significant to collect the minimum nonlinearity over all the bit positions. This allows us to argue that no bit position in the table is weaker than the value we have. Since a table collects multiple Boolean functions, tables tend to be weaker than the average Boolean function of the same length. But the nonlinearity values for tables and sequences of the same length do tend to be similar and somewhat comparable. Some Table Nonlinearity Distributions There are no nonlinear 2-bit tables. We know this because there are exactly 6 balanced bit sequences of length 4, and each of those has a measured nonlinearity of zero. So there is no chance to build a nonlinear table by collecting those sequences. Here are some coarse graphs of nonlinearity distributions at various table sizes: Nonlinearity Distribution in 4-Bit Tables 0.6 | 0.5 | * * 0.4 | * * 0.3 | * * 0.2 | * * 0.1 | * * 0.0 | * * * Prob +--+--+--+-- 0 2 4 Nonlinearity Nonlinearity Distribution in 5-Bit Tables 0.7 | * 0.6 | * 0.5 | * 0.4 | * 0.3 | * 0.2 | * * 0.1 | * * * 0.0 | * * * Prob +--+--+--+--+--+--+-- 0 2 4 6 8 10 Nonlinearity Nonlinearity Distribution in 8-Bit Tables 0.35 | * 0.3 | * 0.25 | * * 0.2 | * * * 0.15 | * * * 0.1 | * * * * 0.05 | * * * * * 0.00 | * * * * * * * Prob +--+--+--+--+--+--+--+--+-- 92 96 100 104 Nonlinearity Nonlinearity Distribution in 10-Bit Tables 0.2 | 0.175 | * * 0.15 | * * * 0.125 | * * * * 0.1 | * * * * * 0.075 | * * * * * * 0.05 | * * * * * * * * 0.025 | * * * * * * * * * * 0.00 | * * * * * * * * * * * Prob +--+--+--+--+--+--+--+--+--+--+--+--+-- 436 440 444 448 452 456 Nonlinearity References and Bibliography [AY82] Ayoub, F. 1982. Probabilistic completeness of substitution-permutation encryption networks. IEE Proceedings, Part E. 129(5): 195-199. [DAE94] Daemen, J., R. Govaerts and J. Vandewalle. 1994. Correlation Matrices. Fast Software Encryption. 275-285. [FOR88] Forre, R. 1988. The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition. Advances in Cryptology -- CRYPTO '88. 450-468. [GOR82] Gordon, J. and H. Retkin. 1982. Are Big S-Boxes Best? Cryptography. Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29-April 2, 1982. 257-262. [HED78] Hedayat, A. and W. Wallis. 1978. Hadamard Matrices and their Applications. The Annals of Statistics. 6(6): 1184-1238. [HEY94] Heys, H. and S. Tavares. 1994. On the security of the CAST encryption algorithm. Canadian Conference on Electrical and Computer Engineering. Halifax, Nova Scotia, Canada, Sept. 1994. 332-335. [HEY95] Heys, H. and S. Tavares. 1995. Known plaintext cryptanalysis of tree-structured block ciphers. Electronics Letters. 31(10): 784-785. [MEI89] Meier, W. and O. Staffelbach. 1989. Nonlinearity Criteria for Cryptographic Functions. Advances in Cryptology -- Eurocrypt '89. 549-562. [MIR97] Mirza, F. 1997. Linear and S-Box Pairs Cryptanalysis of the Data Encryption Standard. [OC91] O'Connor, L. 1991. Enumerating nondegenerate permutations. Advances in Cryptology -- Eurocrypt '91. 368-377. [OC93] O'Connor, L. 1993. On the Distribution Characteristics in Bijective Mappings. Advances in Cryptology -- EUROCRYPT '93. 360-370. [PIE88] Pieprzyk, J. and G. Finkelstein. 1988. Towards effective nonlinear cryptosystem design. IEE Proceedings, Part E. 135(6): 325-335. [PIE89] Pieprzyk, J. and G. Finkelstein. 1989. Permutations that Maximize Non-Linearity and Their Cryptographic Significance. Computer Security in the Age of Information. 63-74. [PIE89B] Pieprzyk, J. 1989. Non-linearity of Exponent Permutations. Advances in Cryptology -- EUROCRYPT '89. 80-92. [PIE93] Pieprzyk, J., C. Charnes and J. Seberry. 1993. Linear Approximation Versus Nonlinearity. Proceedings of the Workshop on Selected Areas in Cryptography (SAC '94). 82-89. [PRE90] Preneel, B., W. Van Leekwijck, L. Van Linden, R. Govaerts and J. Vandewalle. 1990. Propagation Characteristics of Boolean Functions. Advances in Cryptology -- Eurocrypt '90. 161-173. [RUE86] Rueppel, R. 1986. Analysis and Design of Stream Ciphers. Springer-Verlag. [SCH86] Schroeder, M. 1986. Number Theory in Science and Communications. Springer-Verlag. [SCH87] Schroeder, M. and N. Sloane. 1987. New Permutation Codes Using Hadamard Unscrambling. IEEE Transactions on Information Theory. IT-33(1): 144-145. [XIO88] Xiao, G-Z. and J. Massey. 1988. A Spectral Characterization of Correlation-Immune Combining Functions. IEEE Transactions on Information Theory. 34(3): 569-571. [YOU95] Youssef, A. and S. Tavares. 1995. Resistance of Balanced S-boxes to Linear and Differential Cryptanalysis. Information Processing Letters. 56: 249-252. [YOU95B] Youssef, A. and S. Tavares. 1995. Number of Nonlinear Regular S-boxes. Electronics Letters. 31(19): 1643-1644. [ZHA95] Zhang, X. and Y. Zheng. 1995. GAC -- the Criterion for Global Avalanche Characteristics of Cryptographic Functions. Journal for Universal Computer Science. 1(5): 316-333. Other nonlinearity articles, often dealing with measurements on the new block ciphers I have been developing, are available in the Technical Articles section of my pages: http: www.ciphersbyritter.com index.htmlTechnicalArticles Also, many Walsh-Hadamard references are available in my Walsh-Hadamard literature review: http: www.ciphersbyritter.com RES WALHAD.HTM Nonlinearity Measurement Bit Width: 2 3 4 5 6 7 8 Make Table is just a convenient way to create a random permutation and place it in the top panel. The buttons select the size of the table. Enter Table: The top panel wants to see a table permutation with a space or a comma between each element. An arbitrary table can be entered, but the number of elements must be some power of 2 (such as: 4, 8, 16, ...). Bit Column: Extract LS Bits will run down the list in the top panel and test the least-significant bits of each value to create a bit-sequence in the bottom panel. Extract Next Bits extracts the next most-significant bits. First Combination creates a balanced bit-sequence of the same length as a table (bit width 4 or less) and puts it in the bottom panel. Next Combination steps the sequence. The bottom panel normally holds a bit sequence, or the transformed result, with a space or a comma between each value. A general sequence of values can be entered and transformed, but the number of elements must be some power of 2. Max UD: Nonlinearity: Transform will run a fast Walsh-Hadamard transform (FWT) on the sequence in the bottom panel, and replace the sequence with the results. Overall Minimum Nonlinearity: Status: Overall NL will extract a bit-column and run a FWT for every bit-column of the table in the top panel. The result is the minimum nonlinearity value over all bit columns. Warning: With 8-bit tables this operation has taken almost a minute to complete, and also has crashed Windows 3.1 with a "stack overflow" message. Terry Ritter , his current address , and his top page . Last updated:1998-05-21
Index of Cryptography Papers Available Online
A research tool for the cryptography community maintained by Counterpane Systems. Over 400 papers online.
Index of Crypto Papers Available Online Bruce Schneier Home Weblog Crypto-Gram Newsletter Books Essays and Op Eds Computer Security Articles In the News Speaking Schedule Password Safe Cryptography and Computer Security Resources Contact Information Index of Cryptography Papers Available Online The index currently contains 1427 papers. Papers sorted by year: 1978 1982 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2003 unknown Papers sorted by first author: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Papers sorted by any author: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All papers, by first author, in a single file (for keyword searching with your browser's search command) Researchers: can't find your paper in the index? Add a new paper (or correct an existing one) . Schneier.com is a personal website. Opinions expressed are not necessarily those of Counterpane Internet Security, Inc. Search Schneier on Security A weblog covering security and security technology. read more New Book Beyond Fear: Thinking Sensibly About Security in an Uncertain World read more Crypto-Gram Newsletter A free monthly e-mail newsletter on security and security technology. read more
Foundations of Cryptography
Oded Goldreich. A public domain book available on-line. Only partially completed.
Foundations of Cryptography by Oded Goldreich
Nickellie Encryption Toolkit
The Nickellie Encryption Toolkit is a data and file encryption library that provides a COM interface to simplify development of Windows and Pocket PC software that requires encryption.
Nickellie Encryption Toolkit : Data and File Encryption Library for the Pocket PC and Win32 Available Now For Developers - Encryption Toolkit Pricing Support Upgrades Documentation Encryption FAQ Download Trial Add Ons Articles For Home Use - PocketRx Coming Soon For the Enterprise Encryption Toolkit This encryption library includes all the tools you need to utilize data encryption and file encryption from within your applications. The toolkit includes COM objects with a standard interface for both the Pocket PC and Windows desktop platforms. This enables you to use the same source code on both platforms for both file encryption and data encryption. Data encrypted with the library can easily be transmitted between Pocket PC devices, between desktop computers or servers, or between a Pocket PC and a desktop computer or server. This encryption library is ideal for standalone Windows or Pocket PC applications and Client Server applications. Key Features Supports both 40 and 128 bit symmetric key encryption via the Microsoft Base and Enhanced Cryptographic Providers Streamlines file encryption and data encryption in your application development Decrypting a file requires the password used at the time of encryption COM Interface simplifies encryption from Visual Basic, Embedded Visual Basic, Visual C++, Embedded Visual C++, ASP, and NS Basic CE Win32 Context Menu Extension makes file encryption from Windows Explorer a snap Complete documentation with sample code helps you get started quickly Supports Pocket PC 2002, Windows 98, Windows ME, Windows NT, Windows 2000, and Windows XP Includes... Necessary runtime and debug DLLs for all supported platforms Complete Technical Manual in standard Windows Help format inluding a complete object reference and code samples Sample projects in Visual Basic, Embedded Visual Basic, Visual C++, and Embedded Visual C++ Thirty days of free technical support via email Nickellie Satisfaction Guarantee Pricing Support Documentation FAQ Download Trial Add Ons Articles Copyright 2002-2003 Nickellie, LLC. All rights reserved. Microsoft, Windows, the Windows CE Logo, and the Windows logo are trademarks or registered trademarks of Microsoft Corporation in the United States and or other countries.
Botan
An open-source C++ crypto library that includes block and stream ciphers, hash functions, MACs, and public key algorithms, along with an easy to use filter-based interface.
Botan Botan Basic Info Introduction License FAQ Portablity Donations Users Get It Download Docs API ( PDF PS ) Tutorial ( PDF PS ) Algorithms ChangeLogs Benchmarks Examples Mailing Lists announce devel What is this? If you are not familiar with Botan, you might want to read the introduction and or FAQ first. News November 6, 2005 I've put up 1.4.9, with a whole bunch of nice new algorithms, including MARS, SEED, Turing, and FORK-256, which is a new hash function that was presented at the NIST hash bash last week. FORK-256 should not be used right now, and of course it might be broken, as new proposals often are. And a well known cryptographer at the NIST conference stated that he suspected FORK-256 to be insecure (I won't name names so as to not put words into his mouth, since that was just an aside during a conversation at lunch, not a comment made on a panel or floor discussion). However it is a very nice design, and much faster than SHA-256, so hopefully it will get some good analysis. Other changes include optimizations for RC6 and Twofish, much better support for 64-bit PowerPC, support for high resolution hardware timers on most PowerPC systems, fixing a persistent build annoyance that shows up on BSD systems, and generalizing the X9.31 RNG to support arbitrary block ciphers as well as arbitrary underlying PRNG objects. October 24, 2005 This was a really good weekend for me being productive on Botan. I implemented the IBM AES candidate MARS and the South Korean cipher SEED, optimized RC6 and Twofish significantly, and collected and formatted a large body of new test vectors. Implementing and optimizing MARS and SEED was quite enjoyable; it's been a long while since I've done any really low level programming, and I think I may start implementing a few of the modern stream cipher designs like Turing or Sober just for fun, though who knows if I'll continue this little streak. All of these changes will be part of the next release. I don't want to push out too many new releases in such a short timespan, and as what will become 1.4.9 doesn't have any bugfixes so far, just enhancements, I'm going to hold off for a while. October 16, 2005 A couple of users reported problems with 1.4.7, including a minor Visual Studio compilation problem and a major issue with the memory allocator. It turns out that, due to a mistake I made in 1.4.4, the memory allocator was not emptying out already deleted memory blocks as it should, so as time went on, the list of "allocated" blocks became longer and longer, being filled mostly with empty buffers. This bug was found and then diagnosed and fixed by Nathaniel Smith and Matt Johnston, a couple of people who are working on Monotone . September 25, 2005 After a six month break, Botan 1.4.7 was released today. The most notable change is speed - an interaction between Botan and later versions of GCC that was severly impacting performance of a number of algorithms was found and worked around. Some hash functions and ciphers are now as much as three times faster on common platforms than they were in previous releases. In addition, a number of bugfixes were made, support for some platforms was improved, a few cleanups were made, and the PRNG code underwent substantial (but mostly backwards-compatible) improvement. Older news here .
SlavaSoft QuickHash Library
Add hash (MD2, MD5, SHA-1, SHA-2, RIPEMD-160, PANAMA, TIGER), checksum (CRC32, ADLER32) and HMAC (HMAC-MD5, HMAC-SHA1, HMAC-SHA256, HMAC-SHA384, HMAC-SHA512, HMAC-RIPEMD160, HMAC-PANAMA, HMAC-TIGER) calculations to your Windows apps quickly and easily. C++, commercial.
QuickHash Library - Implementation of 17 most popular hash and checksum algorithms: MD2, MD4, MD5, SHA1, SHA256, SHA384, SHA512, RIPEMD128, RIPEMD160, RIPEMD256, RIPEMD320, PANAMA, TIGER, ADLER32, CRC16, CRC16C, CRC32, ... ,development,implementation,component,tool,tools,fast,fastest,quick,quickest,dll,lib,library,download,file,files,window,windows,crypt,cryptography,cryptographic,cryptology,cryptological,encrypt,encryption,encrypted,algorithm,algorithms,function,functions,method,methods,data,integrity,digital,signature,key,keys,password,passwords,hash,hashes,hashing,calculate,calculation,perform,performance,compute,computation,hmac,message,digest,checksum,checksums,check,checking,sum,sums,check sum,crc,crc16,crc-16,crc16C,crc-16C,crc32,crc-32,crc 32,md,md4,md-4,md5,md-5,md 5,md2,md-2,md 2,sha,sha1,sha-1,sha 1,sha2,sha-2,sha 2,sha256,sha-256,sha 256,sha384,sha-384,sha 384,sha512,sha-512,sha 512,ripemd,ripemd128,ripemd-128,ripemd160,ripemd-160,ripemd 160,ripemd256,ripemd-256,ripemd32-,ripemd-320,panama,tiger,adler,adler32,adler-32,adler 32,c,c++,c c++,vb,visual basic,tlb,component,ActiveX,Active X,programmer,programmers,soft,slavasoft,slava Home | Products | Downloads | Purchase | Support Products Paint Express PrivyPad HashCalc FSUM QuickCrypt Library QuickHash Library Download Purchase Samples License Agreement Related Links F.A.Q. Overview FastCRC Library Company About Us Contact Us Miscellaneous Affiliate Program Site Map SlavaSoft QuickHash Library HIGHLY OPTIMIZED HASH, CRC, AND HMAC LIBRARY QuickHash Library 3.0 Free To Try A highly optimized implementation of the most popular hash, checksum and HMAC algorithms. The library allows Windows developers to perform hash, checksum and HMAC calculations for memory blocks, strings, blobs, streaming data and files in their applications. QuickHash Library was designed to be fast, flexible and extremely easy to use. Version: 3.0 Released: 06 30 2003 File Size: 660KB OS: Windows 95 98 Me NT 2000 XP Free Trial Limitation: The trial version of QuickHash Library will cause a 10 second delay when running any application that uses it. F.A.Q. Related Links License Agreement Samples Order Download Tell a friend about QuickHash Library Send Feedback to SlavaSoft Major Features: Support of 13 hash algorithms: MD2, MD4, MD5, SHA-1, SHA-2 (SHA-256, SHA-384, SHA-512), RIPEMD-128, RIPEMD-160, RIPEMD-256, RIPEMD-320, PANAMA, TIGER. 4 checksum algorithms: CRC16, CRC16C (CRC-CCITT), CRC32, ADLER32. 12 HMAC algorithms: HMAC-MD4, HMAC-MD5, HMAC-SHA1, HMAC-SHA256, HMAC-SHA384, HMAC-SHA512, HMAC-RIPEMD128, HMAC-RIPEMD160, HMAC-RIPEMD256, HMAC-RIPEMD320, HMAC-PANAMA, HMAC-TIGER. Support of 3 interfaces: QuickHash API (The QuickHash API can be used as is, or it can be used to create wrappers for other languages that can use DLLs). C++ Interface (C++ wrapper classes to QuickHash API). QuickHash Type Library (Includes all declarations for accessing the QuickHash Library from different programming languages which have the possibility to reference a Type Library, such as VB 5.0, VB 6.0, VBA, etc.) Support for Static Linking Dynamic Linking No external dependencies such as MFC DLLs, COM DCOM or other resources. Excellent documentation (MFC-style help). Details: The quickhash.zip file that you download contains the following files: QuickHash.h - include file QuickHashS.lib - LIB file for static linking to QuickHash Library QuickHash.lib - LIB file for dynamic linking to QuickHash Library QuickHash.dll - DLL file QuickHash.tlb - Type Library for QuickHash.dll QuickHash.chm - HTML help file for QuickHash Library ReadMe.txt - brief QuickHash Library description Register.exe - registration program for SlavaSoft products Samples: Some samples are listed in the table below. More samples can be found in QuickHash Library's help file (QuickHash.chm). C++ Interface Examples String message digest generation using the SHA-1 hash algorithm File message digest generation using the MD5 hash algorithm String checksum generation using the ADLER32 checksum algorithm File checksum generation using the CRC32 checksum algorithm String HMAC generation using the RIPEMD-160 hash algorithm File HMAC generation using the SHA-2(256) hash algorithm QuickHash API Examples ( C ) String message digest generation using the SHA-1 hash algorithm File message digest generation using the MD5 hash algorithm String checksum generation using the ADLER32 checksum algorithm File checksum generation using the CRC32 checksum algorithm String HMAC generation using the RIPEMD-160 hash algorithm File HMAC generation using the SHA-2(256) hash algorithm QuickHash Type Library Examples ( Visual Basic ) String message digest generation using the SHA-1 hash algorithm File message digest generation using the MD5 hash algorithm String checksum generation using the ADLER32 checksum algorithm File checksum generation using the CRC32 checksum algorithm String HMAC generation using the RIPEMD-160 hash algorithm File HMAC generation using the SHA-2(256) hash algorithm SlavaSoft products implemented using QuickHash Library: PrivyPad - a Notepad-like text editor that allows to create, edit and e-mail plain and encrypted text files; HashCalc - hash, checksum and HMAC calculator for files, text and hex strings; FSUM - file checksum generation and verification utility; Copyright SlavaSoft Inc. All rights reserved. Page last updated on September 14, 2004 development implementation component tool tools fast fastest quick quickest dll lib library download file files window windows crypt cryptography cryptographic cryptology cryptological encrypt encryption encrypted algorithm algorithms function functions method methods data integrity digital signature key keys password passwords hash hashes hashing calculate calculation perform performance compute computation hmac message digest checksum checksums check checking sum sums check sum crc crc16 crc-16 crc16C crc-16C crc32 crc-32 crc 32 md md4 md-4 md5 md-5 md 5 md2 md-2 md 2 sha sha1 sha-1 sha 1 sha2 sha-2 sha 2 sha256 sha-256 sha 256 sha384 sha-384 sha 384 sha512 sha-512 sha 512 ripemd ripemd128 ripemd-128 ripemd160 ripemd-160 ripemd 160 ripemd256 ripemd-256 ripemd320 ripemd-320 panama tiger adler adler32 adler-32 adler 32 c c++ c c++ vb visual basic tlb component ActiveX Active X programmer programmers soft slavasoft slava md5sum sfv hash message digest checksum crc hmac algorithm file string data block memory key password MD -2 -4 -5 SHA1 SHA2 CRC32 CRC16 .DLL .LIB TLB component c c++ vb visual basic encryption encrypt 128 bit check checking sum authentication digital signature example examples sample samples calculate calculation calculations calculating calculated perform performing make making integrity check checking checker md5sum sfv compute computing encription encript encripting crypto crypting crypt cryptoapi xceed generate generation generating produce production producing validate validation validating compute computation computing reckon compare comparing comparision message authentication code authenticate A fast, highly optimized implementation of hash and checksum algorithms: MD2, MD4, MD5, SHA-1, SHA-2(256,384,512), RIPEMD(128,160,256,320), PANAMA, TIGER, CRC-32, CRC-16, CRC-CCITT, ADLER32. The library allows to calculate hashes (message digests), checksums and HMACs for files, memory blocks, strings, blobs, streaming data. It is quick, flexible, easy to use. It supports 3 interfaces: QuickHash API (the API can be used as is, or it can be used to create wrappers for languages that can use DLL or LIB), C++ Interface (C++ wrapper classes to QuickHash API), and QuickHash Type Library (includes all declarations for accessing the functionality from programming languages that can reference a .TLB, such as VB 5.0, VB 6.0, VBA, etc). It allows static dynamic linking. It has no external dependencies such as MFC DLLs, COM DCOM or other component. The help file has C, C++ and Visual Basic examples showing how to add hash, checksum and HMAC calculations to Windows applications quickly and easily.
Punkroy and the Cypher Project
Collection of programming examples on encryption including: file encryption, steganography in images and sound, data base record encryption, and password verification. All written in Pascal, all source code available.
Punkroy - Who is? Main Programs Writings Algorithms About Links Contact Programs These are program examples created with the Cypher project. All (but the Cypher, natraly) requier the libarys in Cypher in order to compile. All example software is 100% free and comes with compleat Pascal source code. What is the Cypher Project? Main Page Cypher base libraries Current version: 3.0 as of 10-19-2002 Cypher base units needed for, well, prity much everything else on this page Cypher Cypher is a command line file encryption utility with a lot of options. Has a great deal of experimental tools built in. Encode to BMP (EncBMP) Encode to BMP is a steganography program designed to "hide" data inside a BMP image Encode to WAV (EncWAV) Encode to WAV is a steganography program designed to "hide" data inside a WAV audio file DataBase A set of object classes for quick database integration. The binaries are of no practical use. Password A program useful for sensitive, user specific information all stored in a single file accessible by many people. Verify Example of using stored hash values for checking passwords Grand Key System System for using a single encryption key protected by a pass phrase for file encryption. Is will be included in the all encryption programs on this page. Text Cipher System Text encryption system has no strength cryptographically, but a way to cipher text without changing spacing and or capitation, numbers and punctionation. HexEdit Actually nothing to do with encryption, but a powerful tool for viewing editing files in hex. Useful for checking content of encrypted files. And in general, a hexeditor is a programmer must-- so it's just good to have around. Copyright 2001-2005, Punkroy. Bla, bla, bla... =:(
QuartzLight in Java
Implements the public key signature system QuartzLight in Java where QuartzLight refers to a research version of the Quartz standard.
QuartzLight in Java Implementing QuartzLight in Java This is the Java implementation of a modified version of the Quartz signature scheme, called QuartzLight. QuartzLight is not suitable for signature, as it is less secure than Quartz. However, it can be used as a starting point for a Java implementation of Quartz. You can access the related paper as PS or PDF file (approx. 200 kB each), the Java source code (320 kB) of this implementation, the javadoc documentation (600 kB) of the source code, and a tar-file (110 kB) with both the source code, the classes, and the javadoc documentation. Use "tar -xzf jhfe.tar.gz" to untar it. Parts of the source code can certainly be used in other projects. E.g. the finite field operations for GF(2^n), and also matrix operations (including LU decomposistion). However, the software comes with no warranty as it is free of charge. Christopher Wolf, 5. 9. 2002. eMail: hfe@christopher-wolf.de
Sysepub
A Java open source cipher that combines one time pad with public and private keys.
Teutoburgo - Java - Sysepub Java Home Sysepub Symmetric semi-public key cipher New! Sysepub has evolved into OTP4U ! Cryptography as we are used to has two big cathegories of ciphers: public key ciphers (asymmetric), and private key ciphers (symmetric). Sysepub is the implementation of a new system, which wants to combine the power of One Time Pad with the advantages of public key ciphers. It uses a symmetric algorithm (XOR), but it uses two keys: one is private and the other is public. See how it works . Download Sysepub 0.9 for free: it's open source! ( GNU GPL license) (size: 81 KB) Sysepub challenge! Take a look at my applets: JSiteMap ( Site Map Generator ) JaVi Note: Sysepub is NOT a well known and established cipher, but rather a proposal. If you want, read a public discussion about it, that took place on the Usenet (September 2002). Please note also that Sysepub comes with the GNU GPL license, then WITHOUT ANY WARRANTY of any kind. Teutoburgo Home Copyright Pierre Blanc 2002 geovisit();
The source code of the 128-bit PC1 cipher algorithm
In C, Delphi, Java, Perl and Visual Basic.
The PC1 Encryption Algorithm The PC1 Encryption Algorithm Very High Security with 128 or 256-bit keys Alexander Pukall 2004 alexandermail@hotmail.com Code free for all, even commercial applications. Crypto Source code for C, C++, Delphi, Java, Perl, Visual Basic, TCL, PIC Microchip processor, Texas Instrument TI-89 TI-90 TI-9x, 6809 microprocessor Assembler. CAUTION : To download the .zip sources you must use SAVE AS function of your browser do not click directly on the link because it will not open the source correctly The ZIP archive for PC1 encryption algorithm in C language (128-bit keys) ( input = BINARY FILE, output = BINARY FILE ). The ZIP archive for PC1 encryption algorithm in C language (256-bit keys) ( input = BINARY FILE, output = BINARY FILE ). The ZIP archive for PC1 encryption algorithm in C language (256-bit keys) ( input = BINARY FILE, output = TEXT ). The ZIP archive for PC1 encryption algorithm in Borland C++ language (256-bit keys) graphical interface ( input = TEXT, output = TEXT ). The ZIP archive for PC1 encryption algorithm in C++ language (128-bit keys) command line interface ( input = TEXT, output = TEXT ). The ZIP archive for PC1 encryption algorithm in CBuilder 5 language (256-bit keys) ( input = TEXT, output = TEXT ). How to encrypt passwords in C language Frequently asked questions The ZIP archive for PC1 encryption algorithm in JAVA language (128-bit keys) by Robert Neild ( input = BINARY FILE, output = BINARY FILE ). The ZIP archive for PC1 encryption algorithm in TCL language (256-bit keys) ( input = TEXT, output = TEXT ). The ZIP archive for PC1 encryption algorithm in Delphi language (128-bit keys) translated from C to Pascal by Peter Torris ( input =TEXT, output = TEXT ). The ZIP archive for PC1 encryption algorithm in Perl language (128-bit keys) ( input = BINARY FILE, output = TEXT or input = TEXT, output = TEXT ). The ZIP archive for PC1 encryption algorithm in Visual Basic 6.0 (128-bit keys) ( input = TEXT, output = TEXT ). The ZIP archive for PC1 encryption algorithm in Visual Basic 6.0 (128-bit keys) ( input = BINARY, output = BINARY ). The ZIP archive for PC1 crypt algorithm in VB 6.0 ACTIVE X control (128-bit keys) by Dan "Wraith" Hetrick The ZIP archive for PC1 crypt algorithm in POWERBASIC (128-bit keys) The ZIP archive for Encrypted Notepad in POWERBASIC (128-bit keys) (input = TEXT, output = BINARY FILE) The ZIP archive for Encrypted Notepad in POWERBASIC (128-bit keys) (input = TEXT, output = TEXT FILE) The ZIP archive PC1 for Microchip PIC Microcontroller 16F627, 16F627A, 16F628, 16F628A, 16F648A, 16F72, 16F73, 16F74, 16F76, 16F77, 16F818, 16F819, 16F87, 16F870, 16F871, 16F872, 16F873, 16F873A, 16F874, 16F874A, 16F876, 16F876A, 16F877, 16F877A, 16F88 (128-bit keys) The ZIP archive for PC1 crypt algorithm for 6809 processor (80-bit keys) The ZIP archive for PC1 crypt algorithm for Texas Instrument TI-89 TI-90 TI-9x (80-bit keys) The PC1 cipher uses a 128 or 256-bit key. It's a stream cipher with a retroaction function. Tested with Turbo C 2.0 for DOS and Microsoft Visual C++ 5.0 for Win 32 Delphi 2.0 Perl 5.0 Visual Basic 4.0 32 bits mode Microchip PIC
SSL++ -- C++ Wrapper arround OpenSSL library
SSL++ is simple C++ library encapsulating OpenSSL functionality to make it simple and easily accessible to C++ programmers.
Total Knowledge: SSL++ -- C++ wrapper around OpenSSL Library Total Knowledge SelfSoft, Inc. [ Home ] [ Site Map ] [ Services ] [ Open Source Projects ] [ About the Company ] [ Help ] [ Contact ] [ Portfolio ] SSL++ SSL++ is simple C++ library that encapsulates some of OpenSSL functionality in easy to use set of classes. It is in very early stage of development now, but can do enough already to be useful to C++ developers, who want to use SSL in their programs. Use SSL++ as you like, and if you have any questions problems bug reports bug fixes post them to sslpp@total-knowledge.com . Send empty message to sslpp-subscribe@total-knowledge.com to subscribe. Latest version: 0.1.1 See ChangeLog for more information. File Name File Size Upload date PGP signature ssl++.0.1.1.tgz 5k Monday, 08-Nov-2004 08:59:27 PST ssl++.0.1.1.tgz.asc Known high severity bugs Known low severity bugs No known bugs You are visitor since Jul 19, 2002. [ Home ] [ Site Map ] [ Services ] [ Open Source Projects ] [ About the Company ] [ Help ] [ Contact ] [ Portfolio ] Authoright Total Knowledge: 2001-2004
PrimeInk
Tools to work with X.509 certificates and revocation lists, various security syntax and messaging formats, a time stamping API, public key encryption algorithms, key exchange protocols, and a range of secure hash functions. Lists types of uses and compatible languages.
Cryptomathic PrimeInk - e-Security Tools For Professional Application Development COMPANY PRODUCTS SERVICES NEWS LABS JOBS CONTACT TOOLKITS Why PrimeInk? PrimeInk... Basic Premium Java ECC Web Signer Signature Validator Secure Mail CSP Hardware Crypto Support High-Speed Assembler Support Request Information PKI PRODUCTS AUTHENTICATOR EMV MIGRATION UTILITIES THIRD PARTY PRODUCTS E-SECURITY TOOLS FOR PROFESSIONAL APPLICATION DEVELOPMENT Business applications must be secure in order to protect yourself, your partners and your customers against direct threats such as fraud and espionage. In addition, by creating a trusted electronic business environment, organisations can open new market channels and realise significant cost savings. C ryptomathic PrimeInk is a range of toolkits for securing a wide variety of business applications. A result of almost 20 years of experience in delivering security solutions, PrimeInk offers high performance combined with ease of integration through compliance with all relevant security standards. For applications ranging from secure data storage and communication, to trusted web-based forms, there is a PrimeInk toolkit that can provide a simple solution. PrimeInk has been deployed worldwide in applications as diverse as data encryption utilities to advanced and legally-binding digital signature solutions. System integrators, architects and developers can all benefit from using PrimeInk. Each toolkit is targeted for a specific application type just pick the toolkit that meets your security requirements and fits your system architecture, and you will have everything needed to secure your application. The PrimeInk toolkits are divided into three groups: Universal Toolkits - Standards-based cryptographic algorithm implementations that are widely applicable across a range of applications. Application-Specific Toolkits - Tailored toolkits providing a plug-in solution to a specific common security requirement. Toolkit Add-Ons - Enhancements to the above toolkits adding support for additional features to address particular specialised requirements. Learn more For more information, please fill in the interest card today. One-stop-shopping for security Cryptomathic PrimeInk supports various third party products . Cryptomathic 2003. All rights reserved. Terms of Use | Privacy Statement
Hidden Field Equations (HFE) in Java
A free implementation of the public key cryptography system with source code and documentation.
Hidden Field Equations (HFE) in Java Implementing Hidden Field Equations (HFE) in Java This project is an Java implementation of a public key cryptography system called "Hidden Field Equations" (HFE) . It was part of my visiting year at University College Cork (Ireland) and was accepted for the Irish Signals and Systems Conference 2002 . You can also download the article (PS). You can access the project documentation as PS or PDF file (430 kB each), the Java source code (590 kB) of this implementation, the javadoc documentation (930 kB) of the source code, and a tar-file (260 kB) with both the source code, the classes, and the javadoc documentation. Use "tar -xzf jhfe.tar.gz" to untar it. Parts of the source code can certainly be used in other projects. E.g. the finite field operations for GF(2^n), and also matrix operations (including LU decomposistion). However, the software comes with no warranty as it is free of charge. There is also a special version called QuartzLight which implements a research version of the public key signature system Quartz. Moreover, the code for key generation has been optimized. In addition, my Master's Thesis (Diplomarbeit) deals with HFE. Christopher Wolf, 21. 4. 2003. eMail: hfe@christopher-wolf.de
Snapcrypt - Cryptography Algorithms
A library for the TMS320C54x DSP, contains algorithms for symmetric block ciphers, one-way hash functions, public key encryption and digital signature.
Snapshield's OEM Licensing program. Encryption Algorithms - DES, HASH, Public Key Algorithms
Dragonate Technologies Ltd.
Offers Elliptic Curve software. including ECDSACom, an ActiveX control, and borZoi, an open source library. Includes product descriptions and contact information.
Dragongate Technologies Ltd. - Products borZoi An Open Source C++ Elliptic Curve Cryptography Library. jBorZoi An Open Source Java Elliptic Curve Cryptography Library. ECCcom An Elliptic Curve Cryptography COM component. ECDSACom An Elliptic Curve Digital Signature Algorithm COM component. jSaluki An Open Source Java Hyperelliptic Curve Cryptography Library. borZoi borZoi is a C++ Elliptic Curve Cryptography Library which implements the following algorithms using elliptic curves defined over finite fields of characteristic 2 (GF2m): ECDSA (Elliptic Curve Digital Signature Algorithm) As specified in ANSI X9.62, FIPS 186-2 and IEEE P1363. ECIES (Elliptic Curve Integrated Encryption Scheme) As specified in ANSI X9.63 and the IEEE P1363a Draft. Elliptic Curve Diffie-Hellman Key Agreement Scheme As specified in ANSI X9.63 and IEEE P1363. The AES symmetric encryption scheme (NIST AES draft) and SHA-1 hash algorithm (FIPS 180-1) are also included. Licensing: borZoi can be freely downloaded and used under the terms of the GNU GPL . Please contact sales@dragongate-technologies.com for details of commercial licensing options. We welcome any comments or bug reports which you may have, however please note that we cannot accept any patches for legal reasons, because some of the borZoi code is also used in our commercial products. Documentation: The draft version of the manual is now available for download below and is also included in the source distribution: borZoi.pdf (pdf format) borZoi.ps (postscript format) Downloads: The current release is revision 1.0.2 and the source code can be downloaded from the links below. Commercial support and cryptography consulting is also available. Please send mail to sales@dragongate-technologies.com for more details. borZoi-1.0.2.tar.gz (Unix) borZoi-1.0.2.zip (Windows) jBorZoi jBorZoi is a Java Elliptic Curve Cryptography Library which implements the following algorithms using elliptic curves defined over finite fields of characteristic 2 (GF2m): ECDSA (Elliptic Curve Digital Signature Algorithm) As specified in ANSI X9.62, FIPS 186-2 and IEEE P1363. ECIES (Elliptic Curve Integrated Encryption Scheme) As specified in ANSI X9.63 and the IEEE P1363a Draft. Elliptic Curve Diffie-Hellman Key Agreement Scheme As specified in ANSI X9.63 and IEEE P1363. The AES symmetric encryption scheme is also included. Licensing: jBorZoi can be freely downloaded and used under the terms of the GNU GPL . Please contact sales@dragongate-technologies.com for details of commercial licensing options. We welcome any comments or bug reports which you may have, however please note that we cannot accept any patches for legal reasons, because some of the jBorZoi code is also used in our commercial products. Documentation: The draft version of the manual is now available for download below and is also included in the source distribution: jBorZoi.pdf (pdf format) jBorZoi.ps (postscript format) The javadoc documentation is online at the link below and is also included in the source distribution: jBorZoi Documentation (javadoc) Downloads: The current release is revision 0.90 and the source code can be downloaded from the links below. Commercial support and cryptography consulting is also available. Please send mail to sales@dragongate-technologies.com for more details. jBorZoi_0.90.zip ECCcom ECCcom is an Elliptic Curve Cryptography COM component which provides key agreement, digital signature and encryption algorithms using elliptic curves defined over finite fields of characteristic 2 (GF2m ). The AES symmetric encryption algorithm and SHA-1 256 384 512 hash algorithms are also included and Base64 encoding support is provided. More details... ECDSACom ECDSACom is an Elliptic Curve Cryptography COM component which provides digital signature functionality using elliptic curves defined over finite fields of characteristic 2 (GF2m ). It provides an easy means of adding digital signature support to software applications and libraries. It generates and verifies digital signatures using the Elliptic Curve Digital Signature Algorithm (ECDSA), provides Base64 encoding decoding support and implements the SHA-1, SHA-256, SHA-384 and SHA-512 hash algorithms. More details... jSaluki jSaluki is a small easy to use Java Hyperelliptic Curve Cryptography Library. Hyperelliptic Curve Cryptography is still an experimental area so this library is only recommended for research and educational purposes. Real life cryptosystems should use a more proven method such as Elliptic Curve Cryptography. Licensing: jSaluki can be freely downloaded and used under the terms of the GNU GPL . We welcome any comments or bug reports which you may have, however please note that we cannot accept any patches for legal reasons, because some of the jSaluki code is also used in our commercial products. Documentation: The preliminary draft of the documentation is online at the link below: jSaluki Documentation (javadoc) Downloads: The current release is revision 0.82 and the source code can be downloaded from the links below. jSaluki_0.82.zip [ Home ] [ Products ] [ About ] Copyright 2001, 2002, 2003 Dragongate Technologies Limited. All rights reserved.
TPCrypt by Technology Pathways LLC
Cryptographic classes for Microsoft .NET. Includes DES, TripleDES, RC2, and Rijndael (AES) implementations.
Technology Pathways LLC - Security Focused Software Tools and Consulting, Forensics, PKI, Audits, Encryption, Lockdown, Design, Public Key Infrastructure, ProDiscover DFT, TPCrypt Home Home About Contact Products Services Partners Support Resource Center Error! The License Authorization Code entered is not vaild or you have requested an invalid URL. Hit the backbutton on your browser to return to the Create your ProDiscover Account page and reenter the code. If this problem persists email support@techpathways.com ProDiscover Account Login Email: Password: Remember Login
RSA MD5 Visual C++
An implementation of the message digest algorithm. Includes a performance measurement facility.
RSA MD5 Message Digest Visual C++ Source Code RSA MD5 Message Digest Summary This is a Visual C++ implementation of the RSA MD5 message digest algorithm. The algorithm calculates a 16 byte checksum for any data sequence (e.g., array of bytes, a string or a file). Full details of the MD5 algorithm are provided within the code. MD5 Checksum Test Program Download The download consists of two Visual C++ V6 projects, the executable program itself, test data files and documentation. Download File: MD5 v1.2.zip - 106 KB Download Contents MD5 Library Source Code (MD5.dsw) This Visual C++ project builds a static library that provides the MD5 calculation routines. The source code will unzip to a folder named 'Code'. The library will build to 'Release' or 'Debug' subfolders. Do not change this folder configuration if you wish to build the MD5 Test Program (see below). MD5 Test Program Source Code (MD5ChecksumTest.dsw) This Visual C++ project builds an executable program that uses the MD5 library to calculate checksums. The source code will unzip to a folder named 'Test'. The executable will build to 'Release' or 'Debug' subfolders. The MD5 Library is a dependent subproject and so will build automatically before the test program. The MD5 library source code must be held in a folder named 'Code' which should be at the same level as the 'Test' folder. This is the default folder configuration created by the zip file. MD5 Test Program Executable (MD5ChecksumTest.exe) This is the executable program built by the MD5 Test Program Source Code (see screenshot above). It can be used to calculate the MD5 checksum for manually entered strings or for individual files. Test Data Several test data files are included within the test program source code and executable zip files. These test files will unzip to a folder named 'TestData'. The MD5 Test program uses these files to perform an automatic self verification. It expects to find them within the TestData subfolder. Documentation A copy of this web page is included in the download. The majority of the projects' documentation is in the form of commented source code. Further Details - MD5 Library The MD5 message digest algorithm is wrapped in a C++ class named CMD5Checksum. This exports three public functions:- CString GetMD5( BYTE* pBuf, UINT nLength ) CString GetMD5( CFile File ) CString GetMD5( const CString strFilePath ) All three are implemented as static functions. The checksum calculated is returned as a 32 character hexadecimal number held in a CString. GetMD5 is overloaded to take data to be checksummed as either an array of bytes or as a file. The class CMD5Checksum is held within the MD5 library source code. Building this project creates the static library MD5.lib. Further Details - MD5 Test Program A demonstration and test environment is provided in the MD5 test program. This allows the user to:- Type a string and see its checksum calculated in real time Select a file and calculate its checksum Perform an automatic self verification Get performance figures The user may type into the "Enter a string" edit box; the corresponding checksum will be calculated and displayed in real time. The test program source code download includes test data files. The user may browse and choose a file for checksum in the "Select a file" edit box; the file's checksum is then displayed. The checksums for the smaller test files may be verified by typing the contents directly into the "Enter a string" edit box. Obviously, the checksums obtained by both methods should be the same! The test environment also includes a "Self Test" button. This checksums each of the supplied test data files in turn and verifies the results. Finally, a "Performance Test" is provided. This displays and records statistics that indicate the execution speed of the checksum calculation. Thus, the performance implications of any modifications to the implementation can be assessed. Public Domain This implementation of the RSA MD5 algorithm was developed by Langfine Ltd and has been placed in the public domain for free use. However, wherever it is used, the RSA copyright notices must be adhered to, as described within the code and the test application's "About" box. Also, Langfine must be credited. If the code is modified in any way, this should be mentioned. Source code should clearly distinguish between Langfine's original code and the modifications. Version History V1.2 Performance indicators added. V1.1 Performance improved by making some functions inline. V1.0 First release. Disclaimer This download is provided free of charge by Langfine Ltd. All use is at your own risk. No liability of any kind whatsoever is accepted by Langfine Ltd. See Disclaimers . Comments If you improve the implementation in any way, we will be happy to update our code and make your changes available here. 2004 Langfine Ltd
RC-Crypt
Implementation of RC5 (128) in C.
RC-Crypt - Keeps your data safe Software Download Page More Software from Ricksoft Please read the Disclaimer before downloading software from this site Title RC-Crypt Operating Systems Linux, Solaris, HPUX etc Description RC-Crypt keeps your data safe. It is an easy to use command line program that encrypts your data. It works with big and little endian hardware, and has been tested on Linux, HPUX and Solaris. It uses the rc5 algorithm, which has proved almost impossible to crack with key sizes of greater than 64 bits. (See www.distributed.net for details of how long it took thousands of computers worldwide to crack a 64 bit key when the initial content of the data was known.) It has a multitude of options making it very suitable for inclusion into complex scripts. Amazon have many useful books on Cryptography . PLEASE NOTE: The format of the output has been modified at version 1.3. Do not use versions 1.3 or greater to decode data encrypted with version 1.2 or ealier - it will not work! If you like the software, please consider making a donation for any amount. Version 1.6 rccrypt-1.6.tar.gz (20k) Version 1.5 rccrypt-1.5.tar.gz (20k) Version 1.4 rccrypt-1.4.tar.gz (17k) Requirements glibc and a C compiler Change Log May 2005 Fixed race condition caused by changes to the way signals are sent in the new versions of Kernel or C Libraries in Linux. Also removed compiler warnings due to new versions of gcc. 17th Feb 2004 Added security enhancements so command line options are not visible using "ps" or in " proc". Added -v flag to show version number. Added -e flag to allow passing of key through an environment variable. The program now forks and does the encryption in a child process. The -w flag will make rccrypt wait for its child to end before returning. The default is to return immediately. Scripts using rccrypt will need modifying because of this. 26th Aug 2003 Added large file support for Linux. Enhanced speed for little-endian architechtures. Added new option to allow each block to be xor-ed with previous block before encryption. 24th Sept 2002: Minor bugfixes. Refactored the code. Stopped it printing out the padding bytes. Modified output file format ready for future upgrade. 19th Sept 2002: Minor bugfixes, added big little endian compatibility. 14th Nov 2001: Added command line option to specify which file contains the key. 2nd August 2001: Found that first release still had debug outut. Replaced tar file with correct version. 25th July 2001: Initial release
BeeCrypt
An open source cryptography library that contains highly optimized C and assembler implementations of many well-known algorithms including Blowfish, MD5, SHA-1, Diffie-Hellman and ElGamal.
WideXS - Home Home Producten Service Help Resellers Webmail NAVIGATIE Bedrijfsinformatie Nieuws Formulieren Vacatures Contactgegevens PAGINA Zoeken Afdrukken Bookmark (Ctrl+D) Feedback Sitemap Disclaimer Algemene voorwaarden Acceptable use policy This text should be replaced with tooltips INFORMATIE WideXS is een Nederlandse hosting provider die Internet diensten levert aan overheden, MKB en consumenten, de diensten variren van domeinnaam registraties tot en met geavanceerde hosting oplossingen. WideXS garandeert een 100% veilige hosting omgeving die 24 7 bereikbaar is, mede door een dubbel uitgevoerde verbinding naar het Internet via de eigen MPLS backbone (AS 8195) en een directe glasvezelkabel verbinding met de AMS-IX. WideXS staat voor effectief, snel en service gericht. In Nederland heeft WideXS ruim 70.000 domein namen geregistreerd en ruim 10.000 tevreden MKB klanten. DOMEINCONTROLE Controleer hier of uw domein al bestaat. ADSL2+ WideXS Home Office 16-24Mbps 1Mbps 99,99 p maand Postcode: Huisnr: ANNOUNCES 16-11-2005 uitstel upgrade dedicated servers 14-11-2005 Upgrade Apache php Dedicated Servers 2005 WideXS, an ion-ip company
Applied Cryptography Code
The code from the Applied Cryptography disk, available outside the US.
Index of pub crypto applied-crypto on ftp.zedz.net:21 Index of pub crypto applied-crypto on ftp.zedz.net:21 1993 Nov 22 File ASSORTED.ZIP (13,715 bytes) 2001 Dec 01 File BruceSchneierappliedcrypto.zip (4,328,523 bytes) 1993 Sep 07 File CRYPT3.ZIP (4,726 bytes) 1993 Sep 12 File DES-OSTH.ZIP (87,091 bytes) 1994 Sep 01 File DES-hut.tar.gz (51,663 bytes) 1995 Jan 21 File ERRATA (30,517 bytes) 1995 Jan 21 File ERRATA.gz (10,600 bytes) 1993 Nov 22 File ESCROW.ZIP (5,945 bytes) 1993 Sep 27 File EXAMPLES.ZIP (7,939 bytes) 1993 Nov 28 File HASHES.ZIP (24,277 bytes) 1993 Nov 28 File IDEA68K.ZIP (26,225 bytes) 1992 Oct 08 File MD4-DOS.ZIP (30,478 bytes) 1994 Sep 01 File MD5.tar.gz (21,414 bytes) 1993 Oct 11 File PPSC.ZIP (10,957 bytes) 1993 Sep 27 File RANDOM1.ZIP (3,214 bytes) 1993 Sep 27 File RANDOM2.ZIP (4,798 bytes) 1996 Jan 28 File README (12,407 bytes) 1994 Sep 01 File SHS.tar.gz (40,375 bytes) 1994 Sep 29 File ZCRYPT23.ZIP (18,936 bytes) 1994 Sep 01 File bignum.tar.Z (32,475 bytes) 1994 Sep 01 File bin-crypt.c.gz (1,013 bytes) 1994 Sep 01 File boucher-big-block-cipher.tar.gz (4,088 bytes) 1994 Sep 01 File boucher-chi-square-frequency-analysis.c.gz (2,533 bytes) 1994 Sep 01 File ca_1.1.tar.gz (8,309 bytes) 1994 Sep 01 File cbw.tar.gz (532,480 bytes) 1994 Sep 01 File crypt3.c (8,300 bytes) 1994 Sep 01 File cryptpol.gz (22,291 bytes) 1994 Sep 01 File d3des.tar.gz (5,793 bytes) 1994 Sep 01 File des-barr.zip (33,818 bytes) 1994 Sep 01 File des-bish.zip (8,667 bytes) 1994 Sep 01 File des-dist.tar.gz (56,816 bytes) 1994 Sep 01 File des-koon.tar.gz (16,527 bytes) 1994 Sep 01 File des-mitc.zip (13,012 bytes) 1994 Aug 31 File descore.shar.gz (18,447 bytes) 1994 Sep 01 File enigma-modification-peake.c (10,307 bytes) 1994 Sep 12 File enigma.c (7,407 bytes) 1994 Sep 01 File feal8.tar.gz (1,652 bytes) 1994 Sep 01 File fealnx.tar.gz (2,449 bytes) 1994 Sep 01 File fips171.txt (76,798 bytes) 1994 Sep 01 File fips171.txt.gz (21,246 bytes) 1994 Sep 01 File fips180.txt (10,113 bytes) 1994 Sep 01 File fips181.txt (127,318 bytes) 1994 Sep 01 File fips181.txt.gz (27,874 bytes) 1994 Sep 01 File fips185.txt (19,210 bytes) 1994 Sep 01 File fips185.txt.gz (6,480 bytes) 1994 Sep 01 File gillogly-sha.tar.gz (7,354 bytes) 1994 Sep 03 File gost-spec.tar.gz (20,538 bytes) 1994 Sep 03 File gost-spec2.ps.gz (38,253 bytes) 1994 Sep 01 File green-book-4.0.txt.gz (113,791 bytes) 1994 Sep 01 File haval.tar.gz (8,543 bytes) 1994 Sep 01 File hill.gz (4,466 bytes) 1994 Sep 01 File i-hat.zip (17,779 bytes) 1994 Sep 01 File idea-8086.asm (10,645 bytes) 1994 Sep 12 File idea-from-pgp.tar.gz (7,586 bytes) 1994 Sep 01 File idea.V1.1.tar.Z (142,760 bytes) 1994 Sep 01 File idea.lha (31,731 bytes) 1994 Sep 01 File idea.tar.gz (12,459 bytes) 1994 Sep 01 File idea22a.zip (14,592 bytes) 1994 Sep 12 File index (53,827 bytes) 1994 Sep 12 File isomorph.c (1,325 bytes) 1994 Sep 01 File itar9307.zip (181,027 bytes) 1994 Sep 01 File karn-md5-cipher.tar.gz (4,228 bytes) 1994 Sep 01 File khufu.tar.gz (6,752 bytes) 1994 Sep 01 File libdes-3.0.tar.gz (67,261 bytes) 1994 Sep 01 File linear-rng.tar.gz (6,707 bytes) 1994 Sep 01 File loki-3.0.tar.gz (14,950 bytes) 1994 Sep 01 File lucifer-outerbridge-5.0.tar.gz (3,477 bytes) 1994 Sep 01 File lucifer-outerbridge.c.gz (5,891 bytes) 1994 Sep 01 File lucifer-smith.c.gz (2,113 bytes) 1994 Sep 01 File lucifer.shar.gz (13,294 bytes) 1994 Sep 01 File md4.txt.gz (9,504 bytes) 1994 Aug 31 File md5.zip (24,530 bytes) 1994 Sep 01 File mimic-two.ps.gz (53,722 bytes) 1994 Sep 01 File newde.tar.gz (4,605 bytes) 1994 Sep 01 File newdes.tar.gz (2,636 bytes) 1994 Sep 01 File nhash.c (5,949 bytes) 1994 Sep 01 File nsea.tar.gz (25,411 bytes) 1994 Sep 01 File nsea.zip (32,924 bytes) 1994 Sep 01 File okeefe.tar.gz (3,228 bytes) 1994 Sep 01 File okeefe_encrypt.tar.gz (3,236 bytes) 1994 Sep 01 File pfdes.tar.gz (10,968 bytes) 1994 Sep 01 File pittner-prng-cipher-3.c.gz (11,362 bytes) 1994 Sep 01 File pittner-prng-cipher.c.gz (8,759 bytes) 1994 Sep 12 File playfair.c (3,239 bytes) 1994 Sep 01 File pubcrypt.zip (117,793 bytes) 1994 Sep 01 File redoc2.c.gz (4,939 bytes) 1994 Sep 01 File redoc3.c.gz (878 bytes) 1994 Sep 01 File rfc1319.txt.gz (7,552 bytes) 1994 Sep 01 File rfc1320.txt.gz (9,504 bytes) 1994 Sep 01 File rfc1321.txt.gz (10,691 bytes) 1994 Sep 01 File rfc1421.txt.gz (30,243 bytes) 1994 Sep 01 File rfc1422.txt.gz (25,574 bytes) 1994 Sep 01 File rfc1423.txt.gz (9,207 bytes) 1994 Sep 01 File rfc1424.txt.gz (5,220 bytes) 1994 Sep 01 File rfc1510.gz (64,757 bytes) 1994 Sep 01 File ripe-md.tar.gz (5,352 bytes) 1994 Sep 01 File ripem-1.2a-0.tar.Z (758,767 bytes) 1994 Sep 01 File rsa-faq.txt (148,264 bytes) 1994 Sep 01 File rsa-faq.txt.gz (49,961 bytes) 1994 Sep 01 File rsaref.tar.gz (53,702 bytes) 1994 Sep 01 File rsaref2.tar.gz (76,958 bytes) 1994 Sep 01 File schneier-blowfish.c.gz (7,439 bytes) 1994 Sep 01 File sci.crypt-FAQ.gz (28,331 bytes) 1994 Sep 01 File sci.crypt.faq.gz (35,773 bytes) 1994 Sep 01 File secude-4.1.all.tar.gz (2,451,819 bytes) 1994 Sep 14 File secure.contents (48,317 bytes) 1994 Sep 14 File secure.contents.gz (7,097 bytes) 1994 Sep 01 File setzer-trans.tar.gz (10,240 bytes) 1994 Sep 01 File sha.tar.gz (5,275 bytes) 1994 Sep 12 File sharing.tar.gz (6,487 bytes) 1994 Sep 01 File shs.zip (15,796 bytes) 1994 Sep 01 File snefru.tar.gz (56,171 bytes) 1994 Sep 01 File snefru2.5a.tar.gz (35,945 bytes) 1994 Sep 01 File solve-vigenere-4.tar.gz (8,889 bytes) 1994 Sep 01 File solve-vigenere.tar.gz (3,492 bytes) 1994 Sep 01 File splay.tar.gz (8,460 bytes) 1994 Sep 01 File tispem.FAQ (10,505 bytes) 1994 Sep 01 File tran-and-prngxor.shar.gz (9,591 bytes) 1994 Sep 01 File tran-and-prngxor.tar.gz (9,229 bytes) 1994 Sep 01 File ucb-crypt.1.c.gz (807 bytes) 1994 Sep 12 File vigenere.c (4,667 bytes) 1994 Sep 01 File wpcrack.tar.gz (13,181 bytes) 1994 Sep 01 File zcrypt21.zip (17,763 bytes)
CypherMath - Cryptographic Math Package
Gives your applications access to multi-precision integer math routines with just a function call. Full source code available. For VB, C++, or embedded systems.
CypherCalc Please click here for the CypherCalc Cryptographer's Calculator.
Network Security Services
Mozilla's NSS, is a set of libraries designed to support cross-platform development of security-enabled server applications.
Network Security Services (NSS) Skip to main content Mozilla About Developers Store Support Products search mozilla: Roadmap Projects Coding Module Owners Hacking Get the Source Build It Testing Releases Nightly Builds Report A Problem Tools Bugzilla Tinderbox Bonsai LXR FAQs Network Security Services (NSS) Newsgroup: netscape.public.mozilla.crypto Main technical contact: Bob Relyea Manager: Wan-Teh Chang Network Security Services (NSS) is a set of libraries designed to support cross-platform development of security-enabled client and server applications. Applications built with NSS can support SSL v2 and v3 , TLS , PKCS 5 , PKCS 7 , PKCS 11 , PKCS 12 , S MIME , X.509 v3 certificates, and other security standards. For detailed information on standards supported, see Overview of NSS . NSS is available under the Mozilla Public License, the GNU General Public License, and the GNU Lesser General Public License. For information on downloading NSS releases as tar files, see Download PKI Source . To participate in ongoing technical discussions related to NSS, tune in to the IRC channel mozcrypto on the server irc.mozilla.org. Project Information S MIME Toolkit Module SSL TLS Module Documentation Mozilla CVS Information Project Information NSS 3.10 has been released. We are working on NSS 3.11. 19 May 2005: NSS 3.10 Release NSS 3.10 was completed on 27 April 2005. The CVS tag is NSS_3_10_RTM. It is the first release in which the DBM library (mozilla dbm and mozilla security dbm) became part of the NSS source tree. NSS 3.10 may be used with NSPR 4.5.1 (CVS tag NSPR_4_5_1_RTM) or later. We will post the release notes here soon. 19 May 2005: NSS 3.9.5 Release NSS 3.9.5 is the latest patch release for NSS 3.9. The CVS tag is NSS_3_9_5_RTM. 8 January 2004: NSS 3.9 Release The new features and enhancements in NSS 3.9 include GeneralizedTime support, RFC 3280 compliant name constraints, and the ability to list duplicate certificate instances in multiple tokens. NSS 3.9 passes all the NISCC SSL TLS and S MIME tests (1.6 million test cases of invalid input data) without crashes or memory leaks. We recommend that all NSS customers upgrade to NSS 3.9 in the next release of your product. For details, see NSS 3.9 Release Notes . 20 June 2003: NSS 3.7.7 Release NSS 3.7.7 is a patch release for NSS 3.7. For the list of the bugs that have been fixed in NSS 3.7.7, see NSS 3.7.7 Release Notes . 21 May 2003: NSS 3.7.5 Release NSS 3.7.5 is a patch release for NSS 3.7. For the list of the bugs that have been fixed in NSS 3.7.5, see NSS 3.7.5 Release Notes . 10 April 2003: NSS 3.8 Release The new features and enhancements in NSS 3.8 include the SHA-256, SHA-384, and SHA-512 algorithms, enhanced smartcard support, and the elliptic curve cryptography code (not compiled by default) contributed by Sun Labs. For details, see NSS 3.8 Release Notes . 20 March 2003: NSS 3.7.3 Release NSS 3.7.3 is a patch release for NSS 3.7. For the list of the bugs that have been fixed in NSS 3.7.3, see NSS 3.7.3 Release Notes . 10 March 2003: NSS 3.7.2 Release NSS 3.7.2 is a patch release for NSS 3.7. For the list of the bugs that have been fixed in NSS 3.7.2, see NSS 3.7.2 Release Notes . 4 March 2003: NSS 3.4.3 Release NSS 3.4.3 is a patch release for NSS 3.4. For the list of the bugs that have been fixed in NSS 3.4.3, see NSS 3.4.3 Release Notes . 27 Febrary 2003: Security Vulnerability: Vaudenay Timing Attack on CBC mode block ciphers Recently a timing-based attack on SSL TLS implementations of CBC mode block cipher suites was disclosed . At present the implementation of SSL and TLS in NSS is susceptible to this method. The flaw is exploited on the recipient of sensitive data, which is normally servers. Servers are vulnerable to the attack only if they implement all of the following: TLS (supported by NSS 2.8 and later); cipher suites that use block ciphers; application protocols that are likely to receive sensitive data (for example, passwords) at exactly the same offset in many messages from a client. We have implemented a countermeasure and will release NSS patch releases soon. Until updated NSS libraries are available, we recommend the following action: Netscape mozilla browser users do not need to take any action. They could choose to disable TLS or disable CBC mode block ciphersuites as a precaution against vulnerable servers. Administrators of servers that are based on NSS 2.8 or later and that enable TLS need to take action. They could disable TLS or disable CBC mode block cipher suites. For more information, please see our article on this security flaw. 29 January 2003: NSS 3.7.1 Release NSS 3.7.1 is a patch release for NSS 3.7. For the list of the bugs that have been fixed in NSS 3.7.1, see NSS 3.7.1 Release Notes . 20 December 2002: NSS 3.7 Release The new features and enhancements in NSS 3.7 include a new version of the NSS certificate database that supports large CRLs and multiple email addresses for the subject of a certificate. For details, see NSS 3.7 Release Notes . 4 December 2002: NSS 3.6.1 Release NSS 3.6.1 is a patch release for NSS 3.6. For the list of the bugs that have been fixed in NSS 3.6.1, see NSS 3.6.1 Release Notes . 18 October 2002: NSS 3.6 Release The new features and enhancements in NSS 3.6 include new certificate handling and SSL functions, better certificate path construction, significantly improved CRL performance and memory usage, better SSL client authentication performance, and PKCS 11 session logging. For details, see NSS 3.6 Release Notes . July 2002: NSS 3.5 Release NSS 3.5 is an interim release created for Mozilla 1.0.1 and Netscape 7. We recommend that other NSS clients upgrade to NSS 3.6. 10 June 2002: NSS 3.4.2 Release NSS 3.4.2 is a patch release for NSS 3.4. For the list of the bugs that have been fixed in NSS 3.4.2, see NSS 3.4.2 Release Notes . 6 May 2002: NSS 3.4.1 Release NSS 3.4.1 is a patch release for NSS 3.4. For the list of the bugs that have been fixed in NSS 3.4.1, see NSS 3.4.1 Release Notes . 6 May 2002: NSS 3.4 Release NSS 3.4 contains a partial implementation of the core NSS 4.0 (code name Stan) functions and supports the new TLS AES ciphersuites. For details, see NSS 3.4 Release Notes . 12 December 2001: NSS 3.3.2 Release NSS 3.3.2 is a patch release for NSS 3.3. For the list of the bugs that have been fixed in NSS 3.3.2, see NSS 3.3.2 Release Notes . 9 November 2001: NSS 3.3.1 Release NSS 3.3.1 is a patch release for NSS 3.3. For the list of the bugs that have been fixed in NSS 3.3.1, see NSS 3.3.1 Release Notes . 26 July 2001: NSS 3.3 Release NSS 3.3 enables JSS (3.1 or newer) to use NSS shared libraries and implements five new DHE cipher suites for SSL TLS on the client side. For details, see NSS 3.3 Release Notes . Source code for a Java interface to NSS is available in the Mozilla CVS tree. For details, see Network Security Services for Java . NSS 3.3 source is available via CVS and may be viewed in HMTL (via the LXR tool) at http: lxr.mozilla.org mozilla source security nss . 6 April 2001: NSS 3.2.1 Release NSS 3.2.1 provides improved SSL performance and fixes bugs in pk12util and some certificate query operations. For details, see NSS 3.2.1 Release Notes . NSS 3.2.1 also facilitates simplified build instructions. For details, see Build Instructions for NSS 3.2.1 Release . For background information on the build system and proposals for future changes, see The NSS Build System: History and Future Directions . 2 March 2001: NSS 3.2 Release NSS 3.2 provided support for shared libraries for the first time. For details, see NSS 3.2 Release Notes . Applications that use only the NSS 3.2 Public Functions exported by the NSS 3.2 DLLs are guaranteed to work with future versions of the shared libraries. S MIME Toolkit Module See S MIME Toolkit for information about NSS libraries designed to support cross-platform development of S MIME applications. Originally created to support S MIME in Communicator 4.x and Personal Security Manager (PSM), these libraries form the basis of a new S MIME Toolkit for cross-platform development of S MIME applications. SSL TLS Module See SSL TLS for information about NSS libraries designed to support cross-platform development of SSL- and TLS-enabled applications. These libraries form the basis of the SSL module. Documentation Background information: Overview of NSS . Provides a brief summary of NSS and its capabilities. NSS FAQ . Answers basic questions about NSS. Introduction to Public-Key Cryptography . Explains the basic concepts of public-key cryptography that underlie NSS. Introduction to SSL . Introduces the SSL protocol, including information about cryptographic ciphers supported by SSL and the steps involved in the SSL handshake. History: History of NSS . A brief history of NSS. NSS Project Plans . Links to project plans for NSS 3.0 and later releases. NSS Release Notes . Links to release notes for NSS 3.0 and later releases. NSS Contributors lists major contributors to the NSS project. NSS APIs: Introduction to Network Security Services . Provides an overview of the NSS 3.2 libraries and what you need to know to use them. NSS 3.4 Public Functions summarizes the APIs exported by the NSS 3.4 shared libraries. These APIs are guaranteed to work with future versions of NSS shared libraries. SSL Reference . API used to invoke SSL operations. NSS API Guidelines . Explains how the libraries and code are organized, and guidelines for developing code (naming conventions, error handling, thread safety, etc.) NSS Technical Notes . Links to NSS technical notes, which provide latest information about new NSS features and supplementary documentation for advanced topics in programming with NSS. Tools, testing, and other technical details: Build Instructions for NSS (see NSS release notes for links). Describe how to check out and build NSS releases. NSS Tools . Tools for developing, debugging, and managing applications that use NSS. NSS 3.2 Test Suite. Describes how to run the standard NSS tests. NSS Performance Reports. Links to performance reports for NSS 3.2 and later releases. Encryption Technologies Available in NSS 3.9 lists the cryptographic algorithms used by NSS 3.9. NSS 3.1 Loadable Root Certificates . Describes the new scheme for loading root CA certificates. cert7.db . General format of the cert7.db database. Content Version Numbers in the Certificate Database . Information about content version numbers in cert7.db. PKCS 11 information for implementors of cryptographic modules: Implementing PKCS 11 for NSS PKCS 11 FAQ Using the JAR Installation Manager to Install a PKCS 11 Cryptographic Module PKCS 11 Conformance Testing NSS is built on top of Netscape Portable Runtime (NSPR); developers using NSS must call some NSPR functions. For information on NSPR, see the following: Netscape Portable Runtime . NSPR project page. NSPR Reference . NSPR API documentation. Mozilla CVS Information The CVS tags for various NSS releases can be found in the NSS release notes . NSS source code is in the mozilla security coreconf and mozilla security nss directories. Site Map Security Updates Contact Us Donate Portions of this content are 19982005 by individual mozilla.org contributors; content available under a Creative Commons license | Details . Last modified May 19, 2005 Document History Edit this Page (or via CVS )
libmcrypt
Supports the following algorithms; BLOWFISH, TWOFISH, DES, TripleDES, 3-WAY, SAFER-sk64, SAFER-sk128, SAFER+, LOKI97, GOST, RC2, RC6, MARS, IDEA, RIJNDAEL-128 (AES), RIJNDAEL-192, RIJNDAEL-256, SERPENT, CAST-128, CAST-256, ARCFOUR and WAKE. ANSI C.
Mcrypt This is the old page of mcrypt, which has a new maintainer and has been moved to Sourceforge. The new pages are at http: mcrypt.sourceforge.net . Mirrors of this site Index: Mcrypt: Encryption program LibMcrypt: The encryption library used by mcrypt Related links Development About the author Mcrypt: mcrypt is intended to be a replacement of the old unix crypt(1) under the GNU General Public License . Unix Crypt(1) was a popular(?) file encryption program in unix boxes. It was based on the enigma encryption algorithm but it was considerable trivialized. Since this was not adequate, even for individual privacy needs, I decided to create a similar program using some modern block encryption algorithms. Mcrypt also has a compatibility mode with unix crypt(1) and with solaris des(1). It supports all the algorithms and modes found in libmcrypt and it is very extendable. At the time writing this, it supports the algorithms: BLOWFISH, TWOFISH, DES, TripleDES, 3-WAY, SAFER, LOKI97, GOST, RC2, MARS, RIJNDAEL, SERPENT, CAST, ARCFOUR and WAKE. Block algorithms are implemented in modes: CFB, CBC, CTR, ECB, OFB (8 bit and n bit, where n is the size of the algorithm's block length). For a brief description of the algorithms and the modes look at the mcrypt manpage (this may be out of date). In mcrypt it is on the user to decide which algorithm he considers best for encrypting his data. Since mcrypt 2.6.0, the OpenPGP (RFC2440) encrypted file format is supported. Some notes: Keep in mind that in cryptography you shouldn't trust anything you do not know how it works or what it does. Do not trust mcrypt just because you have the source code. Please check that source code, and use it if it satisfies your security needs. Mcrypt should work fine in all unix systems. It may work (probably with changes) in other non-unix systems. Mcrypt 2.6.x can also been ported to Win32 using the Cygwin compiler . Here you can get mcrypt Libmcrypt: libmcrypt is the library which implements all the algorithms and modes found in mcrypt. It is currently under development but it seems to work pretty good. Unlike most encryption libraries libmcrypt does not have everything (random number generators, hashes, hmac implementation, key exchange, public key encryption etc.). Libmcrypt only implements an interface to access block and stream encryption algorithms. It's purpose was to assist in the development of mcrypt by providing a uniform interface to access several different encryption algorithms, so that the main program is independent of the encryption algorithms and the modes used. Libmcrypt supports the algorithms: BLOWFISH, TWOFISH, DES, TripleDES, 3-WAY, SAFER-sk64, SAFER-sk128, SAFER+, LOKI97, GOST, RC2, RC6, MARS, IDEA, RIJNDAEL-128 (AES), RIJNDAEL-192, RIJNDAEL-256, SERPENT, CAST-128 (known as CAST5), CAST-256, ARCFOUR and WAKE. Block algorithms can be used in: CBC, ECB, CFB and OFB (8 bit and n bit, where n is the size of the algorithm's block length). The license of libmcrypt is GNU Lesser General Public License . For information on how to use the libmcrypt, check the manpage (it may be out of date). Libmcrypt should compile fine in most *NIX systems with an ANSI C compiler. The new versions of libmcrypt use dynamic linking, which is not supported in all systems. This problem is minimized by using libltdl (a part of libtool). Note that libmcrypt has nothing to do with the crypt(3) library call. Here you can get the library Development: If you like mcrypt and you'd like to participate in the development, you should subscribe to the mailing list mcrypt-dev by visiting http: lists.hellug.gr mailman mcrypt-dev . Patches, bugfixes, suggestions, should be addressed to this list. Announcements of new versions and description of changes will be posted there. The current mailing list is hosted at lists.hellug.gr, thanks to HELLUG . The previous mailing list was hosted in argeas.cs-net.gr thanks to Giannis Ioannou. Access to the mcrypt CVS repository is available through anonymous cvs. To access it enter the following commands: $ cvs -d :pserver:anonymous@cvs.hellug.gr: var cvs mcrypt login Password: (enter password anonymous) $ cvs -d :pserver:anonymous@cvs.hellug.gr: var cvs mcrypt co mcrypt $ cvs -d :pserver:anonymous@cvs.hellug.gr: var cvs mcrypt co libmcrypt $ cvs -d :pserver:anonymous@cvs.hellug.gr: var cvs mcrypt co libmcrypt-nm To update your checkout, change into the mcrypt directory and execute: $ cvs update -dP To compile the cvs, run first the buildconf script. Mcrypt-cvs needs the programs: autoconf, automake and libtool. All these programs can be found at the nearest GNU mirror . Mhash can be found at mhash.sourceforge.net . Some documents you may find usefull: docs Links: shash: A program that produces message digests StegoArchive: Information about Steganography and applications Steghide software Overwrite: Secure Delete files SRM: Secure Deletion software GNUPG: An OpenPGP implementation (Electronic Mail privacy) nettle: A low level crypto library About the author: The author of mcrypt and libmcrypt is Nikos Mavroyanopoulos .
Catacomb Cryptographic Library
Library of cryptographic primitives in ANSI C, including block ciphers and hash functions, together with generic modes of operation. Also includes simple key management system, multiprecision arithmetic, and public key algorithms.
Miscellaneous hacking Home Miscellaneous hacking Miscellaneous hacking mLib handy C library catacomb crypto primitives mgLib GTK stuff CFD GNU build system bits AVQ search engine queries chkpath check $PATH and $TMPDIR Cookie make and check crypto cookies Doto run commands on many hosts fw excessive port forwarder pause wait for timeout or keypress Pixie now lives in Catacomb Priv tools for privileged scripts Quine make self-printing programs Shells special login shells Skel Emacs templates sw-tools software installation tool tripe simple VPN xtitle read and set xterm titles xtoys simple X tools z gunzip files on command line This area contains various hacks which are either portable or hard to pin down in some other way. All the programs here are free software: you are allowed to modify and redistribute them. Most are subject to the GNU General Public License . Most of the packages are done up as nice source distributions with configure scripts and so on. You can tell which they are because the tar files have version numbers in their names. Other things are just quickly thrown together. mLib New in version 2.0.1: Fixed a memory leak in sel_select. New in version 2.0.0: Memory management overhaul. Weve lost binary compatibility, hence the major version step. New in version 1.6.3: Bug fix in sel, allowing timers to be reinserted while theyre being called. New in version 1.6.2: Important dstr overflow fix. Other bug fixes. New in version 1.6.1: Minor bugfixes and tweaks in testrig. New in version 1.6.0: Included libtool support for building mLib as a shared library. New in version 1.5.0: Added a background resolver, ident client, Perl-like dynamic arrays and other stuff. mLib is my standard library. Its built from little chunks of useful code Ive found handy in various programs and collected together for ease of maintenance. Nothing heres earth-shatteringly clever or utterly essential. Its just stuff I use a lot, and thought I might as well share. Features include: Kludgy (but relatively effective) exception handling. Unobtrusive dynamic string handling. No more buffer overflows. Space- and time-efficient small blocks allocator. Extensible hashtable for arbitrary data. Generic rig for comparing function outputs against test vectors. Handling for select calls. Theres line buffering and non-blocking connect support here. Command line options parser, like GNU getopt only more so. Memory allocation tracing. Its not much, but its been useful a couple of times. Uncontrollable growth rate of new features. (Actually, this is becoming a problem) There are now extensive manual pages for the various bits and pieces in the library. Not quite everything is documented, but everything thats actually useful seems to be. Download: mLib-2.0.1.tar.gz current release. (As of version 1.2.0, mLib is licensed under the terms of the GNU Library General Public License . It used to be covered by the full-strength GPL.) Catacomb New in version 2.0.0: Memory management overhaul. Lots of new ciphers. Secret sharing. Improved key management (but a completely new system is in design at the moment). Bug fix in division. RSA padding support. Computing factorials and other products of lots of small numbers. Bug fix in RSA and BBS key generation. A library of cryptographic primitives. Currently, there are a few block ciphers and hash functions, together with generic modes for building more interesting constructions from them. Theres also what used to be a simple key management system, a multiprecision maths library, some public key algorithms and various useful tools. Documentation is sparse, but the header comments are good and there are a few README files to help get you started. A proper manual is in progress. Youll also need mLib if you want to build or use Catacomb. Download: catacomb-2.0.0.tar.gz current release version. mgLib A small library of GTK-related bits. Nothing terribly interesting, probably. This library is required by xtoys , though, so itd be a good idea to fetch it if you want to build the xtoys distribution. Download: mgLib-1.1.0.tar.gz current version. Common Files Distribution The CFD contains lots of common files used when building GNU applications. Its useful because it means you only need to upgrade the CFD when the files change; you dont need to individually fiddle with each of your projects. Download: common-1.2.8.tar.gz current version. AVQ A handy tool, particularly in conjunction with xgetline (from the xtoys collection) and a decent window manager. It accepts a search expression as a command line argument and emits a URL for a search engine ( AltaVista and Google are currently supported). You need to write a script which sends the URL to your web browser to make it work really well. Download: avq-1.0.2.tar.gz current version. chkpath A brace of useful tools for the paranoid. The chkpath program scrutinizes your $PATH for ways in which evil users could introduce malicious software which you might run. The tmpdir program uses similar checks to choose a secure directory for temporary files. This package requires the mLib library. Youd better fetch and install that before building these tools. Download: chkpath-1.0.1.tar.gz current version. Cookie The cookie program generates and verifies timestamped cryptographic cookies. When given a cookie, you can verify that (a) you assigned that cookie to someone, (b) that it hasnt expired, and (c) that some other pieces of data issued with the cookie havent been changed. The program is relatively simple. However, it needs the mLib and catacomb libraries to be installed before it will build. Download: cookie-1.0.2.tar.gz current version. doto Runs a command on a collection of hosts. The commands output is shown in a configurable way; the default uses a scrolling curses window for each host, which is quite handy. This is a useful thing to have when administering a big bunch of Unix hosts on a network. This package requires the mLib library. Youd better fetch and install that before building these tools. Download: doto-1.0.2.tar.gz current version. fw A port forwarder. It accepts connections on one port and makes an outgoing connection somewhere else. Its very configurable. Features include: Non-blocking, single-process design. Optional connection logging (with ident lookup). Access control on incoming connections. Works with Unix-domain sockets as well as TCP IP. Can also attach programs and files to sockets (or each other). I got carried away with this one. It does just about everything a port forwarder ought to do (I think) and lots more besides. This package requires version 2.0.0 of the mLib library. Youd better fetch and install that before building these tools. Download: fw-1.2.6.tar.gz current version. Pause The pause program will wait for a given amount of time to elapse (specified in seconds, may be fractional), or for a key to be pressed. Its useful for interactive delays. Well, I think it is. This package requires the mLib library. Youd better fetch and install that before building these tools. Download: pause-1.0.1.tar.gz current version. Priv A couple of useful tools for letting people run privileged shell scripts, based on an idea by Clive Jones. priv is a tiny setuid executable which runs a named program from a fixed directory with a stripped environment, after checking some permissions and making appropriate log entries. iscons is useful in such scripts to find out whether the caller is attached to a physical console. Download: priv-1.0.0.tar.gz current version. Quine Programs which print their own source code are called quines. (See the definition of quine in the Jargon File for more here.) Quine is a kit which allows you to write your own quines. Essentially, given a source distribution, it will build a source file (a really big one, usually) which contains a function to write the distribution to disk, or dump it to stdout. For a typical program, this will be big. Obviously, the Quine program is itself a quine. This complicated the build process a bit. You dont have to worry about that, though: just configure and make. Next project along these lines is to implement proc src for Linux Download: quine-1.1.0.tar.gz current version. Shells There are no proper interactive shells here. If thats what you want, look somewhere else. These are special little programs to set as the login shells of unusual users. The banned shell tells a user that he or she is not allowed to log in, logging a message to the system logs at the same time. The chrootsh shell puts the user in a chroot(2) gaol before invoking a real shell. The cvssh shell is helpful when setting up anonymous CVS servers. Download: shells-1.0.0.tar.gz current version. Skel I got annoyed one day at the amount of boilerplate I was having to type into every new source file before I could actually start work on it. Now, I could have just written a skeleton containing all my boilerplate, and inserted it into my new source file whenever I created one. But that doesnt really solve the problem: I write in lots of languages (C, Perl, shell script, autoconf, Emacs lisp, Haskell, ML, the list goes on) and they all need more-or-less the same boilerplate, with subtle differences like comment styles and so on. Skel is the answer. Its a (fairly small) Emacs package which provides a command skel-create-file (and some other stuff). This command accepts a filename, and looks at its extension for a bit to decide what sort of a file it is (or you can override its opinions by giving a prefix argument). After its done that, it looks in the current directory, the current directorys parent, and so on all the way up, and in a few other built-in places, for configuration files, both generic and specific to that sort of file, and pieces the bits together to make a new skeleton. Skel is very customizable. Actually, its a trivial bit of Lisp code and a big pile of customization. You can customize individual projects to have specific license conditions, author strings, or even the entire skeleton design, with the local tweaks being savable in CVS repositories. You can even arrange for it to ask you to `fill in the blanks as it goes (I use this for the purpose string in my standard header). Apologies for the hard sell on this one. Its a piece of software I really do use all the time, and Im very glad Ive written it. It could do with a lot of polishing (not to mention a big pile of documentation) before its really nice, but I find it thoroughly serviceable as it is. Download: skel-1.0.3.tar.gz current version. sw-tools Some tools for installing software in a heterogeneous environment. The main program, sw, will build programs in parallel on several different architectures, displaying the results from each and maintaining a build log. It has special treatment for GNU Autoconf packages, although it can also cope with other types of packages by making big trees full of symbolic links. Theres also a CGI script which allows browsing of the installed software and its documentation. It can translate manpages and GNU info files into HTML on the fly, inserting hyperlinks as necessary. Everythings documented fairly well. Its probably slightly overspecified: there may be some features Ive not actually used yet (although I cant think of any offhand). This package requires the mLib library. Youd better fetch and install that before building these tools. Download: sw-tools-1.0.4.tar.gz current version. tripe TrIPE (Trivial IP Encryption) is a simple network protocol which uses cryptography to make a secure path between two network gateways over which IP packets can be sent. tripe is an implementation of this protocol. TrIPE is currently in pre-release, until the documentation is finished. Im still finding (minor) security problems at the moment, and I dont recommend deployment of tripe in production systems at this time. The documentation will include a complete mathematical proof of security for the protocol (based on some standard assumptions) and at that time tripe will be released properly. TrIPE requires mLib version 2.0.0 or later, and Catacomb version 2.0.0 or later. Linux 2.4.x works with the standard TUN TAP driver. There's a module which I wrote for Linux 2.2.x, but you probably shouldnt be using that any more mail me if nothing else will do. TrIPE should work on BSD systems out of the box, but Ive not got a machine to try it on. Other systems arent supported (but ports shouldnt be too difficult). Download: tripe-1.0.0pre5.tar.gz current pre-release version. xtitle A small program which can read and set the title of an xterm window, designed to be used from shell scripts and aliases. It can be compiled either as a standalone program or as a bash 2.0 builtin (which improves performance from shell scripts). The following bash shell function appends a string to the current xterms title bar for the duration of a shell command: entitle() { local t="`xtitle -q`" xtitle "$t $1" shift "$@" xtitle "$t" } Download: xtitle.c source code (Yes, thats right. You just get a single source file. Its just a quick hack. Compile with BASH_BUILTIN defined to create a builtin; otherwise you get a standalone program.) xtoys A small collection of X-related tools, mainly concerned with making my window manager configuration nice. xgetline is intended to be used from a shell script to solicit input from the user. It pops up a pretty dialogue box, waits for the user to type a string in, and echoes it to standard output, whence a shell script can pop it into a variable using backticks. Now supports history files, so you can recall past entries quickly. xscsize reads the display size and echoes it to standard output in the form of a shell variable assignment, so that a .xinitrc file can decide how big to make various windows. Finally, xwait waits until you run xtell and then quits. This is handy at the end of a .xinitrc file, so youre not dependent on a window manager not crashing or anything like that. Theres also a xshutdown program which does the same job as xtell only asking for confirmation with a pretty GTK dialogue box first. This package requires the mLib and mgLib libraries. Youd better fetch and install them before building these tools. Download: xtoys-1.3.0.tar.gz current version. z Lots of programs dont work on gzipped or bzip2ed files, which can be kind of annoying. In particular, Debian comes with a pile of compressed Postscript and DVI documents, and Ghostscript and xdvi dont like compressed input files. z is a neat little shell script. The arguments you give it are a program to run. All z does is preprocess the arguments, spotting files which look like theyre compressed and decompressing them somewhere temporary, passing on the decompressed filename instead. So I can now say something like z ghostview usr doc something manual.ps.gz and everything works perfectly. Download: z.tar.gz current version. Mark Wooding mdw@nsict.org
CTC
CTClib (PGP-interoperable ANSI C encryption software library) and CTCjava (Java crypto components and application).
CTC - PGP-compatible encryption software Bifroest Mr. Tines CTC Home CTClib MacCTC CTCjava Manual CTC Freeworld Crypto Freeware CTC is a collection freeware PGP-interoperable encryption software package developed by Ian Miller and Mr. Tines . CTC does not stand for anything; it is Rot13("PGP"). The currently released components are:- CTClib a ANSI-C library by both authors. Current release: 2.2 Released 28-Oct-1999 Release Notes MacCTC Macintosh application by Ian Miller . Current release: 2.1 Released 17-Jan-1999 Release Notes CTCjava Java crypto components and application by Mr. Tines . Downloads Legality Licensing Further reading Acknowledgements We would like to thank: Charly For his constructive criticism of MacCTC. Robert Guerra For help with PGP5 interoperability testing. Richard Outerbridge For supplying us his 3-DES implementation. Andrew Paterson For work debugging CTClib numerous suggestions Background Albino Frog Software, Inc. Please report any problems with this site to:- webmaster@bifroest.demon.co.uk
Emacs Cryptographic Library and Tools
Includes code for IDEA, Blowfish, SHA-1, MD5, RC16 (RC4 extension), an initial implementation of DES and a few related toys.
Emacs Cryptographic Library and Tools Emacs Cryptographic Library and Tools Ecrypto2.0.tgz (29436 bytes) - an emacs crypto library. includes code for IDEA, Blowfish, SHA-1, MD5, RC16 (RC4 extension), an initial implementation of DES, and a few related toys. (note: sometimes the caching on this server seems to go haywire. if you end up with fewer than 29436 bytes, please mail me and i'll kick it until it works again. or check at this link .) obscure.tgz (2201 bytes) - obscure.el, which uses SHA-1 and IDEA to encrypt buffers with passphrases. zenirc-secure.tgz (18982 bytes) - adds cryptographically secure communication to zenirc , an IRC client for emacs. Ray Jones (rjones@pobox.com)
Cryptlib Encryption Toolkit
A powerful security toolkit which allows even inexperienced crypto programmers to easily add encryption and authentication services to their software.
cryptlib Encryption Toolkit This page is designed to be viewed with a browser which supports HTML frames. Since your browser doesn't support frames you can use the following links to get to the various cryptlib pages.
OpenSSL
A collaborative effort to develop a robust, commercial-grade, full-featured, and Open Source toolkit implementing the Secure Sockets Layer (SSL v2 v3) and Transport Layer Security (TLS v1) protocols as well as a full-strength general purpose cryptography library. The OpenSSL Project is a collaborative effort to develop a robust, commercial-grade, fully featured, and Open Source toolkit implementing the Secure Sockets Layer and Transport Layer Security protocols with full-strength cryptography world-wide. A toolkit implementing SSL v2 v3 and TLS protocols with full-strength cryptography world-wide. It is based on SSLeay, developed by Eric Young and Tim Hudson. [Free Open Source] (The OpenSSL Project)
OpenSSL: The Open Source toolkit for SSL TLS Welcome to the OpenSSL Project The OpenSSL Project is a collaborative effort to develop a robust, commercial-grade, full-featured, and Open Source toolkit implementing the Secure Sockets Layer (SSL v2 v3) and Transport Layer Security (TLS v1) protocols as well as a full-strength general purpose cryptography library. The project is managed by a worldwide community of volunteers that use the Internet to communicate, plan, and develop the OpenSSL toolkit and its related documentation. OpenSSL is based on the excellent SSLeay library developed by Eric A. Young and Tim J. Hudson. The OpenSSL toolkit is licensed under an Apache-style licence, which basically means that you are free to get and use it for commercial and non-commercial purposes subject to some simple license conditions. Date Newsflash 15-oct-2005: OpenSSL 0.9.7i is now available , contains compatibility fix 11-oct-2005: Security Advisory : Potential SSL 2.0 rollback 11-oct-2005: OpenSSL 0.9.8a is now available , including security fix 11-oct-2005: OpenSSL 0.9.7h is now available , including security fix 05-jul-2005: OpenSSL 0.9.8 is now available , a major release more... This software package uses strong cryptography, so even if it is created, maintained and distributed from liberal countries in Europe (where it is legal to do this), it falls under certain export import and or use restrictions in some other parts of the world. PLEASE REMEMBER THAT EXPORT IMPORT AND OR USE OF STRONG CRYPTOGRAPHY SOFTWARE, PROVIDING CRYPTOGRAPHY HOOKS OR EVEN JUST COMMUNICATING TECHNICAL DETAILS ABOUT CRYPTOGRAPHY SOFTWARE IS ILLEGAL IN SOME PARTS OF THE WORLD. SO, WHEN YOU IMPORT THIS PACKAGE TO YOUR COUNTRY, RE-DISTRIBUTE IT FROM THERE OR EVEN JUST EMAIL TECHNICAL SUGGESTIONS OR EVEN SOURCE PATCHES TO THE AUTHOR OR OTHER PEOPLE YOU ARE STRONGLY ADVISED TO PAY CLOSE ATTENTION TO ANY EXPORT IMPORT AND OR USE LAWS WHICH APPLY TO YOU. THE AUTHORS OF OPENSSL ARE NOT LIABLE FOR ANY VIOLATIONS YOU MAKE HERE. SO BE CAREFUL, IT IS YOUR RESPONSIBILITY. CREDIT INFORMATION: This product includes cryptographic software written by Eric A. Young (eay@cryptsoft.com). This product includes software written by Tim J. Hudson (tjh@cryptsoft.com). Website designed by Ralf S. Engelschall and generated with Website META Language (WML). All markup code and graphics on this website are Copyright 1999-2005 The OpenSSL Project , All rights reserved. This website is served by an Apache webserver environment. Hardware and bandwidth provided by SpaceNet AG .
Crypto++
Free C++ library for cryptography: includes ciphers, message authentication codes, one-way hash functions, public-key cryptosystems, and key agreement schemes.
Crypto++ Library 5.2.1 - a Free C++ Class Library of Cryptographic Schemes
Horst Grtz Institute for IT-Security
Ruhr-University of Bochum, Germany : Cryptographic and security protocols, Security architectures, Digital Rights Management systems, Cryptographic embedded applications, Network security etc.
Horst Grtz Institute for IT-Security Homepage Overview A-Z Search Contact Structure Teachings Cooperation Conferences Publications Press Newsletter Contact HGI Homepage Mystery Twister Mystery Twister is an international cryptology competition. Its focus is on the fun of discovering a new world and uncovering secrets. In solving the competition's tasks, the journey is the reward. more CHES 2006 (Workshop on Cryptographic Hardware) HGI is one of the organisers of CHES 2006 (Workshop on Cryptographic Hardware), taking place in Yokohama in the middle of october. more Embedded Security in Cars 2005 (ESCAR) From 29 till 30 november the third conference on Embedded Security in Cars (ESCAR) will take place in Cologne, Germany. more The Horst Grtz institute (HGI) for security in information technology In the year 1999 the University of Bochum developed a concept in order to build up a center of competence for IT security. Dr.-Ing. E.h. Horst Grtz , founder of the company Utimaco, supported this project with a generous donation. Meanwhile, this center of competence is established and is one of the biggest of its kind in Europe. It consists of two sections: the Horst Grtz Institute for IT security (HGI), named after its sponsor, as the central scientific institute at the Ruhr-University of Bochum and the Gesellschaft fr IT-Sicherheit (GITS AG), a newly founded company in the novel house for IT security (4,000 m with offices and several conference- and seminar rooms) which mainly deals with the education and training in the field of IT security. The HGI's main focus is research, consulting, cooperation with IT security related companies and IT security personnel training. Moreover, the HGI combines different areas of expertise with technical, economic, legal and social scientific character. Here you will learn more about the organisation of the institute Please note: the English section of our website is still under construction and content is being added continually... TOP Last change: 08.12.2004 | Contact: Content oder Technics
ECRYPT
European Network of Excellence for Cryptology: Areas Cryptology and Watermarking. About 31 institutes are collaborated in this joint research project.
ECRYPT main Network of Excellence in Cryptology IST-2002-507932 Overview Partners Workshops Schools Documents Lounges Past Events Contact Disclaimer Workshops Schools ECRYPT Position Paper: Recent Collision Attacks on Hash Functions revision 1.1, 17 February 2005 ECRYPT Yearly Report on Algorithms and Key Lengths (2004) revision 1.1, 17 March 2005 All ECRYPT public documents eSTREAM - ECRYPT Stream Cipher Project ECRYPT Lounges ECRYPT - European Network of Excellence for Cryptology is a 4-year network of excellence funded within the Information Societies Technology (IST) Programme of the European Commission's Sixth Framework Programme (FP6) under contract number IST-2002-507932. It falls under the action line Towards a global dependability and security framework. ECRYPT was launched on February 1st, 2004. Its objective is to intensify the collaboration of European researchers in information security, and more in particular in cryptology and digital watermarking. Cryptology is the science that studies mathematical techniques in order to provide secrecy, authenticity and related properties for digital information. Watermarking allows embedding hidden information into the digital media, such that the watermark is imperceptible and difficult to remove. Cryptology and watermarking are interdisciplinary research areas with a high strategic impact for European industry and for the society as a whole. They are a fundamental enabler for security, privacy and dependability in the Information Society for digital asset management. The ECRYPT research roadmap is motivated by the changing environment (evolving towards ambient intelligence) and threat models in which cryptology is deployed, by the gradual erosion of the computational difficulty of the mathematical problems on which cryptology is based, by the need of strong foundations in the watermarking area and by the requirements of new applications and cryptographic implementations. The main objective of ECRYPT is to ensure a durable integration of European research in both academia and industry and to maintain and strengthen the European excellence in these areas. In order to reach this goal, 32 leading players integrate their research capabilities within five virtual labs focused on the following core research areas: symmetric key algorithms (STVL), public key algorithms (AZTEC), protocols (PROVILAB), secure and efficient implementations (VAMPIRE), and watermarking (WAVILA). Essential integration activities include joint workshops, exchange of researchers and students, development of common tools and benchmarks and a website and forum which will be a focal point for the network and the wider cryptographic community. Spreading activities will include a training program, a substantial contribution towards standardization, bodies and an active publication policy. The project team has the critical mass and breadth to address the key questions in these areas. The general objectives of the ECRYPT network of excellence are the following: Maintain and strengthen the excellence of European research and industry in the areas of cryptology and watermarking and obtain a durable integration which lasts beyond the funding of the NoE provided by the European Commission. This is achieved by E-integration: web portal, forum, email lists Workshops for collecting requirements from all relevant players, building consensus on an integrated research roadmap, scientific presentations and interactions (brainstorming sessions) Exchange visits of researchers and PhD students Developing a joint infrastructure Strengthen and integrate research in cryptology and watermarking in Europe and decrease fragmentation by creating a research infrastructure and by organising research into virtual laboratories thereby establishing a joint research agenda and executing joint research in these areas. The Virtual Labs foster joint research between the ECRYPT members; each Virtual Lab has several working groups; this substructure will be refocused or renewed on a regular basis. The network will be organised to ensure that Virtual Labs cooperate closely towards achieving common goals. Improve the state of the art in practice and theory of cryptology and watermarking: Improve our understanding of existing algorithms and protocols Expand the theoretical foundations of cryptology and watermarking Develop better cryptographic algorithms, protocols and implementations in the following respects: high performance, low cost, high security Develop a joint infrastructure which includes: tools for the evaluation of cryptographic algorithms, a benchmarking environment for cryptographic hardware and software, infrastructure for side channel analysis measurements and tools, tools for benchmarking watermarking schemes. The activities of the ECRYPT Network of Excellence are organized into five virtual laboratories established as follows: Symmetric techniques virtual lab (STVL) Asymmetric techniques virtual lab (AZTEC) Protocols virtual lab (PROVILAB) Secure and efficient implementations virtual lab (VAMPIRE) , and Watermarking and perceptual hashing virtual lab (WAVILA) . Each virtual lab within the ECRYPT Network of Excellence aims to promote and facilitate cryptographic research on a pan-European level. The primary technical objective of the STVL is to facilitate European research on both the design and analysis of symmetric cryptosystems. In this way it is hoped that the work in the STVL will address some pressing issues for academia and industry alike. Thus, three particular areas of research have been identified within the scope of the STVL and it is intended that an exchange of ideas from both academia and industry will help the cryptographic community make substantial progress in these areas. The first target for the efforts of the STVL is the development of secure and efficient stream ciphers; a task that will require considerable input from industry and academia alike. A second target for the STVL is a coordinated cryptanalytic assessment of the Advanced Encryption Standard. In fact, this task lies within a broader research area of symmetric cipher cryptanalysis, and it is anticipated that collaboration with the AZTEC virtual lab will complement the efforts within the STVL. A third goal of the STVL will be to address the development of lightweight cryptographic primitives as a fundamental foundation to ambient technology. Such a technical objective is ambitious; but with the added collaboration of the other Virtual Labs, the opportunities for progress are significant. The main technical objective of the AZTEC lab is to allow better collaboration among European institutions on the design and analysis of asymmetric cryptographic techniques. To accomplish this goal, four main areas of study have been identified. First, it is important to study, compare and propose mechanisms for provable security, to improve and better understand the security of asymmetric schemes. A second target for the AZTEC efforts is to develop alternatives to the RSA scheme, with particular attention to lightweight solutions, a task that will require considerable efforts from industry and academia. In the Internet era, many new applications are emerging for which asymmetric primitives with some specific properties are useful; for this reason it is fundamental to include the study of such primitives as the third target area of the AZTEC lab. Finally, since there cannot be unconditionally secure asymmetric cryptography, the fourth goal of AZTEC is to improve our knowledge on the hardness of the computational problems that are used as underlying assumptions to provide security. PROVILAB is concerned with cryptographic protocols, where two or more agents interact in order to reach some common goal; this can be to establish a secure network connection, to realize a payment transaction securely, or to carry out a secure auction over a network. A large body of theoretical research on protocols already exists, but our basic knowledge is still far from complete. Furthermore, analyzing the security of concrete protocols is notoriously difficult, and several solutions proposed and sometimes even used in practice have later turned out to be insecure. The first objective of PROVILAB is therefore to construct practically useful protocols for a wide range of applications with well understood and provable security. The second is to expand our basic knowledge, for instance in the area of unconditional security, i.e. protocols that remain secure, no matter the resources invested in breaking them. The VAMPIRE lab has a dual role in ECRYPT. On one hand, it will research new techniques that are related to efficient and secure implementation. On the other hand, VAMPIRE will provide a bridge between the research and the user community. In concrete terms, the technical goals of the VAMPIRE lab for the duration of ECRYPT can be summarized as: development of novel efficient implementation techniques in hardware and software; development of a solid understanding of existing and new side channel attacks and efficient counter measures; researching and understanding of cryptanalytical hardware and its impact on cryptographic parameters. There are also non-technical objectives: We hope that the important field of cryptographic implementation grows internationally through VAMPIRE and that the interplay of secure algorithms and secure implementations becomes more prominent. We hope to foster cooperation between strong engineering groups and pure crypto groups. Also, it is a major goal to bridge the existing gap between the research community and engineers in industry who need to apply implementation techniques. Another important objective is to assist the researchers in the other (more theoretical) Virtual Labs in understanding the requirements and meeting the needs of applied cryptography. The interdisciplinary structure of ECRYPT appears to be an ideal mechanism to reach these goals. The watermarking and perceptual hashing virtual lab WAVILA intends to broaden the scope of ECRYPT beyond the classical cryptographic techniques into the domain embedded signalling and fuzzy signatures. These two techniques have recently been proposed as important ingredients in digital rights management (DRM) systems, but they have never fully been analyzed with respect to security and usage (protocols), comparable to the standard of cryptography. It is the goal of WAVILA to build tools and techniques for assessing the security aspects of watermarking and perceptual hashing, to design advanced algorithms with a well-defined security level, to design protocols, both stand-alone as well as integrated in cryptographic protocols, and to develop methods and techniques for efficient and secure implementations. The overall and broader goal is to bring watermarking and perceptual hashing to such a level that they can be successfully be integrated into future DRM systems.
Stanford University's Security Lab
Interests: Security of cryptographic primitives and protocols, Identity Based Encryption Email system, Intrusion tolerance via threshold cryptography, Electronic wallets, RSA keys bits generation
Computer Security Lab at Stanford Home People Projects Courses and Seminars The Security Lab is a part of the Computer Science Department at Stanford University . Research projects in the group focus on various aspects of network and computer security.
Florida State University
Interests: Wireless Security, Privacy, Forensics, Security Protocols.
Florida State University - Security Research Group Florida State University Computer Science Department Security Research Group Main Group Schedule Presented Papers People Security Protocols Intrusion Detection Wireless Security Publications NSA Security Proffesional Certificate Security Related Courses Security Related Conferences SAIT Labs DoD Scholarship Grant Proposal Tips Links Bibliography The Security Research Group is a group of graduate and undergraduate students who are interested and willing to research information security issues. The group, led by Dr. Alec Yasinsac, meets to share research with each other, and to present and discuss various security related topics, some of which include: Wireless Security. Privacy. Forensics. Security Protocols. There is a strong base of interest in wireless security in the security group. Our researchers strive to find innovative and practical ways to secure the growing amount of wireless communications. The group works at discovering and discussing new and old ways of dealing with security in Ad hoc Networks and other wireless communications. As the information world becomes more and more accessible, the need for increased privacy is growing steadily. The security group works to present new or improved ways to aid this constantly changing topic. The only way for the information security world to continue to defend against new attacks is to examine and evaluate previous attacks. The security group discusses how different attacks work and how to better combat them. This also helps to find flaws in the current systems and how to correct them. Security protocols today are constantly changing and growing. The security group researches these protocols in order to better understand how different information security approaches work. The security protcols are fundamental to security and understanding them not only helps to better understand the concepts of information security, but also helps to develop new ways to improve existing methods of security. We are also interested in examining practical applications of the technologies and concepts that we investigate. We hope to produce systems that detect and deter computer and network-based attacks, and to produce policies and procedures that will facilitate catching and prosecuting perpetrators.
MIT's Cryptography and Information Security Group
Threshold Cryptography, Zero-Knowledge Proofs, Pseudo-Randomness, Random Oracle Model, and Anonymity in cryptography, Digital Signatures.
Cryptography and Information Security Group (CIS Group) Cryptography and Information Security Group (CISGroup) The CIS Group is part of the Theory of Computation Group of MIT's Laboratory for Computer Science . Professors Shafi Goldwasser , Silvio Micali, and Ron Rivest founded this group in Fall 1995. Here is the CIS group's mission statement . CIS Group links: CIS people CIS research projects CIS publications (partial list) Theses CIS seminars (both upcoming and past) A set of web pages maintained for DARPA, who sponsors much of the research in this group. For a great collection of related information, check out Ron Rivest's collection of links on Cryptography and Security ! If you are a member of the CIS group, and have some software that falls under the US export laws that you would like to publish on the Web, read this page . It describes the Domestic Web Server, which can limit the distribution of export-controlled software to those users who represent themselves as eligible to receive it. The author of the dws believes this due diligence is sufficient to satisfy current US export laws. CIS Home | CIS Research Projects | CISPublications | Theses | Seminars | Security for Distributed Computer Systems boyko@theory.lcs.mit.edu
NIST Computer Security Division and Computer Security Research Center
Develops cryptographic methods and standards, conducts research and testing on security systems and emerging technologies, and provides education and outreach.
NIST Computer Security Division's CSRC Home page About the Computer Security Division (CSD): Mission Statement Annual Report CSD staff Contact Location Search on CSRC: Services For: Federal Community Vendor User Links: Federal Directives Policies Firstgov NIST home page NIST Visitor Info General NIST inquiries: E-mail: Public Inquiries Unit (301) 975-NIST (6478) TTY (301) 975-8295 Quick Links: CSRC Site Map CSD Publications Draft Guidelines Standards Security Guidelines (800 Series) Federal Information Processing Standards (FIPS) Federal Information Security Management Act (FISMA) Implementation Project Practices, Implementation Guides, Security Checklists Program Personal Identity Verification (PIV) of Federal employees and contractors National Vulnerability Database (NVD) Computer Security Division Focus Areas: Cryptographic Standards and Application Security Testing Security Research Emerging Technologies Security Management and Guidance A more complete listing of research areas is given here . CSD News: October 20, 2005: NIST is pleased to announce the release of Special Publication 800-87 (SP 800-87) Codes for the Identification of Federal and Federally-Assisted Organizations . SP 800-87 provides the organizational codes necessary to establish the Federal Agency Smart Credential Number (FASC-N) that is required to be included in the FIPS 201 Card Holder Unique (CHUID) and is a companion document to FIPS 201. October 19, 2005: The NIST Computer Security Division is pleased to announce publication of NIST Special Publication 800-85 (SP800-85), PIV Middleware and PIV Card Application Conformance Test Guidelines (SP800-73 Compliance) . SP800-85 provides an approach for development of conformance tests for PIV middleware and PIV card application products. The approach includes Derived Test Requirements (DTR) and Test Assertions (TA). The DTRs and TAs are based on SP 800-73 Interfaces for Personal Identity Verification. The Guidelines are to be used by the developers of software modules and testing laboratories August 16, 2005: The National Institute of Standards and Technology (NIST), Information Technology Laboratory (ITL) is seeking a highly qualified individual for the position of Division Chief for the Computer Security Division (CSD). The Division Chief provides executive direction for... Click here to learn more about the Division Chief vacancy for the Computer Security Division . May 16, 2005: NIST to hold Cryptographic Hash Function Workshop (October 31-November 1, 2005). Click link to learn more workshop details. Feb. 22, 2005: NIST has posted brief comments on the recent SHA-1 cryptanalytic attacks. NIST Computer Security Division Employment Opportunity Weekly Announcements Archived News (updated 10 19 05) Latest ITL Bulletin .pdf - October 2005 National Vulnerability Database: Helping Information Technology System Users And Developers Find Current Information About Cyber Security Vulnerabilities Latest ITL Bulletin .pdf - August 2005 Implementation Of Fips 201, Personal Identity Verification (Piv) Of Federal Employees And Contractors ITL Bulletin Archive Status of Draft Publications CSD Sponsored Events Workshops Other Security Events Would you like to receive e-mail notification(s) when NIST releases new security publications? Click here to learn more about it and how to subscribe to this list . Website Survey: Please take a moment to fill out our CSRC website survey. Your input on how to improve the site will allow us to improve our services to you. Please click here to go directly to the on-line survey form . Thank you for taking a moment for filling out the survey. Last updated: October 26, 2005 Page created: Jan. 28, 1996 Disclaimer Notice Privacy Policy Send comments or suggestions to CSRC Webmaster at NIST NIST is an Agency of the U.S. Commerce Department's Technology Administration
Cambridge Univ's Computer Security Group
Research Interests: Security Protocols, Formal Methods, Reliability of Security Systems, Medical Information Security, Cryptographic Algorithms, Steganography Information Hiding, Digital Watermarking, Hardware Security, Electronic Commerce
Computer Security Group Introduction Research Topics Seminars Meetings People in the Group Publications Projects Contact Information Resources Interests Computer Laboratory | University of Cambridge Copyright 1995-2001 by Computer Security Group Computer Laboratory, University of Cambridge. Contact group webmaster for more information or comments. Last updated: 14th February 2001.
Royal Holloway's Security research Group
Interests: Security Analysis of AES, PKI, Quantum Cryptography, mobile privacy, ECC, Digital signatures, Authentication protocols
The Information Security Group The ISG is one of the largest academic security groups in the world. It brings together in a single institution expertise in education, research and practice in the field of information security. The ISG offers an active research environment. It has a thriving PhD community, and offers world-leading masters degree programmes (campus-based and online), as well as postgraduate diploma programmes in information security. The ISG also includes the Smart Card Centre of Excellence which it founded with Vodafone and Giesecke Devrient. Top of page Last updated Thursday, 06-Oct-2005 10:04:46 BST
Macquarie University, Australia
Interests: Security techniques for wired and wireless networks, fixed and mobile distributed applications, practical quantum cryptography, Cryptography and Information Security, Computational Number Theory, Algebraic and Combinatorial Algorithms.
Division of Information and Communication Sciences Skip Links Please note: You are viewing the unstyled version of this web site. Either your browser does not support CSS (cascading style sheets) or it has been disabled. Home | Events | Handbook | Library | Search | Contact Division of Information and Communication Sciences Local Navigation Home News Events About Division Depts Centres Undergraduate Postgraduate Research Industry Schoolies Alumni Site Search Employment Staff Directory Intranet The Division of Information and Communication Sciences (ICS) at Macquarie University, Sydney, Australia, brings together the Department of Computing Department of Electronics Department of Mathematics Department of Physics Postgraduate Professional Development Program We teach, research and consult across the broad area of information and communication sciences and in the specific disciplines related to each department. Our work is underpinned by a strong collaboration with industry and a commitment to community outreach. [ Back to top ] News Events Technology Trends Seminar: New Approaches in Biometrics Macquarie University and CSIRO will be hosting the 10th Technology Trends Seminar for this year. This month's topic is 'New Approaches in Biometrics' and will be presented by Paul Watters from the Division of Information Communication Science's Postgraduate Professional Development Program at Macquarie University. Monday 14th of November 2005 5.30pm - 6.30pm with light refreshments served afterwards details about the New Approaches in Biometrics Seminar ICS Honours Scholarships 2006 Any student with an overall GPA (grade-point average) of 4.0 from their undergraduate study at Macquarie University (or equivalent from another university) is immediately eligible for an Honours Scholarship of $4,000 for the year (conditions as per those for Macquarie University Honours Scholarships). In addition, the Division of ICS will award up to 10 ICS Honours Scholarships to students with a GPA of 3.25 or above. Students with a GPA of 3.25 to 3.75 are eligible for a $4,000 scholarship, and students with a GPA greater than 3.75 are eligible for a $5,000 scholarship (conditions apply). Applicants must be graduates of a relevant bachelor degree program and be eligible for admission to one of the ICS Honours programs (please note that GPA conditions apply). Research Student Seminar Series Do you remember what it was that first drew you to science and engineering? The excitement of discovery, the challenge of invention, understanding the unknown. Do you feel as if the day to day grind and detail of research has dulled the excitement? The ICS Postgraduate Research Student Seminar Series is designed to give you an exciting glimpse into the research happening at Macquarie, without burdening you with cumbersome technical details. Presentations are accessable to everyone. Every second Wednesday at 12am-1pm details Copyright Site information Copyright Macquarie University Privacy statement CRICOS Provider No 00002J, ABN 90 952 801 237 Last Updated: Tue, 01 Nov 2005 09:30:31 Authorised by: Dean ICS
UCSD's Security and Cryptography Group
Development and analysis of crypto protocols and algos, Interests: Security of systems and networks, e-commerce, computational complexity theory, Formal methods for computer security, digital signatures, incremental cryptography
Security and Cryptography Security and Cryptography Research in CSE Welcome to the web page for security and cryptography research in the Department of Computer Science and Engineering at UCSD. We are organized into two complementary arms, and you can find out more about the people and their work via the links below: Cryptography Group Systems Security Group The cryptography group focuses on the development and analysis of cryptographic protocols and algorithms, while the systems security group focuses on the security of systems and networks. These subgroups however are closely connected and complement each other, and one of the strengths of security research in our department is the wide range of available skills and interests, and our ability in leveraging these skills in joint projects. Students in the two groups are sometimes co-located, working in the same lab in order to better complement each other. Here are some highlights of our work: Research highlights
COmputer Security and Industrial Cryptography
Kuleuven Univ, Belgium. Interests: Design, evaluation, and implementation of crypto algorithms and protocols, and on the development of security architectures for computer systems and telecom networks. Also theoretical work in crypto algorithms related to discrete mathematics.
COmputer Security and Industrial Cryptography COSIC: Home All - SISTA - COSIC - DocArch For information on a specific research group select one of the links above Home About People Research Publications YearReports Projects Education Spin-offs Honors Seminars PressReleases Vacancies Links LocalInfo Search ContactInfo COSIC: COmputer Security and Industrial Cryptography Press release: August 12, 2003 - Vulnerability in Secure Login Token Discovered ( Dutch , English ) Press release: February 27, 2003 - NESSIE project announces final selection of crypto algorithms ( English ) General info about COSIC's current and past activities . COSIC is headed by Prof. Bart Preneel and Prof. Joos Vandewalle. More about the people at COSIC. COSIC's current research and projects . COSIC's publications from 1982 until 2004. COSIC's (Master) thesis proposals and a list of the past Master theses . COSIC organizes biweekly seminars on various topics. COSIC organizes bi-annually an International Course on the State of the Art and Evolution of Computer Security and Industrial Cryptography . The last two editions were held June 3-6, 2003 , and June 5-8, 2001 . Leuven Security Excellence Consortium L-SEC has been formed in February 2002 by 8 founding members: Banksys, Cryptomathic, DATA4s, HyperTrust, K.U.Leuven, Telindus, Ubizen and Utimaco Safeware. The sponsoring member is PricewaterhouseCoopers. Upcoming Events: 24-26 5 2006 PQCrypto 2006: International Workshop on Post-Quantum Cryptography Leuven How to Contact us Copyright 2005 Katholieke Universiteit Leuven Feedback: webmaster
Saarland University, Germany
Interests: Cryptographic Copyright Protection, Secure End-User Devices, Network Telecom Security, Trusted Computing Platforms, Malicious- and Accidental-Fault Tolerance
Security and Cryptography Research Group News About us Research Projects Teaching (C) 2003 by Security and Cryptography Group Security and Cryptography Security means to reach certain aims in spite of certain threats. It is assumed that threats are caused by attackers on purpose; security against accidental, typically statistic mistakes are defined as fault tolerance. Security becomes more important the more different independent people are interacting via computers; especially in the fields of communications (internet, WWW) and secure electronic commerce there is presently a real security boom. Cryptography was for a long time only seen as the teaching of secret writing, ciphers and codes. Nowadays it comprises all algorithmic aspects of security where various parties interact without all trusting each other or the channels between them. Important individual problems are digital signatures, electronic payments or secure elections via networks.
Cryptography at Microsoft
Researching new cryptographic methods and applications. Working with standards bodies to develop security protocols. Providing internal security to Microsoft products.
Cryptography - Home Microsoft.com Home | Site Map Search: All Research Online All Microsoft.com Microsoft Research Home About Microsoft Research Research Areas People Worldwide Labs University Relations News Publications Downloads Conferences and Events Lectures Online Related Web Sites Press Resources Careers Visiting Microsoft Research Contact Us Cryptography Overview People Projects Selected Publications Overview Cryptography from the Greek: hidden writing - is the ancient science of encoding messages so that only the sender and receiver can understand them. Cryptography is now available to everyone thanks to the development of modern computers, which can perform more mathematical operations in a second than a human being could do in a lifetime. An ordinary PC can produce codes of such complexity that the most powerful supercomputer using the best available attack algorithms would not break them in a million years. Cryptography is used to secure telephone, Internet, and email communication and to protect software and other digital property. It may soon usher in a new age of money with electronic commerce. The Cryptography and Anti-Piracy group within Microsoft Research serves multiple roles: Researching new cryptographic methods and applications. Working with standards bodies to develop security protocols. Providing internal security consulting on Microsoft products. People Primary Contact: Yacov Yacobi Benaloh, Josh Charles, Denis Photo Not Available Chen, Yuqun Photo Not Available England, Paul Photo Not Available Jain, Kamal Photo Not Available Jakubowski, Mariusz Kirovski, Darko Lauter, Kristin Mihcak, Kivanc Photo Not Available Montgomery, Peter Photo Not Available Venkatesan, Ramarathnam Photo Not Available Yacobi, Yacov Yuval, Gideon Affiliate Members Petitcolas, Fabien Zhu, Bin Projects The Cryptography Group is engaged in work at the forefront of current research. Ongoing projects include: Electronic Cash and related Electronic Commerce Infrastructure Internet Security Protocols High-performance Encryption Methods Public-Key Cryptography and Infrastructures Theoretical Cryptography Computational Number Theory Intellectual Property and Content Protection Mechanisms Fighting Pirates FingerMark (Powerpoint Presentation) Watermarking Property The Secure PC Selected Publications Selected cryptography papers (in postscript form unless otherwise specified) are included below. On the economic payoff of forensic systems when used to trace counterfeited software and content , by Yacov Yacobi. Enabling Trusted Software Integrity by D. Kirovski, M. Drinic and M. Potkonjak. Replacement Attack on Arbitrary Watermarking Systems by D. Kirovski and F. A. P. Petitcolas. Code Optimization for Improved Compression by M. Drinic, D. Kirovski and H. Vo. Spread Spectrum Watermarking of Audio Signals by D. Kirovski and H. S. Malvar. PPMexe: PPM for Compressing Software by M. Drinic and D. Kirovski. Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation by K. Eisentraeger, K. Lauter and P. L. Montogomery. The equivalence of the geometric and algebraic group laws for Jacobians of genus 2 curves by K. Lauter. The maximum or minimum number of rational points on genus three curves over finite fields by Kristin Lauter. Improved upper bounds for the number of points on curves over finite fields by Everett W. Howe and Kristin E. Lauter. Constructing Elliptic Curves with a known number of points over a prime field by A. Agashe, K. Lauter and R. Venkatesan. High-Assurance Computing on Open Hardware Architectures by Yuqun Chen, Paul England, Marcus Peinado and Bryan Willman. Oblivious Hashing: Silent Verification of Code Execution by Yuqun Chen, Matthew Cary, Mariusz Jakubowski, Ruoming Pang and Ramarathnam Venkatesan. Multimedia content screening using a dual watermarking and fingerprinting system by Darko Kirovski, Henrique S. Malvar and Yacov Yacobi. A Few Thoughts on E-Commerce by Yacov Yacobi. Improved Boneh-Shaw Content Fingerprinting by Yacov Yacobi. Risk Management for E-Cash Systems with Partial Real-Time Audit by Yacov Yacobi, Netnomics 3, 119-127, 2001 Fast Exponentiation Using Data Compression by Yacov Yacobi. On the Continuum Between On-line and Off-line E-cash Systems by Yacov Yacobi. Batch Diffie-Hellman Key Agreement Systems by Yacov Yacobi. A Framework For Evaluating the Data-Hiding Capacity of Image Sources by P. Moulin and M. K. Mihcak. Cryptanalysis of Discrete-Sequence Spread Spectrum Watermarks by M. K. Mihcak, R. Venkatesan and M. Kesal. Watermarking via Optimization Algorithms for Quantizing Randomized Statistics of Image Regions by M. K. Mihcak, R. Venkatesan and M. Kesal. Blind Image Watermarking via Derivation and Quantization of Robust Semi-Global Statistics by M. K. Mihcak and R. Venkatesan. New Iterative Geometric Methods for Robust Perceptual Image Hashing by M. K. Mihcak and R. Venkatesan. A Perceptual Audio Hashing Algorithm: A Tool for Robust Audio Identification and Information Hiding by M. K. Mihcak and R. Venkatesan. Information-Theoretic Model for Image Watermarking and Data Hiding by P. Moulin, M. K. Mihcak and G. I. Lin. Iteratively Decodable Codes for Watermarking Applications by M. Kesal, M. K. Mihcak, R. Koetter and P. Moulin. Anonymous Communication and Anonymous Cash by Daniel R. Simon. Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols by Josh Cohen Benaloh. Cryptographic Defence against Traffic Analysis by Charles W. Rackoff and Daniel R. Simon. Dense Probabilistic Encryption by Josh Benaloh. Distributing the Power of a Government to Enhance the Privacy of Voters by Josh Cohen Benaloh and Moti Yung. Efficient Broadcast Time-Stamping by Josh Benaloh and Michael de Mare. An Efficient Procedure to Double and Add Points on an Elliptic Curve by Kirsten Eisentrger, Kristin Lauter, and Peter L. Montgomery. Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? by Daniel R. Simon. General Linear Secret Sharing by Josh Benaloh. Generalized Secret Sharing and Monotone Functions by Josh Benaloh and Jerry Leichter. Geometric Methods for Improving the Upper Bounds on the Number of Rational Points on Algebraic Curves over Finite Fields by Kristen Lauter (with appendix by J-P. Serre). Improving Privacy in Cryptographic Elections by Josh D. Cohen (Benaloh). Limits on the Efficiency of One-Way Permutation-Based Hash Functions by Jeong Han Kim, Daniel R. Simon, and Prasad Tetali. The Maximum of Minimum Number of Rational Points on Curves of Genus Three over Finite Fields by Kristen Lauter (with appendix by Jean-Pierre Serre). Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack by Charles W. Rackoff and Daniel R. Simon. On the Power of Quantum Computation by Daniel R. Simon. One-Way Accumulators: A Decentralized Alternative to Digital Signatures by Josh Benaloh and Michael de Mare. Receipt-Free Secret-Ballot Elections by Josh Benaloh and Dwight Tuinstra. A Robust and Verifiable Cryptographically Secure Election Scheme by Josh D. Cohen (Benaloh) and Michael J. Fischer. Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret by Josh Cohen Benaloh. Uncoercible Communication by Josh Benaloh and Dwight Tuinstra. Verifiable Secret-Ballot Elections by Josh Daniel Cohen Benaloh. WindowBox: A Simple Security Model for the Connected Desktop (in PDF format) by Dirk Belfanz and Daniel R. Simon. Also see our Microsoft Research Publications page. Manage Your Profile | Contact Us 2005 Microsoft Corporation. All rights reserved. Terms of Use | Trademarks | Privacy Statement
Information Security and Cryptography: ETH, Zurich
Interests: Information-theoretic cryptography, Secure distributed computation, Public-key cryptography and digital signatures, Number-theoretic and algebraic cryptography, Zero-knowledge protocols, Complexity theory
Cryptography and Information Security Information Security and Cryptography Research Group Home Research Publications Teaching People Events Links Information Security and Cryptography Research Group top row, left to right: Ueli Maurer , Martin Hirt middle row, left to right: Stefano Tessaro , Dominik Raub , Zuzana Beerliov , Johan Sjdin bottom row, left to right: Bartosz Przydatek , Krzysztof Pietrzak , Thomas Holenstein Mission Statement Information is becoming a crucial if not the most important resource of the economy and the society at large. Information differs radically from other resources; for instance, it can be copied without cost, it can be communicated at the speed of light, and it can be destroyed without leaving traces. This poses new challenges for the protection of this new resource and of intellectual property in general. Information security, in particular cryptography, is an enabling technology that is vital for the development of the information society. Our missions are to contribute to understanding the foundations of, and finding practical solutions for, known and emerging information security problems, to foresee and identify future issues in information security, to advance the theory of information security and cryptography as scientific disciplines, to teach our core competences to university students as well as other academic and non-academic audiences, to be a center of competence and a contact point for research institutions, the business sector, government administrations, the media, and the public at large, in all questions related to information security, to think about the impact of information technology on the society and the economy, and to enjoy the pleasure of research and teaching motivated students. Check out our group's Research Highlights and have a look at the research overview. See also a list of our Ph.D. graduates . 24-Oct-2005 wwwcrypt@inf.ethz.ch
IBM Research: Cryptography Group
Lists group members, current research, recent publications, and speakers and other activities at the T.J. Watson Research Center.
IBM Research: Cryptography Group Cryptography Research Group Welcome to the home page of the Cryptography Research Group at the IBM T.J. Watson Research Center. Current group members are: Ran Canetti, Rosario Gennaro , Shai Halevi , Hugo Krawczyk, and Tal Rabin . We are located in the Hawthorne I building, in Hawthorne, NY. We are involved in a variety of research projects: from the theoretical foundations of cryptography to the design and implementation of cryptographic protocols. Following the links below you can find out more about the research activities in our group. We are very interested in interacting with the research and academic community. In fact, we run the Cryptography Research Seminar where you can tell us about your interesting new results. Longer visits to the group are also possible. We also run a regular Crypto Reading Group to discuss recent published work in the crypto area. Meetings of the Reading Group are usually open to visitors as well. Group Links: Research Projects Group Publications Cryptography Research Seminar Other IBM Links: Security Group at the IBM Zurich Research Lab Security Research at IBM Theoretical Computer Science Research at IBM IBM Security Homepage Visitors' Information and Directions to our Lab Other Links: IACR : The International Association for Cryptologic Research ACM SIGSAC : ACM Special Interest Group on Security ACM SIGACT : ACM Special Interest Group on Theoretical Computer Science If you have any questions or feedback about this page send us email.
Indian Statistical Institute, Kolkata (Calcutta), India
Interests: Boolean functions, Stream ciphers, Block Ciphers, Hash functions, Database security, Digital Watermarking, Elliptic HyperElliptic Curve Crypto, Visual Crypto, Digital Signature Schemes
Cryptology Research Group at the Indian Statistical Institute
FSE 2006
The 13th annual Fast Software Encryption workshop, concentrating on fast and secure primitives for symmetric cryptography. Graz, Austria; 15--17 March 2006.
FSE 2006 Home Call for Papers Proceedings Submission Accepted Papers Program Registration Venue Accommodation Extra Activities Contact Fast Software Encryption 2006 March 15-17 Graz, Austria FSE 2006 is the 13th annual Fast Software Encryption workshop, for the fifth year sponsored by the International Association for Cryptologic Research(IACR). Original research papers on symmetric cryptology are invited for submission to FSE 2006. The workshop concentrates on fast and secure primitives for symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, encryption schemes, analysis and evaluation tools, hash functions, and message authentication codes (MACs). Sponsors: Dates Submission: November 25, 2005 Notification of decision: January 27, 2006 Early Registration until: February 15, 2006 Conference: March 15-17, 2006
PQCrypto 2006
International Workshop on Post-Quantum Cryptography. Katholieke Universiteit Leuven, Belgium; 24--26 May 2006.
PQCrypto 2006: International Workshop on Post-Quantum Cryptography PQCrypto 2006: International Workshop on Post-Quantum Cryptography Will large quantum computers be built? If so, what will they do to the cryptographic landscape? Anyone who can build a large quantum computer can break today's most popular public-key cryptosystems: e.g., RSA, DSA, and ECDSA. But there are several other cryptosystems that are conjectured to resist quantum computers: e.g., the Diffie-Lamport-Merkle signature system, the NTRU encryption system, the McEliece encryption system, and the HFE signature system. Exactly which of these systems are secure? How efficient are they, in theory and in practice? PQCrypto 2006, the International Workshop on Post-Quantum Cryptography, will look ahead to a possible future of quantum computers, and will begin preparing the cryptographic world for that future. Organization PQCrypto 2006 is organized by the European Network of Excellence for Cryptology ( ECRYPT ), funded within the Information Societies Technology Programme (IST) of the European Commission's Sixth Framework Programme (FP6) under contract number IST-2002-507932. PQCrypto 2006 is an activity of ECRYPT's Asymmetric Techniques Virtual Lab ( AZTEC ). Program committee: Daniel J. Bernstein, University of Illinois at Chicago Johannes Buchmann, Technische Universitt Darmstadt Jintai Ding, University of Cincinnati Louis Goubin, Universit de Versailles Tanja Lange, Danmarks Tekniske Universitet Phong Nguyen, cole Normale Suprieure Tatsuaki Okamoto, NTT Laboratories Louis Salvail, Aarhus Universitet Alice Silverberg, University of California at Irvine Joe Silverman, Brown University Martijn Stam, University of Bristol Christopher Wolf, Katholieke Universiteit Leuven Location PQCrypto 2006 will be held at the Katholieke Universiteit Leuven in Belgium from Wednesday 24 May 2006 through Friday 26 May 2006. (Eurocrypt 2006 will begin on Sunday 28 May 2006 in St. Petersburg.) Lectures There will be approximately seven invited lectures. Space has also been reserved in the schedule for contributed lectures. A record of the workshop containing all accepted papers will be provided to the participants. There will be no formal proceedings; papers may be submitted to other conferences. Important dates: submission of extended abstracts (at most 20 pages), 3 April 2006; notification, 24 April 2006; registration, 26 April 2006; workshop, 24-26 May 2006. Tentative lecture schedule: Wed 24 May 09:00-09:50 Registration Wed 24 May 09:50-12:00 Speakers Talks Wed 24 May 12:00-14:00 Lunch break Wed 24 May 14:00-18:00 Speakers Talks Thu 25 May 09:00-12:00 Speakers Talks Thu 25 May 12:00-14:00 Lunch break Thu 25 May 14:00-18:00 Speakers Talks Fri 26 May 09:00-12:00 Speakers Talks Fri 26 May 12:00-14:00 Lunch break Fri 26 May 14:00-14:50 Speakers Talks Contact If you have questions about PQCrypto 2006, contact the organizers at the following address: questions at postquantum.cr.yp.to. Version This is version 2005.08.16 of the PQCrypto 2006 web page.
IACR Calendar of Events in Cryptology
Calendar of cryptographic events all over the world, together with submission deadline. Updated several times a week.
IACR Calendar of Events in Cryptology IACR Calendar of Events in Cryptology The IACR calendar lists events (conferences, workshops, ...) that may be of interest to IACR members or deal with research in cryptology. If you want to have an event listed here, please fill out this form . (The current condition for being listed is that the description of an event must contain the substring "crypt" anywhere.) Events are sorted by date. Sort by submission deadline. 2005 First National Symposium on Cryptology ( I Ulusal Kriptoloji Sempozyumu) , November 18-20, Ankara, Turkey. Tercer Congreso Iberoamericano de Seguridad Informatica (CIBSI '05) , November 21-25, Valparaiso, Chile. Embedded Security In Cars , November 29-30, Cologne, Germany. International Conference on Information Security and Cryptology (ICISC 2005) , December 1-2, Seoul, Korea. Asiacrypt 2005 , December 4-8, Chennai, India. The First International Workshop on Security in Ubiquitous Computing Systems (SecUbiq-05) , December 6-9, Nagasaki, Japan. Indocrypt 2005 , December 10-12, Bangalore, India. The 7th International Conference on Information and Communications Security (ICICS2005) , December 10-13, Beijing, China. The first International Workshop on Security and Pervasive Multimedia Environmen , December 12-12, Irvine, CA, USA. 3rd International IEEE Security in Storage Workshop , December 13-13, San Francisco, USA. The 4th International Conference on Cryptology and Network Security (CANS05) , December 14-16, Xiamen, Fujian, China. SKLOIS Conference on Information Security and Cryptology (CISC2005) , December 15-17, Beijing, China. Tenth IMA International Conference on Cryptography and Coding (CCC) , December 19-21, Cirencester, United Kingdom. The First International Workshop on Rapid Internet Attacks , December 19-19, San Jose, CA, USA. 2006 Australasian Information Security Workshop 2006 (Network Security) , January 16-19, Hobart, Tasmania, Australia. Special Issue on Security of Computer Network and Mobile Systems of the Internat (IJWMC) , January 31-31, ., .. SASC 2006 - Stream Ciphers Revisited , February 2-3, Leuven, Belgium. (Submissions due: 2 December 2005.) Workshop on Mathematical Techniques in Cryptology (WMTC-2005) , February 10-12, Mathura, INDIA. (Submissions due: 25 November 2005.) RSA Conference 2006, Cryptographers' Track , February 13-17, San Jose, CA, USA. German Workshop "Applied Cryptography" , February 20-23, Magdeburg, Germany. Workshop "Kryptographie in Theorie und Praxis" , February 20-23, Magdeburg, Germany. 10th International Conference on Financial Cryptography and Data Security (FC06) , February 27-March 2, Anguilla, British West Indies. The third Theory of Cryptography Conference (TCC'06) , March 5-7, New York, United States. Third IEEE International Workshop on Pervasive Computing and Communication Secur , March 13-13, Pisa, Italy. International Workshop on Boolean Functions : Cryptography and Applications , March 13-15, Rouen, FRANCE. (Submissions due: 21 December 2005.) Fast Software Encryption 2006 , March 15-17, Graz, Austria. (Submissions due: 25 November 2005.) Latin American Theoretical INformatics , March 20-24, Valdivia, Chile. ACM Symposium on InformAtion, Computer and Communications Security , March 21-24, Taipei, Taiwan. ACM Symposium on Information,Computer and Communications Security , March 21-24, Taipei, Taiwan, ROC. SHARCS'06 - Special-purpose Hardware for Attacking Cryptographic Systems , April 3-4, Cologne, Germany. (Submissions due: 17 February 2006.) 5th Annual PKI RD Workshop , April 4-6, Gaithersburg, USA. 2nd Information Security Practice and Experience Conference , April 11-14, Hangzhou, China. IEEE International Workshop on Trusted and Autonomic Computing Systems , April 18-20, Vienna, Austria. 3rd International Conference on Security in Pervasive Computing (SPC 2006) , April 18-21, York, England, United Kingdom. The Second International Workshop on Security in Networks and Distributed System , April 18-20, Vienna, Austria. 7th Smart Card Research and Advanced Application Conference (CARDIS'2006) , April 19-21, Tarragona, Catalonia, Spain. The First International Conference on Availability, Reliability and Security , April 20-22, Vienna, Austria. (Submissions due: 4 December 2005.) Ninth International Workshop on Practice and Theory in Public Key Cryptography (PKC 2006) , April 24-26, New York, USA. Applied Cryptography and Information Security 06 , May 8-11, Glasgow, UK. (Submissions due: 15 December 2005.) 2006 IEEE Symposium on Security and Privacy (IEEE SP 2006) , May 21-26, Berkeley, USA. 15th International WWW Conference -- Security, Privacy, and Ethics Track (WWW2006) , May 22-26, Edinburgh, United Kingdom. International Workshop on Post-Quantum Cryptography , May 24-26, Leuven, Belgium. (Submissions due: 3 April 2006.) Eurocrypt 2006 , May 28-June 1, St. Petersburg, Russia. 4th International Conference on Applied Cryptography and Network Security , June 6-9, Singapore, Singapore. (Submissions due: 15 January 2006.) International Conference on Emerging Trends in Information and Communication Sec , June 6-9, Freiburg, Germany. (Submissions due: 6 January 2006.) 18th Annual FIRST Conference , June 25-30, Baltimore, MD, USA. (Submissions due: 30 November 2005.) Workshop on Privacy Enhancing Technologies , June 28-30, Cambridge, United Kingdom. (Submissions due: 3 March 2006.) Computer and Network Security Symposium International Wireless Communications , July 3-6, Vancouver, Canada. (Submissions due: 15 December 2005.) 33rd International Colloquium on Automata, Languages and Programming , July 9-16, S. Servolo, Venice, Italy. (Submissions due: 10 February 2006.) Third GI SIG SIDAR Conference on Detection of Intrusions Malware, and Vulnerab , July 13-14, Berlin, Germany. (Submissions due: 13 January 2006.) IEEE CEC Special Session on Evolutionary Computation in Computer Security and C , July 16-June 21, Vancouver, Canada. (Submissions due: 31 January 2006.) Algorithmic Number Theory Symposium VII (ANTS VII) , July 23-28, Berlin, Germany. (Submissions due: 15 January 2006.) Thirteenth workshop on Selected Areas in Cryptography , August 17-18, Montreal, Canada. Crypto 2006 , August 20-24, Santa Barbara (CA), USA. Fall 2006 Thematic Program in Cryptography , September 1-December 31, Toronto, Canada. Securing Cyberspace: Application and Foundations of Cryptography and Computer Se , September 11-December 15, Los Angeles, USA. International Conference on SEQUENCES AND THEIR APPLICATIONS 2006 , September 24-28, Beijing, China. (Submissions due: 1 March 2006.) IJSN Special Issue on Cryptography in Networks , October 1-1, ., .. (Submissions due: 1 March 2006.) 2007 2007 IEEE Symposium on Security and Privacy (IEEE SP 2007) , May 20-23, Berkeley, USA. Past events are archived here . Journal Calls for Papers Other Calendars Cipher's calendar (security privacy) ACM SIGACT Theory Calendar (theory of computation) Calendar from UCL Crypto Group (crypto, security) a systems and networking calendar from UCSD ACM Calendar of Events [ Calendar of events | IACR home page ] IACR
ECC 2005
The 9th Workshop on Elliptic Curve Cryptography. Technical University of Denmark, Copenhagen; 19--21 September 2005.
CACR: 2005 Conferences 2005 Conferences The 9th Workshop on Elliptic Curve Cryptography (ECC 2005) Technical University of Denmark , Copenhagen September 19, 20 21, 2005 Final Announcement Lecture slides are available here Rump session program . Photos: here and here . ECC 2005 is the ninth in a series of annual workshops dedicated to the study of elliptic curve cryptography and related areas. Over the past years the ECC conference series has broadened its scope beyond curve-based cryptography and now covers a wide range of areas within modern cryptography. For instance, past ECC conferences included presentations on hyperelliptic curve cryptography, pairing-based cryptography, quantum key distribution, AES, implementation issues, and deployments (e.g., cryptography for travel documents). At the same time ECC continues to be the premier conference on elliptic curve cryptography. It is hoped that ECC 2005 will further our mission of encouraging and stimulating research on the security and implementation of elliptic curve cryptosystems and related areas, and encouraging collaboration between mathematicians, computer scientists and engineers in the academic, industry and government sectors. As with past ECC conferences, there will be about 15 invited lectures (and no contributed talks) delivered by internationally leading experts. There will be both state-of-the-art survey lectures as well as lectures on latest research developments. Sponsors: Certicom Cryptomathic ECRYPT - European Network of Excellence in Cryptography DFG Graduierten Kolleg "Mathematische und Ingenieurwissenschaftliche Methoden fr sichere Datenbertragung und Informationsvermittlung" escrypt - Embedded Security Centre for Foundations in Cryptology and Security HGI Ruhr-University Bochum Technical University of Denmark University of Duisburg Essen, Campus Essen University of Waterloo Organizers: Gerhard Frey (University of Duisburg-Essen) Tanja Lange (Technical University of Denmark) Alfred Menezes (University of Waterloo) Christof Paar (Ruhr-Universitt Bochum) Scott Vanstone (University of Waterloo) Speakers: Peter Beelen (Technical University of Denmark, Copenhagen) Dan Bernstein (University of Illinois at Chicago, USA) Claus Diem (University Duisburg-Essen, Germany) Steven Galbraith (Royal Holloway University of London, UK) Rob Gallant (Certicom, Canada) Florian Hess (TU Berlin, Germany) Lars Knudsen (Technical University of Denmark, Copenhagen) Peter Landrock (University of Aarhus and Cryptomathic, Denmark) Kenny Paterson (Royal Holloway University of London, UK) Christophe Ritzenthaler (CRM Barcelona, Spain) Takakazu Satoh (Tokyo Institute of Technology, Japan) Martijn Stam (University of Bristol, UK) Rainer Steinwandt (Florida Atlantic University, USA) Scott Vanstone (University of Waterloo, Canada) Andre Weimerskirch (escrypt, Germany) Conference Programme: The conference programme is available here . Titles and abstracts for some of the talks are available here . There will be a Rump Session at ECC 2005, where participants can give 5-minute presentations on recent results, work in progress, or make announcements of interest to attendees. The Rump Session program is available. Summer School: After receiving so much positive feedback we decided to also have a summer school on ECC the week before, i.e. September 12.-16.th. Our school is aimed at PhD students who have some background in cryptography and mathematics and at Post-Docs in related fields. For information about the summer school can be found here . Registration: The full conference fee is 1200 DKK (approx 160 Euros) for regular attendees, and 600 DKK (approx 80 Euros) for students. The deadline for registration is August 31, but we would greatly appreciate it if you would register as early as possible. Payment can be done via bank transfer or by cash at the beginning of the conference. Please note that we cannot accept credit cards or any currency except for DKK; the amounts in Euros are stated only for convenience. The registration form is available here Travel: The Technical University of Denmark (DTU) is situated in Kongens Lyngby, in a suburb of Copenhagen, the Capital of Denmark. There are local trains commuting between Copenhagen main station and Lyngby and the ride takes 20 minutes. DTU is easy to reach by public transport, see Danish Railways for travel details. There are international trains including night trains to Copenhagen, and Copenhagen's airport is served by all major airlines. Some cheap flight companies also serve Malmv which is well connected to Copenhagen by train. More information about transportation to DTU is available here . Lectures take take place in Oticon Salen of the Technical University Denmark. This is building 107 on this map . The yellow half-points represent bus stops. The closest one is DTU Raevehoejvej. This bus stop actually exists in two different locations - if you take the 150S from the town center then it will let you out on the east of 107 on the big highway. Mount the stairs and cross the bridge, Oticon Salen is the first building you reach on the footpath once you have crossed the smaller road. Some pictures of Oticon Salen are available here . If you take bus 300S then the stop is the conveniently located one right next to the conference building. If your journey plan suggests to take the 590 or 591 then this is also very close. The stop called DTU is the east-most stop between quadrant 2 and three. It is possible to walk through the west wing of building 101. Accommodations: A list of hotels is now available. Please note that there is a big congress taking place in Copenhagen the same week as ECC, so you are strongly advised to book your accommodations as early as possible. Further information: For further information, please contact: Tanja Lange Institute for Mathematics Technical University of Denmark e-mail: t.lange@mat.dtu.dk Fax: +45 4588 1399 Phone: +45 4525 3007 Voice mail: +45 3696 7248
e-gate Open 2005
A developer contest from Schlumberger to develop e-business solution using smart cards, now closed. Winner will be announced 27 June 2005.
Axalto : e-gate open 2005 contest Worldwide USB smart card developer contest 3rd edition Registrations are now closed for the e-gate open 2005 contest. A training session has been organized by Axalto for selected contestants on January 5 and 6 2005 in Paris, France. Finalists will be featured on Axalto stand at JavaOne, San Francisco, June 27-30. Winners will be announced June 27 and publicized on this site. The field concerned is the development of new secure e-business solutions or applications using e-gate smart cards (Axalto USB smart cards). Two categories of contestants (professionals and students) are invited to develop (proof of concept) innovative solutions, using the Java Cyberflex e-gate smart cards, such as: Internet Access Solution Digital Identity Management Solution based on 2 factor authentication (Liberty Alliance) Wireless Network Access (WIFI, Wimax, 3G) Roaming and VPN (Virtual private network) Voice Over IP (VoIP) Internet on-line value added Services (Consumer) Communication (Video Conference,IP telephony) E-commerce and Banking Services (e-banking, MODS Mastercard Object DataStorage, gambling, e-broking) Entertainment (VOD, games, home network) Citizens Services (e-voting, electronic signature) Six finalists will be selected by a Jury including key leaders in the IT and e-business world and will have the opportunity to present their project to the public during the JavaOne 2005 exhibition in San Francisco, USA in June 2005. Projects will be assessed according to the following criteria : innovation, marketing appeal, ease of implementation, user-friendliness, compactness, cost-effectiveness, ease of deployment on the market, security and business potential. Schedule Registration June 14-Dec. 10, 2004 Contestants submit an outline of their projects by filling the entry form document and send it by email to egateopen@axalto.com with the following email subject : egateopen 2005 - Entry Form. Selection Dec.20, 2004 Shortlist of 30 projects to be supported through the development phase Development Dec.21, 2004 - May 2, 2005 Axalto will support contestants in developing their projects through a training session in Austin, Texas, and dedicated extranet Submission deadline May 2, 2005 Projects are to be submitted in the form of a document in English of 8 A4 pages, and Java code. Shortlisting May 19, 2005 Jury selects 6 finalists Finalists @ JavaOne 2005 June 27-30, 2005 6 finalists will present their projects at JavaOne in San Francisco, USA Prizes Gold Award 10,000 euro Silver Award 8,000 euro Bronze Award 6,000 euro Special Awards (3) 2,000 euro Gold, Silver and Bronze winners will win a VIP trip to Silicon Valley in July 2005 Rules Please click here to download the rules of the e-gate open 2005 contest. Registration Registration will be open from June 14, 2004. Entries are invited for the following categories : scientific engineering schools, universities and business schools companies specialized in electronics, computer sciences, or other software companies or integrators. Contestants are asked to submit their project on-line. Deadline: Dec. 10, 2004. Download the registration form and send it by email to egateopen@axalto.com with the following email subject : e-gate open 2005 - Entry Form. Legal Information | webmaster 2004 Axalto. All rights reserved.
CHES
Workshop on Cryptographic Hardware and Embedded Systems. Biennial. Next meeting Edinburgh, Scotland, UK; 29 August -- 1 September 2005.
Workshop on Cryptographic Hardware and Embedded Systems 2005 (CHES 2005) Workshop on Cryptographic Hardware and Embedded Systems (CHES 2005) Edinburgh, Scotland Monday Evening August 29th - Thursday September 1st, 2005 The Roxburghe Hotel Co-located with Workshop on Fault Detection and Tolerance in Cryptography , Friday September 2nd sponsored by IACR Call For Papers (in PDF format ; in Postscript format ) PROGRAM ACCEPTED PAPERS RUMP SESSION BEST PAPER AWARD BANQUET CHES 2005 Puzzle ACCOMMODATIONS TRANSPORT PARTNERS PROGRAM EDINBURGH INFO VISA INFORMATION! CALL FOR PAPERS (PDF) DATES MAILING LIST PROGRAM COMMITTEE CONTACT INFORMATION HISTORY OF CHES FORMER CHES INFO SPONSORS The focus of this workshop is on all aspects of cryptographic hardware and security in embedded systems. The workshop will be a forum of new results from the research community as well as from the industry. Of special interest are contributions that describe new methods for efficient hardware implementations and high-speed software for embedded systems, e.g., smart cards, microprocessors, DSPs, etc. We hope that the workshop will help to fill the gap between the cryptography research community and the application areas of cryptography. Consequently, we encourage submissions from academia, industry, and other organizations. All submitted papers will be reviewed. The topics of CHES 2005 include but are not limited to: Computer architectures for public-key and secret-key cryptosystems Efficient algorithms for embedded processors Reconfigurable computing in cryptography Cryptographic processors and co-processors Cryptography in wireless applications (mobile phone, LANs, etc.) Trusted computing platforms Smart card attacks and architectures Tamper resistance on the chip and board level True and pseudo random number generators Special-purpose hardware for cryptanalysis Embedded security Cryptography for pervasive computing (e.g., RFID, sensor networks) Device identification Nonclassical cryptographic technologies Side Channel Cryptanalysis Rump Session For the second time there will be a rump session at CHES. The rump session is an informal session in which participants give short presentations on recent results, work in progress, and other topics of interest to the CHES community. Presentations that are not purely technical in nature are also possible (we are not opposed to jokes and puns!) If you'd like to present at the rump session please write a 1 2 page abstract and drop it off at registration desk by noon (12:00) on Tuesday (August 30). Depending on the submissions received, the chairs will select a program for the Rump Session. The decisions will be published at registration desk by 18:00 on Tuesday. The presentations will be short, 3 slides max, 5 minutes max. You can use a computer or overhead slides (transparencies at registration desk). Best Paper Award(s) For the second time at CHES, Best Paper Award(s) will be given based on the written contribution in the proceedings. The selection committee is composed of the two program chairs. CHES Banquet The banquet takes place on Wednesday evening in the National Museum of Scotland on Chambers Street. Map and directions can be found on the CHES Banquet page. Instructions for Authors Authors are invited to submit original papers and are strongly encouraged to use our Electronic Paper Submission System. The submission must be anonymous, with no author names, affiliations, acknowledgments, or obvious references. It should begin with a title, a short abstract, and a list of keywords. The paper should be at most 12 pages (excluding the bibliography and clearly marked appendices), and at most 15 pages in total, using at least 11-point font and reasonable margins. Submissions not meeting these guidelines risk rejection without consideration of their merits. All submissions will be blind-refereed. Only original research contributions will be considered. Submissions which substantially duplicate work that any of the authors have published elsewhere, or have submitted in parallel to any other conferences or workshops that have proceedings, will be instantly rejected. The submission deadline for CHES 2005 has passed. Important Dates All deadlines end on 23:59 Pacific Standard Time (PST) on the given date. Submission deadline: March 1st, 2005. Acceptance notification: April 29th, 2005. Final Version due: May 29th, 2005. Workshop: August 29th - September 1st, 2005 (after CRYPTO 2005 , August 14th - 18th). Mailing List If you want to receive subsequent Call for Papers and registration information, please send a brief mail to mailinglist@chesworkshop.org . Program Committee Ross Anderson, Cambridge University, UK Mohammed Benaissa, The University of Sheffield, UK Suresh Chari, IBM Thomas J. Watson Research Center, USA Kris Gaj, George Mason University, USA Louis Goubin, Universite de Versailles-St-Quentin-en-Yvelines, France Jorge Guajardo, Infineon Technologies, Germany etin Kaya Ko,Oregon State University, USA Peter Kornerup, University of Southern Denmark, Denmark Pil Joong Lee, Postech, South Korea David Naccache, Gemplus, France and Royal Holloway, University of London, UK Elisabeth Oswald, Graz University of Technology, Austria Christof Paar, Ruhr-University Bochum, Germany Daniel Page, University of Bristol, UK Bart Preneel, Katholieke Universiteit Leuven, Belgium Pankaj Rohatgi, IBM Thomas J. Watson Research Center, USA Ahmad Sadeghi, Ruhr-University Bochum, Germany Kouichi Sakurai, Kyushu University, Japan David Samyde, FemtoNano, France Erkay Savas, Sabanci University, Turkey Werner Schindler, Bundesamt fr Sicherheit in der Informationstechnik, Germany Jean-Pierre Seifert, Intel, USA Nigel Smart, University of Bristol, UK Francois-Xavier Standaert, Universite Catholique de Louvain, Belgium Tsuyoshi Takagi, TU Darmstadt, Germany Elena Trichina, Spansion, USA Ingrid Verbauwhede, ESAT COSIC Division, Kotholieke Universiteit, Leuven Colin Walter, Comodo Research Lab, UK Organizational Committee All correspondence and or questions should be directed to either of the Organizational Committee members: Berk Sunar Josyula R Rao (Program co-Chair) (Program co-Chair) Electrical and Computer Eng. Dept. IBM Watson Research Center Worcester Polytechnic Institute P.O. Box 704 100 Institute Road Yorktown Heights Worcester, MA 01609-2280, USA NY 10598, USA Phone: +1 508 831-5494 Phone: +1 914 784-6692 Fax: +1 508 831-5491 Fax: +1 914 784-7455 Email: sunar@ece.wpi.edu Email: jrrao@us.ibm.com Colin Walter Christof Paar (General co-Chair) (Publicity Chair) Cryptography Dept. Electrical Eng. Information Sciences Dept. Comodo Research Lab. Ruhr-Universitt Bochum, Germany 10 Hey Street Universittsstrae 150 Bradford, BD7 1DQ, UK Bochum, D-44780 Germany Phone: +44 (0)1274 730505 Phone: +49 (0)234 32-22994 Fax: +44 (0)1274 730909 Fax: +49 (0)234 32-14389 Email: colin.walter@comodo.com Email: cpaar@crypto.rub.de History of CHES This will be the seventh CHES workshop. CHES '99 and CHES 2000 were held at WPI . CHES 2001 was held in Paris, CHES 2002 in the San Francisco Bay Area, CHES 2003 in Cologne, and CHES 2004 in Boston. The number of participants has grown to more than 200, with attendees coming from industry, academia, and government organizations. Workshop Proceedings The proceedings will be published in Springer's Lecture Notes in Computer Science (LNCS) series in time for distribution at the workshop. Accepted papers should be formatted according to the NCS default author instructions (see file "typeinst.pdf"). Notice that in order to be included in the proceedings, the authors of an accepted paper must guarantee to present their contribution at the workshop. Visa Information Very few conference attendees (if any) will need to obtain visas for entering the UK. A list of countries whose nationals are affected is given here . Some of the larger countries in the list are Turkey, India, Pakistan, China and Taiwan. The UK Home and Foreign Offices provide an anonymous on-line questionnaire here which will determine whether a visa is required. The process of obtaining the visa is usually fast and painless. Please contact the general chair if you need a letter of sponsorship to support an application. Sponsors We would like to thank the following sponsor for their generous support of CHES: Last update: September 5th, 2005.
Cryptography Decrypted
Mel and Baker, has sample chapters.
H. X. Mel Home Web Sites Glossary Book corrections Thanks Sample chapters Click here or on picture of book Web Sites Glossary Book Corrections Thanks HxM el . com last modified 2 Nov 2003 contact us: book at HxMEL.com (c) H.X. Mel Doris Baker all rights reserved
The Interactive Cryptography Tutorial
Online tutorial with useful info and links.
Cryptography Tutorial - Home Cryptography Home (15 min.) Prerequisites: 1) Know how to add and multiply numbers. 2) Have an open and inquisitive mind 3) Best viewed with Internet Explorer 4.0+. 4) 28.8KB+ connection Have you ever wondered why you can place your credit card number on Amazon's web page to pay online and no eavesdropper (believe me there are many out there) could exploit it for his Christmas shopping? Do you want to know how the British cracked the fantastic ENIGMA machine of the Germans in World War II ? Have you ever wondered how you can keep your secrets on a computer for yourself although people may try very hard to find out? If so, or you just want to learn about cryptography - the science of encoding and decoding secret information - you are welcome to use this easy-to-use, interactive cryptography tutorial. You have the opportunity to learn the secrets of cryptography in 30 lessons without having any background knowledge. check prerequisites on left The tutorial ends with a cipher challenge cipher challenge that you can break if you have mastered the ciphers introduced in this tutorial. Email the solution to the author in order to receive a precious prize. Additionally, please leave your tutorial feedback here . The author appreciates your input to continuously update and improve the tutorial. Course Overview Objective: Learn the most prominent classical and modern ciphers to understand how modern encryption techniques can protect your privacy. Who is this course for? Anybody interested learning cryptography. Outline: View course outline at head menu of this page. Course order is from left to right, top to bottom. Tutorial Version: 1.1 (15 March 2002) Lessons: 30 Lessons. Time required: About 15 hours to work entire tutorial. Individual lessons vary between 15 - 45 min (listed on each page). Technical Requirements: Tutorial is best viewed with Internet Explorer (4.0+), 28.8kb connection or faster. Instruction style: A mixture of interactive web pages and instructional text. How to benefit most: Attempt to break as many ciphers as possible on your own before reading how it is done. The interactive style allows you to test and refine your guesses. Don't move on until the cipher is mastered. The tutorial setup assumes a steady learning process. Fee: none Incentive: Break the final Cipher Challenge to win a price. Additionally, certificate for successful course completion will be issued. Author: This course was created and designed by Nils Hahnfeld with the assistance of Dr. Michael Hortmann and Salvatore Angiletta, both from the University of Bremen, Germany. Resources: Read the accompanying textbook (written in WinWord format). It explains the Ciphers and the underlying Mathematics in detail as well as shows and explains how to implement the ciphers in C++ programming language. Simply click on the provided links in the course pages, look for this symbol: Links to relevant web pages are provided on each course page as well. Feedback: Please leave your feedback on the tutorial usage here . Further Reading: - Singh, S. (1999). The Code Book - Koblitz, N. (1987). A Course in Number Theory and Cryptography. New York: Springer-Verlag - Schneier, B. (1994). Applied Cryptography. New York: John Wiley Sons, Inc. - Kahn, D. (1967). The Codebreakers: The story of secret writing. New York: Macmillan. - Stephenson, N. (2000). Cryptonomicon , 900 pages, gives a great insight from historic to modern cryptography in a quasi-fiction manner. - Kahn, D. (1991). Seizing the Enigma. Boston:Houghton Mifflin. Contact: nhahnfeld@hotmail.com or www.nilshahnfeld.com Get it started Related web sources: Enigma and the Codebreakers Yahoo's Encryption Security Britannica.com Dictionary.com Glossary PBS Online Introduction to Cryptography Enigma History Enigma Emulator top next
The Code Book
Simon Singh. Traces the development of codes and code-breaking from military espionage in ancient Greece to modern computer ciphers.
The Code Book The Code Book Back to Crypto Corner Reviews Young Readers Edition Read an Excerpt The Code Book The Secret History of Codes and Code Breaking Ever since humans began writing, they have been communicating in code. This obsession with secrecy has had dramatic effects on the outcome of wars, monarchies and individual lives. At this website, you can also find out about overseas editions , the Cipher Challenge , and twoadaptations of this books, namely the Young Readers Edition The Science of Secrecy . With clear mathematical, linguistic and technological demonstrations of many of the codes, as well as illustrations of some of the remarkable personalities behind them - many courageous, some villainous - The Code Book traces the fascinating development of codes and code-breaking from military espionage in Ancient Greece to modern computer ciphers, to reveal how the remarkable science of cryptography has often changed the course of history. Amongst many extraordinary examples, Simon Singh relates in detail the story of Mary, Queen of Scots, trapped by her own code and put to death by Elizabeth I; the strange history of the Beale Ciphers, describing the hidden location of a fortune in gold, buried somewhere in Virginia in the nineteenth century and still not found; the monumental efforts in code-making and code-breaking that influenced the outcomes of the First and Second World Wars. Now, with the Information Age bringing the possibility of a truly unbreakable code ever nearer, and cryptography one of the major debates of our times, Singh investigates the challenge that technology has brought to personal privacy today. Dramatic, compelling and remarkably far-reaching, The Code Book will forever alter your view of history, what drives it and how private your last e-mail really was. To add a bit of extra spice to The Code Book, I included ten coded messages for readers to crack. Whoever cracked the messages first would win a prize of 10,000. You can read all about the Cipher Challenge on this site. You can buy signed copies of the book here . The Code Book | Science of Secrecy | Black Chamber | Cipher Challenge Cryptograms | Crypto CD-ROM | Glyphs, Navajo etc. | Turing Memorial Crypto QA | Cryptography Links
Cryptography book recommendations
Cryptography book reviews, links to online erratas, and free book downloads. Most books have charts that recommend prerequisite books, mathematics and programming language experience.
Recommended Cryptography Books Applications and Protocols Welcome to The Crypto-Book Critic pages. Here you will find reviews of cryptography and cryptography related books that I own and have read. The ratings are as follows: a worthy read better than some waste of paper not sure yet Hopefully among these 147 books (of which Ive read and reviewed 90) youll find one that meets your individual crypto needs, and perhaps youll discover a few hard to find books to start tracking down for personal collections. 29 of the books featured here have online erratas, and 7 of the books are free to download in their entirety. Most of these books are available through Amazon (most .com, some .co.uk). If clicking an out-of-print book you will be directed (instead) to ABEbooks (a search engine for thousands of used book stores). For more information, please read the Crypto-Book Critic FAQ . There are other great crypto books out there. Feel free to do a search from here: Last Update: July 7, 2003 Biographical Conference Proceedings Cryptanalysis General Interest History Information Warfare Kids Literature Mathematics Newly Added Books Pen and Paper Politics and Organizations Programming Quantum Reference Steganography Top Picks
In Code
Sarah Flannery's supplement to her book "In Code", describing her Cayley-Purser algorithm.
Sarah Flannery on Cayley-Purser: An Investigation of a New Algorithm vs. the RSA 12 June 2000: Add link to Sarah Flannery's Web site with the original of her Cayley-Purser paper. Thanks to J-JQ. 22 November 1999: Sarah Flannery writes today the good news that she will put her paper online soon, free of any errors which may remain in this version. URL when it's available. 17 November 1999. Many thanks to Erick Wong for countless(!) typos corrected. Add William Whyte message on the successful attack on Cayley-Purser. 13 November 1999. Add transcription of Mathematica code of the RSA and C-P algorithms, which completes the HTML conversion of the full document. 12 November 1999: Add transcriptions of "The Cayley-Purser Algorithm," "Wherein lies the security of the Cayley-Purser Algorithm?," "Empirical Run-time Analysis," Post Script attack and Bibliography. Joe Author provided a PDF version of the 18 TIF images in a smaller package: http: cryptome.org flannery-cp.pdf (603KB). 11 November 1999 Source: TIF images provided by Jean-Jacques Quisquater of 18-page hardcopy provided by Jean-Franois Misarsky. Set of 18 images http: cryptome.org flannery-cp.zip (1.2MB) See press release: http: europa.eu.int comm dg12 press 1999 pr2509en.html See related January 1999 report: http: jya.com flannery.htm In equations single letters are substituted for Greek characters. Double check all equations with original images. Errata welcome; send to jy@jya.com [Document undated; apparently September 1999. Excerpts.] Cryptography: An Investigation of a New Algorithm vs. the RSA Sarah Flannery, Blarney, Co. Cork, Ireland Contents Introduction Aim The RSA Algorithm The Cayley-Purser Algorithm Wherein lies the security of the Cayley-Purser Algorithm? Some differences between the RSA and Cayley-Purser Algorithms RSA vs. Cayley-Purser -- Empirical Time Analysis Graph: CP vs. RSA -- Comparison of Enciphering Times Conclusions Post Script: An Attack on the CP Algorithm Appendix of Programmes -- Mathematica Code for RSA Algorithm -- Mathematica Code for Cayley-Purser Algorithm Bibliography Cryptography: An Investigation of a New Algorithm vs. the RSA Introduction As long as there are creatures endowed with language there will be the desire for confidential communication -- messages intended for a limited audience. Governments, companies and individuals have a need to send or store information in such a way that on the intended recipient is able to read it. Generals send orders, banks send fund transfers and individuals make purchases using credit cards. Cryptography is the study of methods to 'disguise' information so that only the intended receipient can obtain knowledge of its content. Public-Key Cryptography was first suggested in 1976 by Diffie and Hellman and a public-key cryptosystem is one which has the property that someone who knows only how [to] encipher ('disguise') a piece of information CANNOT use the enciphering key to find the deciphering key without a prohibitively lengthy computation. This means that the information necessary to send private or secret messages, the enciphering algorithm along with the enciphering key, can be made public-knowledge by submitting them to a public directory. The first public-key cryptosystem, the RSA Algorithm, was developed by Ronald Rivest, Adi Shamir and Leonard Adleman at MIT in 1977. This system, described below, has stood the test of time and is today recognised as a standard of encryption worldwide. Aim This project investigates a possible new public-key algorithm, entitled the Cayley-Purser (CP) Algorithm and compares it to the celebrated RSA public-key algorithm. It is hoped that the CP Algorithm is As secure as the RSA Algorithm and FASTER than the RSA Algorithm Firstly both algorithms are presented and why they both work is illustrated. A mathematical investigation into the security of the Cayley-Purser algorithm is discussed in the main body of the report. Some differences between the RSA and the CP algorithms are then set out. Both algorithms are programmed using the mathematical package Mathematica and the results of an empirical run-time analysis are presented to illustrate the relative speed of the CP Algorithm. RSA Public Key Cryptosystem The RSA scheme works as follows: Start Up: [This need be done only once.] Generate at random two prime numbers p and q of 100 digits or more. Calculate n = pq phi(n) = (p-1)(q-1) = n - (p + q) + 1. Generate at random a number e phi(n) such that (e, phi(n)) = 1. Calculate the multiplicative inverse, d, of e (mod phi(n)) using the Euclidean algorithm. Publish: Make public the enciphering key, KE = (n, e) Keep Secret: Conceal the deciphering key, KD = (n, d) Enciphering: The enciphering transformation is, C = f(P) = Pe (mod n) Deciphering: The deciphering transformation is, P = f--1(C) = Cd (mod n) Why the deciphering works:- The correctness of the deciphering algorithm is based on the following result due to Euler, which is a generalization of what is known as Fermat's little theorem. This result states that, aphi(n) = 1 (mod n) whenever (a, n) = 1, where phi(n), Euler's-phi function, is the number of positive integers less than n which are relatively prime to n. When n = p, a prime, phi(n) = p - 1, and we have Fermat's theorem: ap-1 = 1 (mod p) ; (a, p) = 1 If p|a then ap = a = 0 (mod p), so that for any a, ap = a (mod p) Now since d is the multiplicative inverse of e, we have ed = 1 (mod phi(n)) = ed = 1 + k phi(n), k in Z Now f--1(f(P)) = (Pe)d = Ped (mod n) and Ped = P1 + k phi(n) (mod n) (for some integer k) Now for P with (P, p) = 1, we have Pp-1 = 1 (mod p) = Pk phi(n)+1 = P (mod p) as p - 1|phi(n) This is trivially true when P = 0 (mod p), so that for all P, we have Ped = P1+k phi(n) = P (mod p) Arguing similarly for q, we have for all P, Ped = P1+k phi(n) = P (mod q) Since p and q are relatively prime, together these equations imply that for all P, Ped = P1+k phi(n) = P (mod n). The Cayley-Purser Algorithm Introduction Since this algorithm uses 2 x 2 matrices and ideas due to Purser it is called the Cayley-Purser Algorithm. The matrices used are chosen from the multiplicative group G = GL(2, Zn). The modulus n = pq, where p and q are both primes of 100 digits or more, is made public along with certain other parameters which will be described presently. Since |GL(2, Zn)| = n phi(n)2(p + 1)(q +1) we note that the order of G cannot be determined from a knowledge of n alone. Plaintext message blocks are assigned numerical equivalents as in the RSA and placed four at a time in the four positions (ordered on the first index) of a 2 x 2 matrix. This message matrix is then transformed into a cipher matrix by the algorithm and the corresponding ciphertext is then extracted by reversing the assignment procedures used in the encipherment. Because this algorithm uses nothing more than matrix multiplication (modulo n) and not modular exponentiation as required by the RSA it might be expected to encipher and decipher considerably faster than the RSA. This question was investigated, using the mathematical package Mathematica, by applying both algorithms to large bodies of text (see Tables I-IX) and it was found that the Cayley-Purser algorithm was approximately twenty-two times faster than the RSA with respect to a 200-digit modulus. Needless to say if it could be shown that this algorithm is as secure as the RSA then it would recommend itself on speed grounds alone. The question of security of this algorithm is discussed after we have described it and explained why it works. The CP Algorithm Start Up: procedure to be followed by B (the receiver): [Cryptome note: Here "in" is used for the element inclusion symbol.] Generate two large primes p and q. Calculate the modulus n = pq. Determine x and a in GL(2, Zn) such that xa-1 = ax. Calculate b = x-1a-1x. Calculate g = xr ; r in N. Publish: The modulus n and the parameters a, b, and g Start Up Procedure to be followed by A (the sender): In order to encipher the matrix corresponding to a plaintext unit for sending to B, Person A must consult the parameters made public by B and do the following: Generate a random t in N Calculate s = gt Calculate e = s-1as Calculate k = s-1bs Enciphering Procedure When the above parameters are calculated, A enciphers via ' = kk and sends ' and e to B Deciphering Procedure When A receives ' and e (s)he does the following: Calculates l = x-1ex and deciphers ' via = l'l Why the deciphering works. The deciphering works since l = x-1ex = x-1(s-1as)x = s-1(x-1ax)s : (s. being a power of x. commutes with x) = s-1(x-1a-1x)-1s = s-1b-1s : (recall that b = x-1a-1x) = (s-1bs)-1 = k-1 : ( B's enciphering key ) so that l'l = l(k k)l = (k-1k)(kk-1) = . Wherein lies the security of the Cayley-Purser Algorithm? To find the secret matrix x, known to B alone, one might attempt to solve either the equation b = x-1a-1x or g = xr In the first of these equations the matrix b is public and the matrix a-1 can be computed since both the matrix a and the modulus n are public. In the second equation only the matrix g is known and it is required to solve for both the exponent r and the base matrix x. Assuming that one knew r, solving this equation would involve extracting the rth - roots of a matrix modulo the composite integer n. Even in the simplest case, where r = 2, extracting the square root of a 2 x 2 matrix modulo n requires that one be able to solve the ordinary quadratic conruence [as written] x2 = a (mod n) when n = pq. It is known that the ability to solve this 'square root' problem is equivalent to being able to factor n. Thus we may regard an attack on x via the public parameter g as being computationally prohibitive. Solving the equation b = x-1a-1x would appear the easier option for an attack on the private matrix x as it only involves solving the set of linear equations given by xb = a-1x However the number of possible solutions to this equation is given by the order of C(a), the centraliser of a in GL(2, Zn). By ensuring that the order of this group is extremely large one can make it computationally prohibitive to search for x. To see why this is the case suppose that b = x-1a-1x and b = x1-1a-1x1 Then x-1a-1x = x1-1a-1x1 If and only if a-1xx1-1 = xx1-1a-1 If and only if xx1-1 in C(a-1) If and only if x in C(a-1)x1 Thus the number of distinct solutions of the equation is given by |C(a)| as C(a-1) = C(a). Now C(a) will have a large order if the matrix element a has a large order. By choosing our primes p and q to be of the form p = 2p1 + 1 and q = 2q1 + 1, where p1 and q1 are themselves prime, we canshow that it is almost certainly the case that an element a chosen at random from GL(2, Zn) has a large order. To see why, we begin by considering the homomorphism p of GL(2, Zn) onto Zn defined by sending a matrix into its determinant. The order of a matrix in GL(2, Zn) is at least that of the order of its image in Zn since ... If r is the order of A in GL(2, Zn) and p(A) = u then Ar = I with 1 = p(I) = p(Ar) = p(A)r = ur shows that m divides r where m is the order of u in Zn. Thus the order of A in GL(2, Zn) is at least m. In fact p(Am) = p(A)m = um = 1 shows that Am lies in SL (2, Zn) so the matrix A will have order iff Am = I in SL (2, Zn). We note also that since the maximum achievable order of an element in Zn is [p - 1, q - 1] (p - 1)(q - 1) __________ = phi(n) ___ 2 2 (as (p - 1, q - 1) 2) and since the order of SL (2, Zn) is n phi(n)(p + 1)(q + 1) the maximum achievable order of a matrix in GL(2, Zn) is [p - 1, q - 1] n phi(n)(p + 1)(q + 1) n phi(n)2(p + 1)(q + 1) 2 = |GL(2, Zn)| 2. Thus if we can show that the probability of an element having a small order in Zn is negligibly small then we will have shown that the order of an element chosen at random from GL(2, Zn) is almost certainly of 'high order.' If p = 2p1 + 1 and q = 2q1 + 1 then phi(n) = phi(pq) = (p - 1)(q - 1) = 2p12q1 = 4p1q1 with [p - 1, q - 1] = [2p1 2q1 ] = 2p1q1 = phi(n) 2 Now the possible orders of the elements in Zn are divisors of phi(n) 2 = 2p1q1 and so are 1, 2, p1 q1 2p1, 2q1 p1q1 2p1q1 and all of these orders are achieved by some elements. In fact by counting exactly how many elements correspond to each order we show that the probability of finding a unit in Zn of order less than p1q1 is negligibly small. Recall that if a in Zp has order k and b in Zq has order l then the order of c in Zn where c = a (mod p) and c = b (mod q) is [k, l], the least common multiple of k and l. Now the possible orders of a and b in Zp and Zq are divisors of p - 1 = 2p1 ; q - 1 = 2q1 respectively. The following table lists the possible orders along with the number of elements of each order. Z*p Z*q Possible Orders No. of elements of that order Possible Orders No. of elements of that order 1 1 1 1 2 1 2 1 p1 p1 - 1 q1 q1 - 1 2p1 p1 - 1 2q1 q1 - 1 By lifting elements in pairs via the CRT we obtain the elements corresponding to the different orders in Zn along with number of elements of each order. Order Number Reason 1 1 [1, 1] = 1 2 3 [1, 2] = [2, 1] = [2, 2] = 2 p1 p1 - 1 [p1, 1] = p1 q1 q1 - 1 [1, q1] = q1 2p1 3p1 - 3 [2p1, 1] = [p1, 2] =[2p1, 2] = 2p1 2q1 3q1 - 3 [1, 2q1] = [2, q1] = [2, 2q1] = 2q1 p1q1 p1q1 - p1 - q1 + 1 [p1, q1] = p1q1 2p1q1 3p1q1 - 3p1 - 3q1 + 3 [2p1, q1] = [p1, 2q1] = [2p1, 2q1] = 2p1q1 Note that if we sum all the individual counts we get exactly 4p1q1 which is the number of elements of Zn. Explanation: To see how the number of elements corresponding to an order is obtained consider the last entry in the above array: An element of order 2p1q1 in Zn can be obtained in 3 different ways by lifting pairs of elements from Zp and Zq: One way is lifting the pair (a, b) where a has an order 2p1 and b has order q1; another by lifting the pair (a, b) where a has an order p1 and b has order 2q1 and another by lifting the pair (a, b) where a has an order 2p1 and b has order 2q1. Regarding elements of order less than p1q1 as elements of 'low order' we obtain the probability of choosing an element of order less than p1q1 to be 4p1 + 4q1 - 4 ___________ 4p1q1 This is equivalent to 1 p1 + 1 q1 - 1 p1q1 In the case where p and q are both of order of magnitude 10100 this probability is approximately 2.10-100 which, by any standards, is negligibly small. Some differences between the RSA and Cayley-Purser Algorithms 1. The most significant difference between the RSA and the Cayley-Purser algorithm is the fact that the Cayley-Purser algorithm uses only modular matrix multiplication to encipher plaintext messages whereas the RSA uses modular exponentiation which requires a considerably longer computation time. Even with the powerful Mathematica function PowerMod the RSA appears (see Tables I - IX) to be over 20 times slower than the Cayley-Purser Algorithm. 2. In the RSA the parameters needed to encipher -- (n, e) --are published for the whole world to see and anyone who wishes to send a message to Bob raises their messages' numerical equivalents to the power of e modulo n. However in the Cayley-Purser algorithm the enciphering key is not made public! Only the parameters for calculating one's own key are published. This means that every sender in this system also enjoys a certain measure of secrecy with regard to their own messages. One consequence of this is that the Cayley-Purser algorithm is not susceptible to a repeated encryption attack because the sender, Alice, is the only one who knows the encryption key she used to encipher. In the RSA, however, if the order of e can be found then an eavesdropper can decipher messages. 3. Alice can choose to use a new enciphering key every time she wishes to write Bob. In the unlikely event that an eavesdropper, Eve, should find an enciphering key, she gains information about only one message and no information about the secret matrix c. By contrast, if a piece of intercepted RSA ciphertext leads to Eve being able to decipher (through repeated encryption, etc.), then she would be able to decipher all intercepted messages which are enciphered using the public exponent e. 4.In the Cayley-Purser algorithm the sender, Alice, has the ability to decipher the ciphertext which she generates using Bob's public parameters even if she loses the original message (because she knows d and therefore can get the deciphering key, k-1 = l!). Contrast this to the RSA -- Alice cannot decipher her own message once she has enciphered it using Bob's public key parameters. There is a possible advantage in this for Alice in that she could store encrypted messages on her computer ready for sending to Bob. RSA vs. Cayley-Purser Empirical Time-Analysis The times taken by the Cayley-Purser and RSA algorithms (using a modulus n of the order 10200) to encipher single and multiple copies of the Desiderata (1769 characters) by Max Ehrman are given in the following tables along with the times taken by both algorithms to decipher the corresponding ciphertext. Table I Running Time (Seconds) Message = 1769 characters Trial No. 1 2 3 Average RSA encipher 41.94 42.1 41.78 41.94 RSA decipher 40.99 41.009 41.019 41.009 C-P encipher 1.893 1.872 1.893 1.886 C-P decipher 1.502 1.492 1.492 1.4953 Table II Running Time (Seconds) Message = 2 * 1769 = 3538 characters Trial No. 1 2 3 Average RSA encipher 72.364 72.274 72.364 72.334 RSA decipher 70.942 70.952 72.144 71.346 C-P encipher 3.305 3.305 3.325 3.3016 C-P decipher 2.734 2.864 2.864 2.8206 Table III Running Time (Seconds) Message = 3 * 1769 = 5307 characters Trial No. 1 2 3 Average RSA encipher 103.078 102.808 103.489 103.125 RSA decipher 101.246 101.076 104.06 102.1273 C-P encipher 4.757 4.737 4.747 4.747 C-P decipher 3.976 4.086 4.066 4.0426 Table IV Running Time (Seconds) Message = 4 * 1769 = 7076 characters Trial No. 1 2 3 Average RSA encipher 134.434 134.323 134.333 134.363 RSA decipher 131.128 134.734 134.734 133.532 C-P encipher 6.159 6.048 6.109 6.1053 C-P decipher 5.227 4.967 4.967 5.05536 Table V Running Time (Seconds) Message = 12 * 1769 = 21228 characters RSA enc RSA dec C-P enc C-P dec Time Taken 378.078 371.254 17.435 14.371 Table VI Running Time (Seconds) Message = 24 * 1769 = 42456 characters RSA enc RSA dec C-P enc C-P dec Time Taken 509.523 511.455 22.583 18.767 Table VII Running Time (Seconds) Message = 48 * 1769 = 84912 characters RSA enc RSA dec C-P enc C-P dec Time Taken 1019.24 1023.95 44.894 36.823 Table VIII Running Time (Seconds) Message = 144 * 1769 = 254736 characters RSA enc RSA dec C-P enc C-P dec Time Taken 3154.21 3036.24 142.775 129.416 With respect to a 133MHz machine the Cayley-Purser Algorithm is on average approximately 22 times faster than the RSA where in each case the modulus n is of the order 10200. Table IX The following table illustrates the time taken for the RSA and CP Algorithms to encipher a piece of text (7076 characters in length) with varying size moduli. The ratio of the enciphering speeds is also given. Running Time (Seconds) Message containing 7076 characters Modulus RSA CP Ratio 222 digits 84.641 3.916 21.6:1 242 digits 104.71 4.036 25.9:1 262 digits 118.841 4.276 27.8:1 282 digits 131.739 4.326 30.5:1 302 digits 145.689 4.487 32.5:1 Note: The difference in times taken to encipher and ecipher in the RSA depends on the binary weight of the exponents e and d. Graph 1: Comparison of Enciphering Times - Cayley-Purser vs. RSA Number of Desiderata enciphered The piece of text used (Desiderata) contains 1769 characters. Conclusions This project (a) Shows mathematically that the CP algorithm is as secure as the RSA Algorithm. (b) Illustrates through an empirical run-time analysis that the CP Algorithm is FASTER to implement than the RSA Algorithm: the speed factor increasing with modulus size as shown on the following table: - Running Time (Seconds) Message = 4 * 1769 = 7076 characters Modulus RSA CP Ratio 222 digits 84.641 3.916 21.6:1 242 digits 104.71 4.036 25.9:1 262 digits 118.841 4.276 27.8:1 282 digits 131.739 4.326 30.5:1 302 digits 145.689 4.487 32.5:1 Post Script: An Attack on the CP Algorithm We describe an attack on the Cayley-Purser algorithm which shows that anyone with a knowledge of the public parameters a, b and g can form a multiple x' of x. This matrix x' can then be used in conjunction with e to form l = k-1 which is the deciphering key. Thus the system as originally set out is 'broken'. If x' = vx for some constant v and if e is known to an adversary then the calculation x'-1ex' = (v-1x-1) e (vx) = x-1ex = k-1 yields the deciphering key k-1. Thus any multiple of x can be used to decipher. In the CP system the matrix g is made to commute with with x so as to enable the deciphering process. This is done using the construction g = xr for some r and herein lies the weakness of the algorithm. Were g to be generated more efficiently using a linear combination of x and the identity matrix I (higher order polynomials in l reduce via the Cayley-Hamilton theorem to linear expressions in l) the system is still compromised. If the matrix g is non-derogatory (i.e. when g is reduced mod p and mod q neither of the two matrices obtained are scalar multiples of the identity) then x = uI +vg ( If thematrix g is derogatory then n can be factorised by calculating GCD (g11 - g22 , g12 , g21 , n) ) Now since g is non-derogatory (v, n) = 1 and x' = v-1x = v-1uI + g = dI + g for some d in Zn. Since b = x-1a-1x = vx-1a-1v-1x = (v-1x)-1a-1(v-1x) = b = x'-1a-1x' = x'b = a-1x' Substituting dI + g for x' in this last equation gives [dI + g]b = a-1[dI + g] = db +gb = da-1 + a-1g = d[b - a-1] = [a-1g - gb] Since a = b-1 these matrices differ in at least one position. For argument's sake let a11 = b11-1. Comparing the (1, 1) entries in the above matrix identity gives d(b11-1 - a11) = e (mod n) : e in Zn If (a11 - b11-1)-1 exists mod n the above linear congruence is uniquely solvable for d. If not a factorisation of n is obtained. Remark 1: This attack shows that anyone with a knowledge of the public parameters a, b and g can form a multiple x' of x. This matrix x' can then be used to form l = k-1 provided e is known. If e is transmitted securely on a once off basis then knowledge of a x' on its own is not enough to break the system, though then the Cayley-Purser Algorithm would no longer be public-key in nature. Remark 2: The fact that a derogatory g leads to a factorisation of the modulus n was further investigated on the assumption that knowledge of n might not severely compromise the system. However in this case also a multiple of x is obtainable. Remark 3: An analysis of the CP algorithm based on 3 x 3 matrices, though slightly more involved in its details, leads to conclusions similar to the ones just described. Remark 4: For the sake of efficiency s should be calculated as s = ag + bI rather than as s = gt. Mathematica Code for RSA CP Algorithms _______________________________________________________________ FirstPrimeAbove[n Integer] (Clear[k];k = n;While[! PrimeQ[k],k = k + 1];k) _______________________________________________________________ ConvertString[str_String] := Fold[Plus[256 1, 2], 0, ToCharacterCode[str]] _______________________________________________________________ StringToList[text_string] := Module[{blockLength = Floor[N[Log[256, n]]], strLength = StringLength[text]}, ConvertString @ Table[StringTake[text,{i, Min[strLength, 1 + blockLength - 1]}],{i, 1, strLength, blockLength}]] _______________________________________________________________ ConvertNumber[num_Integer]:= FromCharacterCode @ IntegerDigits[num,256] _______________________________________________________________ ListToString[l_List] := StringJoin[ConvertNumber @ 1] Mathematica Code for RSA Algorithm _______________________________________________________________ GeneratePQNED[digits_Integer] := (p = FirstPrimeAbove[ prep = Random[Integer, {10(digits-1), 10digits-1}]]; Catch[Do[preq = Random[Integer, 10^(digits-1), 10^digits-1}]; If[preq[=[re[,Throw[q = FirtPrimeAbove[preq]]], {100}]] n = pq;e = Random[Integer, {p, n}]; While[GCD[e, (p-1) (q-1) i = 1, e = Random[Integer, {p, n}]]; e; d = PowerMod[e, -1 (p-1) (q-1)];) _______________________________________________________________ RSAencNumber[num_Integer] := PowerMod[num, e, n] _______________________________________________________________ RSAdecNumber[num_Integer] := PowerMod[num, d, n] _______________________________________________________________ RSAenc[text_String]:= RSAencNumber[] @ StringToList[text] _______________________________________________________________ RSAdec[cipher_List]:=ListToString[RSAdecNumber[] @cipher] Mathematica Code for Cayley Purser Algorithm _______________________________________________________________ StringToMatrices[text_String]:= Partition[Parition[Flatten [Append[StringToList[text],{32,32,32}]],2],2] _______________________________________________________________ MatriceToString[l_List] := StringJoin [ ConvertNumber @Flatten[1]] _______________________________________________________________ CPpqn[digits_Integer] :=Module[{ p1 = FirstPrimeAbove[Random[Integer, {10^(Floor[digits 2]-1), 10^(Floor[digits 2])-1}]], q1 = FirstPrimeAbove[Random[Integer, {10^(Floor[digits 2]-1), 10^(Floor[digits 2])-1}]], While[PrimeQ[p = 2p1 +1], p1 = FirstPrimeAbove[p1 + 1]]; p; While[PrimeQ[q = 2q1 +1], q1 = FirstPrimeAbove[q1 + 1]]; q; n = pq; ] _______________________________________________________________ randmatrix := (Catch[ Do[m = Table[Random[Integer, {0, n}], {i, 1, 2}, {j, 1, 2}]; If[GCD[Mod[Det[m], n], n] == 1, Throw[m]], {1000}]]) _______________________________________________________________ inv[a_] := (d = Mod[Det[a], n]; i = PowerMod[d, -1, n]; {{Mod[i * a[[2, 2]], n], Mod[-i * a[[1, 2]], n]}, {Mod[-i * a[[2, 1]], n], Mod[i * a[[1, 1]], n]}}) _______________________________________________________________ mmul[j_, k_] := Mod[ {{Mod[j[[1, 1]]*k[[1, 1]], n] + Mod[j[[1, 2]]*k[[2, 1]], n], Mod[j[[1, 1]]*k[[1, 2]], n] + Mod[j[[1, 2]]*k[[2, 2]], n}}, {Mod[j[[2, 1]]*k[[1, 1]], n] + Mod[j[[2, 2]]*k[[2, 1]], n], Mod[j[[2, 1]]*k[[1, 2]], n] + Mod[j[[2, 2]]*k[[2, 2]], n]}}, n] _______________________________________________________________ CPparameters := (identity = {{1, 0}, {0, 1}}; alpha = randmatrix; Catch[Do[chi = randmatrix; If[mmul[chi, alpha] ! = mmul[alpha, chi], Throw[chi]], {10000000}]] chiinv = inv[chi]; alphainv = inv[alpha]; Catch[Do[s = Random[Integer, {2, 50}]; gamma = Mod[MatrixPower[chi, s], n]; If[gamma != identity, Throw[gamma]], {10000000}]]; Catch[Do[delta = Mod[Mod[Random[Integer, {1, n-1}]gamma, n] + Mod[Random[Integer, {1, n-1}]identity, n], n] If[delta !=identity mmul[delta, alpha] !=mmul[alpha, delta], Throw [delta]], {10000000}]; beta = mmul[mmul[chiinv, aphainv], chi]; deltainv = inv[delta]; epsilon = mmul[mmul[deltainv, alpha], delta]; kappa = mmul[mmul[deltainv, beta], delta]; lambda = mmul[mmul[chiinv, epsilon], chi];) _______________________________________________________________ CPenc[plain_String] := CPencNum [ StringToMatrices[plain]] _______________________________________________________________ CPDecNum[l_list] := Table[mmul[mmul[lambda, l[[i]]], lambda], {i, Length[l]}] _______________________________________________________________ CPEncNum[l_List] := Table[mmul[mmul[kappa, l[[i]]], kappa], {i, Length[l]}] _______________________________________________________________ CPdec[cipher_List] := MatricesToString[CPDecNum[cipher]] Bibliography:- Higgins, J and Cambell, D: "Mathematical Certificates." Math. Mag 67 (1994). 21-28. Mackiw, George: "Finite Groups of 2 x 2 Integer Matrices." Math. Mag 69 (1996). 356-361. Meijer, A.R.: "Groups, Factoring and Cryptography." Math. Mag 69 (1996). 103-109. Menezes, van Oorschot, Vanstone: Handbook of Applied Cryptography, CRC Press 1996. Salomaa, Arto: Public-Key Cryptography (2 ed.). Springer Verlag 1996. Schneier, Bruce: Applied Cryptography. Wiley 1996. Stangl, Walter D.: "Counting Squares in n." Math. Mag 69 (1996). 285-289. Sullivan, Donald: "Square Roots of 2 x 2 Matrices." Math. Mag 66 (1993). 314-316. From: "William Whyte" wwhyte@baltimore.ie To: "Jim Gillogly" jim@acm.org , "John Young" jya@pipeline.com Subject: RE: Flannery on Cayley-Purser RSA Date: Thu, 11 Nov 1999 18:10:21 -0000 Hi Jim, My take from her remark in that paper is that the system is broken as it stands, and that there's no hint yet of a repair. This is correct; the system as published by Sarah, and posted on the Cryptome website, is broken. The reason why the project still says that it's secure is to do with the rules of the science fair that Sarah entered the project in. As you remember, she won the Young Scientist award in January with the original Cayley-Purser project, which stated that the algorithm was secure. Afterwards, myself, Michael Purser, and Sarah discovered an attack against the presented algorithm that appears pretty definitive. However, for the European Young Scientists fair, the project submitted had to be the same as the project for which you won your national prize, with the exception that you could add appendices. So that's what happened: the original project, submitted verbatim, claims the system is secure; the appendix, written afterwards, exposes the attack. It might be worth html-ising the attack and posting it, too.... Baltimore's official position is that we wish Sarah well, we continue to investigate new cryptosystems, and that the security or otherwise of the Cayley-Purser algorithm doesn't affect our core business, which is building open, standards-based Public Key Infrastructures. In a world where RSA will shortly be free, and where substantial investment has already been made in infrastructures based on existing algorithms, it seemed unlikely that Cayley-Purser would ever be a commerical proposition anyway. I did make one misleading statement, right at the start of the press excitement, when I said in various forums that the security was based on the difficulty of factorisation and was assumed to be exactly as strong as RSA. Blame the excitement of the times; we hadn't looked at the system ourselves in almost a year and in the rush I posted before pausing to make sure I had my details right. I'll do better next time (if there is a next time). Cheers, William
Security Engineering
Anderson, Ross. Author describes book in his own words. He explains how "pure" cryptography is not quite so pure when expressed in the context of real world applications.
Security Engineering - A Guide to Building Dependable Distributed Systems Security Engineering - The Book Also available in Chinese and Japanese If you've already bought my book, you should look occasionally at the errata. There is a top-level errata page here , and since 21 May 2004 there are now additional, more detailed, pages of errata and new material for part 1 , part 2 , and part 3 . I will update these from time to time. There are many books on security tools, such as cryptology, access controls and intrusion detection systems, but so far there has been almost nothing on how to use them in real systems. As a result, most security systems don't fail because the protection mechanisms were weak, but because they weren't used right. Dealing with such failures has frustrated me so much, and for so many years, that I finally wrote a book. `Security Engineering - a Guide to Building Dependable Distributed Systems' goes down into the details of applications such as automatic teller machines, burglar alarms, copyright protection mechanisms, de-identified medical record databases and electronic warfare systems. It also covers a lot of technology for which there isn't any good introductory text, such as biometrics, emission security, tamper-resistant electronics and the tricks used in phone fraud. These real-world examples not only let me explain when certain types of cipher or auditing mechanism should or shouldn't be used; they also bring out a lot of system-level engineering issues, such as false alarm rates, protection versus resilience, naming, security usability, reliability, and assurance. Although the book grew out of notes for security courses I teach at Cambridge, I've rewritten the material to ensure it's accessible to the working programmer, and added lots of case histories and practical advice drawn from fifteen years' experience as an information security consultant. Check out the following: Here is the foreword , written by Bruce Schneier. Here is the table of contents . Here is a sample chapter (chapter 10) on the protection of burglar alarms and other monitoring systems. Here is another sample chapter (chapter 18) on network attack and defense. You can read chapter 1 and part of chapter 2 as excerpts on Amazon (though the graphics quality here has been deliberately downgraded). Here is the bibliography . The first three items are from the raw version of the book, as I sent it off to the publishers; chapter 18 and the bibliography are from the published version, which has been copyedited but not had its content change significantly. (The bibliography numbering changed though.) The last two are excerpts that appeared in unixreview.com . Here are the reviews and the publicity material . What is Security Engineering? Security engineering is about building systems to remain dependable in the face of malice, error or mischance. As a discipline, it focuses on the tools, processes and methods needed to design, implement and test complete systems, and to adapt existing systems as their environment evolves. It requires cross-disciplinary expertise, ranging from cryptography and computer security, through hardware tamper-resistance and formal methods, to a knowledge of applied psychology, organizational methods, audit and the law. System engineering skills - from business process analysis through software engineering to evaluation and testing - are also important, but they are not sufficient. They only deal with error and mischance rather than with malice. Why is Security Engineering Important? For generations, people have defined and protected their property and their privacy using locks, fences, signatures, seals, account books, and meters. These have been supported by a whole host of social constructs ranging from international treaties through national laws to manners and customs. This is changing, and quickly. Most records are now electronic, from bank accounts to registers of company shares and real property; and transactions are increasingly electronic, as shopping moves to the Internet. Just as important, but less obvious, are the many everyday systems that have been quietly automated. Burglar alarms no longer wake up the neighborhood but send silent messages to the police; students no longer fill their dormitory washers and dryers with coins but credit them using a smartcard they recharge at the college bookstore; locks are no longer simple mechanical affairs but are operated by electronic remote controls or swipe cards; and instead of renting videocassettes, millions of people get their movies from satellite or cable channels. Even the humble banknote is no longer just ink on paper, but may use tricks such as digital watermarks to enable many forgeries to be detected by machine. How good is all this new security technology? Unfortunately, the honest answer is `nowhere near as good as it should be'. New systems are often rapidly broken, and the same elementary mistakes are repeated in one application after another. It often takes four or five attempts to get a security design right, and that is far too much. A common view of the Internet divides its history into three waves, the first being centered around mainframes and terminals, and the second (from about 1992 until now) on PCs, browsers, and a GUI. The third wave, starting now, will see the connection of all sorts of devices that are currently in proprietary networks, standalone, and non-computerized. By 2003, there will be more mobile phones connected to the Internet than computers. Within a few years we will see many of the world's fridges, heart monitors, bus ticket dispensers, burglar alarms, and electricity meters talking IP. By 2010, `ubiquitous computing' will be part of our lives. This is the world for which I've written my book. We already have a number of the component technologies required to make ubiquitous computing dependable; the last twenty years have seen much work on the theoretical aspects of computer security and cryptology. But there has been much less on the practice. Many insecure systems are built, and the resulting safety, privacy and crime prevention problems (both real and perceived) are a significant impediment to building the `electronic society'. Once communicating embedded systems become both ubiquitous and critical, we will simply have to do better. Why do We Need Another Book on Security Engineering? I don't know of any existing textbook that's adequate. Although there are good books some of the component technologies, such as cryptography, and adequate textbooks on some others, there is no good introduction to the discipline as a whole, and large sections of it are completely uncovered. For example, much of the research in computer security focuses on information flow controls, yet there isn't any introduction to it that's both comprehensive and accessible to a working programmer. (In fact, even bright graduate students have a hard time finding their way into the subject.) For technologies such as Tempest, for attacks on smartcards, for how cash machines work, for the vulnerabilties of seals, for the interaction between computer security and economics - and for many other important topics - there are at most a few research publications, often in conference proceedings that are out of print. Even where solid textbooks exist, they often use too much mathematics and too few examples. They can be very valuable to a graduate student working under the guidance of a professor who can provide the motivation and describe the big picture, but for poor old Dilbert - or any working programmer or engineer who suddenly needs to learn a lot about security engineering, and quickly - they are too heavy going. (In fact, even I find many of them to be rather turgid.) My book is based on industrial consulting I've done over the last fifteen years, the lessons from which are written up in a number of papers on my home page ; on lecture notes I've developed over five years at Cambridge to teach courses for our students; and on training I've done for all sorts of clients from consulting firms through medics, and in a number of countries round the world. So the material has been piloted all the way from the research lab to the classroon to the server room. I hope you find it useful! How can I get my hands on a copy? The best deal may depend on where you are, what else you're buying and whether you're in a hurry. The largest sales outlet overall since publication has been Amazon.com , who sometimes give quite big discounts (try clicking on the book's title from that link). Even if they don't, using them may make sense if you're buying other stuff from them and can amortize the shipping cost. If you're in Europe, the Middle East or Africa, try Amazon.co.uk which is offering over twelve pounds off. The cheapest in the USA may be Bookpool , which offers eight dollars off, but seems to have the highest shipping costs of any online bookseller. In the UK, Student Book World gives almost ten pounds off; if you're in a hurry, PC BookShops offer free same-day delivery by courier in London, and next-day delivery throughout the UK. Barnes and Noble offers same-day delivery in Manhattan, plus three dollars off if you're in their club; while in Germany, Amazon.de will do free shipping. If you're in Oregon, or not in a hurry, look at Powells - they are in Portland, and also offer free shipment within the USA (albeit by fourth-class post). Availability and discounts vary continually - even Amazon were out of stock for most of the first month the book was on sale. For up-to-date data on stock and discounts, you can try BestBookBuys . Return to Ross Anderson's home page
Cryptography Theory and Practice
Douglas Stinson. Subtitled "Discrete Mathematics and Its Applications". Written with more emphasis on theory than practice, as acknowledged in the preface.
Cryptography Theory and Practice Cryptography Theory and Practice last modified March 27, 2000 This is the (old) web page for the first edition of the book. A second edition has now been published, and its web page is here . This cryptography textbook by Doug Stinson was published in March, 1995, by CRC Press, Inc It was reprinted with corrections in late 1996: click here This home page contains the following sections: The Fourth Printing Table of Contents Translations Reviews Solutions to Some Exercises Ciphertext for Selected Exercises [March 23, 1999] Errata List (printings 1, 2, and 3) [October 1, 1996] Errata List (fourth and later printings) [March 18, 1999] Supplementary Material The Fourth Printing At the end of Novermber, 1996, the book was reprinted with corrections. This is the fourth printing of the book. (You can check which printing of the book you have by looking at the second last line of the back of the cover page. The first number in the sequence specifies the printing. For example, the fourth printing looks like 4 5 6 7 8 9 0.) The following are the (only) changes in the fourth pringing: All errors in the Errata List have been corrected. The "Further Reading" section has been updated. Several new books are now referenced, and IACR conference proceedings are included through CRYPTO '96. Several exercises have been changed, mainly to correct bad wording and or typographical errors. The exercises that have been changed are the following: 1.4, 3.3(d), 3.8 (Figure 3.16), 4.8(b), 4.11, 4.13, 5.9, 6.6, 11.3, and 12.5. Table of Contents You can view the Table of Contents of the book. Translations Cryptography Theory and Practice has been translated into French by Serge Vaudenay . It is entitled Cryptography Thorie et Pratique and was published by International Thomson Publishing France, 1996. The book has also been translated into Japanese by Kouichi Sakurai . Reviews There are now several reviews of the book. The Cryptology Column, SIGACT News, vol. 28, 2, (1995), pp. 18-20; review by Gilles Brassard Cryptologia, vol. 20 (1996), pp. 14-15; review by Louis Kruh Computer and Communications Security Reviews, vol. 4, No. 3 (1995), p. 48 Mathematical Reviews, November 1996, MR 96k:94015; review by Yvo Desmedt Cipher, Electronic Issue (EI) 18, November 11 1996, on-line review by Bob Bruen Solutions to Some Exercises Answers to some of the exercises can be found here . Ciphertext for Selected Exercises Ciphertext for some of the exercises can be found here . Errata List (Printings 1, 2, and 3) I have constructed an errata list, which can be found here . Errata List (Fourth and later printings) I have constructed an errata list for the fourth and later printings, which can be found here . Supplementary Material Here are some supplementary notes on specific topics, stored in the form of postscript files: The Vigenere Tableau Involutory Keys in the Affine Cipher Inverting Matrices over Rings Combining LFSRs to Achieve Nonlinearlity Cryptanalyzing a Keystream Obtained from the Product of Two LFSRs On the Decryption Exponent of RSA RSA, Factoring, and Squeamish Ossifrage The Pohlig-Hellman Algorithm The Group Operation for Elliptic Curves Finding Primitive Elements in Z_p A More Efficient Method of Breaking a Vigenere Cipher I also maintain bibliographies on research papers in two areas of cryptography: secret sharing schemes and authentication codes . Doug Stinson's Address Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario, N2L 3G1 Canada Telephone: (519) 888-4567, ext. 5590 Fax: (519) 725-5441 FirstInitialLastName@uwaterloo.ca
A Course in Number Theory and Cryptography
Neal Koblitz. An algorithmic approach that covers basic arithmetic topics all the way to elliptic curves.
Springer - Home Please enable Javascript in your browser to browse this website. All Author Editor Title ISBN ISSN Series Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom Choose a discipline: Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Our services for: Ads and Corporate Sales Authors Booksellers Book Reviews Instructors Librarians Rights Permissions Subscription Agencies Developing Countries SpringerLink Online Libraries: Find Springer online journals, books and book series in the subject collection of your choice. Please select: Behavioral Science Biomedical and Life Sciences Business and Economics Chemistry and Materials Science Computer Science Earth and Environmental Science Engineering Humanities, Social Sciences and Law Mathematics Medicine Physics and Astronomy Online publishing service with now over 1200 journals ...More Unlocking the Gateway to Historic Scientific Research Springer is pleased to introduce the new Online Archives database. Now, access to the previously hard to find works of countless scientists are just a few mouse clicks away. We offer a total of 2 million archive records comprising approximately 1,200 journals. ...More Bruno Siciliano new President of IEEE RAS The Springer editor Bruno Siciliano is the new president of the IEEE Robotics and Automation Society. Siciliano has been elected as President Elect for 2006-2007 and he will succeed for 2008-2009. Siciliano is Editor of "Springer Tracts in Advanced Robotics". ...More Company News Springer Authors Among Nobel Prize Winners 2005 This year there are nine Springer authors among the Nobel Prize Winners in the categories Medicine, Physics, Chemistry and Economic Sciences. ...More Cooperation between prestigious publishers Springer has now made a high quality collection of Chinese journals available to worldwide academic institutions, corporate libraries, scientists and researchers. Chinese Library of Science Sign up for SpringerAlerts and save! Benefit from attractive savings on Springer books by signing up for Springers free new book e-mail notification service. New title info, news and special announcements: with SpringerAlerts, it pays to be informed. ...More Special Pre-publication Price Genomics and Proteomics in Molecular Medicine This new title published within Springer's Encyclopedic References program provides a broad overview of the topics and issues central to understanding molecular biology and molecular medicine, in addition to the latest information on developments in the field. ...More Computer Science New Insights into Darwin's Early Influences Springer author Mark Whitehorn was recently featured on three British radio and TV stations. Whitehorn is part of a research team studying early influences on Charles Darwin in order to better understand how he came to develop the theory of evolution. ...More Oncology: An Evidence-Based Approach Written by experts from all fields of cancer care, this up-to-date and comprehensive text reflects the principles and current practice of oncology. The consistent evidence-based approach enables readers to make treatment decisions on the basis of concrete data ... More 199,95 Prepublication price149,95 valid until March 31, 2006 You save 50,00 Springer Online Products Journals, eBooks and online reference works ...More SpringerAlerts Receive email updates on new books and journals ...More Springer Open Choice authors choose how they want their articles distributed. ...More New Forthcoming Titles Stay up to date in your field through new titles ...More Browse Journals by Subject Select a subject below to browse all available journals, plus view tables of contents, get access to free electronic sample copies, and much more. Please select: Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Springer Journals A - Z Browse our complete journals archive. ...More 2005 Journals Price List Click here to see prices for 2005. ...More Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
The Mathematics of Ciphers
S.C. Coutinho. An introduction to number theory and its applications to cryptography. A revised and updated translation from original in Portuguese.
rsabook S. C. Coutinho The Mathematics of Ciphers: Number theory and RSA cryptography About the book Table of contents Download the errata (ps file) Hints for classroom use Portuguese edition About the book This is an introduction to number theory and its applications to cryptography. The aim of the book is to explain in detail how the public key cryptosystem known as RSA works. The system was invented in 1977 by Rivest, Shamir and Adleman--hence RSA--and it is one of the most successful of the public key cryptosystem now in use in commercial applications. Althouth this is the aim of the book, we do not follow a straight path to this end. Instead we stroll about the landscape, never forgetting our aim, but stopping to explore whatever reachs are available on the way. Thus the book includes a chapter on group theory, and it is pepered with historical notes that range from biographical facts on famous mathematicians to little anecdotes. The mathematics behind most of the books subject is, naturally enough, number theory. Most of the traditional topics of a beginners course on number theory are to be found here. Thus there are chapters on the Euclidean algorithm, factorization of integers, primes, modular arithmetic, Fermat's little theorem, the Chinese remainder theorem and Mersenne and fermat numbers. However we follow na algorithmic approach, so that the proofs the theorems are, whenever possible, of a constructive nature. Back to the top Table of contents 1. Fundamental algorithms (division and Euclidean algorithms) 2. Unique factorization 3. Prime numbers 4. Modular arithmetic 5. Induction and Fermat 6. Pseudoprimes 7. Systems of congruences 8. Groups 9. Mersenne and Fermat 10. Primality tests and primitive roots 11. The RSA cryptosystem Back to the top Hints for classroom use This book was written for an introductory course on algebra and number theory aimed at first year Computer Science students. The Brazilian edition has been used in such a course for several years now. The course lasts one semester (usually 16 weeks, with two 2-hour lectures per week). You will find below some details about how I use the book when I teach this course: 1. The course lecture by lecture ( first part and second part ) 2. A sample of exam questions . (ps file). Back to the top Last update: January 2002.
Contemporary Cryptology
Gustavus J. Simmons. Subtitled "The Science of Information Integrity". Has emphasis on the cryptographic elements of the subject.
Wiley::Contemporary Cryptology: The Science of Information Integrity Location: Slovenia | change location Shopping Cart My Account Help Contact Us By Keyword By Title By Author By ISBN By ISSN Wiley Engineering Electrical Electronics Engineering Communication Technology Communication System Security Contemporary Cryptology: The Science of Information Integrity Related Subjects General Communication Technology Microwave Theory Techniques Mobile Wireless Communications Networks Optical Communications Satellite Communications Signal Processing Join an Engineering Mailing List Related Titles Communication System Security Modern Radio Science 1999 (Hardcover) by M. A. Stuchly (Editor) Review of Radio Science 1996-1999 (Hardcover) by W. Ross Stone (Editor) Radio Wave Propagation in the Marine Boundary Layer (Hardcover) by Alexander Kukushkin Multimedia Storage and Retrieval: An Algorithmic Approach (Hardcover) by Jan Korst, Verus Pronk Compressed Video Communications (Hardcover) by Abdul H. Sadka MPEG-4 Facial Animation: The Standard, Implementation and Applications (Hardcover) by Igor S. Pandzic (Editor), Robert Forchheimer (Editor) H.264 and MPEG-4 Video Compression: Video Coding for Next-generation Multimedia (Hardcover) by Iain E. G. Richardson Communication System Security Contemporary Cryptology: The Science of Information Integrity Gustavus J. Simmons (Editor) ISBN: 0-7803-5352-8 Paperback 656 pages January 1999, Wiley-IEEE Press 71.50 104.20 Add to Cart This price is valid for Slovenia. Change location to view local pricing and availability. Description Table of Contents Read Excerpt: Chapter (PDF) Read Excerpt: Table of Contents (PDF) The field of cryptography has experienced an unprecedented development in the past decade and the contributors to this book have been in the forefront of these developments. In an information-intensive society, it is essential to devise means to accomplish, with information alone, every function that it has been possible to achieve in the past with documents, personal control, and legal protocols (secrecy, signatures, witnessing, dating, certification of receipt and or origination). This volume focuses on all these needs, covering all aspects of the science of information integrity, with an emphasis on the cryptographic elements of the subject. In addition to being an introductory guide and survey of all the latest developments, this book provides the engineer and scientist with algorithms, protocols, and applications. Of interest to computer scientists, communications engineers, data management specialists, cryptographers, mathematicians, security specialists, network engineers. Printer-ready version E-mail a friend Copyright 2000-2005 by John Wiley Sons, Ltd. or related companies. All rights reserved. Please read our Privacy Policy
Primality and Cryptography
Evangelos Kranakis. A comprehensive account of recent algorithms developed in computational number theory and primality testing.
Wiley::Primality and Cryptography Location: Slovenia | change location Shopping Cart My Account Help Contact Us By Keyword By Title By Author By ISBN By ISSN Wiley Computing Computer Science Networking Security Primality and Cryptography Related Subjects UNIX Networking Windows NT Windows 2000 General Networking LINUX Networking Join a Computing Mailing List Related Titles Security Internet Privacy For Dummies (Paperback) by John R. Levine, Ray Everett-Church, Greg Stebben, David Lawrence (Foreword by) Storage Security: Protecting SANs, NAS and DAS (Paperback) by John Chirillo, Scott Blaul Security+ Certification For Dummies (Paperback) by Lawrence H. Miller, Peter H. Gregory Security+ Prep Guide (Paperback) by Ronald L. Krutz, Russell Dean Vines Secrets of Computer Espionage: Tactics and Countermeasures (Paperback) by Joel McNamara Firewalls For Dummies, 2nd Edition (Paperback) by Brian Komar, Ronald Beekelaar, Joern Wettern Cryptography For Dummies (Paperback) by Chey Cobb Security Primality and Cryptography Evangelos Kranakis ISBN: 0-471-90934-3 Hardcover 252 pages April 1986 250.00 375.00 Add to Cart This price is valid for Slovenia. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 3 days delivery time for paperbacks, and 10 days for hardcovers. The book is not returnable. Description Table of Contents A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretical study of public key cryptography and pseudorandom generators. Unique in its approach, the book will be a valuable addition to computer literature. Printer-ready version E-mail a friend Copyright 2000-2005 by John Wiley Sons, Ltd. or related companies. All rights reserved. Please read our Privacy Policy
RSA Security's Official Guide to Cryptography
Burnett and Paine. Explains the differences between symmetric-key and public-key cryptography, how PKI and X.509 affect security and how the RSA algorithm works within protocols.
Online Book Store - Buy Books Online at McGraw-Hill Professional Books Home Contact Us Customer Service About Us For Authors Help Search: All Subjects Aviation Business Careers College Computing E-Bookstore Engineering Architecture Foreign Language Reference General Self Help Medical Science Math Sports Recreation Telecommunications Test Prep Study Guides Search Tips My Account View Cart Checkout Aviation Business Careers College Computing Engineering Architecture Foreign Language Reference General Self Help International Marine Medical Schaum's Science Math Sports Recreation Telecommunications Test Prep Study Guides Resources About Us Contact Us Corp. Govt. Resources Customer Service For Authors Help International Offices Library Services Privacy Notice Site Map Technical Support DeMystified Series There is no easier, faster, or more practical way to learn the really tough subjects than with the DeMystified Series! Click here to view our selection of DeMystified titles at 30% off! The McGraw-Hill Dictionary of Engineering - Digital Edition Now you can download our Engineering Reference Software FREE! Derived from the world-renowned McGraw-Hill Dictionary of Scientific and Technical Terms, 6th Ed., this reference software offers a wealth of essential information in a convenient, quick-find format. The Digital Edition brings you thousands of terms from all major engineering disciplines, from construction to chemical engineering to telecommunications. Register for your copy today ! Learn more about the new 16th edition of Harrison's Principles of Internal Medicine. The site includes: sample chapters, author biographies, table of contents, access to the Harrison's e-Supplement, and more. Visit Harrisons16.com! New Releases QuickBooks 2006 The Official Guide by Ivens, Kathy $29.99 USD See DOI for More Info Qty The Outside-In Corporation by Bund, Barbara $27.95 USD See DOI for More Info Qty Why Customers Do What They Do by Cohen, Marshal $24.95 USD See DOI for More Info Qty The Irwin Handbook of Telecommunications, 5E by Green, James Harry $129.95 USD See DOI for More Info Qty The Standard Poor's Guide to Selecting Stocks by Kaye, Michael $24.95 USD See DOI for More Info Qty Perfect Phrases for Motivating and Rewarding Employees by Diamond, Harriet Diamond, Linda $9.95 USD See DOI for More Info Qty Implementation How to Transform Strategic Initiatives into Blockbuster Results by Bodley-Scott, Sam $29.95 USD See DOI for More Info Qty Hemingway's Hurricane by Scott, Phil $24.95 USD See DOI for More Info Qty Perfect Digital Photography by Kinghorn, Jay Dickman, Jay $39.95 USD See DOI for More Info Qty First Shot by Craddock, John $24.95 USD See DOI for More Info Qty Healing Gourmet Eat to Fight Cancer by Healing Gourmet Liu, Simin McManus, Kathy Carlino, John $16.95 USD See DOI for More Info Qty Accounting Demystified by hart, leita $19.95 USD See DOI for More Info Qty Why Is My Child?s ADHD Not Better Yet? by Gottlieb, David Shoaf, Thomas Graff, Risa $16.95 USD See DOI for More Info Qty McGraw-Hill's SAT II Biology by Zinn, Stephanie $14.95 USD See DOI for More Info Qty Promotion Code Responding to a promotion?Please enter your Special Reference Code here: Sign Up Learn about new books, special offers, discounts, and promotions in your field of interest. Click here to sign up. Privacy Notice Our Brands International Marine Home | Contact Us | Customer Service | About Us | For Authors | Help eBookstore | Corporate Government Resources | International Offices | Library Services | Site Map | Technical Support Aviation | Business | Careers | College | Computing | Engineering Architecture | International Marine | Languages Reference General Self Help | Medical | Schaums Outlines | Science Math | Sports Recreation | Telecommunications | Test Prep Study Guides Copyright 2005 The McGraw-Hill Companies . All rights reserved. Any use is subject to the Terms of Use and Privacy Notice.
Coding Theory and Cryptography
David Joyner, editor. Proceedings of the 'Conference on Coding Theory, Cryptography, and Number Theory' held at the U.S. Naval Academy during October 25-26, 1998
Springer - Home Please enable Javascript in your browser to browse this website. All Author Editor Title ISBN ISSN Series Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom Choose a discipline: Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Our services for: Ads and Corporate Sales Authors Booksellers Book Reviews Instructors Librarians Rights Permissions Subscription Agencies Developing Countries SpringerLink Online Libraries: Find Springer online journals, books and book series in the subject collection of your choice. Please select: Behavioral Science Biomedical and Life Sciences Business and Economics Chemistry and Materials Science Computer Science Earth and Environmental Science Engineering Humanities, Social Sciences and Law Mathematics Medicine Physics and Astronomy Online publishing service with now over 1200 journals ...More Unlocking the Gateway to Historic Scientific Research Springer is pleased to introduce the new Online Archives database. Now, access to the previously hard to find works of countless scientists are just a few mouse clicks away. We offer a total of 2 million archive records comprising approximately 1,200 journals. ...More Bruno Siciliano new President of IEEE RAS The Springer editor Bruno Siciliano is the new president of the IEEE Robotics and Automation Society. Siciliano has been elected as President Elect for 2006-2007 and he will succeed for 2008-2009. Siciliano is Editor of "Springer Tracts in Advanced Robotics". ...More Company News Springer Authors Among Nobel Prize Winners 2005 This year there are nine Springer authors among the Nobel Prize Winners in the categories Medicine, Physics, Chemistry and Economic Sciences. ...More Cooperation between prestigious publishers Springer has now made a high quality collection of Chinese journals available to worldwide academic institutions, corporate libraries, scientists and researchers. Chinese Library of Science Sign up for SpringerAlerts and save! Benefit from attractive savings on Springer books by signing up for Springers free new book e-mail notification service. New title info, news and special announcements: with SpringerAlerts, it pays to be informed. ...More Special Pre-publication Price Genomics and Proteomics in Molecular Medicine This new title published within Springer's Encyclopedic References program provides a broad overview of the topics and issues central to understanding molecular biology and molecular medicine, in addition to the latest information on developments in the field. ...More Computer Science New Insights into Darwin's Early Influences Springer author Mark Whitehorn was recently featured on three British radio and TV stations. Whitehorn is part of a research team studying early influences on Charles Darwin in order to better understand how he came to develop the theory of evolution. ...More Oncology: An Evidence-Based Approach Written by experts from all fields of cancer care, this up-to-date and comprehensive text reflects the principles and current practice of oncology. The consistent evidence-based approach enables readers to make treatment decisions on the basis of concrete data ... More 199,95 Prepublication price149,95 valid until March 31, 2006 You save 50,00 Springer Online Products Journals, eBooks and online reference works ...More SpringerAlerts Receive email updates on new books and journals ...More Springer Open Choice authors choose how they want their articles distributed. ...More New Forthcoming Titles Stay up to date in your field through new titles ...More Browse Journals by Subject Select a subject below to browse all available journals, plus view tables of contents, get access to free electronic sample copies, and much more. Please select: Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Springer Journals A - Z Browse our complete journals archive. ...More 2005 Journals Price List Click here to see prices for 2005. ...More Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Algebraic Aspects of Cryptography
Neal Koblitz. A textbook for a course, or self-instruction, in cryptography with emphasis on algebraic methods.
Springer - Home Please enable Javascript in your browser to browse this website. All Author Editor Title ISBN ISSN Series Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom Choose a discipline: Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Our services for: Ads and Corporate Sales Authors Booksellers Book Reviews Instructors Librarians Rights Permissions Subscription Agencies Developing Countries SpringerLink Online Libraries: Find Springer online journals, books and book series in the subject collection of your choice. Please select: Behavioral Science Biomedical and Life Sciences Business and Economics Chemistry and Materials Science Computer Science Earth and Environmental Science Engineering Humanities, Social Sciences and Law Mathematics Medicine Physics and Astronomy Online publishing service with now over 1200 journals ...More Unlocking the Gateway to Historic Scientific Research Springer is pleased to introduce the new Online Archives database. Now, access to the previously hard to find works of countless scientists are just a few mouse clicks away. We offer a total of 2 million archive records comprising approximately 1,200 journals. ...More Bruno Siciliano new President of IEEE RAS The Springer editor Bruno Siciliano is the new president of the IEEE Robotics and Automation Society. Siciliano has been elected as President Elect for 2006-2007 and he will succeed for 2008-2009. Siciliano is Editor of "Springer Tracts in Advanced Robotics". ...More Company News Springer Authors Among Nobel Prize Winners 2005 This year there are nine Springer authors among the Nobel Prize Winners in the categories Medicine, Physics, Chemistry and Economic Sciences. ...More Cooperation between prestigious publishers Springer has now made a high quality collection of Chinese journals available to worldwide academic institutions, corporate libraries, scientists and researchers. Chinese Library of Science Sign up for SpringerAlerts and save! Benefit from attractive savings on Springer books by signing up for Springers free new book e-mail notification service. New title info, news and special announcements: with SpringerAlerts, it pays to be informed. ...More Special Pre-publication Price Genomics and Proteomics in Molecular Medicine This new title published within Springer's Encyclopedic References program provides a broad overview of the topics and issues central to understanding molecular biology and molecular medicine, in addition to the latest information on developments in the field. ...More Computer Science New Insights into Darwin's Early Influences Springer author Mark Whitehorn was recently featured on three British radio and TV stations. Whitehorn is part of a research team studying early influences on Charles Darwin in order to better understand how he came to develop the theory of evolution. ...More Oncology: An Evidence-Based Approach Written by experts from all fields of cancer care, this up-to-date and comprehensive text reflects the principles and current practice of oncology. The consistent evidence-based approach enables readers to make treatment decisions on the basis of concrete data ... More 199,95 Prepublication price149,95 valid until March 31, 2006 You save 50,00 Springer Online Products Journals, eBooks and online reference works ...More SpringerAlerts Receive email updates on new books and journals ...More Springer Open Choice authors choose how they want their articles distributed. ...More New Forthcoming Titles Stay up to date in your field through new titles ...More Browse Journals by Subject Select a subject below to browse all available journals, plus view tables of contents, get access to free electronic sample copies, and much more. Please select: Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Springer Journals A - Z Browse our complete journals archive. ...More 2005 Journals Price List Click here to see prices for 2005. ...More Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Codes and Ciphers
Robert Churchhouse. Describes and analyses systems from the earliest to the most recent.
Mathematics Statistics - Cambridge University Press Home Science, Technology Medicine Mathematics Statistics Mathematics Statistics Cambridge University Press is the largest academic publisher of books in pure and applied mathematics and statistics. Our full list of titles includes textbooks for both graduate and undergraduate courses, works of reference, user's guides, and monographs spanning the following range of subjects. Much of our publishing is concentrated in our collection of highly-regarded series . Algebra, Geometry and Topology Analysis Probability Dynamical Systems and Differential Equations Financial Mathematics Foundations, Combinatorics Logic Mathematical Association of America Mathematics for Science and Engineering Number Theory Numerical Analysis and Computing Statistics and Applied Probability View pdf print catalogues in your subject, at Catalogshop Other Areas Science, Technology Medicine Textbooks English Language Teaching Humanities Social Sciences Resources Schools Colleges Reference General Interest Series News and Events Bibles eBooks Corporate and Special Sales Journals Quick Search Advanced Search Features A rigorous course in the calculus of functions of a real variable. Differential Equations are central to science, engineering and mathematics This is a lively textbook providing a solid introduction to financial option valuation for undergraduate students The complete introduction for students The outstanding resource for scientific computing The best books on the most fascinating subjects to challenge and entertain. Cambridge University Press 2005. Privacy Policy | Site map | Contacts
Decrypted Secrets
Friedrich L. Bauer. Subtitled "Methods and Maxims of Cryptology". Covers both cryptography and cryptanalysis.
Springer - Home Please enable Javascript in your browser to browse this website. All Author Editor Title ISBN ISSN Series Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom Choose a discipline: Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Our services for: Ads and Corporate Sales Authors Booksellers Book Reviews Instructors Librarians Rights Permissions Subscription Agencies Developing Countries SpringerLink Online Libraries: Find Springer online journals, books and book series in the subject collection of your choice. Please select: Behavioral Science Biomedical and Life Sciences Business and Economics Chemistry and Materials Science Computer Science Earth and Environmental Science Engineering Humanities, Social Sciences and Law Mathematics Medicine Physics and Astronomy Online publishing service with now over 1200 journals ...More Unlocking the Gateway to Historic Scientific Research Springer is pleased to introduce the new Online Archives database. Now, access to the previously hard to find works of countless scientists are just a few mouse clicks away. We offer a total of 2 million archive records comprising approximately 1,200 journals. ...More Bruno Siciliano new President of IEEE RAS The Springer editor Bruno Siciliano is the new president of the IEEE Robotics and Automation Society. Siciliano has been elected as President Elect for 2006-2007 and he will succeed for 2008-2009. Siciliano is Editor of "Springer Tracts in Advanced Robotics". ...More Company News Springer Authors Among Nobel Prize Winners 2005 This year there are nine Springer authors among the Nobel Prize Winners in the categories Medicine, Physics, Chemistry and Economic Sciences. ...More Cooperation between prestigious publishers Springer has now made a high quality collection of Chinese journals available to worldwide academic institutions, corporate libraries, scientists and researchers. Chinese Library of Science Sign up for SpringerAlerts and save! Benefit from attractive savings on Springer books by signing up for Springers free new book e-mail notification service. New title info, news and special announcements: with SpringerAlerts, it pays to be informed. ...More Special Pre-publication Price Genomics and Proteomics in Molecular Medicine This new title published within Springer's Encyclopedic References program provides a broad overview of the topics and issues central to understanding molecular biology and molecular medicine, in addition to the latest information on developments in the field. ...More Computer Science New Insights into Darwin's Early Influences Springer author Mark Whitehorn was recently featured on three British radio and TV stations. Whitehorn is part of a research team studying early influences on Charles Darwin in order to better understand how he came to develop the theory of evolution. ...More Oncology: An Evidence-Based Approach Written by experts from all fields of cancer care, this up-to-date and comprehensive text reflects the principles and current practice of oncology. The consistent evidence-based approach enables readers to make treatment decisions on the basis of concrete data ... More 199,95 Prepublication price149,95 valid until March 31, 2006 You save 50,00 Springer Online Products Journals, eBooks and online reference works ...More SpringerAlerts Receive email updates on new books and journals ...More Springer Open Choice authors choose how they want their articles distributed. ...More New Forthcoming Titles Stay up to date in your field through new titles ...More Browse Journals by Subject Select a subject below to browse all available journals, plus view tables of contents, get access to free electronic sample copies, and much more. Please select: Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Springer Journals A - Z Browse our complete journals archive. ...More 2005 Journals Price List Click here to see prices for 2005. ...More Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Cryptography for Visual Basic
Richard Bondi. Subtitled "A Programmer's Guide to the Microsoft CryptoAPI" which describes what the book is about.
bondi Cryptography for Visual Basic: A Programmers Guide to the Microsoft CryptoAPI "This is essential reading for anyone who needs to understand Microsofts CryptoAPI, its strengths and its limitations." Bruce Schneier, author of Applied Cryptography and CTO of Counterpane Internet Security, Inc See authors description below. Publisher John Wiley Sons Author Richard Bondi Pub. Date September 2000 ISBN 0471381896 Format Paperback CD, 480pp Purchase Compare prices at Bestbookbuys Fatbrain Amazon Authors Description I wrote this book in order to make strong cryptography available to as many Visual Basic programmers as possible. The best way to do that was to write some very intuitive VB COM wrappers, and release them to the world with an Open Source license. That kind of license both permits and encourages programmers to make the source code available to other programmers, and to modify it for their own use, free of charge. (You can read more about Open Source licenses here .) Unfortunately, cryptography is complicated. That means that there can be no such thing as simple COM cryptography objects per se. In order to program with cryptography, a programmer must first have a good grasp of the basics of modern cryptography. Therefore my approach was to write a book that does that, and then write my COM objects so that they would be intuitive and simple for someone who understands cryptography. So my book has three main goals: Explain modern cryptography to Visual Basic programmers (Chapter 1). Provide Visual Basic programmers with a set of COM objects that are very intuitive once you understand modern cryptography, and to make the source code freely available (Chapter 5, Appendix B, and the source code on the CDROM). Show Visual Basic programmers how to call Microsofts built-in cryptography API (the CryptoAPI) (Chapters 2 through 9), so they can understand the source code of my COM objects, and write more CryptoAPI code without me. My COM objects for calling the CryptoAPI are called WCCO (Wiley CryptoAPI COM Objects). The object model is simple: there is a CryptoAPI provider object, a key container object, a session key object, a message text object, an RSA key pair object, and a hash object. So for example, to encrypt some plaintext you would load it into a messagetext object, load or generate a key inside a session key object, and then pass the message text object to an encrypt method; finally, you would retrieve your ciphertext from the message text object. To assure readers (and myself!) that the WCCO actually work the CD includes tests, described in Chapter 10, that do things like e.g. encrypt and decrypt random text thousands of times. Programmers can use this code to test their own modifications of the WCCO. Chapter 11 provides information on key management with the CryptoAPI. The book is dedicated to everyone who reads the final chapter, chapter 12. This is a brief history of 20th century cryptography and surveillance policy in the United States. Very few people understand cryptography, just as few people understand genetic engineering, nuclear power, and other complicated subjects with grave social consequences. I hope my book gives its readers enough of an understanding of cryptography to begin to follow, and perhaps participate in, the policy battles surrounding it. The final chapter is an introduction to those battles. Finally, I welcome feedback. You can use the links at the top left of this page to obtain help and additional code. For example, you can search the archive of the listserv to see if anyone has already asked about your problem. [ splash page ][ home ][ books ][ links ][ contact ] Note: the book and companion source code do not currently include support for certificates.
Foundations of Cryptography
Oded Goldreich. Focuses on the basic mathematical tools needed for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs.
Mathematics Statistics - Cambridge University Press Home Science, Technology Medicine Mathematics Statistics Mathematics Statistics Cambridge University Press is the largest academic publisher of books in pure and applied mathematics and statistics. Our full list of titles includes textbooks for both graduate and undergraduate courses, works of reference, user's guides, and monographs spanning the following range of subjects. Much of our publishing is concentrated in our collection of highly-regarded series . Algebra, Geometry and Topology Analysis Probability Dynamical Systems and Differential Equations Financial Mathematics Foundations, Combinatorics Logic Mathematical Association of America Mathematics for Science and Engineering Number Theory Numerical Analysis and Computing Statistics and Applied Probability View pdf print catalogues in your subject, at Catalogshop Other Areas Science, Technology Medicine Textbooks English Language Teaching Humanities Social Sciences Resources Schools Colleges Reference General Interest Series News and Events Bibles eBooks Corporate and Special Sales Journals Quick Search Advanced Search Features A rigorous course in the calculus of functions of a real variable. Differential Equations are central to science, engineering and mathematics This is a lively textbook providing a solid introduction to financial option valuation for undergraduate students The complete introduction for students The outstanding resource for scientific computing The best books on the most fascinating subjects to challenge and entertain. Cambridge University Press 2005. Privacy Policy | Site map | Contacts
An Introduction to Cryptography
Richard A. Mollin. Intended for a one-semester introductory undergraduate course in cryptography. Covers symmetric and public key systems with chapters on advanced topics.
AN INTRODUCTION TO CRYPTOGRAPHY Publisher: ChapmanHall CRC Press, Boca Raton, London, New York, Washington, D. C. ISBN: 1-58488-127-5 Reviews "This is a great book! It can be used in many ways: for a university course at one extreme, and as selective light reading for pleasure at the other. The author's enthusiasm carries the reader along clearly and easily, spilling over to scores of fascinating, beautifully written footnotes, which include more than fifty mini-biographies." "...this book is excellent and highly recommended." Short Book Reviews, Vol. 21, No. 2, August, 2001 Order electronically: For those who have a copy, here is an online updates page TABLE OF CONTENTS: BRIEF OVERVIEW: This book is intended for a one-semester introductory undergraduate course in cryptography. The text has been designed in such a way that the reader with little mathematical background can work through the text, and the reader with a firm mathematical background will encounter sufficient challenging material to sustain interest. Any mathematics required is presented herein in advance of the cryptographic material requiring it. The impetus for the writing of this text arose from this author's involvement in designing an undergraduate course in introductory cryptography for the Mathematics Department at the University of Calgary in 1998. No suitable text for that course was on the market, nor is there one at the time of this writing, hence the incarnation of this one. Essentially, the text is meant for any reader who wants an introduction to the area of cryptography. The core material is self-contained so that the reader may learn the basics of cryptography without having to go to another source. However, in the optional material sections, such as Section Two of Chapter Five, where the number field sieve is studied, the reader will require some knowledge of algebraic number theory such as that given in this author's previous book ALGEBRAIC NUMBER THEORY. Also, for the advanced topics in optional Chapter Six, such as Section One on elliptic curve methods in primality testing, factoring, and cryptosystems, some algebraic background is required, but the basics of elliptic curves are developed in that section for the benefit of the reader. For the instructor, a course outline is, simply put, the first four chapters (excluding the material in Section Three of Chapter Two on successors and cryptanalysis of DES) as the core material for a basic introduction to the area. Optional material (determined by the pointing hand symbol) may be added at the discretion of the instructor, depending upon the needs and background of the students involved. The material in Section One of Chapter One is a motivator for the material in the text by giving an overview of the history of the subject, beginning with the first rumblings of cryptography in ancient Egypt four millennia ago and ending with our modern day needs and challenges. There is sufficient historical data on various ciphers, such as the Caesar cipher, the Playfair cipher, the German World War I ADFGVX field cipher, and one of Edgar Allan Poe's famous cryptograms, to provide a novel set of challenging exercises at the end of this first section to motivate the reader further. Section Two of Chapter One is similarly a history, this time of factoring and primality testing. This may be seen as a precursor to the core material in Chapter Four and the optional material in Chapter Five. We begin with the notion of a prime defined in Euclid's Elements and proceed through several primality testing and factoring techniques introduced by Fibonacci and developed by Fermat, Euler, and numerous others up to Lucas at the end of the nineteenth century. We continue with Kraitchik, Lehmer and others whose work ushered in the twentieth century, setting the groundwork for algorithms to be developed in the computer age. Section Three of Chapter One develops the basics of computer arithmetic, and sets the stage for Section Four which explores complexity issues. Section One of Chapter Two is an introduction to modular arithmetic. The language of congruences is developed from the basic definition through Wilson's Theorem, Fermat's Little Theorem, Euler's generalization, the Arithmetic of the Totient, the Chinese Remainder Theorem and its generalization together with numerous illustrations such as the Coconut Problem, the Egg Basket Problem, and the Units of Work problem, culminating in a tool to be used in many of the cryptographic techniques developed in the text --- the Repeated Squaring Method for Modular Exponentiation. Section Two of Chapter Two is devoted to the first of the two symmetric-key cryptosystems to be studied, namely block ciphers. From requisite definitions of the basic concepts such as enciphering and deciphering transformations, we provide detailed discussions, with examples and diagrams, of numerous block ciphers including: affine, substitution, running-key, as well as transposition and permutation ciphers; concluding with a complete, detailed description of the Data Encryption Standard, DES, together with many illustrative figures. Section Three of Chapter Two is optional, containing a discussion of modes of operation and cryptanalysis of blocks ciphers such as DES, and the candidates for the successor of DES, the soon to be Advanced Encryption Standard, AES. We give a complete, detailed, illustrated description of one of the candidates, the Twofish cipher, which is preceded by a discussion of Feistel ciphers of which the latter is an example. Section Four of Chapter Two deals with the other class of symmetric-key ciphers --- stream ciphers. The reader is taken on a journey from the basic definition of a stream cipher through the notions of keystreams, seeds, generators, randomness, one-time pads, synchronous and self-synchronizing ciphers, linear feedback shift registers, and nonlinear combination generators, plus several illustrations and examples. Chapter Three addresses public-key cryptosystems, beginning in Section One with exponentiation, discrete logarithms, and protocols. In particular, we present the Pohlig-Hellman symmetric key exponentiation cipher, one-way functions, coin flipping via both exponentiation and one-way functions, bit commitment protocols, the Pohlig-Hellman algorithm for computing discrete logarithms, hash functions, message authentication codes, and the Diffie-Hellman key-exchange protocol. The latter motivates the discussion in Section Two where we look at public-key cryptosystems, beginning with the definition of trapdoor one-way functions, which leads to a discussion of the RSA public-key cryptosystem. Then a definition of modular roots and power residues fleshes out our knowledge of congruences sufficiently to describe the Rabin and ElGamal public-key ciphers. Section Three deals with issues surrounding authentication, the need for which is motivated by an illustrated discussion of impersonation attacks on public-key cryptosystems. This leads into a definition of the notions surrounding digital signatures. As illustrations, we present the RSA, Rabin and ElGamal public-key signature schemes. Section Four studies the knapsack problem. Once the basics are set up, we provide a definition of superincreasing sequences, illustrated by the Merkle-Hellman and Chor-Rivest knapsack cryptosystems. Chapter Three concludes with a comparison and a contrasting of symmetric-key and public-key ciphers, with a description of the modern approach using combinations of both types of ciphers for a more secure cryptographic envelope. Chapter Four deals with primality testing, starting in Section One with an introduction to primitive roots, moving from the definition to a discussion of Gauss's algorithm for computing primitive roots, Artin's conjecture, and the fundamental primitive root theorem. We then engage in a development of the index calculus, leading to Euler's criterion for power residue congruences. Our knowledge of quadratic residues is then advanced by the introduction of the Legendre symbol and its properties, which allows us to prove Gauss's quadratic reciprocity law. Another step up is taken with a definition of the Jacobi symbol and its properties, which we need later in the chapter. Section Two inspects true primality tests including the Lucas-Lehmer test, the Pocklington theorem, Proth's theorem, and Pepin's test. The section concludes with a discussion of complexity of primality testing, including the introduction of the notion of a certificate. Probabilistic primality tests are the topic of Section Three, starting with the definitions of Euler Liars, pseudoprimes, and witnesses. Then we work through and illustrate the Solovay-Strassen probabilistic primality test. Once the concept of strong pseudoprimes, liars, and witnesses are introduced, we are in a position to present the Miller-Rabin-Selfridge strong pseudoprime. The section concludes with a general discussion of Monte Carlo algorithms, of which the latter two algorithms are examples. Chapter Five on factoring is the first of two optional chapters. Section One involves an illustrated description of three factoring algorithms: Pollard's p-1 method, the Brillhart-Morrison continued fraction algorithm, and the quadratic sieve. A brief history of how the work of Legendre, Euler, Kraitchik and Lehmer led to the development of these algorithms is also provided, as is a discussion of how the notions can be generalized. This motivates the topic of Section Two, which begins with an illustration of how Pollard's original idea for factoring with cubic integers led to the development of the number field sieve. Then a detailed description of the special number field sieve is given (with the factorization of the ninth Fermat number as an illustration) along with a discussion of its complexity in relation to the general number field sieve. Chapter Six contains advanced topics. The first section introduces elliptic curves from the basic definition and leads the reader through the development of the elliptic curve group structure with several figures to illustrate the geometry in relation to the algebraic development. Once the basics are established, we state (without proof) some deep results needed for the cryptography, including the Nagell-Lutz Theorem, Mazur's theorem, Mordell's theorem, Siegel's theorem, and Hasse's theorem. We then present, and illustrate with worked examples, Lenstra's elliptic curve factoring method as well as the elliptic curve primality test and some generalizations thereof. To prepare for the cryptosystems, we generalize the notion of discrete logs to elliptic curves, and describe both the ElGamal and Menezes-Vanstone public-key elliptic curve cryptosystems. The section concludes with a discussion of the security of elliptic curve ciphers. The next section takes a look at the concept of zero-knowledge proofs in its various formats. We illustrate with the Feige-Fiat-Shamir identification protocol, the cut and choose protocol, and Hamiltonian circuits. The section is concluded with a study of noninteractive zero-knowledge protocols and zero-knowledge proofs of discrete log. Section Three, the last section of the main text of the book, takes us into the realm of quantum cryptography. The basis upon which the latter rests is the Heisenberg uncertainty principle that we discuss at length. We demonstrate how this principle can be used to generate a secret key for a quantum cryptosystem, called quantum key generation. The amazing properties of both quantum computers and quantum cryptography are considered, including the proposals for nuclear magnetic resonance-based quantum computers. The latter are closer to the proposed DNA-based computers, which would be several orders of magnitude faster than the fastest supercomputers known today. To take the reader to the edge of the fantastic, we also look at quantum teleportation and all that implies. The building of a quantum computer (a prototype of which already exists) would have dramatic consequences, not the least of which would be the breaking of public-key cryptography, such has RSA cryptosystems. Features of This Text The book is ideal for the student since it offers a wealth of exercises with nearly 300 problems. The more challenging exercises are marked with a star symbol. Also, complete and detailed solutions to all of the odd-numbered exercises are provided at the back of the text. Complete and detailed solutions of the even-numbered exercises are included in a Solutions Manual, which is available from the publisher for the instructor who adopts the text for a course. The exercises marked with two stars are to be considered only by the reader who requires an exceptional challenge, or for the instructor to extract from the solutions manual to present to students as an additional feature. The text is accessible to anyone from the beginning undergraduate to the research scientist. Appendix A, described below, contains a review of all of the requisite background material. Essentially, the reader can work through the book without any serious impediment or need to seek another source in order to learn the core material. There are more than 50 biographies of the individuals who helped develop cryptographic concepts. These are given in the footnotes woven throughout the text, to give a human face to the cryptography being presented. A knowledge of the lives of these individuals can only deepen our appreciation of the material at hand. The footnote presentation of their lives allows the reader to have immediate information at will, or to treat them as digressions, and access them later without significantly interfering with the main mathematical text at hand. The footnotes contain not only the bibliographical information cited above, but also historical data of interest, as well as other information which the discerning reader may want to explore at leisure. There are optional topics, denoted by a pencil symbol, which add additional material for the more advanced reader or the reader requiring more challenging material which goes beyond the basics presented in the core data. There are more than 80 examples throughout the text to illustrate the concepts presented, as well as in excess of 60 diagrams, figures, and tables. Appendix A contains fundamental facts for the uninitiated reader or the reader requiring a quick finger-tip reference for a reminder of the underlying background used in the text. We begin with the basic notions surrounding set theory, binary relations and operations, functions, the basic laws of arithmetic, as well as notions surrounding divisibility including the Euclidean algorithm and its generalization, properties of the gcd and lcm, the fundamental theorem of arithmetic, the principle of induction, and properties of the binomial coefficient including the binomial theorem. Then we turn to some basic concepts in matrix theory, the fundamentals surrounding polynomials and polynomial rings (having already introduced the basic notions of groups, rings and fields in Section One of Chapter Two), morphisms of rings, vector spaces, and sequences. We close the appendix with fundamental concepts needed in the text concerning continued fractions. For ease of search, the reader will find consecutive numbering, namely object N.m is the mth object in Chapter N (or Appendix N), exclusive of footnotes and exercises, which are numbered separately and consecutively unto themselves. Thus, for instance, Diagram 2.76 is the 76th numbered object in Chapter Two; exclusive of footnotes and exercises; Exercise 3.36 is the 36th exercise in Chapter Three; and Footnote 4.9 is the ninth footnote in Chapter Four. The bibliography contains morethan 200 references for further reading. The list of symbols is designed so that the reader may determine, at a glance, on which page the first defining occurrence of a desired notation exists, and the symbols are all contained on a single page. The index has more than 2,400 entries, and has been devised in such a way to ensure that there is maximum ease in getting information from the text. Last updated: September 10, 2003 Return to R.A.Mollin's homepage
Handbook of Applied Cryptography
The online version of the 1996 CRC book by Menezes, van Oorschot and Vanstone.
Handbook of Applied Cryptography Alfred J. Menezes , Paul C. van Oorschot and Scott A. Vanstone CRC Press ISBN: 0-8493-8523-7 October 1996, 816 pages Fifth Printing (August 2001) The Handbook was reprinted (5th printing) in August 2001. The publisher made all the various minor changes and updates we submitted. You can identify the 5th printing of the book by looking for "5 6 7 8 9 0" at the bottom of the page that includes the ISBN number. You can order the handbook today from any one of these online bookstores: Amazon Books (amazon.com) (Price as of October 10, 2005: US $87.31). Chapters Indigo (for Canadian orders) (Price as of October 10, 2005: Cdn$93.06). CRC Press (Price as of October 10, 2004: US $79.95). Sample Chapters FREE!! CRC Press has generously given us permission to make all chapters available for free download. Please read this copyright notice before downloading any of the chapters. Chapter 1 - Overview of Cryptography ps pdf Chapter 2 - Mathematics Background ps pdf Chapter 3 - Number-Theoretic Reference Problems ps pdf Chapter 4 - Public-Key Parameters ps pdf Chapter 5 - Pseudorandom Bits and Sequences ps pdf Chapter 6 - Stream Ciphers ps pdf Chapter 7 - Block Ciphers ps pdf Chapter 8 - Public-Key Encryption ps pdf Chapter 9 - Hash Functions and Data Integrity ps pdf Chapter 10 - Identification and Entity Authentication ps pdf Chapter 11 - Digital Signatures ps pdf Chapter 12 - Key Establishment Protocols ps pdf Chapter 13 - Key Management Techniques ps pdf Chapter 14 - Efficient Implementation ps pdf Chapter 15 - Patents and Standards ps pdf Appendix - Bibliography of Papers from Selected Cryptographic Forums ps pdf References ps pdf Index ps pdf About the book Words from the authors Brief table of contents Table of contents Foreword, by Ron Rivest Preface Reviews Errata (last updated April 21, 2002) Sample implementations (courtesy of Pate Williams) Handbook of Applied Cryptography ajmeneze at uwaterloo.ca last updated October 10, 2005
Applied Cryptography
Bruce Schneier. A comprehensive tutorial and reference but a little light on mathematical theory.
Applied Cryptography by Bruce Schneier Bruce Schneier Home Weblog Crypto-Gram Newsletter Books Essays and Op Eds Computer Security Articles In the News Speaking Schedule Password Safe Cryptography and Computer Security Resources Contact Information Applied Cryptography Second Edition Bruce Schneier John Wiley Sons, 1996 ISBN 0-471-11709-9 Paperback - 784 pages - $60.00 ISBN 0-471-12845-7 Hardcover - 784 pages - $85.00 Table of Contents - Preface - Foreword - Afterword Errata: current - first edition Source Code Disk Set This new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography -- the technique of enciphering and deciphering messages -- to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them in cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What's New in the Second Edition? The second edition of Applied Cryptography is a major rewrite of the first edition: 50% more words, 7 more chapters, and over 1600 new references. Not only did I make corrections to the first edition and add developments since it was published, but I also included topics left out of the first edition. The second edition has lots of new algorithms (including GOST, Blowfish, RC4, and A5), more information on the Clipper Chip and key escrow, dozens of new protocols, more information on how PGP works, detailed information on key management and modes of operation, and new source code. Corrected Printings Wiley has published a corrected printing of Applied Cryptography, 2nd ed. They didn't correct everything, only changes that didn't affect page breaks. Still, I counted over 250 individual corrections. The fifth printing or greater is the corrected version. To find what printing you own, turn to page iv (it's opposite the "Contents in Brief" page). The last line (under "Printed in the United States of America") is a series of numbers, counting down from 10. The lowest number is the printing. For example, you have a fifth printing if your last line looks like: 10 9 8 7 6 5 Ordering Hardcover: Amazon | BN | Amazon.co.uk Paperback: Amazon | BN | Buy.com | Amazon.co.uk Foreign Editions French German Polish Japanese Russian (forthcoming) Reviews Tal Cohen's Bookshelf Slashdot SunWorld Praise for Applied Cryptography "...the best introduction to cryptography I've ever seen.... The book the National Security Agency wanted never to be published...." --Wired Magazine "...monumental...the definitive work on cryptography for computer programmers..." -- Dr. Dobb's Journal "...easily ranks as one of the most authorative in its field." -- PC Magazine "...the bible of code hackers." -- The Millennium Whole Earth Catalog more quotes Schneier.com is a personal website. Opinions expressed are not necessarily those of Counterpane Internet Security, Inc. Search Schneier on Security A weblog covering security and security technology. read more New Book Beyond Fear: Thinking Sensibly About Security in an Uncertain World read more Crypto-Gram Newsletter A free monthly e-mail newsletter on security and security technology. read more
Wang, Xiaoyun
Shandong University. List of publications. Researcher in Digital Signatures, Differential and Linear Cryptanalysis and Hash Functions.
------------------------------------------------[Professor Xiaoyun Wang]------------------------------------------------------ Biographical and Personal Information: Born: 1966, Zhucheng, Shandong Province Mailing Address: 27 Shanda South Road,School of Mathematics System Sciences, Shandong University, Jinan 250100, China E-mail: xywang@sdu.edu.cn Education: B.S., Mathematics Department , Shandong University, 1987. M.S., Mathematics Department , Shandong University, 1990. Ph. D, Mathematics Department , Shandong University, 1993. Employment Record: Lecturer, Mathematics Department, Shandong University, 7 1993-6 1995. Assistant Professor, Mathematics Department, Shandong University, 7 1995-6 2001.9. Professor, School of Mathematics System Sciences, Shandong University,7 2001.9-Present. Other Positions: Research Associate, Computer Department, Hongkong University, 7 1999-7 2000. Visiting Scholar, Computer Department, Hongkong University, 6 2001-8 2001. Honors and Awards: Shandong University SciTech Achievement Award, 1997. Cryptography SciTech Advancement Award, 2002. Member of AsiaCrypt'2005 Committe Main Curriculums: Calculus, 1993-1999. Abstract Algebra, 1995-1997. Applied Cryptography, 2000-Present. Number Theory and Abstract Algebra, 2002. Analysis and Design for Symmetric Cipher, 2002-Present. Public-Key Cryptography, 2002-Present. Programs: The Design and Analysis of Hash Functions and Block Ciphers, NSFC (National Natural Science Foundation of China). Ph. D Students being Supervised: Shihui Zheng, Meiqin Wang, Hong Bo yu, Wenyu Zhang, Lin Li, Zhaoxiang Yan. Publications: 1)Xiaoyun Wang1, Hongbo Yu, Yiqun Lisa Yin, Efficient Collision Search Attacks on SHA-0 ,Crypto'05. (download times : ) 2)Xiaoyun Wang, Yiqun Yin, Hongbo Yu, Finding Collisions in the Full SHA-1Collision Search Attacks on SHA1 ,Crypto'05. (download times : ) 3)Xiaoyun Wang, Yiqun Yin, Hongbo Yu, Collision Search Attacks on SHA1 ,2005. (download times : ) 4)Arjen Lenstra, Xiaoyun Wang,Benne de Weger, Colliding X.509 Certificates , E-print 2005. (download times : ) 5)Xiaoyun Wang, Collisions for Some Hash Functions MD4, MD5,HAVAL-128,RIPEMD ,Crypto'04,E-print. (download times : ) 6) X. Y. Wang, X. J. Lai etc, Cryptanalysis for Hash Functions MD4 and RIPEMD , Eurocrypto05. (download times : ) 7) X. Y. Wang, Hongbo Yu, How to Break MD5 and Other Hash Functions, Eurocrypto05. (download times : ) 8) X. Y. Wang etc, An Attack on Hash Function HAVAL-128 , Science in China Series E. (download times : ) 9) L. C. K. Hui, X. Y. Wang etc, The Differential Analysis of Skipjack Variants from the first Round , Advance in Cryptography--CHINACRYPT'2002, Science Publishing House. (download times : ) 10) X. Y. Wang, L. C. K. Hui etc, Secure and Practical Tree-Structure Schemes Based on Discrete Logarithm , Public Key Cryptography2000, LNCS 1751, 167-177. (download times : ) 11) X. Y. Wang, L. C. K. Hui etc, The Differential Cryptoanalysis of an AES Finalist-Serpent , Technical Report TR-2000-04, 2000. (download times : ) 12) X. Y. Wang, The Improved Collision attack on SHA-0 (Chinese version, English version coming), 1998. 13) X. Y. Wang, The Colliosion attack on SHA-0 (Chinese version, English version coming), 1997. 14) X. Y. Wang, D. S. Zhou, A Method for Constructing One-Way Hash Functions, J. of Software, Vol. 7, Supplement, 279-284, 1996. 15) X. Y. Wang, The Proof of Polynomial Security for Generalized GM Probabilistic Public-Key Cryptosystem, J. of China Institute of Communications, Vol. 17, No. 5, 35-40, 1996. 16) X. Y. Wang, D. X. Li, The Design of One-Way Paralleling Hash Function, Advance in Cryptography--CHINACRYPT'96, Science Publishing House, 153-157, 1996. 17) X. Y. Wang, Y. R. Chen, Probabilistic Encryption Cryptosystem Based on the Discrete Logarithm, Communication security, China, No. 3, 1996. 18) X. Y. Wang, A Secure-Predicate on the Discrete Logarithm Problem for Zpq*, Chinese J. Computer, Vol. 18, No. 3, 205-211, 1995. 19) X. Y. Wang, A Secret Key Exchange Scheme Which Is Equivalent to the Discrete Logarithm for Zpq*, J. of China Institute of Communications, Vol. 16, No. 2, 79-83, 1995. 20) D. X. Li, X. Y. Wang, Cryptanalysis of Extended Linear Code Public-Key Cryptosystem. Advance in Cryptography-- CHINACRYPT'94Science Publishing House, 1-5, 1994. 21) X. Y. Wang, J. Q. Zhang, Collision Analysis for Every Round Function of the MD5 Message Digest Algorithm, Computer Engineering and Science, Vol.18, No. 2, 15-22, 1996. 22) X. Y. Wang, An Interactive Zero-Knowledge Proof Scheme Based on the Discrete Logarithm Problem for Zpq*, Communication Security, China, No. 1, 64-68, 1993. 23) X. Y. Wang, Some Applications of Prime in Cryptography, Communication Security, China, No.1, 1993. 24) X. Y. Wang, Diophantine- Knapsack Public-Key Cryptosystem, J. of Shandong University, vol. 27, no. 1, 29-33, 1992. COPYRIGHT 2004-2005 ALL RIGHTS RESERVED Email:wangmq@keylab.net
Lipmaa, Helger
Professor of cryptology at Helsinki University of Technology. Has links to activities, research and courses he teaches.
Helger Lipmaa Helger Lipmaa Work http: www.cs.ut.ee ~lipmaa --- lipmaa ut.ee --- Contact addresses From 2001 till early 2005 I worked as a professor of cryptology at Laboratory for Theoretical Computer Science , TKK , Finland. I am a senior researcher in the Research and Development Group at Cybernetica AS and a professor of cryptology at the Institute of Computer Science , Department of Mathematics and Computer Science , University of Tartu (Estonia) Some of my colleagues are Ahto Buldas , Peeter Laud and Jan Willemson . Here is a page for Estonian Cryptography (people, papers, courses, institutions, ...). Curriculum vitae [ ps.gz ] Schedule ICICS 2005 (most probably, 2 papers) CANS 2005 (most probably) ISAAC 2005 (most probably, 1 paper) Research Publications Research porjects in Tartu: Cryptographic protocols (base funding from the University of Tartu, 2 years) More information upcoming Research projects (at HUT, now led by Kaisa Nyberg): Krypto Cryptology and Data-Mining (CRYDAMI) GO-SEC (in collaboration with SPL) Old research projects: Cuculus Fast implementations AES Candidates: A Survey of Implementations Graph algorithms Teaching NordSecMob - joint Nordic master programme on data security and mobility Students in Tartu: Dan Bogdanov Marko Jemets Liina Kamm Mart Smermaa (BSc 2005) Students at HUT: Emilia Ksper (BSc 2004) Sven Laur (MSc 2003) Johan Walln (MSc 2003) Upcoming courses: MTAT.07.006 Research seminar in cryptography (Autumn 2005) MTAT.07.008 Selected topics in algorithmic game theory (Autumn 2005) MTAT.07.005 Cryptographic protocols (Spring 2006) Past teaching activities Supervised Students How to Write Research Papers? (student advice) Professional activities I am affiliated with the next upcoming conferences and schools. Please submit good papers and participate: Near past NordSec 2005 (20-21.10.2005, Tartu, Estonia) . Estonian Theory Days , October 28-30, 2005 (Viinistu, Estonia) PSDM 2005 (27.11.2005, New Orleans, LA, USA) ICISC 2005 (1-2.12.2005, Seoul, Korea) Financial Cryptography and Data Security 2006 (27.02-02.03.2006, Anguilla BWI) Estonian WS in CS (5-10.03.2006, Palmse, Estonia) Eurocrypt 2006 (28.05-01.06.2006, St. Petersburg, Russia) ISC 2006 (30.08-02.09.2006, Samos Island, city of Pythagoras, Greece) Crypto computer science: links and cites I keep up a site of Cryptology pointers with more than 4500 links. I also have a list of most cited cryptographers and a list of Estonian, Finnish and Latvian Computer Scientists (together with of citations). ATI (CS department in Tartu) organises seminar . TCS organizes TCS Forum . Here are some HUT-related links that I need in my everyday work. See here for my university-unrelated business activities. Some other actual interesting links: Lance Fortnow's computational complexity weblog Korean language course Tartu go club meets once a week. Currently: Every Tuesday at 18:00 in the University Caffee. Programming MSX - my high school hobby : Simple BWT demo program in PHP3 Personal information My pictures : Links : IQ tests : Conferences, workshops etc I have participated in : MAT90 : Club of Poltpeepers : Estonian Poetry : Warning: fopen( home helger public_html counters main.log): failed to open stream: No such file or directory in counter.php on line 2 for
Diffie, Whitfield
Short C.V. of the discoverer of the concept of public key cryptography with links to his publications.
Dr. Whitfield Diffie Java Solaris Communities Partners My Sun Sun Store United States Worldwide Products Downloads Services Solutions Support Training Research Home Research Research Home Spotlight Articles Projects Publications People Awards Events Downloads Internships Contrarian Minds About Sun Labs Dr. Whitfield Diffie VP, Sun Fellow Chief Security Officer, Sun Microsystems Sun Microsystems Laboratories 2600 Casey Avenue MS UMTV29-116 Mountain View, CA 94043 USA Whitfield Diffie, Chief Security Officer of Sun Microsystems, is Vice President and Sun Fellow and has been at Sun since 1991. As Chief Security Officer, Diffie is the chief exponent of Sun's security vision and responsible for developing Sun's strategy to achieve that vision. Best known for his 1975 discovery of the concept of public key cryptography, Diffie spent the 1990s working primarily on the public policy aspects of cryptography and has testified several times in the Senate and House of Representatives. His position - in opposition to limitations on the business and personal use of cryptography - is the subject of the book, _Crypto_, by Steven Levy of Newsweek. Diffie and Susan Landau are joint authors of the book Privacy on the Line, which examines the politics of wiretapping and encryption and won the Donald McGannon Award for Social and Ethical Relevance in Communications Policy Research and the IEEE-USA award for Distinguished Literary Contributions Furthering Public Understanding of the Profession. Diffie is a fellow of the Marconi Foundation and is the recipient of awards from a number of organizations, including IEEE, The Electronic Frontiers Foundation, NIST, NSA, the Franklin Institute and ACM. Prior to assuming his present position in 1991, Diffie was Manager of Secure Systems Research for Northern Telecom, where he designed the key management architecture for NT's PDSO security system for X.25 packet networks. Diffie received a Bachelor of Science degree in mathematics from the Massachusetts Institute of Technology in 1965, and was awarded a Doctorate in Technical Sciences (Honoris Causa) by the Swiss Federal Institute of Technology in 1992. Would you recommend this Sun site to a friend or colleague? Select -- 10 Extremely likely 9 8 7 6 5 Neutral 4 3 2 1 0 Not at all likely Contact About Sun News Employment Privacy Terms of Use Trademarks Copyright 1994-2005 Sun Microsystems, Inc.
Jakobsson, Markus
Indiana University School of Informatics. Contains links to papers.
Markus Jakobsson | Papers Skip directly to: page content Search Home I400 I590 B548 Papers Grants Awards Experience Professional Activities IUB Informatics IUPUI Informatics IUPUI New Media IUSB Informatics Skip directly to : top of page Markus Jakobsson Papers View By Subject Payments Cryptographic Privacy Applications of Cryptography Distributed Control Efficiency Building Blocks Full Publication List A. Juels, D. Catalano and M. Jakobsson. "Coercion-Resistant Electronic Elections." To appear in WPES '05 [ Abstract ] [ Pdf ] [ BiBTeX ] N. Ben Salem, J.-P. Hubaux, M. Jakobsson. "Reputation-based Wi-Fi Deployment." Mobile Computing and Communications Review, Volume 9, Number 3 [ Abstract ] [ Pdf ] [ BiBTeX ] V. Griffith and M. Jakobsson. "Messin' with Texas, Deriving Mother's Maiden Names Using Public Records." To appear in ACNS '05, 2005 [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson and L. Yang. "Quantifying Security in Hybrid Cellular Networks." To appear in ACNS '05, 2005 [ Abstract ] [ Pdf ] [ BiBTeX ] Y.-C. Hu, M. Jakobsson, and A. Perrig. "Efficient Constructions for One-way Hash Chains." To appear in ACNS '05, 2005 [ Abstract ] [ Pdf ] [ BiBTeX ] N. Ben Salem, J. P. Hubaux, and M. Jakobsson. "Node Cooperation in Hybrid Ad hoc Networks." To appear in IEEE Transactions on Mobile Computing (TMC), 2005 [ Abstract ] [ Pdf ] [ BiBTeX ] P. MacKenzie, T. Shrimpton, and M. Jakobsson. "Threshold Password-Authenticated Key Exchange." To appear in Journal of Cryptology, 2005 [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson. "Modeling and Preventing Phishing Attacks." Phishing Panel in Financial Cryptography '05. 2005. [ Abstract ] [ Pdf ] [ BiBTeX ] N. Ben Salem, J.-P. Hubaux, and M. Jakobsson. "Reputation-based Wi-Fi Deployment Protocols and Security Analysis." In WMASH '04. ACM Press, 2004. pp. 29--40. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson and S. Wetzel. "Efficient Attribute Authentication with Applications to Ad Hoc Networks." In VANET '04. ACM Press, 2004. pp. 38--46. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson, X. Wang, and S. Wetzel. "Stealth Attacks in Vehicular Technologies." Invited paper. In Proceedings of IEEE Vehicular Technology Conference 2004 Fall (VTC-Fall 2004). IEEE, 2004. [ Abstract ] [ Pdf ] [ BiBTeX ] "Cryptographic Protocols." Forthcoming chapter from The Handbook of Information Security. Hossein Bidgoli, Editor-in-Chief. Copyright John Wiley Sons, Inc., 2005, Hoboken, N.J, ALL RIGHTS RESERVED. [ Doc ] "Cryptographic Privacy Protection Techniques." Forthcoming chapter from The Handbook of Information Security. Hossein Bidgoli, Editor-in-Chief. Copyright John Wiley Sons, Inc., 2005, Hoboken, N.J, ALL RIGHTS RESERVED. [ Doc ] A Ambainis, H. Lipmaa, and M. Jakobsson. "Cryptographic Randomized Response Technique." In PKC '04. LNCS 2947. Springer-Verlag, 2004. pp. 425--438. [ Abstract ] [ Pdf ] [ BiBTeX ] P. Golle, M. Jakobsson, A. Juels, and P. Syverson. "Universal Re-encryption for Mixnets." In CT-RSA '04. LNCS 2964. Springer-Verlag, 2004. pp. 163--178. [ Abstract ] [ Pdf ] [ BiBTeX ] P. Golle and M. Jakobsson. "Reusable Anonymous Return Channels." In WPES '03. ACM Press, 2003. pp. 94--100. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson, S. Wetzel, B. Yener. "Stealth Attacks on Ad-Hoc Wireless Networks." In IEEE VTC '03, 2003. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson and F. Menczer. "Untraceable Email Cluster Bombs: On Agent-Based Distributed Denial of Service." CoRR preprint. 2003. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson, J. Linn, and J. Algesheimer. "How to Protect Against a Militant Spammer." ePrint archive. Report 2003 071. 2003. [ Abstract ] [ Ps Pdf ] [ BiBTeX ] N. Ben Salem, L. Buttyan, J.-P. Hubaux, and M. Jakobsson. "A Charging and Rewarding Scheme for Packet Forwarding in Multi-hop Cellular Networks." In ACM MobiHoc '03. ACM Press, 2003. pp. 13--24. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, J.-P.Hubaux and L. Buttyan. "A Micro-Payment Scheme Encouraging Collaboration in Multi-Hop Cellular Networks." In FC '03. LNCS 2742. Springer-Verlag, 2003. pp. 15--33. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, T. Leighton, S. Micali and M. Szydlo. "Fractal Merkle Tree Representation and Traversal." In RSA-CT '03 2003. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] A. Boldyreva and M Jakobsson. "Theft protected proprietary certificates." In DRM '02. LNCS 2696, 2002. pp. 208--220. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] P. Golle, S. Zhong, M. Jakobsson, A. Juels, and D. Boneh. "Optimistic Mixing for Exit-Polls." In Asiacrypt '02. LNCS 2501. Springer-Verlag, 2002. pp. 451--465. [ Abstract ] [ Pdf ] [ BiBTeX ] P. MacKenzie, T. Shrimpton, and M. Jakobsson. "Threshold Password-Authenticated Key Exchange." In CRYPTO '02. LNCS 2442. Springer-Verlag, 2002. pp. 385--400. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Fractal Hash Sequence Representation and Traversal." One-page abstract. In Proceedings of the 2002 IEEE International Symposium on Information Theory (ISIT `02). 2002. pp. 437--444. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] [ Code ] M. Jakobsson, A. Juels, and R. Rivest. "Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking." In Proceedings of the 11th USENIX Security Symposium. USENIX Association, 2002. pp. 339--353. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] D. Coppersmith and M. Jakobsson. "Almost Optimal Hash Sequence Traversal." In Financial Crypto '02. 2002. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] [ Code ] M. Jakobsson. "Financial Instruments in Recommendation Mechanisms." In Financial Crypto '02. 2002. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] J. Garay, and M. Jakobsson. "Timed Release of Standard Digital Signatures." In Financial Crypto '02. 2002. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] F. Menczer, N. Street, N. Vishwakarma, A. Monge, and M. Jakobsson. "Intellishopper: A Proactive, Personal, Private Shopping Assistant." In AAMAS '02. ACM Press, 2002. pp. 1001--1008. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson and M. Reiter. "Discouraging Software Piracy Using Software Aging." In DRM '01. LNCS 2320. Springer-Verlag, 2002. pp. 1--12. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, A. Juels, and P. Nguyen. "Proprietary Certificates." In CT-RSA '02. LNCS 2271. Springer-Verlag, 2002. pp. 164--181. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and A. Juels. "An Optimally Robust Hybrid Mix Network." In PODC '01. ACM Press. 2001. pp. 284--292. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and S. Wetzel. "Security Weaknesses in Bluetooth." In CT--RSA '01. LNCS 2020. Springer-Verlag, 2001. pp. 176--191. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and D. Pointcheval. "Mutual Authentication for Low-Power Mobile Devices." In Financial Crypto '01. LNCS 2339. Springer-Verlag, 2001. pp. 178--195. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, D. Pointcheval, and A. Young. "Secure Mobile Gambling." In CT--RSA '01. LNCS 2020. Springer-Verlag, 2001. pp. 110--125. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and S. Wetzel. "Secure Server-Aided Signature Generation." In PKC '01. LNCS 1992. Springer-Verlag, 2001. pp. 383--401. [ Abstract ] [ Pdf ] [ BiBTeX ] M. Jakobsson and A. Juels. "Addition of ElGamal Plaintexts." In T. Okamoto, ed., ASIACRYPT '00. LNCS 1976. Springer-Verlag, 2000. pp. 346--358. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, and A. Juels. "Mix and Match: Secure Function Evaluation via Ciphertexts." In ASIACRYPT '00. LNCS 1976. Springer-Verlag, 2000. pp. 162--177. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] R. Arlein, B. Jai, M. Jakobsson, F. Monrose, and M. Reiter. "Privacy-Preserving Global Customization." In ACM E-Commerce '00. ACM Press, 2000. pp. 176--184. [ Abstract ] [ Pdf ] [ BiBTeX ] C.-P. Schnorr and M. Jakobsson. "Security of Signed ElGamal Encryption." In ASIACRYPT '00. LNCS 1976. Springer-Verlag, 2000. pp. 73--89. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] A. Juels, M. Jakobsson, E. Shriver, and B. Hillyer. "How To Turn Loaded Dice Into Fair Coins." IEEE Transactions on Information Theory, vol. 46(3). May 2000. pp. 911--921. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] P. Bohannon, M. Jakobsson, and S. Srikwan. "Cryptographic Approaches to Privacy in Forensic DNA Databases." In Public Key Cryptography '00. LNCS 1751. Springer-Verlag, 2000. pp. 373--390. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] J. Garay, M. Jakobsson, and P. MacKenzie. "Abuse-free Optimistic Contract Signing." In CRYPTO '99. LNCS 1666. Springer-Verlag, 1999. pp. 449--466. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Flash Mixing." In PODC '99. ACM Press, 1999. pp. 83--89. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] G. Di Crescenzo, N. Ferguson, R. Impagliazzo, and M. Jakobsson. "How To Forget a Secret." In STACS '99. LNCS 1563. Springer-Verlag, 1999. pp. 500--509. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, D. M'Raihi, Y. Tsiounis, and M. Yung. "Electronic Payments: Where Do We Go from Here?." In CQRE (Secure) '99. LNCS 1740. Springer-Verlag, 1999. pp. 43--63. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] C.P. Schnorr and M. Jakobsson. "Security Of Discrete Log Cryptosystems in the Random Oracle + Generic Model." In Conference on The Mathematics of Public-Key Cryptography. The Fields Institute, Toronto (Canada). 1999. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and A. Juels "Millimix: Mixing in Small Batches." DIMACS Technical Report 99-33, 1999. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and A. Juels "Proofs of Work and Breadpudding Protocols." In CMS '99. IFIP Conference Proceedings, Vol. 152. Kluwer, B.V., 1999. pp. 252--272. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and C-P Schnorr. "Efficient Oblivious Proofs of Correct Exponentiation." In CMS '99. IFIP Conference Proceedings, Vol. 152. Kluwer, B.V., 1999. pp. 71--86. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, P. MacKenzie, and J.P. Stern. "Secure and Lightweight Advertising on the Web." In World Wide Web '99. Journal of Computer Networks, vol. 31, issue 11--16, Elsevier North-Holland, Inc., 1999. pp. 1101--1109. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, J.P. Stern, and M. Yung. "Scramble All, Encrypt Small." In Fast Software Encryption '99. LNCS 1636. Springer-Verlag, 1999. pp. 95--111. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and J. Mueller. "Improved Magic Ink Signatures Using Hints." In Financial Cryptography '99. LNCS 1648. Springer-Verlag, 1999. pp. 253--268. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Mini-Cash: A Minimalistic Approach to E-Commerce." In Public Key Cryptography '99. LNCS 1560. Springer-Verlag, 1999. pp. 122--135. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "On Quorum Controlled Asymmetric Proxy Re-encryption." In Public Key Cryptography '99. LNCS 1560. Springer-Verlag, 1999. pp. 112--121. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and A. Juels. "X-Cash: Executable Digital Cash." In Financial Cryptography '98. LNCS 1465. Springer-Verlag, 1998. pp. 16--27. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and D. M'Raihi. "Mix-based Electronic Payments." In Proceedings of the Selected Areas in Cryptography. LNCS 1556. Springer-Verlag, 1998. pp. 157--173. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, E. Shriver, B. Hillyer, and A. Juels. "A Practical Secure Physical Random Bit Generator." In CCS '98: Proceedings of the 5th ACM conference on Computer and communications security. ACM Press, 1998. pp. 103--111. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "A Practical Mix." In Advances in Cryptology -- EuroCrypt '98. LNCS 1403. Springer-Verlag, 1998. pp. 448--461. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and M. Yung. "On Assurance Structures for WWW Commerce." In Financial Cryptography '98. LNCS 1465. Springer-Verlag, 1998. pp. 141--157. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] E. Gabber, M. Jakobsson, Y. Matias, and A. Mayer. "Curbing Junk E-Mail via Secure Classification." In Financial Cryptography '98. LNCS 1465. Springer-Verlag, 1998. pp. 198--213. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Privacy vs. Authenticity." Ph.D. Thesis, University of California at San Diego. 1997 [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and M. Yung. "Distributed "Magic Ink" Signatures." In Advances in Cryptology -- EuroCrypt '97. LNCS 1233. Springer-Verlag, 1997. pp. 450--464. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and M. Yung. "Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System." In Financial Cryptography '97. LNCS 1318. Springer-Verlag, 1997. pp. 217--238. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. "Proactive public-key and signature schemes." In Proceedings of the 4th Annual Conference on Computer Communications Security. ACM Press, 1997. pp. 100--110. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Bellare, M. Jakobsson, and M. Yung. "Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function." In Advances in Cryptology -- EuroCrypt '97. LNCS 1233. Springer-Verlag, 1997. pp. 280--305. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and M. Yung. "Proving Without Knowing." In Crypto '96. LNCS 1109. Springer-Verlag, 1996. pp. 186--200. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson, K. Sako, and R. Impagliazzo. "Designated Verifier Proofs and Their Applications." In Advances in Cryptology -- EuroCrypt '96. LNCS 1070. Springer-Verlag, 1996. pp. 143--154. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson and M. Yung. "Revokable and Versatile Electronic Money." In CCS '96: Proceedings of the 3rd ACM conference on Computer and communications security. ACM Press, 1996. pp. 76--87. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Ripping Coins for a Fair Exchange." In Advances in Cryptology -- EuroCrypt '95. LNCS 921. Springer-Verlag, 1995. pp. 220--230. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Blackmailing using Undeniable Signatures." In Advances in Cryptology -- EuroCrypt '94. LNCS 950. Springer-Verlag, 1994. pp. 425--427. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Reducing costs in identification protocols." Rump Session, InCrypto '92, 1992. [ Abstract ] [ Ps , Pdf ] [ BiBTeX ] M. Jakobsson. "Machine-Generated Music with Themes." InInternational Conference on Artificial Neural Networks '92. Vol 2. Amsterdam: Elsevier, 1992. pp. 1645--1646 G. Jakobsson, M. Jakobsson, and M. Persson. "NO till vardags." ISBN 91 88070 14 X Patent publications Flash mixing apparatus and method Method and system for quorum controlled asymmetric proxy encryption System and method for secure classification of electronic mail Method and apparatus for ensuring security of users of bluetooth TM-enabled devices Minimalistic electronic commerce system Non malleable encryption apparatus and method Probabilistic theft deterrence Method and apparatus for extracting unbiased random bits from a potentially biased source of randomness Practical mix-based election scheme Storage device random bit generator Executable digital cash for electronic commerce Method and apparatus for encrypting, decrypting, and providing privacy for data values Skip directly to : top of page Turn on JavaScript to view e-mail address. Indiana University School of Informatics http: www.informatics.indiana.edu Indiana University | Comments:
Clifford Neuman
Director of USC's Center for Computer Systems Security. Conducts research in computer security and works on Kerberos authentication system, NetCheque and NetCash electronic payment systems.
Home Page for Clifford Neuman HOME, PAPERS , TALKS , BIOGRAPHICAL , PERSONAL , RECOMMENDATIONS , MUSINGS , FAQ Clifford Neuman Director, Center for Computer Systems Security , Information Sciences Institute University of Southern California 4676 Admiralty Way, Room 1143W Marina del Rey, California 90292-6695 U.S.A. Voice: +1 (310) 448-8736 Asst: +1 (310) 448-8286 (project assistant - Arnold Diaz) email: bcn@isi.edu after reading frequently-asked-questions Research Assistant Professor, Department of Computer Science University of Southern California University Park Campus, Salvatori room 234 Los Angeles, California 90089 U.S.A. Campus telephone: +1 (310) 740-4518 For appointments, requests for materials, or administrative inquiries, please first read my frequently asked questions list, and CC my project assistant Arnold Diaz, diaz@isi.edu . Research Groups Global Operating Systems Technology Group Center for Computer Systems Security Projects Dynamic Policy Evaluation for Containing Network Attacks (DEFCN) Security Infrastructure for Large Distributed Systems (SILDS) Global Operating Systems Technology (GOST) Supporting Organizationally Accepted Practice (SOAP) Scalable Computing Infrastructure (SCOPE) Products Kerberos - Computer security Prospero - Information infrastructure The Prospero Resource Manager - Distributed parallel computing NetCheque - Network payment and electronic commerce NetCash - Anonymous network payment GAA-API - Generic Authorization and Access Contol API Courses Security Systems (CSci530) Advanced Operating Systems (CSci555) Electronic Payment and Web Security Tutorials Recommendations Southern California Hiking Baldwin Hills Park The Ladera Heights Community Solar Power Home Atomation Recipes Home office equipment
Jenkin, Bob
Site has links his works on Cryptography, hash functions, Random Number Generators.
Bob Jenkins' Web Site Bob Jenkins' Web Site New: I'm building a dollhouse . Table of Contents (internal links): Hashing Here's a hash table , code for perfect hashing , a good hash function for hash table lookup , a FAQ , some theory , and code to search for new hash functions. I tried designing block ciphers and finding characteristics . I had an article published in Dr. Dobb's in September 1997. Randomness Have the cryptographic pseudorandom number generator ISAAC , a prize for breaking ISAAC, and ISAAC's background and theory . Also take some tests for randomness, and a table of orders of magnitude . Here are also some protocols and a unit vector generator . Collections See some skits from Boy Scouts, SQL tricks from Oracle, near-future speculations , a cong from the British Museum, and some recipies , a bit on software patents and JPEG 2000 , and some cartoons that I wrote in college. Math Look into pentagonal tiles , formulae for n-body orbit simulations , code for the HOMFLY knot polynomial , voting methods, choosing random passwords , jenny for pairwise testing, some error correction codes , a distributed HTML index , and a web page for choosing colors . Physics Consider perpetual motion machines , a dirigiped design , a scale model of the solar system , a page on exploring orbits with Java and Klemperer Rosettes , a simulation of Cruithne (a near-earth object) , of figure-eight orbits , of binary star planetary orbits , a set of noncolliding orbits , some Dyson Swarms (pretty pictures!) , some methods for the n-body problem , a description of the orbit applet used , and a tentative itzu world . Personal Here is my autobiography , some genealogical notes , a fake resume , and an online scrapbook , my half bath , my house design , my mom's art , the roof rack for my wife's car , and early Bob photos . My wife Justine has her website here too now. Here are some other sites: Search engines: Google . Nothing else is currently worth bothering with. Usenet: Google groups lets you find people anywhere discussing any topic you are interested in. Stock quotes: Yahoo has personalized portfolios, and The Island handles after-hours trades. News: http: slashdot.org for nerd news, CNN for newspaper news, the BBC for a non-US perspective, or the Onion for spoofs of it all. Relative's pages: my wife Justine , my mom's online art gallery . Translate English to from Spanish,French,German,Italian,Portuguese. Specific stuff: near-earth objects , astronomy journals , the Encyclopedia of Integer Sequences , genealogical research , and Rubik's Cube . Send mail to Bob at bob_jenkins@burtleburtle.net .
Dodson, Bruce
RSA130 Factoring Challenge at Lehigh University.
FAFNER: Factoring via Network-Enabled Recursion Jump to Other RSA130 Sites FAFNER: Factoring via Network-Enabled Recursion Welcome to the World-Wide Web RSA130 Factoring Challenge at Lehigh University! This is the RSA130 Web Page for Lehigh University, a site that has contributed 13,000,000+ partial relations to the RSA130 database as of November 24, 1995. In addition, Lehigh Alum Matt Fante has contributed an additional 2,000,000+ partial relations. This site, which is maintained by B. Dodson , receives tasks by email directly from Bellcore, rather than via a primary FAFNER server. Lehigh is primarily an undergraduate institution, with a tradition of recruiting research-oriented faculty; and a small but intensive graduate program. Lehigh's high performance computing environment consists of around 100 IBM RS 6000 workstations in public and semi-public sites, supported by the Andrews File System (afs). Previous factoring projects utilizing Lehigh's computing resources include about 30% of the computing to factor RSA120, which was described at Crypto '93 (immediately preceding the start of the RSA129 project); as well as about one half of the computing (i.e., sieving) for the current factoring record with gnfs, a 119-digit number whose factorization was reported at Crypto '95. Pages for the General Public RSA-130 Challenge Overview ...at Northeast Parallel Architectures Center FAFNER Worldwide ...a geographic guide to FAFNER client server [seems to have expired!] FAFNER Tutorial ...[likewise] Questions, comments to factor-help@cooperate.com .
Lange, Tanja
Researcher in Elliptic Curve Cryptography. Site has links to her publications and some famous crypto conferences
Tanja Lange's Homepage Tanja Lange's Homepage I moved to DTU in Denmark in January, this page is no longer fully updated. Conferences Publications Talks Teaching Links Preprints Institute for Information Security and Cryptology Ruhr-Universitt Bochum Universittsstrae 150 D-44780 Bochum Germany Room NA 5 74 Phone: ++49 (0)234 32 23260 Fax.: ++49 (0)234 32 14430 e-mail: Lange@itsc.ruhr-uni-bochum.de Photo Seite auf deutsch This year the The 8th Workshop on Elliptic Curve Cryptography (ECC 2004) is preceeded by a Summer School on Elliptic Curve Cryptography. Conferences I serve on the following program committees: CHES 2004 SCN 2004, the fourth edition of the Conference on Security in Communication Networks '04 The 8th Workshop on Elliptic Curve Cryptography (ECC 2004) Indocrypt 2004 Cryptographers' Track of the RSA Conference, CT-RSA 2005 WCC - Workshop on Coding and Cryptography SHARCS - Special-purpose Hardware for Attacking Cryptographic Systems I participate in the European Network of Exellence ECRYPT and the Roadmap project STORK . Publications Factoring polynomials over arbitrary finite fields,(with A. Winterhof ) Theoretical Computer Science 234 (2000), 301-308. Algorithms for factoring polynomials over arbitrary finite fields, (with A. Winterhof ), Proceedings of the Fifth International Conference on Finite Fields and Applications 2000, (Springer 2001), 319-328. Speeding up the Arithmetic on Hyperelliptic Koblitz Curves of Genus 2, (with C. Gnther and A. Stein ) Selected Areas in Cryptography, SAC 2001, Lecture Notes in Computer Science 2012, (Springer 2001), 106-117. Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions, (with A. Winterhof ) in: Electronic Notes in Discrete Mathematics 6 as Proocedings of: International Workshop on Coding and Cryptography (WCC 2001) . Incomplete character sums over finite fields and their applications to the interpolation of the discrete logarithm by Boolean functions, (with A. Winterhof ) Acta Arithmetica 101 (2002), 223-229. Linear Complexity of the Discrete Logarithm, (with S. Konyagin and I. Shparlinski ), Designs, Codes and Cryptography 28 (2003), 135-146. Interpolation of the Discrete Logarithm in Fq by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of q-1, (with A. Winterhof ), Discrete Applied Mathematics 128 1 (2003), 193 - 206. Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm, (with A. Winterhof ) Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON'02) (Singapore, 2002), LNCS 2387, 137-143. Koblitz Curve Cryptosystems, STJournal of System Research 4 (2003), 29-36. Improved Algorithms for Efficient Arithmetic on Elliptic Curve using Fast Endomorphisms, (with M. Ciet , F. Sica and J.-J. Quisquater ) Proceedings of Eurocrypt 2003 , LNCS 2656, 388-400. Interpolation of the Elliptic-Curve Diffie-Hellman Mapping, (with A. Winterhof ), Proceedings of AAECC 2003 , LNCS 2643, 51-60. Trace-Zero Subvariety for Cryptosystems, to appear in Journal of the Ramanujan Mathematical Society. On Using Expansions to the Base of $-2$, (with R. Avanzi, G. Frey, and R. Oyono ), to appear in International Journal on Computer Mathematics vol 81 no 4, 2004. Montgomery Addition for Genus Two Curves, to appear in Proceedings of ANTS 2004 . Certain exponential sums and random walks on elliptic curves, (with I. Shparlinski ), submitted. Formulae for Arithmetic on Genus 2 Hyperelliptic Curves, to appear in J. AAECC . Mathematical Background of Public Key Cryptography, (with G. Frey ), see also Preprint 10 2003 of the IEM , Essen. Koblitz Curve Cryptosystems, to appear in FFA . Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves, (with I. Shparlinski ), to appear in J. AAECC . tbc. Some preprints are available electronically here Slides of recent talks Fast arithmetic on hyperelliptic Koblitz curves , at the MAGiC conference in Urbana Champaign Abstract M1.ps M2.ps M3.ps Slides (3 files, middle one containing picture of Diffie-Hellman key-exchange) Speeding up the arithmetic on hyperelliptic Koblitz curves via Frobenius, seminar talk at Information Protection Seminar in Urbana Champaign Abstract Slides Schnelle Arithmetik auf hyperelliptischen Kurven, (german) seminar talk at Oberseminar Algorithmische Mathematik in Paderborn Abstract Slides Hyperelliptische Kurven in der Kryptographie, (german) talk at the workshop "Alternative Public-Key-Algorithmen" organized by ECC-Brainpool Folien Trace-Zero Subvariety for Cryptosystems, talk at YACC 2002 Abstract Slides Efficient arithmetic on (hyper-)elliptic curves over finite fields, talk at UCL Crypto Group - Seminar Series Slides Efficient arithmetic on (hyper-)elliptic curves over finite fields, talk at 2003 International Symposium on Next Generation Cryptography and Related Mathematics, Japan Slides Efficient arithmetic on (hyper-)elliptic curves over finite fields, talk at Computational Aspects of Algebraic Curves, and Cryptography, Gainesville Slides Efficient arithmetic on (hyper-)elliptic curves over finite fields, talk at Cryptography Seminar in Rennes Slides Improved Algorithms for Efficient Arithmetic on Elliptic Curve using Fast Endomorphisms, talk given by Francesco Sica at Eurocrypt 2003 Slides in pdf Efficient arithmetic on (hyper-) elliptic curves over finite fields, talk at ECC 2003 Slides Cryptographic Applications of Trace Zero Varieties, talk at Mathematics of Discrete Logarithms, Essen Slides Cryptographic Applications of Trace Zero Varieties, talk at Dagsthul Seminar -- Algorithms and Number Theory Slides Mathematical Countermeasures Against Side-Channel Attacks on ECC HECC, talk at YACC 2004 Slides Introduction to Side-Channel Attacks on elliptic and hyperelliptic curves, talk at ANTS VI 2004 Slides Montgomery Addition for Genus Two Curves, talk at ANTS VI 2004 Slides Mathematical Countermeasures against Side-Channel Attacks on Elliptic and Hyperelliptic Curves, talk at WARTACRYPT '04 Slides Teaching This term I'm giving practice hours for "Mathematics II for engineers". You find the homepage of the Mathekids Bochum here (only in german). Links Hyperelliptic Curves allowing fast Arithmetic On this site you can obtain my PhD thesis "Fast Arithmetic on Hyperelliptic Curves" I was a member of the Graduate School on "Cryptography" . I organized the Workshop on applied cryptography in Bedlewo, Poland, in 2001. Old homepage containing cours material (german) for courses given in Braunschweig. Homepage der Mathekids (Braunschweig) , only in german. My PGP key e-mail Lange@itsc.ruhr-uni-bochum.de
Joye, Marc
Home page with links to publications, affiliation and curriculum vitae.
Marc Joye's Home Page Welcome to Marc Joye's ( ) Homepage My Publications and my Curriculum Vitae Scientific activities Member of the Steering Committee of IACR CHES Workshop (with B. Kaliski, C. Ko, C. Paar, J.-J. Quisquater, J. Rao, B. Sunar, and C. Walter) Member of the Steering Committee of RSA Conference , Cryptographers' Track (with B. Kaliski, B. Preneel, R. Rivest, and M. Yung) Program co-Chair of the 6th Workshop on Cryptographic Hardware and Embedded Systems ( CHES 2004 ) Program Chair of the 2003 RSA Conference, Cryptographers' Track ( CT-RSA 2003 ) On the board of several program committees: IACR Annual Conferences: CRYPTO EUROCRYPT ASIACRYPT EUROCRYPT 2005 , Aarhus, Denmark, May 22-26, 2005 ASIACRYPT 2004 , Jeju Island, Korea, December 5-9, 2004 ASIACRYPT 2003 , Taipei, Taiwan, November 30 - December 4, 2003 IACR Workshop on Practice and Theory in Public Key Cryptography PKC 2004 , Singapore, March 1-4, 2004 PKC 2003 , Miami, FL, USA, January 6-8, 2003 IACR Workshop on Cryptographic Hardware and Embedded Systems CHES 2004 , Cambridge, MA, USA, August 11-13, 2004 CHES 2003 , Cologne, Germany, September 7-10, 2003 RSA Conference, Cryptographers' Track CT-RSA 2003, San Francisco, CA, USA, April 13-17, 2003 Conference on Financial Cryptography FC 2004 , Key West, FL, USA, February 9-12, 2004 Information Security Conference ISC 2004, Palo Alto, CA, USA, September 27-29, 2004 ISC 2003 , Bristol, UK, October 1-3, 2003 International Conference on Information and Communications Security ICICS 2005, Bejing, China, December 8-11, 2005 International Conference on Information Security and Cryptology ICISC 2005, Seoul, Korea, December 1-2, 2005 Australasian Conference on Information Security and Privacy ACISP 2005 , Brisbane, Australia, July 4-6, 2005 International Conference on Cryptology in Malaysia Mycrypt 2005 , Kuala Lumpur, Malaysia, September 28 - October 2, 2005 Conference on Smart Card Research and Applications CARDIS 2002 , San Jose, CA, USA, November 20-22, 2002 Conference on Information Security Solutions Europe ISSE 2002, Paris, France, October 2-4, 2002 Workshop on Information Security Applications WISA 2002, Cheju Island, Korea, August 28-30, 2002 WISA 2001, Seoul, Korea, September 13-14, 2001 WISA 2000, Seoul, Korea, November 24-25, 2000 External reviewer for international journals: Journal of Cryptology Designs, Codes Cryptography IEEE Transactions on Computers ACM Transactions on Information and System Security Information Processing Letters IEE Proc. Computers Digital Techniques Electronics Letters Leader of the the VAMPIRE Lab-1 (Software implementations), ECRYPT Network of Excellence in Cryptology , 2003-2007 Member of the International Association of Cryptologic Research (IACR) since 1995 My page on elliptic curves Address: Gemplus , Card Security Group La Vigie, ZI Athlia IV, Av. du Jujubier, B.P. 100, 13705 La Ciotat Cedex, France Voice: +33 (0)4 42 36 40 69 Fax: +33 (0)4 42 36 57 92 E-mail: marc.joye(at)gemplus.com, marc_joye(at)hotmail.com URL: http: www.geocities.com marcjoye Last modified: Fri Mar 18 09:38:29 Romance Standard Time 2005 geovisit();
Enge, Andreas
Has links to his books and other publications.
Andreas Enge - Krypto Algebraic Curves and Cryptology TANC Thorie algorithmique des nombres et cryptologie - our project at INRIA Futurs My introductory book on elliptic curve cryptography Elliptic Curves and Their Applications to Cryptography - An Introduction. Kluwer Academic Publishers, 1999. Four pages on algebraic curve cryptography , presented at the STORK workshop 2002 C3,4 curves and their arithmetic My further publications Links CESAM Handbook of Applied Cryptography by A. Menezes, P. van Oorschot and S. Vanstone Algorithms for Modular Elliptic Curves by J. Cremona International Association for Cryptologic Research The Centre for Applied Cryptographic Research of the University of Waterloo IEICE Transactions Number Theory Web Number Theory Mailinglist IEEE Public Key Standard Cryptology ePrint Archive Electronic Frontier Foundation Checklink Last changes on 8th December 2004 by Andreas Enge
Ostrovsky, Rafail
Telcordia technologies researcher, works on zero-knowledge related schemes.
Rafi Ostrovsky's Home Page Rafail Ostrovsky Senior Research Scientist, Math Sciences Research Center Information Computer Sciences, Applied Research contact info: Office MCC-1C357B Phone (973) 829-4079 Fax (973) 829-2645 Email rafail@research.telcordia.com Secretary Kathy Hintz (973) 829-4848 E-mail khintz@telcordia.com Short Bio Dr. Ostrovsky received his Ph.D. in Computer Science from M.I.T. in 1992, where his thesis resolved a major open problem in the theoretical foundations of Software Protection. He was awarded NSF Postdoctoral Fellowship that he conducted at U.C. Berkeley until 1995, when he joined Bell Communications Research (Bellcore, later renamed into Telcordia Technologies.) Dr. Ostrovsky research interests are in the areas of Cryptography and Distributed Algorithms, with a primary focus in Cryptography with over 70 published papers and over 10 patents. Dr. Ostrovsky is a winner of 1993 Henry H. Taub Prize for his work in Zero-Knowledge. He was awarded the 1996 Bellcore prize for excellence in research. Dr. Ostrovsky works include the invention of proactive security in cryptography; disproving the Tiwari Conjecture; establishing that Private Information Retrieval is indeed possible for a single database; establishing a surprising connection between circuit complexity and privacy notions; as well as other fundamental contributions to the theory of cryptography. Dr. Ostrovsky has been recognized as a winner for the best published work at SAIC in 1999 in the area of Information and Communications Technology (SAIC is the parent company of Telcordia Technologies with over 38,000 employees) and as a winner for the best published work at SAIC in both 2001 and 2002 in the area of Mathematics and Computer Science. Dr. Ostrovsky is a co-chair of 2002 DIMACS Workshop on Cryptographic Protocols in Complex Environments, and has been a member of a number of program committees including ACM STOC (2000, 2003), CRYPTO (1998, 2002, and 2003), SCN (1999, 2002), SODA 2000 and RANDOM 2002. You can read Dr. Ostrovsky research summary here. Selected Publications Dr. Ostrovsky published over 70 papers in international journals and conferences, including papers invited for special issues. Click here for a detailed list of publications , which also includes at the end of the list Lecture Notes of a graduate cryptography course taught at U.C. Berkeley in 1994. You can also check DBLP Bibliography Server for a more updated list. Patents While at Telcordia, Dr. Ostrovsky filed 11 patents, many of them are already issued. Oded GOLDREICH and Rafail OSTROVSKY ``COMPREHENSIVE SOFTWARE PROTECTION SYSTEM'' U.S. Patent No.5,123,045. Rafail OSTROVSKY, Giovanni DI CRESCENZO, And Yuval ISHAI, ``METHOD AND SYSTEM FOR NON-MALLEABLE AND NON-INTERACTIVE CRYPTOGRAPHIC COMMITMENT IN A NETWORK'' U.S. Patent 6,301,664. William AIELLO, Rafail OSTROVSKY, And Sachin LODHA ``A METHOD FOR EFFICIENTLY REVOKING DIGITAL IDENTITIES'' U.S. Patent 6,397,329. Rafail OSTROVSKY, Yuval ISHAI, AND Giovanni DI-CRESCENZO, ``METHOD AND SYSTEM FOR PRIVATE INFORMATION RETRIEVAL USING COMMODITIES'' U.S. Patent 6,216,128. Rafail OSTROVSKY and Eyal KUSHILEVITZ, ``METHOD AND APPARATUS FOR PRIVATE INFORMATION RETRIEVAL FROM A SINGLE ELECTRONIC STORAGE DEVICE'' U.S. Patent 6,167,392. Rafail OSTROVSKY And Yuval RABANI, "METHOD AND SYSTEM FOR DETERMINING APPROXIMATE HAMMING DISTANCE AND APPROXIMATE NEAREST NEIGHBORS IN AN ELECTRONIC STORAGE DEVICE" U.S. Patent 6,226,640. Rafail OSTROVSKY, Yuval ISHAI, AND Giovanni DI-CRESCENZO, ``SYSTEM AND METHOD FOR PRIVATE INFORMATION RETRIEVAL USING VERIFIABLE COMMODITIES'' U.S. Patent 6,438,554. Fellowships and Honors SAIC 2002 Publication Prize for Best SAIC employee Publication in Mathematics and Computer Science (SAIC is Telcordia Parent company with over 38,000 employees) SAIC 2001 Publication Prize for Best SAIC employee Publication in Mathematics and Computer Science. SAIC 1999 Publication Prize for Best SAIC-empoloyee Publication in Information and Communications Technology. Bellcore prize for excellence in research, December 1996. Henry H. Taub Prize for the paper ``One-Way Functions are Essential for Non-Trivial Zero-Knowledge'', co-authored with Avi Wigderson, 1993. NSF Mathematical Sciences Postdoctoral Research Fellowship, 1992-1995. IBM Graduate Fellowship, 1990-92. SUNY at Buffalo Department of Mathematics Undergraduate Graduation Honors: With Highest Distinction, 1984. SUNY at Buffalo Undergraduate Dean's List of Excellence, 1983-84. Professional Activities Dr. Ostrovsky frequently consults both internally (within Telcordia and SAIC) and externally on security, cryptography, algorithmic and data-mining projects. He regularly referee papers for SIAM, JACM, JCSS, SICOMP, CRYPTOLOGY and other journals. Dr. Ostrovsky also regularly serves on international program committees: Program Committees CRYPTO-2003: 23nd Annual IACR IEEE Conference on Cryptologic Research, August 2003. STOC-2003:Annual ACM Symposium on Theory of Computing, May 2003. CRYPTO-2002: 22nd Annual IACR IEEE Conference on Cryptologic Research, 2002. RANDOM-2002: The 6th International Workshop on Randomization and Approximation Techniques in Computer Science, 2002. Co-organizer of DIMACS Workshop on Cryptographic Protocols in Complex Environments, May 15-17, 2002. SCN-2002: Third Workshop on Security in Communication Networks, September 2002, Amalfi, Italy. STOC-2000: Annual ACM Symposium on Theory of Computing, 2000. SODA-2000: Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 1-9, 2000, San Francisco. SCN-99: Second Workshop on Security in Communication Networks, September 1999, Italy. CRYPTO-98: 18th Annual IACR IEEE Conference on Cryptologic Research 1998. ISTCS-97: 5th ISRAEL Symposium on Theory of Computing and Systems, 1997. Studies NSF Postdoctoral Research Fellow, Conducted at U.C. Berkeley 1992-95. Ph.D., Computer Science, M.I.T. 1989-92. M.Sc., Computer Science, Boston University. B.A. Magna Cum Laude, Mathematics, (with department honors) SUNY at Buffalo. Authored Papers Home Back Top of Page Feedback www.telcordia.com Last Updated: 1999 - 2005 Telcordia Technologies, Inc.
Weis, Stephen
Graduate student at the MIT Crypto and Info Security Group. Working on Security and Privacy in Radio-Frequency Identification Devices.
Stephen A. Weis - Cryptography and Information Security Group - Massachusetts Institute of Technology Stephen A. Weis Cryptography and Information Security Group Computer Science and Artificial Intelligence Laboratory Home Bibliography Experience Resume CV Software Java Course Links Biography Stephen Weis is a fifth year graduate student in the Cryptography and Information Security group at MIT CSAIL . He is advised by Ron Rivest . His primary academic interests are cryptography, security, algorithms, and financial theory. Most recently, his work has focused on the security and privacy issues of radio-frequency identification (RFID) and pervasive computing devices. Other academic interests include complexity theory and game theory. Steve received his Master's degree in Computer Science from MIT in 2003. As an undergraduate, he attended UC Berkeley where he received degrees in Computer Science and Applied Mathematics. In the past, Steve has worked for RSA Security , Sun Labs , the OceanStore project, and Cisco Systems . In 2005, Steve taught computer science courses in Kenya as part of the MIT Africa Internet Technology Initiative . Outside of school, Steve coaches a lacrosse team for inner-city youth in East Boston and Chelsea through MetroLacrosse . email: sweis at mit dot edu office: 32-G694 , 32 Vassar Street, 02114 phone: 617-253-7583
Morain, Franois
Home page of Ecole Polytechnique researcher with links to cryptographic sites and to records in number theory.
Franois Morain Page personnelle de Franois Morain LIX Laboratoire d'Informatique de l' cole Polytechnique quipe Cryptologie Ma clef publique. Responsable scientifique du projet TANC . E-mail: morain(at)lix.polytechnique.fr 02 03 2005: encore un record pour SEA ( 1500 chiffres dcimaux ). 18 11 2004: un nouveau record pour SEA ( 1000 chiffres dcimaux ). fastECPP 27 01 2005 : version finale de l'article dcrivant fastECPP ( ps.gz , pdf ). 20 07 2004 : 15,071 chiffres dcimaux. L' annonce (en anglais); le certificat . 17 06 2004 : les transparents de mon expos au congrs ANTS-VI (Vermont). 20 12 2003 : 10,041 chiffres dcimaux. L' annonce (en anglais); le certificat . Un manuscrit dcrivant les calculs. 19 08 2003 : la barrire mythique des 10,000 chiffres dcimaux est franchie par l'implantation de J. Franke, T. Kleinjung et T. Wirth, avec la primalit de 10^9999+33603, dont le certificat se trouve ici . 16 7 2003 : 7127 chiffres dcimaux. L' annonce (en anglais); le certificat . L' article prliminaire . 6 6 2003 : 6016 chiffres dcimaux. L' annonce (en anglais, mise jour pour tenir compte des remarques); le certificat . La primalit en temps polynomial (aot 2002): l' article original d'Agrawal, Kayal, Saxena; les articles de Dan Bernstein. la page de P. Mihailescu contenant son amlioration de AKS. Mes commentaires initiaux en franais ( ps ou pdf ) avec une brve comparaison avec ECPP. Presque obsolte. Mon article pour le sminaire Bourbaki, en .ps.gz ou .pdf ; ainsi que les transparents de l'expos ( .ps.gz ou .pdf ). Sujets de recherche : thorie algorithmique des nombres et cryptologie. Enseignement Publications: par thmes ou par ordre chronologique. Mes nombres premiers Le programme ECPP (distribution en date du 2 4 2001). Quelques records en thorie des nombres Plus grands nombres premiers connus: 2^13466917-1 (4 053 946 chiffres dcimaux). 2^6972593-1 (2 098 960 chiffres dcimaux). 2^3021377-1 (909 526 chiffres dcimaux). 2^2976221-1 (895 932 chiffres dcimaux). Plus grands nombres premiers certifis 10^5019 + 3^2*7^5*11^11 (5020 chiffres dcimaux) par Giovanni et Marco La Barbera l'aide du programme PRIMO de Marcel Martin, 2001. Quelques grands nombres premiers ordinaires certifis: Catgorie mono-processeur: (32*10^6959-23) 99 (6959 chiffres dcimaux) par Hans Rosenthal l'aide du programme PRIMO de Marcel Martin, 13 juillet 2003. P5878 (5878 chiffres dcimaux) par Jose Luis Gomez Pardo l'aide du programme PRIMO de Marcel Martin, fvrier 2003. (98*10^4859 - 89) 99 (4859 chiffres dcimaux) prouv par H. Rosenthal l'aide du programme PRIMO de Marcel Martin, 2001. (348^1223 - 1) 347 (3106 chiffres dcimaux), prouv par Giovanni et Marco La Barbera l'aide du programme Titanix de Marcel Martin, janvier 2001. (30^1789-1) 29 (2642 chiffres dcimaux), prouv par Giovanni et Marco La Barbera l'aide du programme Titanix de Marcel Martin, octobre 2000. (2^7331-1) 458072843161 (2196 chiffres dcimaux), trouv par E. Mayer et F. Morain avec ECPP , octobre 1997. Catgorie multi-processeur: 2177^580+580^2177 (FM, 6 juin 2003). Plus grands nombres factoriss: 2^773 + 1 (233 chiffres dcimaux). (10^211-1) 9 (211 chiffres dcimaux) Plus grands nombres ordinaires factoriss: RSA-155 (155 chiffres dcimaux) Quelques pointeurs Thorie des nombres Le serveur de Keith Matthews Le serveur des nombres premiers Cryptographie Le serveur du GRECC Le chiffrement en France Le serveur de K. S. McCurley
Young, Moti
Adjunct Senior Research Scientist at Columbia University. Links to publications.
Moti Yung MOTI YUNG At Columbia University, Computer Science: Visiting Senior Research Scientist. At RSA Laboratories: Director, Advanced Authentication Research. Previously: I have been an Industry Consultant, working on information security and cryptography. Previously: I have been VP, Chief Scientist, with CertCo which is formerly: Bankers Trust E-Commerce (BTEC)). Previously: I have been with IBM T.J. Watson Research Center , Ph.D. -- Columbia University, Computer Science. Selected Publications Coming Soon... (but may take some time... well....) Meanwhile.. Partial Publication list A Book Malicious Cryptography: Exposing Cryptovirology by Adam Young and Moti Yung Published by John Wiley Sons . The book exposes threats that result from combining strong cryptography with malware to attack information systems. Attacks are presented that pit cryptography against cryptography itself by maliciously utilizing cryptographic algorithms to attack implementations of cryptosystems (called kleptographic attacks). The book also details defenses against these types of attacks. This new and unorthodox use of cryptography exploits modern cryptographic notions, constructions, and tools as "dark side" mechanisms (i.e., as methods that increase threats, and perhaps paradoxically, reduce overall system security). Research Interests Cryptography, Security, Networks and Distributed Systems, Theory of Computation: Computational Complexity, Randomization, Algorithms. Applications: Secure Systems Financial E-commerce Banking Secure Web. Projects at Columbia University Public Key cryptography Security of Cryptographic Primitives Design of Ciphers, Systems and Protocols Distributed Cryptosystems (threshold, proactive..) Cryptographic Protocols Cryptography and Complexity Algebraic methods in Cryptography Secret-Ballot Elections Kleptography -- The art of stealing information secretly and subliminally! Digital Rights, Information Hiding Privacy Issues Cryptographic Applications in Network Systems Security Threats and Countermeasures Links to Cryptography-Related Topics Digicrime: a joke! -- (but it has good links) People working and associated with Cryptology--(but: Home-Pages-Less not included) Ron Rivest's Crypto and Security Page Ron Rivest's Crypto Bibliography IACR: Int. Assoc. for Crypto Research More coming Soon... Links to Other Pages of Interest (Computer Science: Major Conferences and Journals) More... Coming Soon... List of some (Ex current) Graduate Students I co-advised and worked with Matt Franklin Alain Mayer Bulent Yener Xiangdong Yu Adam Young Jonathan Katz Aggelos Kiayias Also: a member of: UWM's Center Cryptography, Computer and Network Security , A center dedicated to the theoretical and applied studies of crypto and related areas. See newspaper report: discussion during UWM's day on e-commerce. Contact Information at Columbia University Address (at Columbia): Room 465 S.W. Mudd Building, Computer Science Department, Columbia University, New York, NY 10027, USA. E-mail: use: my first name at the host: cs.columbia.edu ......, more is coming... sometime soon..... Back to Computer Science , School of Engineering and Applied Science , Columbia University . Last updated: $Date: 2003 12 24 18:37:44 $ Moti Yung, user id:moti email-host id:cs.columbia.edu . . . . . . .
Nguyen, Phong Q.
Researcher at the cole normale suprieure. Links to publications and other details.
Phong Q. NGUYN Phong Q. Nguyen Position: CNRS tenure researcher at the cole normale suprieure , in the GRECC team . Research Area: Cryptology (see the International Association for Cryptologic Research ). Manager of AZTEC , ECRYPT 's Virtual Lab on Asymmetric Techniques. Ph.D., 1999 . What's new on this page Proposition de stage sur les fonctions de hachage . The Asiacrypt '05 paper is available. Click here for Crypto's rump session videos. Here are slides of talks I gave recently: EUROCRYPT '05 and PKC '05 . If you use GnuPG GPG , you may want to read this , as well as the corresponding Eurocrypt '04 article . Schedule Nov 24-25: Journes nationales de Calcul Formel . Dec 4-9: ASIACRYPT (India). Current program committees RIVF '06 (Vietnam) Post-Quantum Cryptography Workshop (Belgium) EUROCRYPT '06 (Russia) ASIACRYPT '05 (India)
Kohel, David R.
Lecturer in University of Sydney. Links to publications and courses he teaches.
David Kohel, Sydney Mathematics Statistics Dr. David R. Kohel Senior Lecturer School of Mathematics and Statistics University of Sydney, NSW 2006 Sydney, Australia Office : Carslaw 638 Tel : (61)-2-9351-3279 Fax : (61)-2-9351-4534 Email : kohel@maths.usyd.edu.au Algorithms : : Research : : Seminar : : Teaching Education and Postdoctoral Experience Senior Lecturer, Number Theory Group , School of Mathematics and Statistics at the University of Sydney , 2005-present. Lecturer in Cryptography, Computational Algebra Group , School of Mathematics and Statistics at the University of Sydney , 2002-2004. Postdoctoral Fellow, Mathematical Sciences Research Institute , Berkeley, California, Fall 2000. Senior Research Associate, Computational Algebra Group , School of Mathematics and Statistics at the University of Sydney , 1999-2000 and 2001. Postdoctoral Fellow, Department of Mathematics at the National University of Singapore , 1997-1999. Ph.D. Mathematics (1996), from the Department of Mathematics at the University of California, Berkeley B.S. Mathematics (1989), from the Department of Mathematics at Texas AM University B.S. Biochemistry (1989), from the Department of Biochemistry and Biophysics at Texas AM University Research Interests Algorithmic and computational algebraic number theory. Arithmetic of curves over number rings and finite fields. Integral and rational quadratic modules and arithmetic of quadratic hypersurfaces. Elliptic curves, modular curves, Shimura curves and supersingular divisors. Hecke module structures from quaternion algebras, quadratic forms, and supersingular elliptic curves. Abelian varieties and finite group schemes. Algebraic-geometric codes, cryptology, and discrete log problems. Curriculum vitae ( CV ) last revised August 2005. Algorithms : : Research : : Seminar : : Teaching David R. Kohel ( kohel@maths.usyd.edu.au ) University of Sydney
Kim Nguyen
Personal details, a link to his german homepage (many photos) and also to his PhD thesis.
Welcome! My name is Kim Nguyen, I am a number theorist working in cryptography. (At my thesis defense, 18th of December 2001). Short resume: 2004-: In January 2004 I will the German federal print (Bundesdruckerei GmbH), where I will be working on the implementation of contactless chip cards into travel documents and passports, focusing on the cryptographic aspects of these projects. In December 2001 I defended my Ph.D. thesis. 2001-2003: In July 2001 I joined the Cryptology Competence Center of Business Unit Identification, Philips Semiconductors located in Hamburg, Germany. 1998-2001: Ph.D. student at the Institute for Experimental Mathematics , University of Essen , Germany. Supervisor: Prof. Dr. Dr. h.c. Gerhard Frey. 1998: Staatsexamen in mathematics, physics, University of Gttingen , Germany. 1997: Diploma in mathematics, University of Gttingen , Germany. Research interests: Number theoretical cryptography, especially elliptic and hyperelliptic curves, finite fields My thesis deals with the interpretation of discrete logarithm problems in the (cohomological) language of Brauer groups. Here you can download the ps-file of my thesis. Here you can find my private homepage (german only, sorry). Contact: Kim.Nguyen_3@philips.com
Contini, Scott
His research papers and nice links to "FACTORING"
CryptoWorld! Welcome to CryptoWorld! Choose from the following: FactorWorld . Scott Contini's homepage . Security Consulting Services .
Purdy, George B.
University of Illinois. Links to software and notes on algorithms.
Dr. George B. Purdy Dr. George B. Purdy Professor of Computer Science . Ph.D., University of Illinois Email: george DOT purdy AT uc DOT edu Warning: Clicking on my address won't work! Please: Use your regular email server. Office: 828 Rhodes Hall Software for 20-ECES-735, Cryptography Note: Computer Security course notes may be found on Blackboard Notes for algorithms. Research Interests Cryptography and data security, algorithms for VLSI, discrete and computational geometry, computational number theory. Some of my Publications The Handbook of Combinatorics, Chapter 17, "Extremal Problems in Combinatorial Geometry" with Paul Erdos News Items Any questions or bug reports regarding the Electrical and Computer Engineering and Computer Science Information servers should go to webmaster@ece.uc.edu . Last modified: Thu Dec 17th, 1998 by George Purdy.
Jarecki, Stanislaw
UCI Asst Prof. Works on Threshold Cryptography. Links to his publications
Stanislaw Jarecki Stanislaw Jarecki Assistant Professor, School of Information and Computer Sciences , University of California atIrvine Office: Computer Science, 358C Office Tel: 949-824-8878 Office Fax: +1(949)824-4056 Electronic address:concatenate my username "stasio", the "@" sign, and a string "ics.uci.edu" Mailing address: School of Information and Computer Science, 444 Computer Science Bldg, University of California, Irvine, Irvine, CA 92697-3425 Research Interests: Cryptography, Security, Fault-Tolerant Distributed Computing Professional Activities: Program committees: Crypto 2005 , ACNS 2005 , CT-RSA 2005 , Eurocrypt 2003 Teaching: Fall'05: ICS 22H, Honors Introduction to Computer Science (II) Fall'05: ICS 268, Cryptography and Communication Security Previousquarters: ICS 268, Cryptography and Communication Security, Fall'04 , ICS 180, Intro toCryptography (undergraduate) Spring'04 , ICS 280, Intro toCryptography (graduate) Winter'04 Publications: Further Simplifications in Proactive RSA Signatures,to appear, Theory of Cryptography Conference'05 Stanislaw Jarecki andNitesh Saxena (.pdf) Probabilistic Escrow of Financial Transactions with Cummulative Threshold Disclosure,to appear, Financial Cryptography'05 Stanislaw Jarecki andVitaly Shmatikov (.pdf) Secret Handshakes from CA-oblivious Encryption, Asiacrypt '04 Claude Castelluccia, Stanislaw Jarecki, and Gene Tsudik abstract.html (.pdf) An Attack on the Proactive RSA Signature Scheme in the URSA Ad Hoc Network Access Control Protocol, SASN '04 Stanislaw Jarecki, Nitesh Saxena,and Jeong Hyun Yi abstract.html (.pdf) Versatile Padding Schemes for Joint Signature and Encryption, CCS '04 Yevgeni Dodis, Michael J. Freedman, Stanislaw Jarecki,and Shabsi Walfish abstract.html (.pdf) A Robust Multisignature Scheme with Applications to Multicast Acknowledgement Aggregation, SCN '04 Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,and Gene Tsudik abstract.html (.pdf) Handcuffing Big Brother: An Abuse-Resilient Transaction Escrow Scheme, Eurocrypt '04 Stanislaw Jarecki and Vitaly Shmatikov abstract.html (.pdf) A Signature Scheme as Secure as the Diffie Hellman Problem, Eurocrypt '03 Eu-Jin Goh and Stanislaw Jarecki abstract.html (.pdf) (.ps) Revisiting the Distributed Key Generation for Discrete-Log Based Cryptosystems, RSA Security '03 Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,and Tal Rabin abstract.html (.pdf) (.ps) Negotiated Privacy, International Symposium on Software Security '02 , Stanislaw Jarecki, Pat Lincoln and Vitaly Shmatikov, (.pdf) Cryptographic Primitives Enforcing Communication and Storage Complexity, Financial Cryptography'02 Philippe Golle, Stanislaw Jarecki,and Ilia Mironov (.pdf) Adaptively Secure Threshold Cryptosystems without Erasures, manuscrypt, 1999. Stanislaw Jarecki and Anna Lysyanskaya (.ps) (.ps.gz) This work appeared as"Adaptively secure threshold cryptography: Introducing concurrency,removing erasures" in Eurocrypt '00 , as a jointpublication with another work of Anna Lysyanskaya, ( .ps) ( .ps.gz) ( .pdf ) Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin Adaptive Security for Threshold Cryptosystems, Crypto '99 extended version: (.ps) (.ps.gz) Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Eurocrypt '99 extended version: (.ps) (.ps.gz) Stanislaw Jarecki and Andrew Odlyzko An efficient micropayment system based on probabilistic polling, Financial Cryptography '97 (.ps) (.ps.gz) Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Markus Jakobsson, and Moti Yung Proactive Public Key and Signature Systems, ACM Security '97 (.ps) (.ps.gz) Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin Robust and Efficient Sharing of RSA Functions, Journal of Cryptology , vol. 13 (2): 273-300, 2000 (.ps) (.ps.gz) [The preliminary versionappearedin Crypto '96 ] Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin Robust Threshold DSS Signature, Information and Computation , vol. 164 (1): 54-84, 2001 abstract.html (.ps) (.ps.gz) [The preliminary versionappeared in Eurocrypt '96 .] Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung Proactive Secret Sharing, or How to Cope with Perpetual Leakage, Crypto '95 an extended version: abstract.html (.ps) (.ps.gz) Short Bio: I joined UCI as an assistant professorin the School of Information and Computer Sciences in July 2003. InJune 2001 Igraduatedfrom the MIT Computer Science PhD program, where I studied cryptography under the guidance of Prof. Shafi Goldwasser . Between MIT and UCI,I firstworkedat Intertrust 's "StarLab", a small research lab in the Silicon Valley company which was developing Digital Rights Management systems, and then I spent a yearas apostdocat the applied cryptography group led by prof. Dan Boneh at Stanford. Information and Computer Science University of California, Irvine Irvine, CA 92697-3425 Last modified:29Oct 2004 (Here are some pointers on how to learn HTML .)
Blum, Manuel
Turing Awardee. Details about him. Some of publications and courses he teaches.
Manuel Blum Manuel Blum B.S. in Electrical Engineering, Massachusetts Intitute of Technology, 1959 M.S. in Electrical Engineering, Massachusetts Intitute of Technology, 1961 Ph.D. in Mathematics, Massachusetts Institute of Technology, 1964 Professor W: (510) 642-1662 H: (510) 525-8730 blum@cs.berkeley.edu Awards Lectureships ACM's A. M. Turing Award, 1995 Arthur J. Chick Chair, EECS, 1995 Fellow, American Academy of Arts and Sciences, 1995 Faculty Research Lecturer, UC Berkeley Academic Senate, 1994 Sigma Xi's Monie A. Ferst Award, 1991 Fellow, American Association for the Advancement of Science, 1988 Fellow, IEEE, 1987 Invited Lecturer, International Congress of Mathematicians, 1986 Chair, Computer Science Division, 1977-1980 Distinguished Teaching Award, Academic Senate of UC Berkeley, 1977 Distinguished Lecturer: University of Washington, Princeton University, Massachusetts Institute of Technology, Carnegie Mellon University, Georgia Institute of Technology, Dartmouth University. Committees to Evaluate Computer Science Departments at Ph.D. Granting Institutions. Notes for CS170: Introduction to Theoretical CS. Notes for CS174: Probability and Graph Theory in CS. Selected Publications. International Conference on Theoretical Computer Science (with photos and videos) International Workshop On Cryptographic Techniques and E-Commerce (CrypTEC '99) CALL FOR PAPERS My PhD students over the years: * Andy Kang, Daisy Systems * Tsun Chow, Bell Labs * Ion Filotti, Paris Sud * Ivan Marques, UF, Rio de Janeiro * John Gill, Stanford * Ken Manders, Pitt * Leonard Adleman, USC * Dana Angluin, Yale * Gary Miller, CMU * William Sakoda, Penn State * Howard Katseff, Bell Labs * Michael Sipser, MIT * Silvio Micali, MIT * Shafi Goldwasser, MIT and Weizmann * Joan Plumstead, aka Joan Boyar * Vijay Vazirani, Georgia Tech * Eric Bach, Wisconsin * Rene Peralta, Minnesota * Umesh Vazirani, Berkeley * Steven Rudich, CMU * Moni Naor, Weizmann * Russell Impagliazzo, San Diego * Sampath Kannan, UPenn * Ronitt Rubinfeld, Cornell * Peter Gemmell, Sandia * Mor Harchol, MIT * William S. Evans, Arizona * Mor Harchol, MIT * Troy Shahoumian , HP * Hal Wasserman , CMU (click here for information on result-checking)
Pointcheval, David
Researcher at the CNRS. Homepage with publications and lecture notes of his courses.
David Pointcheval David Pointcheval Ph.D. in Computer Science Researcher at the CNRS Head of the Crypto Team at ENS Program Chair of the 6th RSA Conference Cryptographers' Track 2006 (CT-RSA '06) Call for Papers List of accepted papers Final program Editor IEE Proceedings - Information Security Special Issue on Cryptography in Networks - International Journal of Networks and Security Coordinator of the ACI Scurit Informatique CESAM CESAM : Les Courbes Elliptiques pour la Scurit des Appareils Mobiles (Elliptic Curves for Securing Mobile Devices) Contact Information Ecole normale suprieure -- Dpartement d'informatique 45, rue d'Ulm 75230 PARIS Cedex 05 France Tel: +33 1 4432 2113 Fax: +33 1 4432 2151 E-mail: URL: www.di.ens.fr users pointche How to visit? Office S6, at level -1, in "aile Rataud" Program Committees ACISP '06 - July (Melbourne, Australia) February, 2006 CANS '05 - 14-16 December (Fujian, China) July 1st, 2005 ICICS '05 - 6-9 December (Beijin, China) July 1st, 2005 Asiacrypt '05 - 1-4 December (Chennay [Madras], India) May 30, 2005 ISC '05 - 20-23 September (Singapore) April 11, 2005 ICALP '05 - 11-15 July (Lisboa, Portugal) February 13, 2005 FC '05 - 28 Feb-3 March (Roseau, The Commonwealth Of Dominica) September 17, 2004 PKC '05 - 23-26 January ("Les Diablerets", Switzerland) August 26, 2004 Previous Program Committees News 09 02 2005: Full version of A Simple Threshold Authenticated Key Exchange from Short Secrets (Asiacrypt '05) 03 28 2005: Full version of Interactive Diffie-Hellman Assumptions with Applications to Password-based Authentication (FC '05) 03 19 2005: New version of Key Derivation and Randomness Extraction (ePrint 2005 061) 02 25 2005: Full version of Public Traceability in Traitor Tracing Schemes (Eurocrypt '05) 11 25 2004: Full version of One-time Verifier-based Encrypted Key Exchange (PKC '05) 11 25 2004: Full version of Password-Based Authenticated Key Exchange in the Three-Party Setting (PKC '05) 09 28 2004: Full version of Simple Password-Based Authenticated Key Protocols (CT-RSA '05) Previous News Links to my PhD Students Benot Chevallier-Mames - 2003 Duong Hieu Phan - 2002 2005 Archives Previous Program Committees Previous News Previous Program Committees Asiacrypt '04 - 5-9 December (Jeju Island, South Korea) May 21, 2004 ICISC '04 - 2-3 December (Seoul, South Korea) September 1, 2004 ACM CCS '04 - 25-29 October (Washington DC, USA) May 3, 2004 ICICS '04 - 27-29 October (Malaga, Spain) May 31, 2004 ACISP '04 ACISP '04 - 13-15 July (Sydney, Australia) February 20, 2004 RSA '04 - February (San Francisco, California, USA) Financial Cryptography '04 - February (Key West, Florida, USA) ICISC '03 - November (Seoul, South Korea) ACM CCS '03 - October (Washington DC, USA) Eurocrypt '03 - May (Varsaw, Poland) RSA '03 - April (San Francisco, California, USA) Previous News 08 05 2004: Full version of OAEP 3-Round: A Generic and Secure Asymmetric Encryption Padding (Asiacrypt '04) 07 31 2004: Full version of On the Security Notions for Public-Key Encryption Schemes (SCN '04) 06 29 2004: Full version of About the Security of Ciphers (Semantic Security and Pseudo-Random Permutations) (SAC '04) 06 02 2004: Full version of IPAKE: Isomorphisms for Password-based Authenticated Key Exchange (Crypto '04) 06 02 2004: Final version of How to Disembed a Program? (CHES '04) 02 11 2004: Slides of the Lectures for the "Advanced Course on Comptemporary Cryptology" - Provable Security for Public Key Schemes 01 16 2004: Full version of New Security Results on Encrypted Key Exchange (PKC '04) 09 30 2003: Final version of A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications (Asiacrypt '03) 09 30 2003: Full version of Chosen-Ciphertext Security without Redundancy (Asiacrypt '03) 09 30 2003: Full Version of Security Proofs for an Efficient Password-Based Key Exchange (ACM-CCS '03) 09 30 2003: Full version of Mutual Authentication and Group Key Agreement for Low-Power Mobile Devices (IEEE MWCN '03) 05 27 2003: Final version of The Impact of Decryption Failures on the Security of NTRU Encryption (Crypto '03) 16 04 2003: Full version of Parallel Authentication and Public-Key Encryption (ACISP '03) 12 19 2002: Analysis of the password-based key exchange AuthA, secure against dictionary attacks, proposed to IEEE P1363 - Proofs of Security for Password-Based Key Exchange (IEEE P1363 AuthA Protocol and Extensions) (ePrint 2002 162) 12 06 2002: Full version of Group Diffie-Hellman Key Exchange Secure Against Dictionary Attacks (Asiacrypt '02) 09 30 2002: Final version of The Group Diffie-Hellman Problems (SAC '02) 09 27 2002: PowerPoint slides of Provable Security in Cryptography -- DL-based Systems (ECC -- September 2002) 06 17 2002: Manuscript and PowerPoint Slides of my Habilitation Diriger des Recherches 06 02 2002: Final version of Analysis and Improvements of NTRU Encryption Paddings (Crypto '02) 05 29 2002: Final version of Flaws in Applying Proof Methodologies to Signature Schemes (Crypto '02) 04 29 2002: Journal of Cryptology Paper to appear : RSA-OAEP is Secure under the RSA Assumption 04 26 2002: Announcement of Financial Cryptography '03 04 26 2002: Announcement of my Habilitation Diriger des Recherches 04 11 2002: Survey on RSA-OAEP How to Encrypt Properly with RSA (CryptoBytes) 03 14 2002: Final version of Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions (Eurocrypt '02) 12 16 2001: Final version of GEM: a Generic Chosen-Ciphertext Secure Encryption Method (RSA '02) 12 16 2001: Final version of Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages (PKC '02) 12 07 2001: Final Version of Practical Security in Public-Key Cryptography (ICISC '01) 11 28 2001: PowerPoint slides of Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks (Asiacrypt '01) 11 22 2001: PowerPoint slides of Practical Security in Public-Key Cryptography (ICISC '01) David Pointcheval -- Updated October 10th, 2005
Chaum, David
Founder of DigiCash Inc. Homepage with lists of research papers and patents.
David Chaum David Chaum Dr. David Chaum is the founder and a member of the Board of Directors of DigiCash Inc., a company that has pioneered electronic cash innovations. He received his Ph.D. in Computer Science, with a minor in Business Administration, from the University of California at Berkeley and taught at New York University Graduate School of Business Administration and at the University of California. He built up a cryptography research group at the Center for Mathematics and Computer Science ( CWI ) in Amsterdam and during this time also founded DigiCash. In 1993, he left CWI to become CEO of DigiCash, which had doubled in size since its founding in 1990 with 12 employees. In the area of cryptography, he has published over 45 original technical articles (see list of articles ), received over 17 US patents , and founded the scientific organization, the International Association for Cryptographic Research ( IACR ). Concurrently he created and chaired the Smart Card 2000 conferences and several European Union funded industry consortia, including CAFE , which focused on electronic-wallets and the smart cards they hold.. Professional recognition includes invited articles featured in Scientific American (August 92) and Communications of the ACM (February 81), EU Technology Innovations Award ITEA 95 , D.A.A.D. and UC Regents Fellowships. He has appeared often in popular and trade media, and is widely consulted on matters of cryptography, payments policy and overall technology direction. info@chaum.com
Salomaa, Arto
Information about his Books and publications. Also includes personal details.
Arto Salomaa's Home Page
Boyd, Colin
Faculty at ISRC, QUT. Homepage with links to publications.
Colin Boyd's Home Page Colin Boyd I am a Professor in the School of Software Engineering and Data Communications at Queensland University of Technology in Australia . I am also Deputy Director of the Information Security Institute here at QUT. Contact Information Physical Room 704, 126 Margaret Street Postal Information Security Institute, School of Software Engineering and Data Communications, Queensland University of Technology, Brisbane Q4001 Australia Vocal Telephone: +61 7 3864 9549 Paper Fax: +61 7 3221 2384 Electronic mail PGP Public Key Research My particular research interests are in secure cryptographic protocols though I also have an interest in many area of computer and communications security and also in cryptographic algorithms. Find the latest crytpography news from the IACR . A great source for the latest news in computer security is the electronic newsletter Cipher . If you are looking for cryptography literature I recommend starting at Helger Lipmaa's Cryptology Pointers . An incomplete list of my own publications is available. If you are interested in security proofs for key establishment protocols you may like to refer to the Protocols Lounge maintained by my PhD student Raymond Choo. Conferences These are some forthcoming conferences I am associated with in some way. Asiacrypt 2005 Australasian Information Security Workshop 2006 Eurocrypt 2006 Teaching I am the course co-ordinator in the Faculty of Information Technology for the course IT60 leading to the Master of Information Technology by Research. If you need any information on the course please get in touch and I will do my best to help you. Students may email me at any time to make an appointment at a convenient time. You may also drop by if you are in the building; if I am free I will be pleased to talk to you. Other Interests Most of my "spare" time is taken up by my three children . I used to play a lot of chess when I was younger but I am currently in retirement (probably temporary). Instead I have recently taken up basketball . Last modified: 17th October 2005 Colin Boyd
Blackburn, Simon
Head of Math dept of Royal Holloway, London. List of Publications.
Simon Blackburn's Home Page Department of Mathematics Simon R. Blackburn Head of Department and Professor of Pure Mathematics at Royal Holloway, University of London. I am a mathematician, not a philosopher! If you are looking for Simon Blackburn the philosopher, try here. I organise the pure maths seminar . Address Main research interests Web links List of publications Mathematics home page Address: Department of Mathematics Royal Holloway, University of London Egham Surrey TW20 0EX UK Tel 01784 443422 Fax 01784 430766 Email s.blackburn@rhul.ac.uk Main research interests: Combinatorics Cryptography Group Theory Web links: Engineering and Physical Sciences Research Council (EPSRC) London Mathematical Society (LMS) American Mathematical Society (AMS) International Association for Cryptologic Research (IACR) Kevin McCurley's Crypto Research Web List Doug Stinson's Home Page Peter Cameron's Design Resources on the Web UK Mathematics Departments Mathematics Departments Worldwide sci.crypt.research sci.math.research List of publications: (For a hard copy of any of these publications, just email me) S. R. Blackburn, C. Cid and S.G. Galbraith, `Cryptanalysis of a cryptosystem based on Drinfeld modules', IEE Proc. Information Security, to appear. S. R. Blackburn, D. Gomez-Perez, J. Gutierrez and I. E. Shparlinski, `Reconstructing noisy polynomial evaluation in residue rings', J. Algorithms, to appear. S. R. Blackburn, D. Gomez-Perez, J. Gutierrez and I. E. Shparlinski, `Predicting nonlinear pseudorandom number generators', Math. Comp., Vol. 74 (2005), pp. 1471-1494. S. R. Blackburn and K.G. Paterson, `Cryptanalysis of a message authentication code due to Cary and Venkatesan', in Fast Software Encryption 2004, Lecture Notes in Computer Science Vol. 3017, B. Roy and W. Meier (Eds), (Springer, Berlin, 2004), pp. 446-453. S. R. Blackburn, D. Gomez-Perez, J. Gutierrez and I. E. Shparlinski, `Predicting the inversive generator' in Cryptography and Coding. Proc. 9th IMA Intern. Conf on Cryptography and Coding, Lecture Notes in Computer Science 2898, K.G. Paterson (Ed.), (Springer, Berlin, 2003), pp. 264-275 . S.R. Blackburn and A.J. Spencer, `Products of subsets in an abelian group', J. Comb. Theory - Series A, Vol. 103 (2003), pp. 53-68. S.R. Blackburn, `Combinatorial schemes for protecting digital content', in Surveys in Combinatorics 2003, C.D. Wensley (Ed.) (Cambridge University Press, Cambridge, 2003), pp. 43-78. S.R. Blackburn, `An Upper Bound on the Size of a Code with the k-Identifiable Parent Property', J. Comb. Theory - Series A, Vol. 102 (2003), pp. 179-185. S.R. Blackburn, `Frameproof Codes', SIAM Journal of Discrete Mathematics, Vol. 16 (2003), pp. 499-510. S.R. Blackburn and T. Garefalakis, `Cryptanalysis of a cryptosystem due to Yoo, Hong, Lee, Lim, Yi and Sung', Electronics Letters, Vol. 37, No. 18 (2001), pp. 1118-1119. S.R. Blackburn and E. Teske, `Baby-step giant-step algorithms for non-uniform distributions', in Proceedings of ANTS IV, Lecture Notes in Computer Science 1838, W. Bosma (Ed.) (Springer, Berlin, 2000), pp. 153-168. S.R. Blackburn and S.D. Galbraith, `Certification of secure RSA keys', Electronics Letters, Vol. 36, No. 1 (2000), pp. 29-30. Also see: `Certification of secure RSA Keys', Tech. Report CORR 99-44 , University of Waterloo. S.R. Blackburn, `Perfect hash families: probabilistic methods and explicit constructions', J. Comb. Theory - Series A, Vol. 92 (2000), pp. 54-60. S.R. Blackburn and S.D. Galbraith, `Cryptanalysis of two cryptosystems based on group actions', in Advances in Cryptology -- ASIACRYPT '99, Lecture Notes in Computer Science 1716, K.Y. Lam, E. Okamoto, C. Xing (Eds.) (Springer,Berlin, 1999) pp. 52-61. S.R. Blackburn, `Cryptanalysis of a public key cryptosystem due to Wu and Dawson', IEE Proc. Computers and Digital Techniques, Vol. 146, No. 4 (1999), pp. 185-186. S.R. Blackburn, `Groups of prime power order with derived subgroup of prime order', J. Algebra, Vol. 219 (1999), pp. 625-657. S.R. Blackburn, `The linear complexity of the self-shrinking generator', IEEE Trans. Inform. Theory, Vol. 45, No. 6 (1999), pp. 2073-2077. S.R. Blackburn, `Cryptanalysis of a Keystream Generator due to Chan and Cheng', Electronics Letters, Vol. 34, No. 18 (1998), pp. 1737-1738. S.R. Blackburn, S. Blake-Wilson, M. Burmester and S.D. Galbraith, `Weaknesses in shared RSA key generation protocols' in Cryptography and Coding, 7th IMA International Conference, Cirencester, Lecture Notes in Computer Science 1746, M. Walker (Ed.) (Springer, Berlin, 1999), pp. 300-306. Also see: `Shared generation of shared RSA Keys', Tech. Report CORR 98-19 , University of Waterloo. S.R. Blackburn, K. Brincat, F. Mirza and S. Murphy, `Cryptanalysis of ``Labyrinth'' stream cipher', Electronics Letters, Vol. 34, No. 12 (1998), pp. 1220-1221. S.R. Blackburn and P.R. Wild, `Optimal linear perfect hash families', J. Comb. Theory - Series A, Vol. 83 (1998), pp. 233-250. S.R. Blackburn, `Orthogonal Sequences of Polynomials over Arbitrary Fields', J. Number Theory, Vol. 68, No. 1 (1998), pp. 99-111. S.R. Blackburn, `Combinatorics and Threshold Cryptography', in Combinatorial Designs and their Applications (Chapman and Hall CRC Research Notes in Mathematics 403) F.C. Holroyd, K.A.S. Quinn, C. Rowley and B.S. Web (Eds.), CRC Press, London, 1999, pp. 49-70. S.R. Blackburn, `Fast Rational Interpolation, Reed--Solomon Decoding and the Linear Complexity Profiles of Sequences', IEEE Trans. Inform. Theory, Vol. 43, No. 2 (1997), pp. 537-548. S.R. Blackburn, `A Generalised Rational Interpolation Problem and the Solution of the Welch--Berlekamp Key Equation', Designs, Codes and Cryptography, Vol. 11, No. 3 (1997), pp. 223-234. S.R. Blackburn, `The Sajdak Conjecture', Math. Spectrum, Vol. 30, No. 1 (1997), pp. 15-16. S.R. Blackburn, M. Burmester, Y. Desmedt and P.R. Wild, `Efficient Multiplicative Sharing Schemes', in Advances in Cryptology -- EUROCRYPT '96, Lecture Notes in Computer Science 1070, U. Maurer (Ed.) (Springer,Berlin, 1996) pp. 107-118. S.R. Blackburn and W.G. Chambers, `Some Remarks on an Algorithm of Fitzpatrick', IEEE Trans. Inform. Theory, Vol. 42, No. 4 (1996), pp. 1269-1271. S.R. Blackburn, T. Etzion and K.G. Paterson, `Permutation Polynomials, de Bruijn Sequences and Linear Complexity', J. Comb. Theory - Series A, Vol. 76, No. 1 (1996), pp. 55-82. S.R. Blackburn, S. Murphy and K.G. Paterson, `A Comment on ``A New Public-Key Cipher System based upon the Diophantine equations'' ', IEEE Trans. Comp., Vol. 46, No. 4 (1997), pp. 512. S.R. Blackburn, S. Murphy and K.G. Paterson, `Comments on ``Theory and Applications of Cellular Automata in Cryptography'' ', IEEE Trans. Comp., Vol. 46, No. 5 (1997), pp. 637-638. S.R. Blackburn and F.C. Piper, `Applications of Combinatorics to Security', in Proceedings of `The Applications of Combinatorial Mathematics', Oxford, 14-16 December 1994, C. Mitchell (Ed.) (Oxford University Press, Oxford, 1997), pp. 31-47. S.R. Blackburn,`A Note on Sequences with the Shift and Add Property', Designs, Codes and Cryptography, Vol. 9 (1996), pp. 251-256. U. Baum and S.R. Blackburn, `Clock-controlled Pseudorandom Generators on Finite Groups', in Fast Software Encryption, 2nd International Workshop, Leuven, Belgium, Lecture Notes in Computer Science 1008, B. Preneel (Ed.) (Springer, Berlin, 1995), pp. 6-21. S.R. Blackburn, `A Generalisation of the Discrete Fourier Transform', in Applications of Finite Fields, Proceedings of a conference held at Royal Holloway, University of London, Surrey, U.K., D. Gollmann (Ed.) (Oxford University Press, Oxford, 1996), pp. 111-116. S.R. Blackburn, `A Generalisation of the Discrete Fourier Transform: Determining the Minimal Polynomial of a Periodic Sequence' IEEE Trans. Inform. Theory, Vol. 40 (1994), No. 5, pp. 1702-1704. S.R. Blackburn, `Increasing the Rate of Output of m-Sequences', Information Processing Letters, Vol. 51 (1994), pp. 73-77. S.R. Blackburn, G. Carter, D. Gollmann, S. Murphy, K. Paterson, F. Piper and P. Wild, `Aspects of Linear Complexity', in Communications and Cryptography, (Blahut, Costello, Maurer, Mittelholzer eds) (Kluwer, Boston, 1994), pp. 35-42. S.R. Blackburn, S. Murphy and J. Stern, `Weaknesses of a Public-Key Cryptosystem based on Factorizations of Finite Groups' in Advances in Cryptology -- EUROCRYPT `93, Lecture Notes in Computer Science 765, T. Helleseth (Ed.) (Springer, Berlin, 1994), pp. 50-54. S.R. Blackburn, S. Murphy and J. Stern, `The Cryptanalysis of a Public Key Implementation of Finite Group Mappings' J. Cryptology, Vol. 8 No. 3 (1995), pp. 157-166. S.R. Blackburn, `Node Bisectors of Cayley Graphs', Mathematical Systems Theory, Vol 29 (1996), pp. 589-598. S.R. Blackburn, `Enumeration within Isoclinism Classes of Groups of Prime Power Order' J. London Math. Soc.(2) Vol. 50 (1994), pp. 293-304. S.R. Blackburn
Desmedt, Yvo
Threshold Cryptography introducer. Prof at Stanford Univ. Links to publications and research topics.
Yvo G. Desmedt's Home Page Information security at FSU ACM Workshop on Scientific Aspects of Cyber Terrorism (SACT) PKC 2003, Miami, Florida Yvo G. Desmedt Professor Ph.D. from University of Leuven, Belgium His main interests include cryptography, network security, and computer security. Picture with Richard Clarke (Cyber Security czar) and Michael J. Jacobs on May 24, 2001 Other pictures Address He can be best reached by e-mail. Due to unsolicited junk mail no e-mail address is provided. The format of the e-mail is "my lastname" at cs.fsu.edu tel: +1 (850) 644-9298, fax: +1 (850) 644-0058 US mail: Department of Computer Science PO Box 4530 206 Love Building Florida State University Tallahassee, FL 32306-4530 Recent lectures Teaching related Current Research Topics and Recent Publications on: Information Hiding, Tracing and Watermarking Survivable computation Threshold Cryptography , Key Distribution , Key Escrow , Other computer security topics, e.g. computer viruses . Complete Vitae (January 29, 2004) in PS format , in PDF format THIS IS A TEMPORARY PAGE, A MORE DETAILED ONE IS IN PREPARATION Bouncing e-mail Since December 25, 2001, I have received several complains that e-mail to my account is bouncing. I have been told that this problem has now been fixed. So, please resend your e-mail. If that still does not work, please phone me after March 24. If it is more urgent phone (850) 644-2644 and a phone number will be given where you can reach me. Last modified: May 30, 2002
Camenisch, Jan
IBM Researcher. List of Cryptographers. His publications.
Jan Camenisch Jan Camenisch IBM Zurich Research Laboratory Sumerstrasse 4 CH-8803 Rschlikon Switzerland jca(at)zurich.ibm.com Office: C 271 Phone: +41-1-724-8279 Fax: +41-1-724-8953 PGP-Key: 2048 30FD1811 [ Selected Publications | idemix for Privacy | Mobile Security | Hompages of Some Cryptographers ] IBM doesn't necessarily share my personal opinions stated on this page. Last modified: Fri, 19 Oct 2001 15:16 [ Zurich home page | Research home page ] [ Home | Shop | Contact IBM | Search | Privacy | Legal ]
Naor, Moni
Home page with his publications. Puzzles of Computer Sc. Research details at Weizmann Institute.
Home page of Moni Naor Home page of Moni Naor The Judith Kleeman Professorial Chair Moni Naor Dept. Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 ISRAEL Office Phone: +972-8-934-3701 Home Phone: +972-3-644-8781 Fax: +972-8-934-4122 Ziskind Building , Room 248 Email: I am a professor of computer science at the Weizmann Institute of Science. My research is in Foundations of Computer Science, especially Cryptography. Papers Available On-line All on-line papers , Recent Papers , By topic , Technical Reports Foundations of Computer Science at the Weizmann Institute Information on Research in Foundations of Computer Science The Puzzler page containing puzzles, games and other recreations reflecting research Upcoming Seminars and Events Students PhD: Danny Harnik Tal Moran Asaf Nussbaum Udi Wieder Former PhD: Tzvika Hartman (joint with Ron Shamir) Yehuda Lindell - now at Bar Ilan Kobbi Nissim - now at Microsoft Benny Pinkas - now at HP Labs Omer Reingold - now back at Weizmann Alon Rosen - now at MIT Avishai Wool (joint with David Peleg) - now at Tel-Aviv University MSc: Hillel Maoz Gil Segev Former MSc: Uri Nadav Guy Rothblum Sitvanit Ruah Courses home page: Complexity Theory 2004 5 Foundations of Cryptography ENS Lectures - On Necessary and Sufficient Cryptographic Assumptions: the Case of Memory Checking of Cryptography Theory of Cryptography 2004 Feb 19-21 2004, Cambridge MA, USA, at MIT Home page for TCC2004 Local Information Proceeding: LNCS 2951, Springer To the Faculty of Mathematics and Computer Science Home Page
Malapati, Raja Sekhar
Links to his academic details, his publications, and link to Malapati's CRYPTOPATH and Indian Cryptography Activities.
Malapati Raja Sekhar's (Googler) Personal Homepage : Researcher on Cryptography This page uses frames, but your browser doesn't support them.
Goldreich, Oded
This site contains links to his online e-books, publications and his personal information.
Oded Goldreich - homepage Quick Reference Books + lecture notes Papers FAQ Studies at WIS CV and profile opinions personal Fancier homepage Oded Goldreich Oded Goldreich is a Professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science , Israel. Main Research Interests: Randomness and Computation (specifically, pseudorandomness and probabilistic proof systems of various types) and Foundations of Cryptography. Additional Research Interests: Complexity Theory at large. For more details, see academic profile . BOOKS and LECTURE NOTES (information and texts available on-line) Foundations of Cryptography : A two-volume textbook ( Vol1 , 2001; Vol2 , 2004). The above superseeds older fragments (1995) and lecture notes (1989) . Surveys (1997, 2001 and 2004). Modern Cryptography, Probabilistic Proofs and Pseudorandomness (1998). Introduction to Complexity Theory - Lecture Notes (1999 and 2002). Randomized Methods in Computation - Lecture Notes (2001). PAPERS available on-line ( general list ) [See Copyright Notice. ] See also partial lists of most RECENT papers CRYPTOGRAPHIC related papers and COMPLEXITY related papers webpages on SPECIFIC topics Technical SURVEYS and Some useful trivialities Non-technical ESSAYS and opinions (e.g., Theory of Computation: A Scientific Perspective ) The GMW papers: Zero-Knowledge and Secure Function Computation . ADDITIONAL INFORMATION FAQ: Answers to frequently asked questions and requests . GRADUATE STUDIES in the Theory of Computing, at Weizmann Institute . Foundations of Computer Science Seminar . Currently teaching: Introduction to Complexity Theory. The Shimon Even Memorial Page . Curriculum Vitae , periodical statements and academic profile . Some professional ventures (served by O.G.). A fancier homepage . A personal web-page and more photos . WIS'03 poster and RIAS'03-04 poster . Additional links ( ECCC , CS in Israel, etc). Mailing address: Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, ISRAEL phone: (972)(8)9344215 fax: (972)(8)9344122 click here for email address
Sarkar, Palash
Resume of Palash Sarkar, details of his publications and his photos.
PALASH SARKAR Applied Statistics Unit Indian Statistical Institute 203, B.T. Road, Kolkata 700035, INDIA. e-mail: palash@isical.ac.in I am a member of the Cryptology Research Group at the Indian Statistical Institute. Academics Professional Experience Publications Curriculum Vitae (not regularly updated) Link to Hiji-bij-bij home page Here are some family pictures. daughter . wife and me the lovely ones leading contemplation early days serious them again My (only) day spent on ice fishing (without luck, but with lots of fun!). With the rod . Wishing!! Here are some images of India. The pictures were taken by me. I plan to put up more images in the future.
Boneh, Dan
Site has links to publications, courses and students of this Stanford University Asst Professor.
Dan Boneh Dan Boneh dabo@cs.stanford.edu Associate Professor, Computer Science and Electrical Engineering , Stanford University . Conferences Some conferences and journals I am currently involved with. WWW '06 . WORM '05 . ACM CCS '05 . Usenix Security Symposium '05 . NDSS '05 , Program co-chair. Journal of Cryptology . ACM Transactions on Internet Technology . Address Mail: Computer Science Dept., Gates 475, Stanford, CA, 94305-9045 Office: CS Building, Gates 475. Directions to the Gates building. Telephone Office: (650) 725-3897 Fax: (650) 725-4671 My PGP key. Research Interests My main research focus is on applied cryptography, and network security. Here is a list of my publications and current students and research group . Take a look at our Security Lab . We are also running a biweekly security seminar . Courses CS55N (freshmen seminar): Ten ideas in computer security and cryptography Fall 05 . Fall 03 . Fall 99 . CS155 : Computer and network security Spring 05. Spring 04. Spring 03. Spring 02. CS255 : Introduction to cryptography. Winter 05 . Winter 04 . Winter 03 . Winter 02 . Winter 01 . Winter 00 . Winter 99 . Winter 98 . CS355 : Topics in cryptography. Fall 04 . Fall 02 . Spring 00 . Fall 98 . CS161 : Design and Analysis of Algorithms Fall 01 . Spring 01 . Links Some links related to cryptography and life in general. Applied crypto group , CS Department , Stanford University
Daemen, Joan
Overview of educational and commercial applications background.
Biography of Joan Daemen Biography Joan Daemen Proton World International Joan Daemen was born in 1965 in the Belgian region of Limburg and grew up there in the village of Achel. After getting his degree in Electro-Mechanical Civil Engineering at the Katholieke Universiteit Leuven in 1988, he started a PhD in Cryptography as a member of the research group COSIC (COmputer Security and Industrial Cryptography). From that time, Joan has been actively cryptanalyzing and designing block ciphers, stream ciphers and cryptographic hash functions. He completed his PhD thesis in March 1995. After obtaining his PhD, he quit the field of cryptography and computer security for about a year to work for Janssen Pharmaceutics, a Johnson and Johnson company, in Beerse, Belgium. Then, he returned to the field with positions first at Belgian bank Bacob and shortly after that to Banksys, the main Belgian operator for ATMs and EFT-POS terminals. In late spring 1998, the commercial success of the Proton Electronic Purse, a Banksys development, led to a spin-off called Proton World International. The mission of this newly found Brussels-based company is to be a technology provider, delivering end-to-end solutions in the field of smart card applications. Proton World focuses on applications that require a high level of security such as payment systems and banking. As part of the Banksys security engineering team, Joan switched to Proton World when it was founded and still works there. Today, Joan is primarily active in the design of cryptographic protocols for smart cards, the architecture of multi-application smart card management and personalization systems. After leaving university, Joan has continued to design and publish cryptographic primitives on a regular basis. On many occasions, he has collaborated with his former COSIC colleague Vincent Rijmen. In 1997, this led to the publication of their innovative and influential block cipher design Square, the predecessor of Rijndael. In his most recent cryptographic publications, Joan has concentrated on the analysis and design of mechanisms and cipher features to protect against attacks that exploit implementation weaknesses. Last updated: 10 02 00
Sotoca, Javier Herranz
University of Politcnica de Catalunya, Barcelona, Spain. Faculty of Mathematics and Statistics. Mathematics applied to Cryptology.
Departament Matemtica Aplicada IV
Crowley, Paul
Self-edited page with links to papers and research interests.
ciphergoth.org: Cryptology by Paul Crowley ciphergoth.org Cryptology Cryptology by Paul Crowley Cryptanalysis Bias in the LEVIATHAN stream cipher , designed by Scott Fluhrer and David McGrew of Cisco. Presented at FSE 2001. Problems with the Solitaire hand cipher designed by Bruce Schneier. Cryptanalysis of Carl Ellison's des|tran|des|tran|des Bias in the RC4 stream cipher designed by Ron Rivest. (The symmetry I discovered in RC4's internal states is covered in this FSE 1995 paper by Bob Jenkins.) Improved cryptanalysis of SSC2 by Scott Fluhrer. Cryptography Mercy, a fast cipher for disk sector encryption . Presented at FSE 2000. Mirdek, a hand cipher using playing cards that turns out to be very weak against a chosen plaintext attack. Other Generating random binary data from Geiger counters , a new, efficient, and simple algorithm for generating unbiased, uncorrelated random bits from independent samples of an unknown integer distribution. Software relevant to crypto, including source for algorithms for Geiger counter data and coin flip unbiasing . Writing about crypto. ciphergoth.org Cryptology
Stubblebine, Stuart
Profile of the president of Stubblebine Consulting Research Labs with links to his research papers.
Stuart Stubblebine Resume Stuart Stubblebine Stubblebine Consulting Stubblebine Research Labs BRIEF RESUME EMAIL: stuart (at) stubblebine.com Currently: Dr. Stubblebine is the founder of Stubblebine Consulting, LLC and Stubblebine Research Labs, LLC . Stubblebine Consulting providing a full range of computer security and cryptographic services including evaluations, detailed design and formal analysis, applied research, technical due diligence reviews, intellectual property, and expert witness services. Clients range from domestic startups to international Fortune 500 companies. Stubblebine Research Labsis dedicated to the advancement of science and technology with an objective ofcommercializingtechnologybased upon research programs conducted for the United States government, and based upon internally funded research projects. Affiliations: Professional Researcher (equivalent rank of full Professor) Computer Science Department , Security Lab, University of California - Davis . Previously: Vice president and cryptographer with CertCo ; research scientist with ATT Labs - Research Bell Labs ; research assistant professor at University of Southern California Computer Science Dept. and computer scientist at USC Information Sciences Institute ; telecommunications security engineer at Commcrypt; communications-electronics engineer with US Military. Education :Ph.D. from Univ. of Maryland , M.S. from Univ. of Arizona , B.S. from Vanderbilt Univ . Research Interests My interests fall in the areas of Privacy and Anonymity; Authentication, Subscription Services, and Electronic Commerce; Denial of Service (DoS); Digital Rights Management; Public Key Infrastructure (PKI), Revocation, and Key Distribution; Methods for Analysis, Verification, and Design of Cryptographic Protocols; and Mobile Code Security, and Secure Software Engineering. Links to additional details, including publications, can be found on the Stubblebine Research Labs projects page . A detailed resume is available upon request. An excellent (unaffiliated) Stubblebine Genealogy web site can be found at www.stubblebinefamily.com . 2000-2004 Stubblebine Consulting, LLC; Stubblebine Research Labs, LLC; All rights reserved.
Mironov, Ilya
Describes his cryptography, peer-to-peer technology and offers annotated links to related works.
Ilya Mironov (Stanford page) bio: St. Petersburg, Stanford, Microsoft papers: cryptology links: useful, useless fun teaching: CS359 contact: phone, e-mail, snail mail
Davis, Don
Links to papers covering symmetric and public-key hybrid protocols, key management, natural randomness, Kerberos, PKI, electronic commerce and Web security.
Don Davis' Publications in Cryptography and Computer Security Don Davis' Cryptography Articles My work focusses on network security, computer security, and cryptography. These papers' topics include symmetric and public-key hybrid protocols, key management, natural randomness, Kerberos, PKI, electronic commerce, and Web security. I've listed the papers and their abstracts in reverse chronological order. Most of the papers are formatted in Adode PDF and in PostScript . Please send your comments to me, at don @ mit.edu or dtd @ world.std.com . Index: Most-Cited Articles Disk Drive RNG ('94) PKI key-management problems ('96) Crypto flaw in S MIME, PGP, and XML protocols ('01) Secure Clock Synchronization for Kerberos ('95, '96) Kerberos Articles Peer-to-Peer Authentication with Kerberos ('90) Symmetric-key Certificates ('90, '92) Key-management comparison for Kerberos PKI ('96) RSA integration for Kerberos ('96) E-Commerce Articles E-Commerce privacy security ('03) Personal CAs for scalable payments ('96) Mark S. Ackerman and Donald T. Davis, Jr., "Privacy and Security Issues in E-Commerce" Chapter 39 in: Derek C. Jones (ed.), New Economy Handbook, San Diego: Academic Press Elsevier, 2003, pp. 911-930. (PDF, 470 kbytes) This online version of our chapter is an imperfect galley proof (460 Kbyte PDF). Editor's Abstract: Privacy -- the control over one's personal data -- and security -- the control of attempted access to data by unauthorized others -- are two critical concerns in the "new economy." Consumers are concerned about their personal data leaking unexpectedly or uncontrollably, and e-commerce sites fear the financial losses associated with bad publicity, unauthorized access, and break-ins. This chapter discusses the business, social, and economic issues surrounding both privacy and security. This chapter also surveys the technologies that can be incorporated or have been proposed for both. Donald T. Davis, "Defective Sign Encrypt in S MIME, PKCS7, MOSS, PEM, PGP, and XML." , Proc. Usenix Tech. Conf. 2001 (Boston, Mass., June 25-30, 2001), pp. 65-78.(180 Kbytes) ( PDF , 200 Kbytes) ( HTML , 80 Kbytes) Also, a shortened version of this paper appeared in Dr. Dobb's: Don Davis, "Defective Sign-and-Encrypt," Dr. Dobb's Journal 330, v.26(11) (Nov. 2001), pp. 30-36. Summary of the paper. Abstract: Simple Sign Encrypt, by itself, is not very secure. Cryptographers know this well, but application programmers and standards authors still tend to put too much trust in simple Sign-and-Encrypt. In fact, every secure e-mail protocol, old and new, has codified nave Sign Encrypt as acceptable security practice. S MIME, PKCS7, PGP, OpenPGP, PEM, and MOSS all suffer from this flaw. Similarly, the secure document protocols PKCS7, XML- Signature, and XML-Encryption suffer from the same flaw. Nave Sign Encrypt appears only in file-security and mail-security applications, but this narrow scope is becoming more important to the rapidly-growing class of commercial users. With file- and mail-encryption seeing widespread use, and with flawed encryption in play, we can expect widespread exposures. In this paper, we analyze the nave Sign Encrypt flaw, we review the defective sign encrypt standards, and we describe a comprehensive set of simple repairs. The various repairs all have a common feature: when signing and encryption are combined, the inner crypto layer must somehow depend on the outer layer, so as to reveal any tampering with the outer layer. I had no pubs from '97-2000, because my second daughter was born early in the year. A rule of thumb in research is, "A baby costs three papers or one book." I've found it holds true. Daniel E. Geer and Donald T. Davis, "Token-Mediated Certification and Electronic Commerce" , Proc. 2nd USENIX Workshop on Electronic Commerce, (Oakland, CA, 1996), pp. 13-22. Abstract: Public key technology presumes the availability of certificates and certifying authorities (CAs) living within a shallow hierarchy rooted at a few (n 100) public CAs. We propose an alternative that lessens the day-to-day dependence on centralized CAs while deepening the certificate tree. We do this by suggesting that smartcards provide CA functions, thus re-framing some payment problems as simpler authorization problems. Don Davis, "Compliance Defects in Public-Key Cryptography" , Proc. 6th Usenix Security Symp, (San Jose, CA, 1996), pp. 171-178. (130 Kbytes) ( PDF , 161 Kbytes) Abstract: Public-key cryptography has low infrastructural overhead because public-key users bear a substantial but hidden administrative burden. A public-key security system trusts its users to validate each others' public keys rigorously and to manage their own private keys securely. Both tasks are hard to do well, but public-key security systems lack a centralized infrastructure for enforcing users' discipline. A "compliance defect" in a cryptosystem is such a rule of operation that is both difficult to follow and unenforceable. This paper presents five compliance defects that are inherent in public-key cryptography; these defects make public-key cryptography more suitable for server-to-server security than for desktop applications. The slides (78 Kbytes) PDF (78 Kbytes) discuss a topic that the paper only touches upon: the complexity of thoroughly checking a certificate issuance-chain, to see whether any of the certs in the chain have been revoked recently. Even in the best case, this is a surprisingly messy procedure. See slides 12 13, and their annotations. See also (*) . Don Davis, "Kerberos Plus RSA for World Wide Web Security," Proc. 1st USENIX Workshop on Electronic Commerce, (NYC, July 1995). (93 Kbytes) ( PDF , 122 Kbytes) Abstract: We show how to use Kerberos to enable its clients to interact securely with non-Kerberized World Wide Web servers. That is, our protocol does not require that the Web server be a member of a Kerberos realm, and also does not rely on time-synchronization between the participants. In our protocol, the Kerberos client uses the Web server's public-key certificate to gain cryptographic credentials that conform to public-key authentication standards, and to SHTTP. The client does not perform any public-key encryptions. Further, the client is well-protected from a man-in-the-middle attack that weakens SSL [this MITM attack is described more thoroughly in the next paper]. Our protocol conforms to the current specifications for the Kerberos protocol and for the Secure Hypertext Transfer Protocol. Don Davis, Daniel Geer, and Theodore Ts'o, "Kerberos With Clocks Adrift: History, Protocols, and Implementation" , USENIX Computing Systems 9:1 (Jan. '96). An early version of this paper appeared in: Proc. 5th USENIX UNIX Security Symposium, Salt Lake City, June 5-7, 1995. (160 Kbytes) ( PDF , 219 Kbytes) Abstract: We show that the Kerberos Authentication System can relax its requirement for synchronized clocks, with only a minor change which is consistent with the current protocol. Synchronization has been an important limitation of Kerberos; it imposes political costs and technical ones. Further, Kerberos' reliance on synchronization obstructs the secure initialization of clocks at bootstrap. Perhaps most important, this synchronization requirement limits Kerberos' utility in contexts where connectivity is often intermittent. Such environments are becoming more important as mobile computing becomes more common. Mobile hosts are particularly refractory to security measures, but our proposal gracefully extends Kerberos even to mobile users, making it easier to secure the rest of a network that includes mobile hosts. An advantage of our proposal is that we do not change the Kerberos protocol per se. We have implemented this protocol in the MIT Kerberos V5 source-distribution. D. Davis, R. Ihaka, P.R. Fenstermacher, "Cryptographic Randomness from Air Turbulence in Disk Drives" , in Advances in Cryptology -- CRYPTO '94 Conference Proceedings, edited by Yvo G. Desmedt, pp.114--120. Lecture Notes in Computer Science 839. Heidelberg: Springer-Verlag, 1994. (104 Kbytes) ( PDF , 153 Kbytes) PowerPoint slides (Stuffit archive, 70 Kbytes) Abstract: A computer disk drive's motor speed varies slightly but irregularly, principally because of air turbulence inside the disk's enclosure. The unpredictability of turbulence is well-understood mathematically; it reduces not to computational complexity, but to information losses. By timing disk accesses, a program can efficiently extract at least 100 independent, unbiased bits per minute, at no hardware cost. This paper has three parts: a mathematical argument tracing our RNG's randomness to a formal definition of turbulence's unpredictability, a novel use of the FFT as an unbiasing algorithm, and a "sanity check" data analysis. This is the most-cited of my papers, but it is fairly abstract. The poster session slides present much explanatory material that the published paper lacks. I'm preparing a newer, more readable, and more practically-oriented paper, which I'll include here soon. This paper gave me an Erds number of 5 , though my number has since dropped to 4 . B^) Bell Labs' Markus Jakobssen et al. have built a practical disk RNG application that doesn't require kernel-level support. They also did some crucial hardware-level measurements, showing that a UNIX application can detect the disk's speed variations. Linux' dev random truly-random number generator uses disk timing, as well as other kernel-level noise, to create securely unpredictable random numbers. dev random was written by MIT's Ted Ts'o. D. Davis and R. Swick, "Network Security via Private-Key Certificates, " USENIX 3rd Security Symposium Proceedings, (Baltimore; Sept. '92). Also in ACM Operating Systems Review, v.24, 4 (Oct. 1990). (58 Kbytes) Abstract: We present some practical security protocols that use private-key encryption in the public-key style. Our system combines a new notion of private-key certificates, a simple key-translation protocol, and key-distribution. These certificates can be administered and used much as public-key certificates are, so that users can communicate securely while sharing neither an encryption key nor a network connection. This paper's title is somewhat dated. Nowadays, it might better be called, "Network Security via Symmetric-Key Certificates," because the meaning of "private-key" has shifted since I wrote the paper. D. Davis and R. Swick, "Workstation Services and Kerberos Authentication at Project Athena, " MIT Laboratory for Computer Science Technical Memorandum 424 (Feb. 1990). (45 Kbytes) Abstract: We propose an extension to the Kerberos Ticket-Granting Service protocol, that cleanly supports user-to-user mutual authentication. This extension enables insecure desktop computers to offer secure network services, such as X-windows services, rlogin, rsh, and NFS. Each desktop service authenticates itself with a short-lived Kerberos session key, instead of using a long-lived secret key as secure centralized servers do. We use the Burrows-Abadi-Needham logic to prove that the user-to-user protocol fulfills several authentication goals. We actually wrote this paper in late 1988 as an internal technical proposal for Project Athena. Page 2 includes an interesting tidbit: a concise statement of Kerberos' design constraints, which I deduced and distilled from corridor conversations with other Athena staff. This paper is now part of MIT's Kerberos source-distribution, and our user-to-user protocol has become part of Kerberos Version 5 . According to a Microsoft staffer, the user-to-user protocol is part of Windows 2000's DCOM implementation. Our user-to-user protocol is also part of the P2P security component in the Globus Grid, a distributed supercomputing system being built by IBM, Sun, Microsoft, and by the DoE's Sandia, Lawrence Livermore, and Los Alamos National Labs. Network Security Consulting I'm a full-time consultant, specializing in network security, cryptography, and electronic commerce for large networks. In practice, that means I can: Help you design and build a secure network or a secure networked application; Analyze your network, products, and procedures for security flaws; Advise and help you to repair those flaws, either with off-the-shelf technology, or with software that your staff and I build. I've been a security consultant since 1991, and my clients include investment banks, brokerages, and stock exchanges on Wall St., here in New England, and overseas. I also work for technology firms and ISP's. I've worked in security since the late '80's, when I was one of the senior programming and sys-admin staff at MIT's Project Athena , which was the first large client-server network. I've been a systems programmer (compilers, kernels, and tools) since 1978. I hold a B.Sc. degree in mathematics from MIT. I live in Somerville, Mass., a small city near Boston. My postal address and phone number are: Don Davis 148 School St. Somerville, MA 02143 (617) 625-2242 (617) 629-3010 Resume System Experts is a consulting company with whom I do a lot of work, especially for large corporate and financial clients. Email addresses: dtd @ world.std.com, don @ mit.edu Last updated on April 20, 2004. Visitors since Nov. 10, '98: The World's Homepage
Barreto, Paulo
Home page with links to his publications and cryptography algorithms (includes The Pairing-Based Crypto Lounge)
Paulo Barreto's Crypto Page Paulo Barreto's Crypto Page Contents Tales from the Cryptographer Selected Block Ciphers Selected Stream Ciphers Selected Hash Functions Elliptic Curve Cryptosystems Other Asymmetric Cryptosystems Digital Signature Algorithms Locally Available Software The Pairing-Based Crypto Lounge The Hashing Function Lounge The Anubis Block Cipher The Khazad Block Cipher The Whirlpool Hashing Function Cryptographers and Cryptanalysts Links Material didtico em Portugus Personal page My publications Tales from the Cryptographer This is (or will someday be) a collection of seemingly trivial results, anecdotes from a cryptographer's life, and curiosities from practical cryptography and cryptanalysis. It has been set up in response to a comment by Bart Preneel that there may be cryptanalytical results that researchers "are aware of right now (but they don't tell anyone because for example they think it is trivial)". Your own tales are welcome! Why public elliptic curve parameters are public The cost of forging digital signatures with message recovery Selected Block Ciphers Rijndael , the algorithm. Check the reference Java implementation in the Locally Available Software section . The five AES finalists: MARS RC6 Rijndael Serpent Twofish The NESSIE finalists and winners: Camellia (128 bits, winner) KHAZAD (64 bits, finalist) Misty1 (64 bits, winner) IDEATM (64 bits, finalist) SAFER++ (64 bits and 128 bits, finalist) SHACAL-2 (256 bits, winner) RC6 (128 bits, finalist) A few other algorithms: ANUBIS Blowfish Noekeon Skipjack SQUARE Selected Stream Ciphers Helix (Greg Rose's public domain C implementation ) Scream Turing Selected Hash Functions RIPEMD-128,160 SHA-1,224,256,384,512 Tiger WHIRLPOOL Elliptic Curve Cryptosystems Richard Schroeppel's Elliptic Curve and Galois Field Arithmetic page . Richard Schroeppel's et aliorum Crypto'95 paper "Fast Key Exchange with Elliptic Curve Systems" . Erik De Win and Bart Preneel's introduction to elliptic curve public-key cryptosystems . Erik De Win's et aliorum ANTS'98 paper "On the performance of signature schemes based on elliptic curves" . Other Asymmetric Cryptosystems You see, elliptic curves are not the whole story in state-of-the-art asymmetric algorithms... HFE McEliece Niederreiter NTRU XTR Digital Signature Algorithms There is a recent research trend for very short signature sizes. Name Signature size (bits) Underlying hard problem BLS ZSNS CFS ECDSA 160 81 320 Gap Diffie-Hellman Syndrome decoding EC Computational Diffie-Hellman Locally Available Software All software published here is in the public domain, but notice that some algorithms may be themselves covered by patents. Algorithm Language Notes The AES block cipher (Rijndael), the EAX authenticated encryption mode, and the OMAC message authentication code. C++ , Java All algorithms are patent-free. The AES block cipher (Rijndael), the OCB authenticated encryption mode, and the PMAC message authentication code. Java The OCB and PMAC algorithms are patented. The Skipjack block cipher. C The HAVAL hash function. C Warning: some versions of HAVAL are broken. The SQUARE block cipher. C , Java Elliptix (elliptic curve cryptography). Java Alpha version (March 31, 1999) Elliptix Lite (elliptic curve cryptography). Java Cryptographers and Cryptanalysts This list is very incomplete. I intend to make it more comprising (and more organized) in due time. My apologies for any important (though temporary) omissions! Ross Anderson Mihir Bellare Steven Bellovin Waldyr D. Benits Jr. Eli Biham Alex Biryukov Daniel Bleichenbacher Daniel Boneh Antoon Bosselaers Lawrence Brown Florent Chabaud Nicolas Courtois Jean-Marc Couveignes Ricardo F. Custdio Ricardo Dahab Wei Dai Rgis Dupont Noam D. Elkies Andreas Enge Matt Franklin Gerhard Frey Steven D. Galbraith Pierrick Gaudry Oded Goldreich Shafi Goldwasser Louis Granboulan Peter Gutmann Florian He Antoine Joux Marc Joye Lars R. Knudsen Neal Koblitz Ted Krovetz Reynald Lercier Stefan Lucks Ben Lynn Alfred Menezes Ralph C. Merkle Ilya Mironov Atsuko Miyaji Franois Morain Volker Mller Sean Murphy Jorge Nakahara Phong Nguyen Andrew Odlyzko Paul C. Van Oorschot Sachar Paulus David Pointcheval Bart Preneel Phillip Rogaway Vincent Rijmen Ronald Rivest Takakazu Satoh Claus-Peter Schnorr Richard Schroeppel Hovav Shacham Victor Shoup Alice Silverberg Joseph H. Silvermann Nigel P. Smart Jacques Stern Douglas Stinson Tsuyoshi Takagi Stafford E. Tavares Routo Terada Serge Vaudenay Frederik Vercauteren David Wagner Annegret Weng Amr M. Youssef Yuliang Zheng Material Didtico em Portugus Alguns textos sobre criptologia em Portugus, de minha autoria. O Ataque Quadrado Conceitos bsicos sobre criptoanlise integral. Ataque detalhado a verses reduzidas do AES, extenses a outras cifras de bloco, exerccios propostos. (2002) Curvas Elpticas e Criptografia - Conceitos e Algoritmos Uma introduo terica criptografia baseada em curvas elpticas. Estruturas algbricas envolvidas, algoritmos fundamentais, tpicos de criptoanlise. (1999) Links NIST's Cryptographic Toolkit site NESSIE -- New European Schemes for Signatures, Integrity, and Encryption. The Cryptlib Security Toolkit The GNU Privacy Guard IEEE P1363: Standard for Public-Key Cryptography International Association for Cryptologic Research (IACR) The OpenSSL Project Wei Dai's Crypto++ Library Crypto++ Visits since 1997.12.31: Last update:2004.08.25 Copyright 1998, 2004 by Paulo S. L. M. Barreto. All rights reserved.
Crypto Authors' Sites
Links to researchers home pages and publications.
Cryptography Authors' Sites home resources authors' sites Crypto FAQ Crypto News Research Links Conference Papers Authors' Sites crypto authors' sites Following are links to the web sites and publications of leading cryptographers, researchers, and authors. Authors sorted alphabetically : A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A Martin Abadi site | publications Ross Anderson site | publications N. Asokan site | publications Tuomas Aura site | publications Back to Contents B Shahram Bakhtiari site | publications Niko Bari'c publications Donald Beaver publications Philippe Bguin site | publications Mihir Bellare site | publications Steve Bellovin site | publications Jurgen Bierbrauer site | publications Eli Biham site | publications Matt Bishop site | publications Matt Blaze site (2) | publications (2) Daniel Bleichenbacher site | publications Gerrit Bleumer site | publications (2) Avrim Blum site | publications Manuel Blum site | publications Dan Boneh site | publications Antoon Bosselaers site | publications Joan Boyar site | publications Colin Boyd site | publications Stefan Brands site | publications Andries Brouwer site | publications Lawrie Brown site | publications Back to Contents C Christian Cachin site | publications Jan Camenisch site | publications Paul Camion publications Florent Chabaud publications David Chaum site | publications Jean-Marc Couveignes site | publications Claude Crpeau site | publications Bruno Crispo site | publications Back to Contents D Wei Dai site | publications Don Davis publications Ivan B. Damgrd publications George Davida site | publications Dorothy Denning site | publications Alfredo De Santis site | publications Yvo G. Desmedt site Erik De Win site G. Di Crescenzo publications Yun Ding site | publications Back to Contents E Yves Edel site Back to Contents F Joan Feigenbaum site | publications Simon Foley site Matthew Franklin site Back to Contents G Peter Gemmell site Rosario Gennaro site | publications Keith Gibson site Oded Goldreich site | publications Li Gong site | publications (2) Andrew D. Gordon site Mark Goresky site | publications J Orlin Grabble site Louis Granboulan site | publications Back to Contents H Carlo Harpes site | publications Martin Hellman site Howard Heys site | publications Martin Hirt site | publications Back to Contents I Russell Impagliazzo publications Back to Contents J David P. Jablon site Markus Jakobsson site Sushil Jajodia site | publications Phil Janson publications Stanislaw Jarecki site Bob Jenkins site Antoine Joux site | publications Marc Joye site | publications Mike Just publications Back to Contents K Rajashekar Kailar site Phil Karn site | publications Seung-Joo Kim site | publications Andy Klapper site | publications Lars Knudsen site | publications Paul Kocher site | publications Bert-Jaap Koops site | publications Hugo Krawczyk publications Markus Kuhn site Kaoru Kurosawa site | publications Eyal Kushilevitz site | publications Back to Contents L Brian A. LaMacchia site P. J. Lee publications Reynald Lercier site | publications Leonid Levin site | publications C. H. Lim publications Hung-Yu Lin site Michael Luby site Stefan Lucks site | publications Back to Contents M Dahlia Malkhi site Mark Manasse site | publications Yishay Mansour site | publications Wenbo Mao site | publications Ueli Maurer site | publications Kevin McCurley site | publications John McHugh publications John D. McLean site Catherine Meadows publications Ralph C. Merkle site | publications Daniele Micciancio site Markus Michels site | publications Shiho Moriai site | publications Back to Contents N Moni Naor site | publications Clifford Neuman site | publications Back to Contents O Luke O'Connor publications Andrew Odlyzko site | publications Back to Contents P Christof Paar site Lawrence C. Paulson site | publications Sachar Paulus site David Pearson publications Torben Pedersen site | publications (2) Ruud Pellikaan site Giuseppe Persiano site | publications (2) Holger Petersen site | publications Erez Petrank site | publications Andreas Pfitzmann site | publications Birgit Pfitzmann site | publications Josef Pieprzyk site | publications Richard Pinch site David Pointcheval site | publications Guillaume Poupard site Bart Preneel site | publications Back to Contents Q Xiaolei Qian site | publications Jean-Jacques Quisquater site | publications Back to Contents R Zulfikar Ramzan site Indrajit Ray site Omer Reingold site | publications Michael Reiter site | publications Vincent Rijmen site | publications Terry Ritter site | publications Ron Rivest site | publications Phillip Rogaway site | publications Dana Ron site | publications Avi Rubin site | publications Back to Contents S Ravi Sandhu site | publications Takashi Satoh site | publications Steve Schneider site Bruce Schneier site | publications Claus-Peter Schnorr site | publications Berry Schoenmaker publications Matthias Schunter site | publications Jennifer Seberr site | publications Alan Sherman site | publications Ken Shirriff site | publications Adam Shostack site Victor Shoup site | publications Joseph H. Silverman site Markus Stadler site | publications Michael Steiner publications Jacques Stern site | publications Douglas Stinson site | publications Stuart Stubblebine site Paul Syverson site Back to Contents T Tsuyoshi Takagi site | publications Alain Tapp site | publications Yiannis Tsiounis site | publications Gene Tsudik site | publications Doug Tygar site | publications Back to Contents V Ugo Vaccaro site | publications Jeroen van de Graaf site | publications Eugne van Heijst publications Paul C. van Oorschot site | publications Serge Vaudenay site | publications (2) Back to Contents W David Wagner site | publications Michael Waidner site | publications Stefan Wolf site | publications Dong-Ho Won site Rebecca Wright site Back to Contents Y Bennet Yee site | publications Sung-ming Yen site | publications Adam Young site | publications Amr M. Youssef site | publications Back to Contents Z Xian-mo Zhang site Yuliang Zheng site | publications Back to Contents Home Company What We Do News Events Resources
Bosselaers, Antoon
Home page of Catholic University of Leuven staff member. Contains information RIPEMD160 and fast implementations of hash functions and stream and block ciphers.
Antoon Bosselaers Antoon Bosselaers can be reached in the following ways: By email: For confidential mails: his public PGP key . By snail mail: Katholieke Universiteit Leuven Dept. Elektrotechniek-ESAT Kasteelpark Arenberg 10 B-3001 Heverlee Belgium. By fax: +32 16 32 19 69 I'm working at the COSIC lab of the Department of Electrical Engineering (ESAT) of the K.U.Leuven . You can get an idea of the place from this picture I've drawn for you. My research topic is cryptography in general, and as such I'm member of the International Association for Cryptographic Research . If you have any questions concerning cryptography, you first might want to have a look at a FAQ page . If you did have a look, and you now have even more questions on cryptography, or if you simply want to read the best book on cryptography, then order immediately your copy of the one and only Handbook of Applied Cryptography ! I hope I haven't lost you by now. I'm primarily interested in all issues related to the implementation of cryptographic algorithms. Research topics include, but are not limited to, fast and flexible implementations, both in (portable) C and (non-portable) Intel Assembler, of operations in GF(p), customized hash functions based on MD4. My favourite one is RIPEMD-160 , new ciphers. In this respect the multiple-issue (superscalar VLIW) architecture of the current generation of CISC and RISC processors opens up exciting new perspectives! New results on implementations of cryptographic algorithms taking advantage of these parallel architectures are always welcome. The implementation page gives an overview of the Pentium-optimized implementations I have written of the following algorithms: hash functions: MD2, MD4, MD5, RIPEMD-128, RIPEMD-160, SHA-1, Snefru-128, Snefru-256, Tiger stream ciphers: alleged RC4, SEAL 3.0 block ciphers: Blowfish, CAST, DES, 3DES, IDEA, Khufu, RC5-32, SAFER, SHARK, RC5-64, Square More information on the status of MD5 and why you might consider to switch to RIPEMD-160 is available on the RIPEMD-160 homepage . project. The proceedings of the sixth edition of the ESAT-COSIC biannual Summer School on cryptography are available in the Springer LNCS series. The tenth edition of this summer school will take place in June 2005. Every two weeks you can attend our COSIC seminars. Be there or be square! A list of my publications as well as a list of all COSIC publications . For something completely different you might want to try one of the following links: My brother's webpage Leuven city map VRT Teletekst Newspapers from all over the world ISO 8859-1 Character Set Eclipse'99 , Eclipse Home Page (Fred Espenak) SkyTelescope Newswire Vereniging voor Sterrekunde (VVS) Volkssterrenwachten: MIRA , Urania John Diamond Yasnaya Poliana Anthony the Abbot and Anthony of Padua Evariste Galois and Pierre de Fermat Back to: RIPEMD-160 homepage COSIC's homepage Our department's homepage This page is maintained by Antoon Bosselaers .
Borisov, Nikita
Graduate student at UC Berkeley. Known for his part in breaking 802.11b WEP.
Nikita Borisov [ research | CV | courses | personal | photos | contact | caveat ] Nikita Borisov News I have graduated and moved to the University of Illinois at Urbana-Champaign as an Assistant Professor in the Electrical and Computer Engineering Department . Please see my new webpage there; this page is preserved for historical reference. I was previously a Ph.D. student in Computer Science at the University of California, Berkeley , advised by Prof. Eric Brewer . Prior to being at Berkeley, I was an undergraduate at the University of Waterloo , receiving a Bachelor of Math, double majoring in Computer Science and Pure Math . I also spent a while at Entrust Technologies post-graduation. I grew up in Moscow, and have lived in Paris, Ottawa, and Waterloo, but now I am happy to call the Bay Area my home. Research My main research interests lie in the area of computer security, with an emphasis on large-scale distributed systems and networks. Recently I have been working in the area of privacy and anonymity; my ongoing research in this area includes providing anonymous routing services for stuctured peer-to-peer networks (see my Qualifying Exam Proposal ) and an off-the-record communications providing privacy and authentication for casual, repudiable conversations. Previously, I have done research in the area of wireless security, discovering several flaws in the 802.11 protocol. My master's thesis research focused on access control in distributed systems, proposing a flexible delegation framework using executable Active Certificates . My main interests outside the security field lie in distributed systems. I was a member of the Ninja project, aiming to build a platform for Internet-scale services. My main contribution was building an execution environment for running software components on a cluster of machines, communicating using an asynchronous event substrate. My other outside interests include cryptography and program analysis. Personal While not at work, I am often seen at the movies, dancing, or just hanging out with friends. Living in Berkeley, I've acquired a love for the outdoors and I am often looking for a new place to hike, jog, or go for a bike ride. I'm also fond of chasing solar eclipses and other form of travel . See also my collection of photos . Nikita Borisov - nikita@uiuc.edu
Blaze, Matt
Own site with resume, research papers and links to other cryptographic sites.
Matt Blaze's cryptography resource on the web - crypto.com mab's stuff: research papers talks bio Trust Management RFC-2704 RFC-2792 Risks Report photographs export notices Crypto.Com, Inc. Carnivore testimony Risks of Carnivore Comments on IITRI report USENIX Sec04 CFP CIS-700 (Spring '04) CSE-380 (Fall '05) Other links: Halfbakery Questionable Utility Ron Rivest Crypto Bibliography ATT Research CDT Crypto Policy EFF EPIC Welcome to crypto.com, Matt Blaze's cryptography resource on the Web New Stuff: Fall, 2005: I'm teaching the undergraduate Operating Systems course (CSE-380) at Penn in the Fall 2005 semester. Check out the course web page here. August 16, 2005: Help save the reconstructed Colossus, arguably the world's first electronic computer, built in secrecy at Bletchey Park in England during WWII to break enciphered German messages. Read the story (and donate generously) at http: www.bletchleyparkheritage.org.uk . June 27, 2005: I'm giving this month's Penn Science Cafe talk Monday evening (near the Penn campus). May, 2005: I'm finally getting around to updating the photos page, but it's slow going. December 17, 2004: There's a lot that information security can learn from physical security. See my new draft survey of safecracking and computer science in the papers directory . (Warning - this is a heavily illustrated -- and hence big -- .pdf file) April 6, 2004: I'm chairing USENIX Security '04, to be held August 9-13, 2004 in San Diego, CA. The program will be available soon at http: www.usenix.org . Until then, the list of accepted papers can be found here (ASCII text) . Although the submission deadline is now long past, the official Call for Papers is here ; a plain ASCII version is here . Spring, 2004: I taught a graduate seminar (CIS-700 03) on security vulnerabilities at Penn. Check out the course web page, here . October 13, 2003: Nothing to do with security, but I recently did some performance measurements of NiMH battery chargers, which you can find here . January 22, 2003: For information about my paper on the vulnerability of master keyed mechanical lock systems, click here . October 23, 2002: Some new papers can be found in the research papers section, including some new material on the relationship between cryptology and mechanical locks. December 26, 2001: The list of accepted papers for FC'02 can be found here. For information about the conference, click here . September 12, 2001: My thoughts on yesterday's tragic events can be found here . August 21, 2001: The Call for Papers for Financial Cryptography '02 is available here . August 16, 2001: My declaration in Felten et al vs. RIAA et al can be found here (ASCII text). December 4, 2000: In October, I was part of a group of five security researchers invited by the Justice Department to identify technical issues with the Carnivore system that should be addressed by an outside review. We have just released our analysis of IITRI's draft report on Carnivore; our comments can be found here . November 21, 2000: The US Department of Justice has released a sanitized version of the IITRI Report on Carnivore. I've mirrored the PDF file here . September 1, 2000: Steve Bellovin and I wrote a short guest column for Peter Neumann's Inside Risks page in the October 2000 CACM, reprinted here . July 24, 2000: The House Judiciary Committee's Subcommittee on the Constitution held hearings on "Fourth Amendment Issues Raised by the FBI's 'Carnivore' Program." There were witnesses from the FBI and Department of Justice as well as technical people, civil liberties advocates, and representatives from ISPs. I was invited to testify as an expert on the risks of Internet wiretapping generally and on the issues that would be raised by making the Carnivore software open-source in particular. You can read my written testimony here . If you're trying to find information about "Crypto.Com, Inc.," click here. In real life: On January 1st, 2004, I joined the faculty at the Computer and Infomation Sciences Department at the University of Pennsylvania . where I study and teach security and cryptology. I also serve there as acting director of the Distributed Systems Laboratory, which is an academic and research resource for the study of networking and security. I spent the dozen years before I joined Penn as a research scientist at ATT Labs - Research ATT Bell Labs, in various parts of New Jersey. My research focuses on trust management, smart cards, cryptographic and security protocols, large-scale systems, physical security, and cryptography policy. The best way to reach me is by email, either to my U. Penn or crypto.com address. Before you ask: I do not endorse or link to security products or services, and I probably won't help you with your cryptography homework. A summary of my research and basic biographical information can be found here . Should we discuss security vulnerabilities in the open literature? It's an age-old question; click here for one perspective. Many of my research papers can be found here . Slides from talks I've given can sometimes be found here . If you're developing distributed applications that have security policies or credentials, check out the new KeyNote Trust Management System page , a free toolkit for specifying and checking for compliance with security policies. The KeyNote language is described in RFC-2704 . There's some ciphertext here . Part of the crypto engine that created it can be found here . The report on the Risks of Key Recovery, Key Escrow and Trusted Third Party Encryption is here . U.S. cryptography export rules were relaxed in January 2000, especially for freely-available software source code. Check out the CDT , EFF or EPIC sites for details, but basically you can now make open-source cryptography source code available on the web, provided that you send email to the Commerce Department export people telling them the URL. I maintain a publically-archived alias for this purpose; if you send your notice to exports@crypto.com , it will be automatically forwarded to the government (at crypt@bxa.doc.gov) but will also be archived at http: www.crypto.com exports mail.txt for all to see. Using the exports@crypto.com alias will help others find your software. NOTE: This service has been temportarily discontinuted. Please send export notices directly to the BXA. Here are some random photographs that have nothing to do with cryptography. And what on earth does this sign mean? Or for that matter, this one? And who's responsible for this? For the historically minded, my 1992 dissertation, which anticipated what we now call "peer-to-peer file distribution" by at least five years, can be found here, in PostScript format . Of course, you can still only get it via a centralized server... I'll put up links to other sites that I find useful soon. Until then, here are some of my favorites: The Halfbakery is a fun communal database of ideas and inventions. Ron Rivest's web page has an excellect collection of cryptography and cryptology research links. Bruce Schneier's Counterpane Internet Security maintains a very useful index of cryptography papers available online , with extensive links. It's possible that you've come here expecting to find the Encryption Privacy and Security Resource Page , which we've moved to another site, hosted by the Center for Democracy and Technology. If you're a webmaster hosting the My Lock, My Key icon, you can save your readers trouble by changing the link for the icon to point directly to "http: www.cdt.org crypto " . All of the old crypto policy resources are now located at CDT: voting records on Members of Congress, "Adopt Your Legislator" and other activist resources, as well as tons of headlines, analyses, reports and links. If that's what you were looking for, just click here . Other good cryptography policy resources that deserve your attention and support include the Electronic Frontier Foundation (EFF) and the Electronic Privacy Information Center (EPIC) .
Biham, Eli
Self edited page on Technion's web site. Has links to his publications, programs and courses he teaches at the university.
Eli Biham Eli Biham Research Information Research areas: cryptography and cryptanalysis, differential and linear cryptanalysis, quantum cryptography and quantum computation. Publications Py (Roo) Py (roo) - a New Fast Stream Cipher Tiger - a Fast New Cryptographic Hash Function Tiger2 --- with MD5 SHA compatible padding to appear soon Serpent - A New Block Cipher Proposal for AES The Nessie project Test vectors of NESSIE submissions and other primitives Slides of my invited Talk in Indocrypt 2000: On the Selection of the Advanced Encryption Standard . Slides of my invited Talk in SAC 2004: New Results on Sha-0 and SHA-1 . Slides of my invited Talk in the hash functions workshop in Krakow, June 2005: Recent Advances in Hash Functions: The Way to Go . Teaching See the courses page List of courses in cryptology and computer security Research topics for graduate students Programs Hebrew Gregorian Calendars for any year ( calendar for 2006 , in Hebrew ) Eli Biham Computer Science Department, Technion, Technion city, Haifa 32000, Israel Email and Requests by Email --- read before sending email to me I use AUTOMATIC anti-spam programs to discard emails from known spammers and spamming sites. For information how to bypass it, and what you should not send, see here .
Bellovin, Steven
Home page of the ATT research fellow with links interests and publications.
Steven M. Bellovin Steven M. Bellovin About me Papers Talks Firewalls book Prehistory of Public Key Crypto Permissive Action Links Studying with me Classes: Fall '05: Introduction to Security Spring '05: Anonymity and Privacy Research interests: Networks, security, and especially why the two don't get along. Office hours: Mon 1:30-2:30 Tue 1:00-2:00 or by appointment Voice: +1 212 939 7149 VoIP: sip:7149@128.59.19.28 Fax: +1 212 666 0140 454 Computer Science Building Department of Computer Science Columbia University 1214 Amsterdam Avenue, M.C. 0401 New York, NY 10027-7003 s m b @ c s . c o l u m b i a . e d u
Bellare, Mihir
Professor in UCSD Computer Science and Engineering. Site has links to his publications, courses and students.
Mihir Bellare's Homepage Home Publications CV Research Summary Courses Educational Students Links Calendar Cryptography Group Internal : Access Restricted Welcome to Mihir Bellare's web page. I am a Professor in the Department of Computer Science and Engineering at the University of California, San Diego . Mailing Address: Department of Computer Science Engineering EBU3B, Room 4244 9500 Gilman Drive La Jolla, California 92093-0404, USA Email: My first name at cs.ucsd.edu Phone: (858) 534-4544 FAX: (858) 534-7029 Office: EBU3B 4244
Alfarez, Abdul Rahman
Has links to resume, research papers and contact details.
Alfarez Abdul Rahman Trust and Reputation Research
Anderson, Ross
A large site with many links on the interests and papers of this University of Cambridge researcher.
Ross Anderson's Home Page Ross Anderson [What's New] [Blog] [Research] [My Book] [Music] [Contact Details] Blog Highlights 12 October 2005 - we need to defend academic freedom by amending the University's proposed policy on intellectual property . If the policy goes through unchanged, most of the IP generated here will be controlled by university administrators rather than by its creator. Cambridge would swap one of the most liberal rules on IP of any British university, for one of the most oppressive anywhere. There are grave implications for academic freedom, for faculty recruitment and retention, for students, for colleges, and for the local economy. 25th August 2005 - here is a paper entitled Robbing the bank with a theorem prover , which shows how to apply some of the tools of theoretical computer science to API attacks . See also our briefing paper Chip and Spin . 9th August 2005 - here is a paper on Sybil-resistant DHT routing which will appear at ESORICS 2005 , and a survey of cryptographic processors , a shortened version of which will appear this fall in Proceedings of the IEEE. 1st August 2005 - I am hosting the Fifth Workshop on the Economics of Information Security (WEIS 2006) at Cambridge next June. The deadline for papers is March 20th, 2006. 25th July 2005 - The topology of covert conflict is rather topical - how can the police best target an underground organisation given some knowledge of its patterns of communication? And how might they in turn react to various law-enforcement strategies? We present a framework combining ideas from network analysis and evolutionary game theory to explore the interaction of attack and defence strategies in networks. Although we started out thinking about computer viruses, our work suggests explanations of a number of aspects of modern conflict generally. 21st July 2005 - Here is a paper on combining cryptography with biometrics , which shows that in those applications where you can get some benefit from biometrics, you don't need a large central database.(as proposed in the ID card Bill ). There are smarter and less privacy-invasive ways to arrange things. 2004 blog highlights included academic papers on cipher composition , key establishment in ad-hoc networks and the economics of censorship resistance . I also spent some time lobbying for amentments to the EU IP Enforcement Directive and organising a workshop on copyright which led to a common position adopted by a number of European NGOs. Finally, I started a web page for out-of-copyright recordings of traditional music. For fuller details, see my blog for 2004 . Research I am Professor of Security Engineering at the Computer Laboratory . I supervise a number of research students - Richard Clayton , Jolyon Clulow , Hao Feng , Stephen Lewis , Tyler Moore , Shishir Nagaraja and Andy Ozment . Sergei Skorobogatov and Mike Bond are postdocs. Vashek Matyas and Andrei Serjantov are former postdocs. Jong-Hyeon Lee , Frank Stajano , Fabien Petitcolas , Harry Manifavas, Markus Kuhn , Ulrich Lang , Jeff Yan , Susan Pancho , Mike Bond , George Danezis , Sergei Skorobogatov and Hyun-Jin Choi have earned PhDs. My other personal research interests include: Economics of information security - including material on `Trusted Computing' Peer-to-Peer systems - including the Eternity Service and the Cocaine auction protocol Robustness of cryptographic protocols - including `Programming Satan's Computer' Analysis and design of cryptographic algorithms - including our AES candidate Serpent Information hiding - including Soft Tempest and attacks on copyright marking systems Reliability of security systems - including ATM fraud and ssmartcard hacking Security of clinical information systems - including the Iceland database Privacy and freedom issues - including FIPR and `Trusted Computing' Many of my papers are available in html and or pdf, but some of the older technical ones are in postscript, which was the standard for many years. You can download a postscript viewer from here . Also, by default, when I post a paper here I license it under the relevant Creative Commons license , so you may redistribute it but not modify it. I may subsequently assign the residual copyright to an academic publisher. Economics of information security Over the last few years, it's become clear that many systems fail not for technical reasons so much as from misplaced incentives - often the people who could protect them are not the people who suffer the costs of faulure. There are also many questions with an economic dimension as well as a technical one. For example, will digital signatures make electronic commerce more secure? Is so-called `trusted computing' a good idea, or just another way for Microsoft to make money? And what about all the press stories about `Internet hacking' - is this threat serious, or is it mostly just scaremongering by equipment vendors? It's not enough for security engineers to understand ciphers; we have to understand incentives as well. This has led to a rapidly growing interest in `security economics', a discipline which I helped to found. I maintain the Economics and Security Resource Page , and my research contributions include the following. Why Information Security is Hard - An Economic Perspective was the paper that got information security people thinking about the subject. It applies economic analysis to explain many phenomena that security people had found to be pervasive but perplexing. Why do mass-market software products such as Windows contain so many security bugs? Why are their security mechanisms so difficult to manage? Why are government evaluation schemes, such as the Orange Book and the Common Criteria, so bad? This paper was presented at the Applications Security conference in December 2001, and also as an invited talk at SOSP 2001 . The hot political issue is `Trusted Computing'. My `Trusted Computing' FAQ analysed this Intel Microsoft initiative to install digital rights management hardware in every computer, PDA and mobile phone. `TC' will please Hollywood by making it hard to pirate music and videos; and it will please Microsoft by making it harder to pirate software. But TC could have disturbing consequences for privacy, censorship, and innovation. Cryptography and Competition Policy - Issues with `Trusted Computing' is an economic analysis I gave at WEIS2003 and also as an invited talk at PODC 2003 . TC will enable Microsoft to lock in its customers more tightly, so it can charge you more. The proposed mechanisms could also have some disturbing consequences for privacy, censorship, and innovation. There is also a shortened version of the paper that has appeared in a special issue of Upgrade , and a French translation . I spoke about TC recently at the "Trusted Computing Group" Symposium , at PODC , and at the Helsinki IPR workshop . TC is not just an isolated engineering and policy issue; it is related to the IP Enforcement Directive on the policy front, and new content standards such as DTCP , which will be built into consumer electronics and also into PC motherboards. The row about `Trusted Computing' was ignited by a paper I gave on the security issues relating to open source and free software at a conference on Open Source Software Economics in Toulouse in June 2002. This paper has two parts, the second of which is about TC and got press coverage in the New York Times , slashdot , news.com and The Register . In the first part of my Toulouse paper , I show that the usual argument about open source security - whether source access makes it easier for the defenders to find and fix bugs, or makes it easier for the attackers to find and exploit them - is misdirected. Under standard assumptions used by the reliability growth modelling community, the two will exactly cancel each other out. That means that whether open or closed systems are more secure in a given situation will depend on whether, and how, the application deviates from the standard assumptions. The ways in which this can happen, and either open or closed be better in some specific application, are explored in Open and Closed Systems are Equivalent (that is, in an ideal world) appear as a chapter in Perspectives on Free and Open Source Software . There is also some press coverage . On Dealing with Adversaries Fairly applies election theory (also known as social choice theory) to the problem of shared control in distributed systems. It shows how a number of reputation systems proposed for use in peer-to-peer applications might be improved. It appeared at WEIS 2004 . The Economics of Censorship Resistance examines when it is better for defenders to aggregate or disperse. Should file-sharers build one huge system like gnutella and hope for safety in numbers, or would a loose federation of fan clubs for different bands work better? More generally, what are the tradeoffs between diversity and solidarity when conflict threatens? (This is a live topic in social policy at the moment - see David Goodhart's essay , and a response in the Economist .) This paper also appeared at WEIS 2004 . Here are papers on The Initial Costs and Maintenance Costs of Protocols , which I gave at Security Protocols 05 , and How Much is Location Privacy Worth? which I gave at WEIS 05 . Our annual bash is the Workshop on Economics and Information Security; the 2006 workshop will be here in Cambridge from June 26-28. The 2005 event was at Harvard and the papers are online . My Economics and Security Resource Page provides a guide to the literature and to what's on. There is also a web page on the economics of privacy , maintained by Alessandro Acquisti. Peer-to-Peer systems Since about the middle of 2000, there has been an explosion of interest in peer-to-peer networking - the business of building useful systems out of large numbers of intermittently connected machines, with virtual infrastructures that are tailored to the application. One of the seminal papers in the field was The Eternity Service , which I presented at Pragocrypt 96. I had been alarmed by the Scientologists' success at closing down the penet remailer in Finland, and had been personally threatened by bank lawyers who wanted to suppress knowledge of the vulnerabilities of ATM systems (see here for a later incident). This taught me that electronic publications can be easy for the rich and the ruthless to suppress. They are usually kept on just a few servers, whose owners can be sued or coerced. To me, this seemed uncomfortably like books in the Dark Ages: the modern era only started once the printing press enabled seditious thoughts to be spread too widely to ban. The Eternity Service was conceived as a means of putting electronic documents as far outwith the censor's grasp as possible. (The concern that motivated me has since materialised; a UK court judgment has found that a newspaper's online archives can be altered by order of a court to remove a libel.) But history never repeats itself exactly, and the real fulcrum of censorship in cyberspace turned out to be not sedition, or vulnerability disclosure, or even pornography, but copyright. Hollywood's action against Napster led to my Eternity Service ideas being adopted by many systems including Publius and Freenet . Many of these developments were described in a recent book , and the first academic conference on peer-to-peer systems was held in March 2002 at MIT. The field has since become very active: here is a web page of peer-to-peer conferences. See also Richard Stallman's classic, The Right to Read . My contributions since the Eternity paper include: Key Infection - Smart trust for Smart Dust appeared at ICNP 2004 and presents a radically new approach to key management in sensor and peer-to-peer networks. Peers establish keys opportunistically and use resilience mechanisms to fortify the system against later node compromise. This work challenges the old assumption that authentication is largely a bootstrapping problem. The Economics of Censorship Resistance examines when it is better for defenders to aggregate or disperse. Should file-sharers build one huge system like gnutella and hope for safety in numbers, or would a loose federation of fan clubs for different bands work better? A New Family of Authentication Protocols presented our `Guy Fawkes Protocol', which enables users to sign messages using only two computations of a hash function and one reference to a timestamping service. This led to protocols for signing digital streams, used in systems like Freenet . Our paper also raises foundational questions about the definition of a digital signature. Peer-to-peer techniques are not just about creating virtual machines out of many distributed PCs on the Internet, but apply also to other environments where communication is intermittent. Mobile communications, personal area networks and piconets are another rapidly developing field. The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks describes how to do key management between low-cost devices that can talk to each other using radio or infrared, and without either the costs or privacy problems of centralised trusted third parties (there is also a later journal version of the paper here ). The study of distributed systems which are hidden, deniable or difficult to censor might be described as `subversive group computing'. Our seminal publication in this thread was The Cocaine Auction Protocol which explored how commercial transactions can be conducted between mutually mistrustful principals with no trusted arbitrator, while giving a high degree of privacy against traffic analysis. I have done some work with our university library on how to secure a digital repository . This grew out of a thread on web security: The Eternal Resource Locator: An Alternative Means of Establishing Trust on the World Wide Web investigated how to protect naming and indexing information and showed how to embed trust mechanisms in html documents. It was motivated by a project to protect the electronic version of the British National Formulary , developed by colleagues at our medical school. It followed work reported in Secure Books: Protecting the Distribution of Knowledge , which describes a project to protect the authenticity and integrity of electronically distributed treatment protocols. Later work included Jikzi, an authentication framework for electronic publishing, which works by integrating ERL-type ideas into XML. There are both general and technical papers on Jikzi, and it led to products sold by a startup called Filonet . The XenoService - A Distributed Defeat for Distributed Denial of Service described countermeasures to distributed denial of service attacks. The XenoService is a network of web hosts that can respond to an attack on a site by replicating it rapidly and widely. It uses Xenoservers , developed at Cambridge for the distributed hosting of latency- and bandwidth-critical network services. This technique now appears to be used by hosting companies like Akamai. I am now running a CMI project with Frans Kaashoek and Robert Morris on building a next-generation peer-to-peer system. I gave a keynote talk about this at the Wizards of OS conference in Berlin; the slides are here . Robustness of cryptographic protocols Very many security system failures can be attributed to poorly designed protocols, and this has been of interest to our team for many years. Some relevant papers follow. API Level Attacks on Embedded Systems describes work done with Mike Bond that has broken most of the commercially available cryptoprocessors. Even if a device is physically tamper-proof, it can often be defeated by sending it a suitable sequence of transactions which causes it to leak the key. We've broken pretty well every security processor we've looked at, at least once. Designers must take a lot more care when designing the APIs of such systems! This line of research originated at Protocols 2000 with my paper The Correctness of Crypto Transaction Sets . There's more in my book . Some ideas for future research can be found in Protocol Analysis, Composability and Computation . Programming Satan's Computer is a phrase coined by Roger Needham and myself to express the difficulty of designing cryptographic protocols; it has recently been popularised by Bruce Schneier (see, for example, his foreword to my book ). The problem of designing programs which run robustly on a network containing a malicious adversary is rather like trying to program a computer which gives subtly wrong answers at the worst possible moments. Robustness principles for public key protocols gives a number of attacks on protocols based on public key primitives. It also puts forward some principles which can help us to design robust protocols, and to find attacks on other people's designs. It appeared at Crypto 95. The Cocaine Auction Protocol explores how transactions can be conducted between mutually mistrustful principals with no trusted arbitrator, even in environments where anonymous communications make most of the principals untraceable; NetCard - A Practical Electronic Cash Scheme presents research on micropayment protocols for use in electronic commerce. We invented tick payments simultaneously with Torben Pedersen and with Ron Rivest and Adi Shamir; we all presented our work at Protocols 96. Our paper discusses how tick payments can be made robust against attacks on either the legacy credit card infrastructure or next generation PKIs. The GCHQ Protocol and its Problems points out a number of flaws in a key management protocol widely used in the UK government, and in the French health service. It was promoted by GCHQ as a European alternative to Clipper, until we shot it down with this paper at Eurocrypt 97. Its vulnerabilities allow traceless forgery of government documents and other bad stuff. Many of the criticisms we developed here also apply to the more recent, pairing-based cryptosystems. The Formal Verification of a Payment System describes the first use of formal methods to verify an actual payment protocols, that was (and still is) used in an electronic purse product (VISA's COPAC card). This is a teaching example I use to get the ideas of the BAN logic across to undergraduates. There is further information on the actual system in a technical report , which combines papers that appeared at ESORICS 92 and Cardis 94. An Attack on Server Assisted Authentication Protocols appeared in Electronics Letters in 1992. It points out a weakness in a digital signature protocol. On Fortifying Key Negotiation Schemes with Poorly Chosen Passwords presents a simple way of achieving the same result as protocols such as EKE, namely preventing middleperson attacks on Diffie-Hellman key exchange between two people whose shared secret could be guessed by the enemy. (See also the Hungarian translation .) Protocols have occasionally been the stuff of high drama. Citibank asked the High Court to gag the disclsoure of certain crypto API vulnerabilities that affect a number of cryptographic processors used in banking. I wrote to the judge opposing the application. A gag order was nonetheless imposed, although in slightly less severe terms than those requested by Citibank. The trial was in camera, and new information revealed about these vulnerabilities in the course of the trial may not be disclosed in England or Wales. (Citi had wanted a global ban.) Information already in the public domain was unaffected. The vulnerabilities were discovered by Mike Bond and me while acting as the defence experts in a phantom withdrawal court case, and independently discovered by the other side's expert, Jolyon Clulow , who has since joined us as a research student. They are of significant scientific interest , as well as being of great relevance to the rights of the growing number of people who seem to be suffering phantom withdrawals from their bank accounts worldwide. If Citi thought that this would prevent knowledge of the problem spreading, they reckoned without the New Scientist , the Register , Slashdot , news.com , and Zdnet . Analysis and design of cryptographic algorithms Recent reports of attacks on the standard hash function SHA have left Tiger , which Eli Biham and I designed in 1995, as the obvious choice of cryptographic hash function. I also worked with Eli, and with Lars Knudsen , to develop Serpent - a candidate block cipher for the Advanced Encryption Standard . Serpent won through to the final of the competition and got the second largest number of votes. Another of my contributions was founding the series of workshops on Fast Software Encryption . Other papers on cryptography and cryptanalysis include the following. The Dancing Bear - A New Way of Composing Ciphers presents a new way to combine crypto primitives. Previously, to decrypt using any three out of five keys, the keys all had to be of the same type (such as RSA keys). With my new construction, you can mix and match - RSA, AES, even one-time pad. The paper appeared at the 2004 Protocols Workshop; an earlier version came out at the FSE 2004 rump session. Two Remarks on Public Key Cryptology is a note on two ideas I floated at talks I gave in 1997-98, concerning forward-secure signatures and compatible weak keys. The first of these has inspired later research by others; the second gives a new attack on public key encryption systems. Two Practical and Provably Secure Block Ciphers: BEAR and LION shows how to construct a provably secure block cipher from a stream cipher and a hash function. It had previously been known how to construct stream ciphers and hash functions from block ciphers, and hash functions from stream ciphers; so our constructions complete the set of elementary reductions. They also led to the `Dancing Bear' paper above. Tiger - A Fast New Hash Function defines a new hash function, which we designed following Hans Dobbertin's attack on MD4. This was designed to run extremely fast on the new 64-bit processors such as DEC Alpha and IA64, while still running reasonably quickly on existing hardware such as Intel 80486 and Pentium (the above link is to the Tiger home page, maintained in Haifa by Eli Biham; if the network is slow, see my UK mirrors of the Tiger paper , new and old reference implementations (the change fixes a padding bug) and S-box generation documents . There are also third-party crypto toolkits supporting Tiger, such as that from Bouncy Castle ). Minding your p's and q's points out a number of things that can go wrong with the choice of modulus and generator in public key systems based on discrete log. It elucidated many of the previously classified reasoning behind the design of the US Digital Signature Algorithm, and appeared at Asiacrypt 96. Chameleon - A New Kind of Stream Cipher shows how to do traitor tracing using symmetric rather than public key cryptology. The idea is to turn a stream cipher into one with reduced key diffusion, but without compromising security. The effect is that a single broadcast ciphertext is decrypted to slightly different plaintexts by users with slightly different keys. Thus users who re-sell their copy of the plaintext in contravention of a licence agreement can be traced. This paper appeared at the fourth workshop on Fast Software Encryption in Haifa in January 1997. Searching for the Optimum Correlation Attack appeared at the second workshop on fast software encryption. It shows that nonlinear combining functions used in nonlinear filter generators can react with shifted copies of themselves in a way that opens up a new and powerful attack on many cipher systems. The Classification of Hash Functions appeared at Cryptography and Coding 93. It proves that correlation freedom is strictly stronger than collision freedom, and shows that there are many pseudorandomness properties other than collision freedom which hash functions may need. A Faster Attack on Certain Stream Ciphers shows how to break the multiplex shift register generator, which is used in satellite TV systems. I found a simple divide-and-conquer attack on this system in the mid 1980's, a discovery that got me `hooked' on cryptology. This paper is a recent refinement of that work. On Fibonacci Keystream Generators appeared at FSE3, and shows how to break `FISH', a stream cipher proposed by Siemens. It also proposes an improved cipher, `PIKE', based on the same general mechanisms. Information hiding (including Soft Tempest) From the mid- to late-1990s, I did a lot of work on information hiding. Soft Tempest: Hidden Data Transmission Using Electromagnetic Emanations must be one of the more unexpected and newsworthy papers I've published. It is well known that eavesdroppers can reconstruct video screen content from radio frequency emanations; up till now, such `Tempest attacks' were prevented by shielding, jammers and so on. Our innovation was a set of techniques that enable the software on a computer to control the electromagnetic radiation it emanates. This can be used for both attack and defence. To attack a system, malicious code can hide stolen information in the machine's Tempest emanations and optimise them for some combination of reception range, receiver cost and covertness. To defend a system, a screen driver can display sensitive information using fonts which minimise the energy of RF emanations. This technology is now fielded in PGP and eslewhere. You can download Tempest fonts from here . There is a followup paper on the costs and benefits of Soft Tempest in military environments, which appeared at NATO's 1999 RTO meeting on infosec, while an earlier version of our main paper, which received considerable publicity , is available here . Finally, there's some attack software here , software you can use to play your MP3s over the radio here , a press article here and information on more recent optical tempest attacks here . Hollywood hopes that copyright-marking systems will help control the copying of videos, music and computer games. This became high drama when a paper that showed how to break the DVD SDMI copyright marking scheme was pulled by its authors from the Information Hiding 2001 , in Pittsburgh, following legal threats from Hollywood. In fact, the chosen technique - echo hiding - was among a number that we broke in 1997. The attack is reported in our paper Attacks on copyright marking systems , which we published at Info Hiding 1998. We also wrote a survey paper on information hiding , which is a good place to start if you're new to the field. For the policy aspects, you might read Pam Samuelson . There is much more about the technology on the web page of my former student Fabien Petitcolas . Another novel application of information hiding is the Steganographic File System . It will give you any file whose name and password you know, but if you do not know the correct password, you cannot even tell that a file of that name exists in the system! This is much stronger than conventional multilevel security, and its main function is to protect users against coercion. Two of our students implemented SFS for Linux: a paper describing the details is here , while the code is available here . The threat by some governments to ban cryptography has led to a surge of interest in steganography - the art of hiding messages in other messages. Our paper On The Limits of Steganography explores what can and can't be done; it appeared in a special issue of IEEE JSAC. It is an extended version of Stretching the Limits of Steganography , which appeared at the first international workshop on Information Hiding, whose proceedings are here . I also started a bibliography of the subject which is now maintained by Fabien Petitcolas. The Newton Channel settles a conjecture of Simmons by exhibiting a high bandwidth subliminal channel in the ElGamal signature scheme. It appeared at Info Hiding 96. Reliability of security systems I have been interested for many years in how security systems fail in real life. This is a prerequisite for building robust secure systems; many security designs are poor because they are based on unrealistic threat models. This work began with a study of automatic teller machine fraud, and then expanded to other applications as well. It now provides the central theme of my book . On a New Way to Read Data from Memory describes techniques we developed that use lasers to read out memory contents directly from a chip, without using the read-out circuits provided by the vendor. This can defeat access controls and even recover data from damaged devices. Collaborators at Louvain have developed ways to do this using electromagnetic induction, which are also described. The work builds on methods described in an earlier paper, on Optical Fault Induction Attacks . This showed how laser pulses could be used to induce faults in smartcards that would leak secret information; we can write arbitrary values into registers or memory, reset protection bits, break out of loops, and cause all sorts of mayhem. That paper made the front page of the New York Times ; it also got covered by the New Scientist , slashdot and Tech TV . It was presented at CHES 2002 . After we discovered the above attacks, we developed a new, more secure, CPU technology for use in smartcards and similar products. It uses redundant failure-evident logic to thwart attacks based on fault induction or power analysis. Our paper on this technology won the best presentation award in April at Async 2002. The latest journal paper on this technology, with recent test results, is here . Our classic paper on hardware security, Tamper Resistance - A Cautionary Note , describes how to penetrate the smartcards and secure microcontrollers of the mid-1990s. It won the Best Paper award at the 1996 Usenix Electronic Commerce Workshop and caused a lot of controversy. Our second paper on this subject was Low Cost Attacks on Tamper Resistant Devices , which describes a number of techniques that low budget attackers can use. See also the home page of our hardware security laboratory which brings together our smartcard and Tempest work, and our page of links to relevant off-site resources . Why Cryptosystems Fail has probably been more widely cited than anything else I've written. This version appeared at ACMCCS 93 and goes into the technical aspects of how frauds on ATMs are carried out. We found that almost all failures were due to outright blunders in design and administration. This work did a lot to demolish the banking industry claim that these systems were `infallible', and that any customers who complained about `phantom withdrawals' must be mistaken or lying. Liability and Computer Security - Nine Principles took this work further. It appeared at ESORICS 94, and examines the problems with relying on cryptographic evidence. Most designers did not realise that to be usable in court, their systems would have to withstand the scrutiny of hostile expert witnesses. However, ATM security remains awful . On the Reliability of Electronic Payment Systems is another of the papers that follow naturally from working on ATMs. It looks at the reliability of prepayment electricity meters, and appeared in the May 1996 issue of the IEEE Transactions on Software Engineering. An ealier version, entitled Cryptographic Credit Control in Pre-Payment Metering Systems , appeared at the 1995 IEEE Symposium on Security and Privacy. Another paper on this subject is The design of future pre-payment systems , which appeared at MATES 96 and discussed how we could build a robust payment infrastructure to support utility networking in the UK after deregulation. On the Security of Digital Tachographs looks at the techniques used to manipulate the tachographs that are used in Europe to police truck and bus drivers' hours, and tries to predict the effect of the planned introduction of smartcard-based digital tachographs throughout Europe from the year 2000. This work was done for the Department of Transport. How to Cheat at the Lottery is a paper reporting a novel and, I hope, entertaining experiment in software requirements engineering. The lessons it teaches have the potential to cut the cost of developing safety critical and security critical software, and also to reduce the likelihood that specification errors will lead to disastrous failures. The Grenade Timer describes a novel way to protect low-cost processors against denial of service attacks, by limiting the number of processing cycles which an application program can consume. The Millennium Bug - Reasons Not to Panic describes our experience in coping with the bug at Cambridge University and elsewhere. This paper correctly predicted that the bug wouldn't bite very hard. (Journalists were not interested, despite a major press release by the University.) The Memorability and Security of Passwords -- Some Empirical Results tackles an old problem - how do you train users to choose passwords that are easy to remember but hard to guess? There's a lot of `folk wisdom' on this subject but little that would pass muster by the standards of applied psychology. So we did a randomized controlled trial with a few hundred first year science students. While we confirmed some common beliefs, we debunked some others (see also Hungarian translation); This has become one of the seminal papers on security usability. Murphy's law, the fitness of evolving species, and the limits of software reliability shows how we can apply the techniques of statistical thermodynamics to the failure modes of any complex logical system that evolves under testing. It provides a common mathematical model for the reliability growth of complex computer systems and for biological evolution. Its findings are in close agreement with empirical data. This paper inspired later work in security economics. Security Policies play a central role in secure systems engineering. They provide a concise statement of the kind of protection a system is supposed to achieve. A security policy should be driven by a realistic threat model, and should in turn be used as the foundation for the design and testing of protection mechanisms. This article is a security policy tutorial. Security of Medical Information Systems Reliability leads naturally to medical informatics, a subject in which I've worked off and on over the years. The UK government is building a national database to hold everyone's medical records, which doctors oppose . Ministers recently gave a guarantee of patient privacy, about which the press is sceptical . There are radio pieces on the problems here and here , comments here , and earlier material here and here . An example of likely problems comes from a report that the Real IRA penetrated the Royal Victoria Hospital in Northern Ireland and used its electronic medical records to gather information on policemen to target them and their families for murder. Civil servants started pushing for online access to everyone's records in 1992 and I got involed in 1995, when I started consulting for the British Medical Association on the safety and privacy of clinical information systems. Back then, the police were given access to all drug prescriptions in the UK, after the government argued that they needed it to catch the occasional doctor who misprescribed heroin. The police got their data, they didn't catch Harold Shipman , and no-one was held accountable. The NHS slogan was initially `a unified electronic patient record, accessible to all in the NHS'. The slogan has changed several times, and the strategy now contains some words on confidentiality, but the goal remains the same. The Health and Social Care (Community Health and Standards) Act allowed the Government access to all medical records in the UK, for the purposes of `Health Improvement'. It removed many of the patient privacy safeguards in previous legislation. In addition, the new contract offered to GPs since 2003 moves ownership of family doctor computers to Primary Care Trusts (that's health authorities, in oldspeak). There was a token consultation on confidentiality; the Foundation for Information Policy Research , which I chair, published a response to it (which was of course ignored). The last time people pointed out that NHS administrators were helping themselves illegally to confidential personal health information, Parliament passed some regulations on patient privacy to legalise those illegal practices that had been brought to public attention. For example, the regulations compel doctors to give the government copies of all records relating to infectious disease and cancer. The regulations were made under an Act that was rushed through in the shadow of the last election and that gives ministers broad powers to nationalise personal health information. In the end, perhaps only a European law challenge can halt the slide toward surveillance. The regulations appear to breach the Declaration of Helsinki on ethical principles for medical research, and contravene the Council of Europe recommendation no R(97)5 on the protection of medical data , to which Britain is a signatory. There is a list of some more of the problems here , and a letter we've written to the BMJ here . For deeper historical background, the best source may be an editorial from the British Medical Journal . There is a discussion paper on the problems that the bill could cause for medical and other researchers, and an impact analysis commissioned by the Nuffield Trust. The government claimed the records were needed for cancer registries: yet cancer researchers in many other countries work with anonymised data (there are papers on German cancer registries in Germany here and here , and some links from the website of the Canadian Privacy Commissioner .) See also the article in the Observer that brought this issue to public attention; a leader in the New Statesman ; an article in The Register ; a letter to the editor of the Times written by senior doctors; and the reports of the Parliamentary debate on the original bill in the Commons and the Lords . Some relevant papers of my own follow. Security in Clinical Information Systems was published by the British Medical Association in January 1996. It sets out rules that can be used to uphold the principle of patient consent independently of the details of specific systems. It was the medical profession's initial response to creeping infringement of patient privacy by NHS computer systems. An Update on the BMA Security Policy appeared in June 1996 and tells the story of the struggle between the BMA and the government, including the origins and development of the BMA security policy and guidelines. There are comments made at NISSC 98 on the healthcare protection profiles being developed by NIST for the DHHS to use in regulating health information systems privacy. The protection profiles make a number of mistaken assumptions about the threats to medical systems and of the kind of protection mechanisms that are appropriate. Remarks on the Caldicott Report raises a number of issues about policy as it was settled in the late 1990s. It notes particular problems with the NHS number tracing service, which is open to large numbers of people in the NHS and can be used to re-identify the poorly de-identified data used in medical research and administration; Information technology in medical practice: safety and privacy lessons from the United Kingdom provides an overview of the safety and privacy problems we have encountered in UK healthcare computing since the mid-90s. It appeared in the Australian Medical Journal. The DeCODE Proposal for an Icelandic Health Database analyses a proposal to collect all Icelanders' medical records into a single central database to support genetic research and health service management. I evaluated this for the Icelandic Medical Association and concluded in my report that the proposed controls were inadequate. The company running it has since hit financial problems but the ethical issues remain , and Iceland's Supreme Court recently allowed a woman to block access to her father's records because of the information they may reveal about her. (These issues may recur in the UK with the proposed biobank database.) I also wrote an analysis of security targets prepared under the Common Criteria for the evaluation of this database. For more, see BMJ correspondence , the Icelandic organisation leading opposition to the database, and an article by Einar Arnason . Clinical System Security - Interim Guidelines appeared in the British Medical Journal on 13th January 1996. It advises healthcare professionals on prudent security measures for clinical data. The most common threat is that private investigators use false-pretext telephone calls to elicit personal health information from assistant staff. A Security Policy Model for Clinical Information Systems appeared at the 1996 IEEE Symposium on Security and Privacy. It presents the BMA policy model to the computer security community and had some influence in the formation to current US health privacy legislation (the Kennedy-Kassebaum Bill, now HIPAA). NHS Wide Networking and Patient Confidentiality appeared in the British Medical Journal in July 1995 and set out some early objections to the government's health network proposals. Patient Confidentiality - At Risk from NHS Wide Networking went into somewhat more detail, particularly on the security policy aspects. It was presented at Health Care 96. Problems with the NHS Cryptography Strategy points out a number of errors in, and ethically unacceptable consequences of, a report on cryptography produced for the Department of Health. These comments formed the BMA's response to that report. An important recent paper is Privacy in clinical information systems in secondary care which describes a hospital system that implements the BMA security policy. The main government objection to our policy was `it'll never work in hospitals'; this system, which is now running at a number of sites, shows that hospital systems can indeed be made secure. It is described in more detail in a special issue of the Health Informatics Journal on data security, confidentiality and safety (v 4 nos 3-4, Dec 1998) which I edited. The same issue also contains a paper on Protecting Doctors' Identity in Drug Prescription Analysis which describes a system designed to de-identify prescription data properly for commercial use. This system led to the `Source Informatics' court case, in which the UK government tried to discourage its owner, now called IMS Health, from promoting it - as it would have competed with much less privacy-friendly government systems. The government lost: the Court of Appeal decided that personal health information can be used for research and other secondary purposes without the informed consent of patients, but provided that the de-identification is done competently. A first-class collection of links to papers on the protection of de-identified data is maintained by the American Statistical Association . Bill Lowrance wrote a good survey for the US Department of Health and Human Services of the potential for using de-identified data ro protect patient privacy in medical research, while a report by the US General Accounting Office shows how de-identified records are handled much better by Medicare than by the NHS. For information on what's happening in the German speaking world, see Andreas von Heydwolff's web site and Gerrit Bleumer's European project links. Resources on what's happening in the USA - where medical privacy is a much more live issue - include EPIC , the med-privacy mailing list archives; the web sites run by Citizens for Choice in Health Care and Georgetown University (the latter has a comprehensive survey of US health privacy laws ); and a report from the US National Academy of Sciences entitled For the Record: Protecting Electronic Health Information . Other resources include a report by the US Office of Technology Assessment, and web pages by CPT and the Institute for Health Freedom. Public policy issues John Curran said in 1790: ``The condition upon which God hath given liberty to man is eternal vigilance; which condition if he break, servitude is at once the consequence of his crime, and the punishment of his guilt''. After the crypto wars of the 1990s, this is something we are all aware of! I chair the Foundation for Information Policy Research , which I helped set up in 1998. This body is concerned with promoting research and educating the public in such topics as the interaction between computing and the law, and the social effects of IT. We are not a lobby group; our enemy is ignorance rather than the government of the day, and one of our main activities is providing accurate and neutral briefing for politicians and members of the press. Our top priority in late 2003-early 2004 was the IPR enforcement directive , which has been succinctly described as `DMCA on steroids' . Thanks to lobbying by FIPR and others, there were amendments with a positive effect - notably, by removing criminal sanctions and legal protection for devices such as RFID tags - but other amendments extend its scope still further. Previously, it would have forced Member States to criminalise any serious commercial infringement of intellectual property; now it will only apply vigorous civil remedies, but will cover all infringements. So it looks like in future all Member States will have to make it easy for record companies to harrass children who swap a tune or a mobile phone ring-tone. This is already a contentious issue in the USA.: it will now come here too. Here is a critical article on the original proposal by a number of distinguished lawyers. This Directive is also likely to have unpleasant effects on the communications industry, on universities, on libraries, on software compatibility, and maybe even on the single market - the right to free trade within Europe, which is the very reason for the EU's existence. This horrible law was supported by Microsoft (which is about to be convicted by the EU of anticompetitive behaviour), the music industry and the owners of luxury brands such as Yves Saint Laurent, while it was opposed by phone companies , supermarkets, smaller software firms and the free software community. Lawyers were sceptical , as is the press - in Britain , France and even America . Civil liberties organisations were opposed , and the issue is linked to a boycott of Gillette . For the outcome of the plenary vote, and links to the resulting press coverage, see my blog FIPR's most spectacular recent success was amending the Export Bill . This bill was designed to give ministers the power to license intangible exports. It was the result of lobbying by the USA, and specifically by Al Gore, of Tony Blair in 1997; Al was sore at the fact that guys like me could put crypto source code on our web pages, while our US colleagues weren't allowed to . In its original form , its provisions were so broad that it would have given ministers the power of pre-publication review of scientific papers. Some of the material on this web page would have had to be removed if it they had had got it through. But they didn't; we defeated the Government in the House of Lords by 150-108, following a vigorous campaign. (Here are links to some of the press coverage: in the BBC , the Independent , the New Scientist , the Guardian and the Economist . There is also an article on free speech I wrote and that appeared in IEEE Computing. But the best quote I have is also the earliest. The first book written on cryptology in English, by Bishop John Wilkins in 1641, remarked that `If all those useful Inventions that are liable to abuse, should therefore be concealed, there is not any Art or Science which might be lawfully profest' . This issue became live again recently, with an attempt by the government to wrest back using regulations much of what they conceded in parliament. FIPR fought back , and extracted assurances from Lord Sainsbury about the interpretation of regulations made under the Export Control Act. This may seem boring and technical, but is of considerable importance to British science and to academic freedom in general. Without our campaign, much scientific collaboration would have become technically illegal, leaving scientists open to arbitrary harrassment by the state. Much credit also goes to the Conservative frontbencher Doreen Miller , Liberal Democrat frontbencher Margaret Sharp , and President of the Royal Society Bob May , who marshalled the crossbenchers in the Lords. We are very grateful to them for their efforts. FIPR also ran a successful campaign to limit the scope of the Regulation of Investigatory Powers Act . Originally this would have allowed the police to obtain, without warrant, a complete history of everyone's web browsing activity (under the rubric of `communications data'); a FIPR amendment limited this to the identity of the machines involved in a communication, rather than the actual web pages. Another example of first-class work by FIPR is a research project that brought together legal and computing skills to deconstruct the fashionable notion that `digital certificates' would solve the problems of e-commerce and e-government. Anyone who thinks of buying such a beast, other than for purposes of research or ridicule, should have a look at this article first. My pro-bono work also includes sitting on Council, our University's governing body. I stood for election because I was concerned about the erosion of academic freedom under the previous administration. See, for example a truly shocking speech by Mike Clark at a recent discussion on IPR. Mike tells how our administration promised a research sponsor that he would submit all his relevant papers to them for prior review - without even asking him! It was to prevent abuses like this that we founded the Campaign for Cambridge Freedoms . Its proximate goal was to defeat a proposal by the emeritus Vice Chancellor that most of the intellectual property generated by faculty members - from patents on bright ideas to books written up from lecture notes - would belong to the university rather than to the person who created them. If this had passed, Cambridge would have swapped one of the most liberal rules on intellectual property of any British university, for one of the most oppressive anywhere. There are grave implications for academic freedom , and for faculty recruitment and retention. We were told that this change was instigated by the Department of Trade and Industry; yet the consequences for industry will be dire. The incentives that led to the creation of hundreds of high-tech companies in the area will be destroyed. Perhaps civil servants view us not as the goose that lays the golden eggs, but as a nail that sticks out and needs to be hammered down. See also coverage in the Observer , the Telegraph , the Independent and ZDNET . There's also the BBC , to whom the then Vice Chancellor said "The university has a right to a share because I think there are very few true individuals. Most people have to rely on others". (If he is asserting that the median Cambridge faculty member has never published a significant single-author paper, I'd like to see his statistics.) There was a well-attended Discussion in the Regent House which brought out many of these issues. The Vice Chancellor then set up a committee to advise him how to proceed, and on the 6th August 2003 it published its report . This suggested, as I predicted here , that the University take only patent rights now, as it won't be politically possible to do any more for the time being. This is unacceptable, as it will merely set the stage for further depradations in the future. Finally, my freedom-oriented work includes a number of technical writings: The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption has become perhaps the most widely cited publication on the topic of key escrow. It examines the fundamental properties of current government requirements for access to keys and attempts to outline the technical risks, costs, and implications of deploying systems that would satisfy them. It was originally presented as testimony to the US Senate, and then also to the Trade and Industry Committee of the UK House of Commons, together with some further testimony . Comments on Terrorism presents a brief critique of why many of the technical measures that various people have been trying to sell since the 11th September attacks are unlikely to work as promised; The Global Trust Register is a book which contains the fingerprints of the world's most important public keys. It thus implements a top-level certification authority (CA) using paper and ink rather than in an electronic system. It provides the missing link in the global CA hierarchy, and has been a useful vehicle for research into certification issues. Its relevance to the crypto policy debate is that it if the DTI had pushed through their original policy on mandatory licensing of cryptographic services , this book would have been banned in the UK. At a critical point in the lobbying, it enabled me to visit the Culture Secretary and ask why his government wanted to ban my book. This got crypto policy referred to Cabinet when otherwise it would have been pushed through by the civil servants; The Steganographic File System will give you any file whose name and password you know, but if you do not know the correct password, you cannot even tell that a file of that name exists in the system. It is designed to give a high level of protection against seizure of keys and data as envisaged by the RIP bill . Download the code from here . The GCHQ Protocol and its Problems points out a number of serious defects in the protocol that the British government uses to secure its electronic mail, and which it is trying to arm-twist other organisations into using too. This paper appeared at Eurocrypt 97 and it incorporates our replies to GCHQ's response to an earlier version of our paper. Our analysis prevented the protocol from being widely adapted throughout Europe, as the forces of darkness hoped; as far as I know, its only use outside the UK public sector is in the French health service. Its use even in the UK is now under attack as its escrow of signing keys makes the retrospective forgery of government documents easy, thus undermining the Freedom of Information Act; Crypto in Europe - Markets, Law and Policy surveys the uses of cryptography in Europe, looks at the technical and legal threats, and discusses the shortcomings of public policy. It appeared at the Conference on Cryptographic Policy and Algorithms, Queensland, July 1995. In it, I first pointed out that law enforcement communications intelligence was mostly about traffic analysis - finding out who was talking to whom - and criminal communications security was mostly traffic security. This was considered heretical at the time but has been confirmed since by the emergence of the prepaid mobile phone as the main threat to police communications intelligence. A consultation document from the Foundation for Information Policy Research which makes some interesting comments on multifunction smartcards. It was written in response to a CCTA consultation on smartcards . There is a page of material on the main policy issues as they were in 1999, when I decided to stop maintaining my own web pages on information policy and simply contribute to FIPR's instead. There's also a leaked copy of the NSA Security Manual that you can download (there is also latex source for it). Finally, here is my PGP key . If I revoke this key, I will always be willing to explain why I have done so provided that the giving of such an explanation is lawful . (For more, see FIPR .) My Book on Security Engineering Now also available in Japanese and Chinese! Security engineering is about building systems to remain dependable in the face of malice, error or mischance. As a discipline, it focuses on the tools, processes and methods needed to design, implement and test complete systems, and to adapt existing systems as their environment evolves. Security engineering is not just concerned with `infrastructure' matters such as firewalls and PKI. It's also about specific applications, such as banking and medical record-keeping, and about embedded systems such as automatic teller machines and burglar alarms. It's usually done badly: it often takes several attempts to get a design right. It is also hard to learn: although there are good books on a number of the component technologies, such as cryptography and operating systems security, there's little about how to use them effectively, and even less about how to make them work together. It's hardly surprising that most systems don't fail because the mechanisms are weak, but because they're used wrong. My book is attempt to help the working engineer to do better. As well as the basic science, it contains details of many typical applications - and lot of case histories of how their protection mechanisms failed. (Some of these are available in the research papers listed below, but I've added many more.) It contains a fair amount of new material, as well as accounts of a number of technologies (such as hardware tamper-resistance) which aren't well described in the accessible literature. There was a very nice review in Information Security Magazine, and the other reviews have so far been positive. Even the usually cynical Slashdot crowd liked it. I hope you'll also enjoy it - and find it seriously useful! More ... Contact details University of Cambridge Computer Laboratory JJ Thomson Avenue Cambridge CB3 0FD, England E-mail: Ross.Anderson@cl.cam.ac.uk Tel: +44 1223 33 47 33 Fax: +44 1223 33 46 78 I don't execute programs sent by strangers without good reason. So I don't read attachments in formats such as Word, unless by prior arrangement. I also discard html-only emails, as most of them are spam; and emails asking for `summer research positions' or `internships', which we don't do. If you're contacting me about coming to Cambridge to do a PhD, please read the relevant web pages first.
Knudsen, Lars Ramkilde
Home page with links to personal information and publications. Also has links to algorithms and news items.
Lars Ramkilde Knudsen Lars Ramkilde Knudsen I have moved to Denmark and am employed here . My home page .
Shoup, Victor
Home page of IBM researcher with links to his research papers.
Victor Shoup's Home Page Victor Shoup's Home Page victor@shoup.net Current address: New York University Courant Institute 251 Mercer Street New York, NY 10012 Tel: +1 (212) 998-3511 shoup@cs.nyu.edu A Computational Introduction to Number Theory and Algebra (Version 1) A book introducing basic concepts from computational number theory and algebra, including all the necessary mathematical background. NTL: A Library for doing Number Theory (version 5.4) NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields. ISO 18033-2: An Emerging Standard for Public-Key Encryption ISO 18033-2 is an emerging standard for public-key encryption. This project is being carried out by Working Group 2 of ISO IEC JTC 1 SC27, and I am the editor for this project. Here, you can find a current draft, a reference implementation, and some supporting documentation. Research Papers My research interests include: the design, analysis, and implementation of algorithms for solving problems in the area of number theory and algebra; the design and analysis of cryptographic protocols. NYU Related Stuff Courses, etc. (not always up to date).
Smart, Nigel
Home page of researcher at the University of Bristol, with links to his research interests and courses he teaches.
Nigel Smart Nigel Smart's Home Page Phone: +44 (0) 117 954-5163 Postal Address: Prof. N. P. Smart Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom. I am involved in the following departmental research groups: Cryptography and Infomation Security Mobile and Wearable Computing I am also involved in the teaching of the following units: COMS20805 : Software Product Engineering COMS30124 : Introduction to Cryptography COMSM0213 : Information Security I am also the course director for our Maths and Computer Science degree programmes. I am usually found in my office most days between 08.00 and 16.00 unless I am lecturing. Here are some more pages that you may (probably not) find interesting... Bibliography Some Crypto CNT Links Weil Descent Page Information Security Seminars Various local only information can be found here . A draft version of what ECC keys should look like in SPKI can be found here . Books The Algorithmic Resolution of Diophantine Equations. London Mathematical Society Student Text, 41. Cambridge University Press, 1998. ISBN: 0 521 64633 2 (PB) and 0 521 64156 X (HB). Corrections Errata Elliptic Curves in Cryptography . (with I.F. Blake and G. Seroussi). London Mathematical Society Lecture Note Series. Cambridge University Press, 1999. ISBN: 0 521 65374 6 (PB). Now available in Japanese : ISBN 4 89471 431 0 Now available in Polish : ISBN 83 204 2951 X Cryptography, An Introduction . McGraw-Hill, 2002. ISBN 0 077 09987 7 (PB). Errata Advances in Elliptic Curve Cryptography (Edited with I.F. Blake and G. Seroussi). London Mathematical Society Lecture Note Series. Cambridge University Press, 2004. ISBN: 0 521 60415 X (PB). Errata My PGP key is here . Nigel Smart nigel (at) cs (dot) bris (dot) ac (dot) uk
Lucks, Stefan
Home page of University of Mannheim researcher with links to resume, courses and publications.
Stefan Lucks Stefan Lucks office at University of Mannheim; lucks@th.informatik.uni-mannheim.de Research: My fields of research are Cryptography and Communications Security. I am - searching for an improved understanding and formal handling of security issues, - and actively participating in the development of secure systems. A selection of my papers is available on-line. As is a full list of my publications and my Resume (CV) Pictures: Pictures: , , . TV: . Teaching: (German) Vorlesung: Verschlsseln mit Elliptischen Kurven Vorlesung: Digital Unterschreiben und Bezahlen Seminar: Praktische Kryptographie Frhere Lehrveranstaltungen Crypto-related Links: Scientific Papers about Cryptography The IACR and its eprint server Some german links on Crypto and Security Some conferences I serve in the PC: FSE 2006 , Graz and Eurocrypt 2006 , St. Petersburg Crypto-Workshop at "Sicherheit 2006" , Magdeburg The Cambridge List of Security Conferences Electronic Proceedings of Crypto and Eurocrypt 1981-1997 1. Kryptotag in Mannheim, organised by the task group Applied Cryptography of the True Random Numbers The Poisoned Message Attack see also an illustrated guide on hashes My links regarding cryptography and computer security Press and Security: (German) Wie sicher ist Ihre Internetverbindung? Heise mit tglichen News und Heise Security Eine Geheimwissenschaft wird ffentlich ( ForUM 2003) Brchige Mauern aus Zahlen in Technology Review Sicher ist unsicher , Deutschlandfunk Audio-Stream General Links: Aufdeckung von Plagiat fr Lehrkrfte (German) Travel in Europe , connections to and from Mannheim Postleitzahl-Suche (German, Javascript) Conference Etiquette and Oral Presentation Advice More links of general interest Searching, Translating, ...: Kolibri (German) , and a page with Search Engines AltaVista , AllTheWeb , Google , Scholar-Google , and a Mirror of Google LEO's Dictionary and more Dictionaries The Complexity Zoo and its graphical taxonomy Some Fun: Dilbert User Friendly ( archives ) Garfield Some kind of fine Steganography (German) German researcher at work, McHack math is good for your career Hints on healthy computing The certificate of trustedcomputing.org has expired This page is validity checked and interoperable with any browser . Last modification: 10 2005. The owner supports Privacy . Back to Theoretische Informatik in Mannheim
Schroeppel, Rich
Links to research interests of University of Arizona mathematician.
Rich Schroeppel I'm presently exploring the use of cryptography to implement secure network protocols. My research interests include most things mathematical or computical. Education: BS math MIT '68. Modular Dilogarithms http: www.cs.arizona.edu ~rcs dilog-paper-020402 The classical dilogarithm function can be generalized to Mod P. The Hasty Pudding Cipher http: www.cs.arizona.edu ~rcs hpc A tasty morsel! Elliptic Curves and Fast Galois Field Arithmetic http: www.cs.arizona.edu ~rcs ecrv Find out about the wonderful world of GF[2^K], where 2=0, plus is minus, and squaring is a linear operator. And why they are called elliptic curves. Hilbert Speech http: www.cs.arizona.edu ~rcs hilbert-speech The mathematician David Hilbert, in a 1900 speech, proposed 23 problems. Many new areas of mathematics have evolved since 1900, but Hilbert's problems still have some influence. The equations are best viewed in a fixed-width font. Hunting Big Game in the Theory of Numbers http: www.cs.arizona.edu ~rcs biggame4 Derrick N. Lehmer's classic 1933 article about using an electromechanical sieve for factoring and primality testing. FTP interface: The Hasty Pudding Cipher, Elliptic Curves, and Multiperfect Numbers. ftp: ftp.cs.arizona.edu xkernel rcs index.html No FTP? You can use FTPMAIL to have files emailed to you. Send the message "help" to ftpmail@cs.arizona.edu. Phone: 801-423-7998 Email: rcs@cs.arizona.edu
Schnorr, C.P.
Home page of the research group of Johann Wolfgang Goethe University professor with links to group members home pages, publications and courses.
Mathematische Informatik frames . Welcome to the WWW server of Prof.Dr.Schnorr's research group ``Mathematical Computer Science'', Johann Wolfgang Goethe-University , Frankfurt am Main , Germany. Prof.Dr.Schnorr is with the Department of Mathematics and the Department of Computer Science . Mailing Address: Johann Wolfgang Goethe-Universitt Fachbereich Informatik und Mathematik (Fach 187) AG Mathematische Informatik 7.2 Postfach 11 19 32 60054 Frankfurt Germany Phone: +49 (0)69 798-22526 Fax : +49 (0)69 798-28841 Office location : ( How the reach us building 11 ) AG Mathematische Informatik 7.2 7th floor Robert-Mayer-Strae 10 60325 Frankfurt Bockenheim Germany (Looking out of the window.) People. The following homepages are private and maintained by the owners themselves (except for the generic homepages). Therefore, neither the University of Frankfurt nor the Webmaster of this server is responsible for the contents. Please do not send any Windows-based documents electronically. We are running a Unix system and cannot process those documents. Please convert them to Postscript or PDF first. Professors. Prof. Dr. H. Luckhardt (i.R.) Prof. Dr. C.P.Schnorr Prof. Dr. M.Sieveking (i.R.) Assistants. Rupert J. Hartung Antoine Scemama Secretary. D.Weber (email: sek@mi.informatik.uni-frankfurt.de ) Former Members Coffee Machine Publications, Theses and Lecture Notes. Publications Ph.D. Theses Master Theses Lecture Notes Teaching. Please note that most of the links below are in German. Use this information at your own risk - check out the official information of the University of Frankfurt. Winter 2005 06 Vorlesung "Gitter und Kryptographie" Vorlesungsbeginn: 26.11., Beginn der bungen: 1.11. Seminar "Kryptographie und Komplexitt" Letzte Themenvergaben mglich! Summer 2005. Vorlesung "Kryptographie" by Prof. Schnorr Seminar "Kryptographie und Komplexitt" by Prof. Schnorr AG "Mathematische Informatik" (Veranstaltung der Arbeitsgruppe) Winter 2004 05 "AG Mathematische Informatik" (Veranstaltung der Arbeitsgruppe) Vorlesung "Theoretische Informatik I" by Prof. Schnorr Seminar "Algorithmische Geometrie und Kryptographie" by Prof. Schnorr (Vorbesprechung: 16.07.04 siehe Aushang) Summer 2004. Vorlesung "Kryptographische Algorihmen" by Prof. Schnorr Seminar "Algorithmische Geometrie und Kryptographie" by Prof. Schnorr and PD Dr. Th. Theobald (TU Mnchen) Vorlesung "Diskrete Mathematik" by PD Dr. Th. Theobald Winter 2003 04. Vorlesung " Gitter und Kryptographie " by Prof. Schnorr Seminar " Kryptographie und Komplexitt " by Prof. Schnorr (Vorbesprechung: 18.7.2003) Summer 2003. Proseminar " Kryptograpie und Komplexitt " by Prof. Schnorr Seminar " Kryptographie und Komplexitt " by Prof. Schnorr Vorlesung " Diskrete Mathematik " by Prof. Schnorr Winter 2002 03. Seminar Proseminar " Kryptographie und Komplexitt " by Prof. Schnorr Vorlesung Kryptographie " Summer 2002. Lecture " Diskrete Mathematik " by Prof. M.Sieveking Previous Courses. See a partial list of previous courses . Links. Conferences Homepages of cryptographers and other theoretical computer scientists On-line archives , on-line journals , on-line lecture notes and surveys and publication indices in theoretical computer science Non-profit organizations and research labs in theoretical computer science. Search engines Universities Dictionaries Other links Links for system administrators Publishers and book shops Just for fun Highlights (German) This site supports frames . URL: http: www.mi.informatik.uni-frankfurt.de
Rogaway, Phil
Associate professor at UC Davis, with links to research papers and courses.
Phil Rogaway - Home Page Phillip Rogaway I am a Professor in the Dept of Computer Science at the University of California, Davis , USA. I am also a regular visitor to the Dept of Computer Science at Chiang Mai University , Thailand. My research is in cryptography. I did my undergraduate work at UC Berkeley , and completed my Ph.D. in 1991 at MIT , in the Theory of Computation Group . I worked for three years at IBM as a security architect, then came to UC Davis in 1994. My research has focused on obtaining provably-good solutions to protocol problems of practical interest. Please email me at rogaway@cs.ucdavis.edu Pre-quarter advising hours: Tue 9 27 10-11:30, Wed 9 28 10-11:30 After that, Fall advising hours: Wed 11-12 My sincere apologies to all of the peace-loving people of the world for the decades of war crimes, international terrorism, and crimes against humanity carried out by my government and its people. As for our latest war of aggression, I support the Iraqi resistance. Research: Papers . Research summary . CV and professional statement . Funding . Service contributions Teaching: Classes . My students . Advice for our UG majors Some Algorithms: OCB . UMAC . CMAC Miscellaneous: Links . Consulting . USA Address (present location) Thailand Address Department of Computer Science Department of Computer Science 3063 Kemper Hall Faculty of Science University of California Chiang Mai University Davis, CA 95616-8562 USA Chiang Mai 50200 THAILAND +1 530 752 7583 (office) +66 1 530 7620 (cell phone) +1 530 752 4767 (FAX) +66 53 943433 (FAX) +1 530 752 7004 (secretary) +1 530 753 0987 (home) Time is 14 hours ahead of California And by the way, my name is not spelled Philip Rogaway. My parents paid extra for the second l and I'd prefer you to use it.
Nakahara, Jorge
Home page of doctoral candidate with links to other cryptographers, groups and papers.
Homepage of Jorge Nakahara Jr Homepage of Jorge Nakahara Jr Welcome to my home page at the SCD COSIC group, in ESAT , the Electrical Engineering Department of the Katholieke Universiteit Leuven (K.U.Leuven, in Leuven, Belgium) . Where to find me : Electrical Engineering Dept. - ESAT - SCD COSIC Research Group Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee room 91.55 Tel.: +0032. 16. 32. 17. 00 Some links : IACR (International Association for Cryptologic Research) RSA Labs Home Page Tiny Encryption Algorithm Cipher Newsletter International PGP Home Page Electronic Colloquium on Computational Complexity Internet Engineering Task Force Misty Block Cipher Open SSL Project NESSIE Electronic Frontier Foundation (EFF) Ronald Rivest's Home Page Andrew Odlyzko's Home Page Mahdu Sudan's Home Page Advanced Encryption Standard (AES) Home Page Phililip Rogaway's Home Page IBM Patents David Wagner's Home Page Handbook of Applied Cryptography Some World Famous Cryptographers: Bart Preneel Vincent Rijmen Joan Daemen Keith Martin Lars Ramkilde Knudsen Antoon Bosselaers Eli Biham Bart Van Rompay Frederik Vercauteren Paulo S.L.M. Barreto Ronald L. Rivest Paper World : MSc at KULeuven Feistel Networks (paper presented at WIC'99 Conference) Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher family , 7th Fast Software Encryption Workshop, Apr. 10-12, 2000, New York, USA, Springer-Verlag , LNCS 1978, B. Schnier, Ed., 244-261. Weaknesses in protocols for updating the parameters of an established threshold scheme , Computers and Digital Techniques, Vol 148, No. 1, Jan. 2001, 45-48. Improved Square-Attacks Against Reduced-Round Hierocrypt , 8th Fast Software Encryption Workshop, Apr. 2-4, 2001, Japan, Springer-Verlag , LNCS 2355, M. Matsui, Ed., 165-173. SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers , 23rd Symposium on Information Theory in the Benelux, Louvain-la-Neuve, Belgium, May 29-31, 2002, B. Macq and J.-J. Quisquater, Eds., 187--195. Linear Cryptanalysis of Reduced-Round SAFER++ , Second NESSIE Workshop, Sep. 12-13, 2001, Royal Holloway, University of London, UK, 13 pgs. Square Attacks on Reduced-Round Variants of the Skipjack Block Cipher , IACR Cryptology ePrint Archive, Report 2002 003 (Jan. 4, 2002), 50 pgs. Square Attacks on Extended Rijndael Block Cipher , COSIC Tech report, Jun. 2002, 12 pgs, New Weak-Key Classes of IDEA (revised version) , 4th International Conference on Information and Communications Security - ICICS'02, Singapore, Dec. 10-12, 2002, Springer-Verlag , LNCS 2513, R. Deng, S. Qing, F. Bao, J. Zhou, Ed.s, 315--326 (slides) . Impossible Differential Attacks on Reduced-Round SAFER Ciphers, COSIC Tech report, Nov. 2002, 12 pgs, A Note on Weak Keys of PES, IDEA and some Extended Variants, 6th Information Security Conference (ISC'03), Oct. 1-3, 2003, Bristol, UK. The MESH Block Ciphers (revised and extended version) , The 4th International Workshop on Information Security Applications, WISA 2003, Jeju Island, Korea, Aug. 25-27, 2003, Springer Verlag, K. Chae, M. Yung, Ed.s (C source code) (Slides of presentation) An Update to Linear Cryptanalysis of SAFER++ submitted to the NESSIE Project, Mar. 2003, 5 pgs. Experimental Non-Linear Cryptanalysis , COSIC Tech report, Mar. 2003, 17 pgs. The Biryukov-Demirci Attack on IDEA and MESH Ciphers , COSIC Tech Report, Apr. 2003, 13 pgs My PhD defense took place June 2, 2003, in the Auditorium of the Arenberg Castle, see slides thesis in PDF format and picture1 picture2 picture3 picture4. My supervisors were Prof. Bart Preneel and Prof. Joos Vandewalle . My research assessors were Prof. Jean-Jacques Quisquater and Prof. Marc Van Barel . My Curriculum Vitae (in PDF) Research Interests: I am interested in cryptanalysis techniques and in design of block ciphers. From Sept. 12, 2003, please, send your e-mails to my new address at: jorge_nakahara@yahoo.com.br Last updated on Sep. 9, 2003.
Murphy, Sean
Home page of University of London reader, with links to his papers and university courses.
Sean Murphy Sean Murphy This website is now located at http: www.isg.rhul.ac.uk ~sean .
Maurer, Ueli
Has links to publications, research activities and c.v. of Swiss professor.
Ueli Maurer Home page Ueli Maurer Home page Publications Some talks Short CV Contact Group page Home page Ueli Maurer Professor of Computer Science Information Security and Cryptography Research Group mail: maurer@inf.ethz.ch url: http: www.crypto.ethz.ch ~maurer phone: +41 1 632 74 20 secretary: +41 1 632 73 85 fax: +41 1 632 11 72 Postal address: Department of Computer Science ETH Zurich CH - 8092 Zurich Switzerland Research activities: Selected research projects Some research highlights Publications Selected talks Program committees My research group Links to some of my activities: Editor-in-Chief, Journal of Cryptology (Springer Verlag Link Access) Editor-in-Chief (with Ron Rivest), Springer-Verlag's Book Series on Information Security and Cryptography International Association for Cryptologic Research 2005 Symposium on Privacy and Security Some other links: Computer Science Department at ETH How to find me (building: IFW, room: E 45.1) 09-Mar-2005 wwwcrypt@inf.ethz.ch
Krovetz, Ted
UC Davis lecturer with links to his research papers and courses.
Ted Krovetz Viewing this page requires a browser capable of displaying frames.
Kocher, Paul
Profile of the president of Cryptography Research Inc, with links to company products and services and other staff. Famous for his attacks on RSA implemented smart cards.
Cryptography Research - Paul Kocher home company management Paul Kocher Management Advisory Board Careers Contact Paul Kocher president AND CHIEF SCIENTIST Paul Kocher has gained an international reputation for his consulting work and academic research in cryptography. He brings unsurpassed expertise to the Cryptography Research team, having provided applied cryptographic solutions to clients ranging from start-ups to Fortune 500 companies. An active contributor to major conferences and standards bodies, Paul has designed many cryptographic applications and protocols including SSL v3.0. His development of timing attacks to break RSA and other algorithms received front-page coverage in the New York Times. More recently he has led research to develop Differential Power Analysis and designs for securing smart cards and other devices against these attacks, as well as to design a record-breaking DES Key Search machine. Paul holds a B.S. degree from Stanford University. Paul Kocher in the news DES Key Search Project Completed DPA Information MIT Tech Review's 100 Top Innovators contact info FAX: 415-397-0127 paul@cryptography.com Home Company What We Do News Events Resources
Preneel, Bart
Home page of Belgian researcher with links to his papers and to the COSIC research group.
Bart Preneel's home page Bart Preneel Name : Prof. Dr. Ir. Bart Preneel E-mail : Tel : +32(0)16 32.11.48 Fax : +32(0)16 32.19.69 Postal Address : Katholieke Universiteit Leuven Dept. Elektrotechniek-ESAT COSIC Kasteelpark Arenberg 10 B-3001 Leuven-Heverlee Belgium PGP key ESAT ERASMUS information H0244A H0244B Cryptografie en Netwerkbeveiliging: Toledo HD12 Codeertechnieken - Onderdeel Kanaalcodering: Toledo Who am I I am professor (hoogleraar) in the research group COSIC of the Electrical Engineering Department of the Katholieke Universiteit Leuven in Belgium. My main research area is information security. My research focuses on cryptographic algorithms and protocols as well as their applications to computer and network security and mobile communications. My favourite research topics are hash functions, MACs, and block ciphers. I am still working on my book on hash functions (is my PhD thesis on this subject is out of print but here is finally an electronic version from 1993). I plan to complete it by the end of 2005. My favourite hash function is RIPEMD-160 (more details at this site). My favourite MAC is MDx-MAC (click here for a paper in postscript). I am teaching on cryptology, network security and coding theory at the K.U.Leuven. I have been visiting professor at the Ruhr Universitaet Bochum (Germany), the T.U.Graz (Austria), the University of Bergen (Norway), and the Universiteit Gent (Belgium). In '93-'94 I was a research fellow at the University of California at Berkeley. I have contributed to the growth of COSIC , a research group in cryptology and its applications. The last time I counted, there were 7 postdocs, 22 PhD students or researchers and 6 visitors. My colleagues in COSIC are Prof. Joos Vandewalle and Prof. Ingrid Verbauwhede. I am SOCRATES ERASMUS coordinator for the Electrical Engineering Department. I am responsible for the incoming and outgoing students. I have also organized the ESAT-COSIC biennial Summer School on cryptography (June 2005). The main strength of this course (first edition in 1989) is that it provides speakers with a widely varying background, varying from well-known researchers in cryptology to experts in its applications from the banking and telecommunication world. The last edition had close to 80 participants. The next edition of this course is planned for June 2007. In addition to the 9 Summer Schools in Leuven, I have lectured at more than 20 intensive courses in Austria, China, Denmark, Estonia, Finland (5), France, Greece (4), Lebanon, Poland (2), Spain, Sweden, USA (2). Currently, I am project manager of the future Network of Excellence ECRYPT (Cryptology and Watermarking) (2003-2007). I have been project manager of STORK , and NESSIE , which stands for New European Schemes for Signatures, Integrity and Encryption also sponsored under the IST programme. I am also in charge of APES (Anonymity and Privacy in Electronic Services) which is an STWW project sponsored by the IWT. COSIC has also participated in Cybervote and AREHCC (Advanced Research on Elliptic and Hyperelliptic Curve Cryptography), both sponsored by the IST programme and STEBS (Security Technologies for Electronic Business) sponsored by the IWT. In the past, I have been involved in research projects on several topics including mobile communications security ( ASPeCT ), Internet security (Media On-Line), Digital Timestamping ( TIMESEC ), Electronic PV, Secure Communication with Vehicles (in collaboration with SmartMove), physical attacks on smart cards (including SPA, DPA, EMA, and timing attacks), and biometrics (Smartpen). To fill my days, I do some consulting (Mastercard International, S.W.I.F.T., Proton World International,...), and I participate to the work of ISO IEC JTC1 SC27 WG2. I am Vice President of the International Association for Cryptologic Research (IACR) and Co-founder and chairman of LSEC vzw (Leuven Security Excellence Consortium) I am Member of the Steering Committee of the Workshop Fast Software Encryption (since 1993), International Workshop on Information Security, Korea (since 2002), RSA Security Cryptographer's Track, USA, (2001-2004). My favourite book on cryptography is the Handbook of Applied Cryptography . My favourite book on cryptography politics is Privacy on the Line. The Politics of Wiretapping and Encryption . My favourite journal is the Journal of Craptology . My work Publications Slides of overview talks Slides of lectures (incomplete) List of co-authors My hobby playing saxophone in a Dixieland band ( Interfak Dixieland ) conducting the Interfak Bigband (the bigband of the K.U.Leuven). My favourite quotes click here My links click here to convert currencies or languages Back to: COSIC Home Page ESAT Home Page Katholieke Universiteit Leuven Home Page Partially updated on November 7, 2005. Problems with this page please email me at the address above.
Syverson, Paul
Covers his professional associations and areas of interest related to cryptography.
Paul Syverson Home Page Paul Syverson Home Page I am employed as a Mathematician at the Center for High Assurance Computer Systems ( CHACS ) of the Naval Research Laboratory ( NRL ). Contact Information A picture of me Google Some advertisements for professional activities with which I am involved: Program Committee, IFCA Financial Cryptography Conference (FC06) 2006 Program Committee Workshop on Privacy Enhancing Technologies (PET 2006) Program Committee, (WPES '05) ACM Workshop on Privacy in the Electronic Society, 2005 Program Chair, European Symposium on Research in Computer Security (ESORICS '05) Program Committee 8th Information Security Conference (ISC'05) Publications Chair, ACM Conference on Computer and Communications Security (CCS 2005) Program Committee, ACM Conference on Computer and Communications Security (CCS 2005) Industry Track Advisory Board, PETs (Workshop on Privacy Enhancing Technologies) Steering Committee CSFW (IEEE Computer Security Foundations Workshop) Charter Member, IFIP WG 1.7 , on Theoretical Foundations of Security Analysis and Design Board of Directors, ICISA , (International Communications and Information Security Association) Past activities that I was ``in charge of'' in some way: Director, IFCA (International Financial Cryptography Association), 2002 -- 2005 Program Chair, (WPES '03) and (WPES '04) ACM Workshop on Privacy in the Electronic Society, 2003 and 2004 Program Chair, 2002 Workshop on Privacy Enhancing Technologies General Chair, Workshop on Issues in the Theory of Security (WITS) 2002 Program Chair, IFCA Financial Cryptography Conference (FC01) 2001 Guest Editor, Journal of Computer Security Special Issues of Selected Papers from CSFW12 and CSFW13. Program Chair, IEEE Computer Security Foundations Workshop (CSFW) 1999 and 2000 Editor, Cipher Newsletter of the IEEE Computer Society Technical Committee on Security and Privacy, 1998 -- 2000 Primary Research interests: Secure System Design Anonymity Mechanisms Reliability Mechanisms Security Analysis, Logic, Formal Methods Specification and Analysis of Anonymity Specification and Analysis of Security Protocols Projects and Funding Onion Routing , is a family of projects sponsored by DARPA, CNO, and ONR on designing and using low latency communication abstrusion (making communication anonymous resistant to traffic analysis). The current systems for general internet communication and for location hidden servers can be obtained at the Tor site . It is now supported by the EFF . SPYCE , ONR URI project on diffuse computing Some publications Books: Logic, Convention, and Common Knowledge: A Conventionalist Account of Logic. Published by CSLI Lecture Notes . Also available at your local independent bookseller , and yes Amazon . Brief Description: This book presents the thesis that logic is conventional, that logical consequence and logical truth are not simply given; they arise as conventions. This is a response to Quine's position that conventionalism for logic must be either trivial or vacuous. Following Lewis, convention is explained within a game-theoretic framework to be a kind of equilibrium between the strategies of players. Although Lewis ultimately abandoned that account, it is argued that conventions are still reasonably treated as coordination equilibria. Convention and coordination are ordinarily assumed to require common knowledge. Barwise's shared-situation approach to common knowledge is examined in detail and illustrated by Gray's classic coordination problem from distributed computing, where two generals can only communicate with each other through unreliable means. Though this problem is widely thought to be provably unsolvable, a solution is provided---based on the limitations of the generals' reasoning abilities. Epistemic logic, expressive enough to represent and reason about common knowledge, is developed to capture such limited reasoning. The logic is shown to be sound and complete with respect to a presented situation semantics. Returning to Quine's critique and explaining how conventions can arise even when common knowledge is available only after a convention arises, this book's conclusion completes the justification for a conventionalist view of logic. Edited volumes of papers from chaired conferences and workshops listed above. Some papers: High-Power Proxies for Enhancing RFID Privacy and Utility. by Ari Juels , Paul Syverson , and Dan Bailey . In Workshop on Privacy Enhancing Technologies (PET 2005) . PDF Tor: The Second-Generation Onion Router. by Roger Dingledine , Nick Mathewson , and Paul Syverson . In 13th USENIX Security Symposium (Security '04) . PDF What Price Privacy? (and why identity theft is about neither identity nor theft). by Adam Shostack and Paul Syverson . In Economics of Information Security , Chapter 11, Kluwer Academic Publishers, 2004. PDF Synchronous Batching: From Cascades to Free Routes. by Roger Dingledine , Vitaly Shmatikov , and Paul Syverson . In Workshop on Privacy Enhancing Technologies (PET 2004) . PDF Universal Re-encryption for Mixnets. by Philippe Golle , Markus Jakobsson , Ari Juels , and Paul Syverson . In RSA Conference 2004 , Cryptographers' Track (CT-RSA 04). PDF Formal Specification and Analysis of the Group Domain of Interpretation Protocol Using NPATRL and the NRL Protocol Analyzer. by Catherine Meadows, Paul Syverson, and Iliano Cervesato. In Journal of Computer Security . PS , PDF Reputation in P2P Anonymity Systems. by Roger Dingledine, Nick Mathewson, and Paul Syverson. In Workshop on Economics of Peer-to-Peer Systems June 2003. PDF The Paradoxical Value of Privacy. by Paul Syverson In 2nd Annual Workshop on Economics and Information Security (WEIS 2003). PDF Metrics for Traffic Analysis Prevention. by Richard E. Newman, Ira S. Moskowitz, Paul Syverson, and Andrei Serjantov. In Privacy Enhancing Technologies (PET 2003). PDF On the Economics of Anonymity . by Alessandro Acquisti, Roger Dingledine, and Paul Syverson. In Financial Cryptography (FC 2003). PDF , PS , Slides: ( PDF ) From a Trickle to a Flood: Active Attacks on Several Mix Types. by Andrei Serjantov, Roger Dingledine, and Paul Syverson. In Information Hiding , Oct 2002. PDF , PS Reputation in Privacy Enhancing Technologies. by Roger Dingledine, Nick Mathewson, and Paul Syverson. In Computers, Freedom, and Privacy , Apr 2002. html , PDF , PS , Slides: ( PPT , PS ) Reliable MIX Cascade Networks through Reputation. by Roger Dingledine and Paul Syverson. In Financial Cryptography 2002 . PS , PDF , Slides: ( PDF ) The Logic of Authentication Protocols. by Paul Syverson and Iliano Cervesato. In Foundations of Security Analysis and Design, Springer-Verlag LNCS 2171 PS , PDF Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange. by Paul Syverson. In Proceedings of the 1998 IEEE Computer Security Foundations Workshop (CSFW11). PS , PDF A logical approach to multilevel security of probabilistic systems. by James W. Gray, III and Paul Syverson. In Distributed Computing, 11(2), 1998. PS , PDF A Different Look at Secure Distributed Computation. by Paul Syverson. In Proceedings of the 1997 IEEE Computer Security Foundations Workshop (CSFW10). PS , PDF Protocols using Anonymous Connections: Mobile Applications. by Michael Reed, Paul Syverson, and David Goldschlag. In Security Protocols, Proceedings of the 5th International Workshop, Springer-Verlag LNCS 1361. PS , PDF More of my publications can be found under the CHACS publications page . some publications on security protocol analysis can be found at the CHACS cryptographic protocol analysis page . some on anonymity mechanisms (particularly on the Onion Routing anonymous communication infrastructure) can be found at the Onion Routing Homepage Page maintained by Paul Syverson Last modified on August 30, 2005
Cramer, Ronald
Shows his works and interest. Professor at Center of the Danish National Research Foundation.
Index of ~cramer Index of ~cramer Name Last modified Size Description Parent Directory - CRAMER.JPG 04-Dec-2002 12:27 229K cramer.jpg 23-Nov-2001 15:27 284K help.html 11-Apr-2000 10:36 219 index_outdated.html 05-Feb-2004 17:03 12K papers 02-Apr-2002 15:34 - ronald.jpg 04-Apr-2000 17:08 3.6K
Curtin, Matt
Self edited site with link to current work, interests and publications.
Matt Curtin Welcome to Matt Curtin: The Web Page. You've reached my virtual presence. If you feel so inclined, let me know what you think. Non-techies might be a little more comfortable reading the corporate tripe about me. Brute Force: Cracking the Data Encryption Standard Finally! The story behind the project that I led with Rocke Verser and Justin Dolske to prove that the U.S. Government standard for data encryption was weak is available in print. Brute Force covers the story behind the scenes, how we overcame technical hurdles, organized a huge social network, and defeated the standard before Congress made it illegal for people to use good cryptography to protect themselves. Anatomy of Online Fraud Online fraud is essentially no different from other kinds of fraud. Defenses often include an awareness of the scams that are out there and being careful not to be taken. In this paper, I document and comment on a recent scheme targeting eBay and Best Buy users. Spector Professional Review and Commentary If you're using spyware to see what your children or employees are doing, you might well be allowing a vendor to spy on them as well. We performed a quick analysis of Spector Pro for Windows for WBNS-10TV in Columbus, and documented our findings. PCFriendly Enables DVD Backchannels If you watch DVDs on your computer, you might be in for more than you realized, thanks to some unsafe default behavior in PCFriendly. More information is available in a press release and the paper . Developing Trust: Online Privacy and Security Developing Trust is my book on how to build systems that don't come back and bite us. In the book, I argue that privacy-aware systems are necessary for good security, that today's methods of "addressing" privacy are doomed to failure, and that we can build systems worthy of trust, if we have the courage to do so. Available in late November 2001 from Apress in the US and from Springer-Verlag internationally. Shibboleth: Private Mailing List Manager A mailing list manager that differs widely from others like Majordomo and Mailman. For lists whose subscriptions are by invitation only, these are problematic. We introduce more sophisticated subscriber profiles, protection from "outsiders", and eliminate the problem of receiving multiple copies of the same message. More information is available on this project's page . Programming Stuff Common Lisp I teach "Programming in Common Lisp" (CIS 459.31) at The Ohio State University's Department of Computer and Information Science. You should take my class so I can turn your brain inside out. Plus, we use lots of Common Lisp behind the scenes at Interhack . Perl I used to oversee much of the development of software for internal use and systems operation at OSU's CIS department. Most of this software is written in Perl. We made it a point to write good Perl, with a focus on maintainability and modularity. I'm very proud of what we were able to accomplish while I was there. Some of the systems are now enjoying wider use, others have been documented in formal papers, and some others are still waiting to achieve fame and fortune. Java I have a few projects cooking in Java. At present, I'm more interested in the ubiquitous acceptance of the Java Virtual Machine and implementing other languages in Java. "Open Source" Not a language, but related closely enough that it's worth mentioning here. I was the original advisor of the Open Source Club at Ohio State. The Net IETF Working Groups I poke my head into various working groups as time allows. I'm currently driving two Internet Drafts, both of which came from work that jwz started in 1998. (Actually, these have gotten bogged down, and the working group we were coordinating it through is years behind schedule. I'm just waiting until we get the main documentation finished before I revive these babies.) One is on identifying messages that have been delivered via both mail and news, and the other is an informational one giving some ideas for good Message-ID generation. Cryptography, Security, and Privacy Primary investigator, Interhack Internet Privacy Project Beginning in 2000, we've turned more attention to the privacy project because of recent increases in the number of privacy eroding technologies that have been introduced into the Internet, generally without the knowledge of those whose actions are being tracked. Lots of folks are talking about privacy, but there aren't many (comparatively speaking) who are dealing with the technical side of privacy. We're hoping that we can make a difference by helping developers fix problems that are accidental, by making the general public aware of systems that are not, and by building up a library of good technical documentation that describes these problems and how we can learn from these failures. Primary author and maintainer of the "Snake Oil FAQ" This is the generally accepted authoritative guide to identifying bogus cryptography, without having to be a cryptographer yourself. DESCHALL The first crack of a DES-encrypted message took place in June of 1997. I have some pages on the project here, including the mailing list archives. Also, some of us got our pictures taken for an article in PC Computing Japan about DESCHALL. I wrote a book entitled Brute Force about this project. Running my mouth I like to talk to people about technology, and help them get a grasp on the sorts of things that are possible now. Something that especially appeals to me is demystifying fairly complex issues and technologies like security, cryptography, scalable architectures, distributed systems, and that sort of thing. From time to time, I like to give presentations at schools, and try to help get kids more fired up about the sciences. The presentations I've given are usually pretty well-received; computers, cryptography, and the Internet interest kids now, and they're also great for showing how all that math-stuff they gotta learn is useful later in life. Throw me mail if you're a teacher or counselor in the Ohio area, and are interested in having some weird guy talk to students about the utility (and fun!) of science. You can find my non-work stuff at Ergo Sum . There are a number of ways to get ahold of me. By far, the best and most effective way is by email. Should you happen to come across my phone number, don't bother. It's probably got some strange device hooked up to it, anyway. Snail mail? hahahahahahhaa! If you're going to send me something you want me to read via snail mail, you'll likely have a much greater degree of success if you enclose a cool t-shirt with it. I'm partial to shirts with Unixy, math, and crypto related themes. Microsoft shirts are burned, symbolic of the "crash and burn" with which users of Microsoft software are intimately familiar. (Their CDs are used for coasters. ) interhack | cmcurtin | vitals | the soap box | publications | perl | hackcam | links cmcurtin@interhack.net
Wagner, David
Prof at UCB. His publications. Links to Cryptographers homepages. Courses.
David Wagner David Wagner Assistant Professor Computer Science Division University of California, Berkeley Research interests. Computer security, especially security of large-scale systems and networks. Applications of static and dynamic program analysis to computer security. Theory of cryptography. Design and analysis of symmetric-key cryptosystems. Operating systems. Theory. I am currently working on software security , wireless security , sensor network security , cryptography , and other topics. I participate in the TRUST and ACCURATE centers. Publications. My technical papers and publications are all available online. Some of my technical talks are also available, too. Teaching. I am co-teaching CS 161 (Computer Security) in Fall 2005. See also my past teaching . Students. I'm lucky to have the chance to work with a group of outstanding graduate students: Karl Chen , Rob Johnson , Chris Karlof , Adrian Mettler , David Molnar , Naveen Sastry , Ben Schwarz, Umesh Shankar , and Ka-Ping Yee , See also the students I've graduated . Contacting me. See my contact information for my address and other details. Professional activities. I'm currently involved with the following conferences: DIMACS Special Focus on Security (organizing committee), ACM CCS 2005 (program committee), Usenix Security 2006 (program committee), IEEE Security Privacy 2006 (program committee). Software. Available: Oink , a tool for type inference analysis of C and C++ code; MOPS , a tool for verifying security properties of C code; and BOON , a tool for finding buffer overrun vulnerabilities in C code. Resources I maintain. Information on collecting randomness for cryptographic purposes. A large list of the home pages of some crypto and security researchers . A list of random links . David Wagner, daw@cs.berkeley.edu , http: www.cs.berkeley.edu ~daw .
Schneier, Bruce
Brief public relations information from Counterpane, the company he founded. Has links to his books, algorithms and news items.
Bruce Schneier Enterprise Protection Suite Managed Security Monitoring Managed Vulnerability Scanning Device Management Active Response Email Scanning DDoS Prevention Log Retention Security Consulting Compliance Banking, Finance, Insurance Government Health Care Retail Utilities, Energy, and Power Small Medium Enterprise Literature Crypto-Gram Newsletter Book: Beyond Fear Book: Secrets Lies VARs Resellers Strategic Alliances Our Team Careers Investors Media Releases In the News Events Contact We could not possibly replicate Counterpanes service ourselves. We couldnt staff it. And even if we could, we would not get the benefits of Counterpanes global view. They watch security incidents throughout the globe, and we benefit from that. - David MacLeod, Ph.D. CISSP, The Regence Group CISO Bruce Schneier Founder and Chief Technical Officer Internationally-renowned security technologist and author Bruce Schneier is both a Founder and the Chief Technical Officer of Counterpane Internet Security, Inc. the world's leading protector of networked information - the inventor of outsourced security monitoring and the foremost authority on effective mitigation of emerging IT threats. Bruce is responsible for maintaining Counterpane's technical lead in world-class information security technology and its practical and effective implementation. Bruce's security experience makes him uniquely qualified to shape the direction of the company's research endeavors, as well as to act as a spokesperson to the business community on security issues and solutions. Bruce is the author of eight books, including his current best seller, Beyond Fear: Thinking Sensibly about Security in an Uncertain World, which tackles the problems of security from the small to the large: personal safety, crime, corporate security, national security. Secrets Lies: Digital Security in a Networked World, which was published in October 2000, has sold 150,000 copies. One of his earlier books, Applied Cryptography, now in its second edition, is the seminal work in its field and has sold over 200,000 copies and has been translated into five languages. He writes the free email newsletter Crypto-Gram, which has over 120,000 readers. He has presented papers at many international conferences, and he is a frequent writer, contributing editor, and lecturer on the topics of cryptography, computer security, and privacy. Bruce designed the popular Blowfish and Twofish encryption algorithms, the latter a finalist for the new Federal Advanced Encryption Standard (AES). Bruce served on the board of directors of the International Association for Cryptologic Research, and is an Advisory Board member for the Electronic Privacy Information Center. Bruce holds an MS degree in computer science from American University and a BS degree in physics from the University of Rochester. Bruce Schneier's home page To subscribe to Bruce's free monthly newsletter Crypto-Gram, please visit www.counterpane.com crypto-gram.html . privacy policy site map terms of use 2005 Counterpane Internet Security, Inc.
Rivest, Ronald L. Ronald L. Rivest
Associate Director of MIT's Laboratory for Computer Science, a founder of RSA Data Security. Links to works and related studies. Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science in MIT's EECS Dept and member of Theory of Computation Group at CSAIL. Massachusetts Institute of Technology.
Ronald L. Rivest : HomePage Ronald L. Rivest Professor Rivest is the Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science in MIT 's Department of Electrical Engineering and Computer Science. He is a member of MIT 's Computer Science and Artificial Intelligence Laboratory (CSAIL) , a member of the lab's Theory of Computation Group and a founder of its Cryptography and Information Security Group . He is also a founder of RSA Data Security (now merged with Security Dynamics to form RSA Security ) and of Peppercoin . Professor Rivest has research interests in cryptography, computer and network security, electronic voting, and algorithms. FAQ Biographical information Photos Publications and Talks Programs Bibliographies Classes Links to other web pages on cryptography and security Voting resources and links Web log '00 '01 Ronald L. Rivest CSAIL, 32 Vassar Street, Room 32-G692, Cambridge MA 02139 617-253-5880, or 617-258-9738 (fax) rivestATmit.edu (change "AT" to an "at" sign) The best way to contact me is usually through my secretary: Be (Hubbard) Blackburn CSAIL, 32 Vassar Street, Room 32-G692, Cambridge MA 02139 617-253-6098, or 617-258-9738 (fax) imbeATmit.edu (change "AT" to an "at" sign)
Cryptologia
A scholarly journal devoted to all aspects of cryptology. Tables of contents of all volumes.
Cryptologia Home Page This page uses frames, but your browser doesn't support them.
Cryptography
Something on cryptography. PGP. RSA.
Zoran Lukic: Kriptografska stranica Note: This document is in Croatian only. To obtain some information in English, just type PGP on Yahoo! or any other search engine. This should keep you busy for a few days. Also, take a look at PGP , RSA and International PGP home pages. Neto o kriptografiji. PGP. RSA. Svi su valjda uli za nekakav PGP public key iliti PGP javni klju. Ja bih sad ovdje htio rei neto openito o kriptografiji, o tome to je PGP i kako radi RSA algoritam na kojem se temelji PGP-ova programska podrka, koja je danas najrasprostranjenije i najuinkovitije orue za kriptiranje datoteka ili, uostalom, bilo ega. Osnovni kriptografski problem... Dvoje ljudi moe se dogovoriti za bilo kakvu funkciju, koja mora biti bijekcija, da slui za ifriranje meusobnih poruka. Poiljatelj e tada primijeniti dogovorenu funkciju na skup podataka i dobiti kriptirani tekst kojeg e onda primatelj dekriptirati primjenjujui na njega inverz dogovorene funkcije. Kako bijekcija ima pun kufer, nai junaci ne moraju strahovati da e ih netko prokljuviti. Stvar naravno tima, ako ta dvojica imaju tiho i skrovito mjesto na kojem se u miru mogu dogovarati o svojoj funkciji za kriptiranje. Ali, to ako takvog mjesta nemaju, ili se ak uope ne mogu sresti da bi dogovorili nain kriptiranja? Mali Ivica bi moda prvo poslao svom sugovorniku formulu, a nakon toga i kriptirani tekst. No, jasno je da onda kriptiranje nema smisla, jer ono eli sprijeiti treu osobu da ita ono to joj nije namijenjeno, a ako takav subverzivni element moe doi do kriptiranog teksta kojeg Ivica alje, tada je prethodno mogao uzeti i funkciju-kuharicu za deifriranje. ...i njegovo rjeenje "na prste" Ideja je, dakle, u postojanju dva kljua od kojih prvi slui za kriptiranje (zakljuavanje) a drugi za dekriptiranje (otkljuavanje) podataka. Javni klju, za zakljuavanje, moe biti dostupan svima, dok tajni klju, za otkljuavanje, ima samo onaj kome je poruka upuena. To znai da ako Ivica eli uputiti Marici poruku lascivnog sadraja, a da ih uiteljica ne skui, on e proitati Mariin javni klju na njenoj WWW stranici, upotrijebiti ga da bi kriptirao sadraj poruke i poslat e ju Marici. Ona e tada upotrijebiti svoj tajni kljui (kojeg ima samo ona) da bi dekriptirala Iviinu poruku, na primjer pomou programa PGP koji radi na opisanom naelu dva kljua. To bi tako trebalo ii. No, svatko prosjeno inteligentan uoit e odmah jednu upitnu stvar: ako zahtijevamo bijektivnost kriptiranja dekriptiranja (a moramo, inae gubimo podatke koji se prenose), tada je pomou javnog kljua (bijekcija!) na jedinstven nain odreen tajni klju (njegov inverz) koji moe otkljuati to je ovaj zakljuao. I, time smo na poetku. Tri pametne glave (RSA) "Hej, sjetili smo se!" - povikala su uglas davne 1977. godine trojica profesora na ve legendarnom MIT, Ronald L. Rivest, Adi Shamir i Leonard M. Adleman, i smislili algoritam, kojeg su bez lane skromnosti nazvali poetnim slovima svojih prezimena. Spomenuta trojka pokuala je smisliti odreenu klasu funkcija kojima je teko odrediti inverz, to im je u pravom smislu rijei uspjelo, i time su razrijeili navedeni kriptografski problem. Kriptirajua funkcija i dalje, kao bijekcija, odreuje svoj inverz, ali ga je jaaako teko nai. Kako? Profesori su se sjetili da je jedna od teoretski najlakih, ali praktiki najteih stvari u matematici - faktorizacija. Na faktorizaciji, i to brojeva, poiva RSA algoritam, kojeg u, da ne duljim, navesti: Uzmite dva velika (npr. 1024-bitna) prosta broja p i q. Odaberite broj e takav da su e i ( p - 1) ( q - 1) relativno prosti (nemaju zajednikih prostih faktora). Broj e ne mora biti prost, ali mora biti neparan, jer je ( p - 1) ( q - 1) paran. Odaberite d takav da je ( d e - 1) djeljiv s ( p - 1) ( q - 1) . Kriptirajua funkcija f je f( t ) = ( t e ) mod ( p q ) , za t prirodan broj. Dekriptirajua funkcija f -1 je f -1( c ) = ( c d ) mod ( p q ) , za c prirodan broj. Va javni klju je par ( p q , e). Va tajni klju je broj d. ak je i povrnim uvidom jasno da je za dani par ( p q , e) vrlo teko izraunati neki broj d. To je zato jer je prvo potrebno nai brojeve p i q, dakle, faktorizirati p q. Ukoliko su p i q 1024 - bitni, laganim raunom slijedi da bi najmonije raunalo dananjice trailo faktorizaciju 2048 - bitnog broja p q dulje od ivotnog vijeka Zemaljske kugle, a teorija jo uvijek ne nudi nita vie od Eratostenovog sita. Time je invertiranje kriptirajue funkcije praktiki onemogueno. Ma nemoj... E, sad dolazi do izraaja Tvoja kritinost, dragi itatelju ove stranice. Jesi li se zapitao, ne vuem li te moda za nos? Ukoliko nisi, zapitat u se ja: pa, kako je mogue odabrati sluajni 1024 - bitni prim broj, kad nemam formulu n - tog prim broja, ili bar kriterij? Mogu odabrati veliki sluajni broj, a kako li u ispitati je li prost? Moda mogu zarotiljat raunalo? Hej, pa onda sam na istom! Problem nalaenja 1024 - bitnog prostog broja nije nita laki nego spomenuta faktorizacija. Dapae, ti problemi su ekvivalentni. Nije li naa MIT profesorska trojka samo pretoila iz upljeg u prazno tj. svela problem na ekvivalentno praktiki nerjeiv? Tko je tu lud? Fermat Rivest : Ma moj! Pierre Fermat, francuski pravnik kojemu je struka dosadila pa se bavio matematikom, formulirao je 1640. godine tvrdnju, kasnije poznatu kao Mali Fermatov teorem: Neka je p prost broj i a prirodan broj koji nije djeljiv s p. Tada je broj a p - 1 - 1 djeljiv s p. Dokaz. Ovu injenicu iskoristio je ve spomenuti Ron Rivest da bi proveo istraivanje, iji rezultati su objavljeni u 'Advancess in Cryptology: Proceedings of Crypto '91' , pod naslovom koji govori bolje od iega o njegovom uspjehu. Naslov glasi: Finding Four Million Large Random Primes. Da ne duljim, ispitavi vie od 700,000,000 256-bitnih brojeva, empirijski je zakljuio da je vjerojatnost da 256-bitni broj p zadovoljava tvrdnju Malog Fermatovog teorema uz a = 2 , a da ujedno nije prost, manja od 10 -6 . Dakle, u praktine svrhe nalaenja velikih prostih brojeva (zapravo pseudoprostih, tj. takvih koji su vrlo vjerojatno prosti), dovoljan je Mali Fermatov teorem (kako male stvari ine ivot ljepim), ije vrijeme izvoenja je tako kratko, da ne stignete kako spada izgovoriti 'Fermat' . Prilino dobra privatnost Programski paket PGP (Pretty Good Privacy) najbolji je, najpoznatiji i najrasprostranjeniji soft za kriptiranje dekriptiranje danas. Tvorac PGP-a je Philip Zimmermann, ovjek koji je zbog svog ivotnog djela imao sijaset problema. PGP za generiranje kljueva koristi RSA algoritam, odnosno njegovu preinaku, koja je relativno bra, no, u osnovi, to je to. Zadnja inaica PGP-a nudi nekoliko stupnjeva zatite: niski, visoki i 'vojni'. Prvi koristi 512-bitni klju, drugi 768-bitni, a tzv. vojni stupanj, praktiki neunitiv 1024-bitni klju. Osim generiranja para kripto-kljueva i njihove uporabe, u PGP paketu naii ete na jo 800 raznih stvari. Kao prvo, velik broj hackera nadograuje i distribuira svoje inaice PGP-a, kao da 'slubenih' ve nema dvadesetak. Nadalje, sam paket sastoji se od gomile datoteka i jo vee gomile uputa i objanjenja, tako da Vam nee biti dosadno. Za generiranje velikih sluajnih brojeva ne koristi nikakav poznati generator (tko je to vidio; ionako niti jedan nije uniforman!), nego od Vas trai da lupate po tastaturi, mjerei vremena izmeu udaraca. Na kraju, paranoino e 'spaliti' kompletan sadraj koritenog stacka i RAM-a, da netko ne bi, kad se vi maknete s raunala, proitao Va tajni klju. PGP nudi jo jednu vrlo korisnu stvar: potpisivanje poslanih dokumenata poznatu kao PGP signature. Pretpostavimo da Marica oekuje od Ivice poruku. No, kad poruka stigne, kako ona moe biti sigurna da ju je poslao ba Ivica, a ne npr. tef, koji zna fake-ati mail? E pa zato e Ivica potpisati svoj dokument, i to na sljedei nain: svoje ime i prezime on e kriptirati pomou svog tajnog kljua. Kada Marica primi poruku, upotrijebit e Iviin javni klju, kojeg hvalabogu zna, za dekriptiranje potpisa. Ako se pojavi Iviino benigno ime, sve je OK, a ako dobije smee na ekranu, znai da joj je netko, tko ne zna Iviin tajni klju (dakle, nije Ivica), pokuao uvaliti. Kako je, zbog slanja elektronskom potom, kriptirane datoteke potrebno prevesti u ASCII, PGP moe posluiti i umjesto uuencode programa ili ekvivalenata. Traei Sveti Gral: Idemo svi! Oigledna je, dakle, vanost nalaenja prostih brojeva, ne samo u teoretske svrhe nego, kako smo vidjeli, i za budunost kriptografije. Tijekom povijesti, odreene klase brojeva bile su za neke ljude pravi fetii; sjetimo se samo Pitagorejske kole koja je odavanje tajne o postojanju korijena iz 2 kanjavala smru, ili slobodnih zidara razliitih stupnjeva, koji su napredovali upravo prouavajui omjere brojeva na elu sa Zlatnim rezom. Meu prostima, oigledno je najzanimljivija klasa Mersenneovih brojeva. To su prosti brojevi oblika 2 n -1 , a naziv su dobili po francuskom redovniku imena Marin Mersenne, koji je 1644. naveo (pogreno) prvih 11 brojeva reenog oblika. Danas je, ne biste vjerovali, organiziran pravi pokret za traenje i nalaenje Mersenneovih brojeva, koji je 13. studenog 1996. svijetu sveano objavio da je rekord u potrazi ponovo sruen: dokazano je (najobinijim dijeljenjem, naravno) da je 2 1398269 -1 najvei dosad poznati Mersenneov, a i prim broj uope. Ako vas, dakle, zanimaju prosti brojevi, posjetite The Prime Page , a ako nemate pametnijeg posla, The Great Internet Mersenne Prime Search i ukljuite se u potragu. Kako je u svaijem ivotu rezervirano bar 5 minuta slave, moda ete ba Vi, kao novi rekorder, upisati svoje ime u povijest matematike. Tajna veza Massachusetts Institute of Tecnology, kao ustanova na kojoj je RSA razvijen, vlasnik je patenta na RSA algoritam za podruje Sjedinjenih Drava i Kanade od rujna 1983. godine. No, kako ne postoje ekskluzivna prava na pamet, Phil Zimmermann je sjeo i 1991. napisao svoju implementaciju RSA algoritma - biblioteku potprograma MPILIB, koju su koristile prve inaice njegovog paketa PGP, duboko uvjeren kako 'snana' kriptografija mora postati sredstvo zatite graanskih sloboda i privatnosti pojedinca; u svijetu koji sve vie postaje globalno selo. Komercijalnu inaicu PGP-a prodaje Pretty Good Privacy Inc., a za nekomercijalnu, sam Zimmermann kae da je 'guerrilla freeware', i da eli to veu njegovu rasprostranjenost. MIT takoer distribuira svoju inaicu PGP-a, koja koristi RSAREF biblioteku potprograma za implementaciju RSA algoritma, razvijenu u tvrtki RSA Data Security Inc. No, unato tome to je paket MPILIB bri i uinkovitiji, RSADSInc. dobiva ekskluzivni patent na implementaciju RSA algoritma u Dravama, i tu poinju problemi: ba svaki Amerianin koji distribuira programsku podrku utemeljenu na RSA algoritmu mora koristiti RSAREF biblioteku, ime je, izmeu ostalih, i originalni MPILIB stavljen s one strane zakona. Nadalje, ITAR (International Traffic in Arms Regulations) zabranjuje slobodan izvoz kripto - tehnologije izvan podruja SAD i Kanade, smatrajui ju orujem par excellence. Dakle, za izvoz ak i ovako modificiranog PGP-a ili bilo kojeg drugog kriptopaketa izvan SAD, potrebno je zatraiti dozvolu jednog ureda U.S. State Departmenta, prijateljskog imena 'Office of Defense Trade Controls and Munitions Control', to dovoljno govori o pogledu amerike vlade na kriptozatitu. Ovih nekoliko pravnih akcija, zadralo je razvoj PGP-a i njegovo irenje izvan Sjeverne Amerike. Pa ipak, nepoznat netko imao je petlje i provercao PGP u inozemstvo, ime mu je omoguio ivot i razvoj u pealbi. Naime, ITAR dodue zabranjuje izvoz kripto - proizvoda, ali kad su oni jednom (nelegalno) izvezeni, tree osobe ih mogu potpuno legalno koristiti. tovie, kako RSAREF - monopol vai samo unutar amerikih granica, originalni MPILIB moe se ponovo slobodno upotrebljavati u inozemstvu. Sam Phil Zimmermann je zbog tog nelegalnog izvoza bio 1994. godine predmetom vrlo duge kriminalistike istrage, no kako njegova umijeanost nije dokazana, danas mu ne fali nita osim pozamane gomile dolara potroenih na odvjetnike. Pronaavi negdje provercani PGP, Norveanin Stale Schumacher potrudio se sklopiti meunarodnu inaicu PGP-a s ukljuenim MPILIB, koju danas razvija itav meunarodni tim strunjaka, voenih idejama Phila Zimmermanna (koji, naravno, nema s njima nikakve veze). Toj velikoj skupini moete se prikljuiti kontaktirajui Stalea . Meunarodni PGP je takoer freeware, dok se za komercijalnu uporabu, zbog koritenja nekakvog IDEA algoritma, treba platiti nekoliko dolara vicarskoj tvrtki Ascom Systec AG. Sve u svemu, situacija je ovakva: ako ste Amerianin, moete najnormalnije kupiti zadnju komercijalnu inaicu PGP 4.0 od PGP Inc. , ili u privatne svrhe koristiti nekomercijalni PGP 2.6.2, kojeg distribuira MIT . Oba (zbog RSADS Inc. patenta) koriste RSAREF biblioteku, i za ivu glavu ih nemojte izvoziti iz Sjeverne Amerike, jer e vam National Security Agency skoiti na kimu smatrajui Vas vercerom oruja. Izvoz ukljuuje i bilo kakav download sa raunala koja su fiziki u Americi. Ako, pak, ivite u zemljama koje potpuno zabranjuju snanu privatnu kriptozatitu, kao Irak, Iran, Francuska(!), Kina, Rusija, itd., uope ne smijete rabiti PGP ili ekvivalente. No, ako ste graanin ostatka slobodnog svijeta, slobodno se posluite meunarodnom PGP 2.6.3i inaicom, koju moete legalno skinuti s International PGP Home Page , pri emu morate imati na umu da je zbog koritenja MPILIB, a ne RSAREF biblioteke, PGP 2.6.3i ilegalan u Sjevernoj Americi, pa ga kao takvog tamo ne smijete uvoziti, to ukljuuje i bilo kakav upload na raunala koja su fiziki u SAD ili Kanadi. Najvea ironija ove pravne zbrke je to da se zabrane uvoza i izvoza, amo i tamo, odnose samo na implementacije RSA algoritma u nekom programskom kodu, a ne i na sam matematiki opis algoritma, koji je kao takav i naveden na ovoj stranici. (Zamislite da Vam Njemaka i Engleska pokuaju zabraniti poduavanje Eskima infinitezimalnom raunu.) Zar i ti, oe Julije Povijest biljei da je Julius Caesar, ratujui u Galiji, smislio jednostavan nain kriptiranja pomou kojeg je komunicirao sa svojim vojskovoama. Na nepomini dio sprave sline analognom logaritamskom raunalu, napisao je latinsku abecedu, dva puta u uzastopnom poretku, a na njezin pomini dio cijelu abecedu jedanput. Odabravi jedno slovo s nepominog dijela (klju!), ispod njega je namjestio slovo 'A' tj. poetak pominog dijela, i time definirao bijekciju s abecede na abecedu. Uz klju 'B', njegovo ime je glasilo: Kvmjvt Dbftbs. U kasnijim stoljeima, kriptografija se nije maknula daleko od toga. Kao i u Cezarovom sluaju, najsnanije poticaje razvoju ove discipline davali su ratovi. U prvom svjetskom ratu, 1917., britanci su uhvatili i deifrirali njemaki kablogram Meksiku, u kojem carski ministar vanjskih poslova Arthur Zimmermann nudi Meksiku povrat Teksasa, Novog Meksika i Arizone, ukoliko objavi rat Sjedinjenim Dravama (ti Zimmermanni ba nemaju sree). Jedan od najutjecajnijih kriptoanalitikih radova, objavio je 1918. William Friedman pod naslovom 'The Index of Coincidence and its Applications in Cryptography', a iste godine Edward Hebern patentirao je svoj rotor - stroj (rotor machine), ureaj koji je inio osnovu vojne kriptografije u itavom svijetu u buduih 50 godina. U drugom svjetskom ratu, Ameriani su svoj rotor zvali 'SIGABA', Britanci 'Type X', a Nijemci 'Enigma'. Na Atlantiku, prekretnica u korist Saveznika zbila se kad je britanski matematiar Alan Turing (pomou svog, istoimenog, stroja) razbio 'Enigmin' kriptosustav. Takoer, i amerika pobjeda na Midway-u 1942., koja je predstavljala prekretnicu na Pacifiku, svoju zahvalnost duguje razbijanju japanskih ifri. Kako je silama pobjednicama postala oita vanost kriptografije, u doba hladnog rata ona prelazi iskljuivo u obavjetajnu i vojnu domenu: iduih 20 godina javnost o kriptografiji nee uti ni slova. Iznimku je inio rad Claude Shannon-a 'The Communication Theory of Secrecy Systems', objavljen 1949., koji je grekom izuzet od zabrane. Vaan dogaaj zbio se 1967., kad David Kahn objavljuje svoje djelo 'The Codebreakers', koje ne sadri nove tehnike zamisli, ali donosi potpun pregled povijesti kriptografije. Ono je za posljedicu imalo izuzetno velik porast interesa za ovo podruje: objavljuju se novi radovi, odravaju savjetovanja... Kriptografija je ula u svijest iroke javnosti. Kao rezultat takvog poleta, Whitfield Diffie i Martin Hellman sa Stanfordskog sveuilita, objavljuju 1976. svoj rad 'New Directions in Cryptography', u kojem predlau kriptosustav s javnim i tajnim kljuem. Taj novi koncept revolucionirao je dotadanja rjeenja i godinu dana kasnije doveo do RSA algoritma. Prirodno je da velesile razvijaju u tajnosti svoje kriptosustave i, istodobno, pokuavaju razbiti tue. No, s druge strane, ovjeanstvo je nekoliko puta u XX stoljeu bilo svjedokom opasnosti kojih nosi bilo kakva Orwellovska koncepcija dravnog ustroja. Na kraju milenija, kad su, bar deklarativno, postavljeni vrlo visoki standardi u zatiti ljudskih i graanskih prava, mogunost privatnog koritenja snanih kriptosustava jedini je jamac njihove provedbe bar u jednom, malom dijelu. Napomena: Namjera ove stranice je pruiti osnovnu informaciju o dananjem stanju u kriptografiji, o PGP programskoj podrci i RSA algoritmu, s posebnim osvrtom na njihove matematike temelje te pravnu situaciju oko njih. Sve to ovdje pie, moe se nai na mrei, pretraivanjem Yahoo! -a ili bilo koje druge WWW baze po kljunoj rijei PGP. Sve primjedbe na ovu stranicu, poaljite njenom autoru . Preporuljiva razluivost 800x600 i nekakav Central European font. Zadnja promjena: 05.04.1997.
Crypto Museum
Photos, manuals, and other information about the German Enigma, the M-209, and other old encryption machines.
ilord.com: Bob Lord's Home Page Bob's Home Crypto Machines Enigma Enigma Lamps M-209 Swiss NEMA M-94 Larrabee Cipher Crypto Documents Enigma Bletchley Park decrypts TM 11-484 (Elementary Cryptography) TM 11-485 (Advanced Cryptography) TM 11-469 (Communication Security) M-209 (TM 11-380) M-209 Training Film NEMA (scans) NEMA (English) NEMA (French) M-210 Message Book Field Manual 24-5 Press Propaganda Life Magazine Stetson ad War Posters NSA Awareness Misc Tracy's Jewelry Store Penn and Teller Bullet Trick Web Links Resume Contact Bob Lord's Home Page PLEASE NOTE: This browser window is 0 pixels wide. For the best experience with this web site, I recommend that you resize this window to be at least 850 pixels wide. Welcome to my online crypto museum! Here you will find some information about items in my collection, including manuals, posters, and machines (including an Enigma machine). I hope you enjoy your visit. Please don't hesitate to contact me by clicking the "contact" link on the navigation bar to the left. I would enjoy hearing from you. I try to put as many original source materials online as I can. I have posted some manuals here, some of my favorite propaganda, magazine articles, and even a training video for the M-209 encryption machine. I'll keep working to expand my collection and will post as much as I can. As I tried to learn more about these crypto machines on the web, I found that there were very few hi-resolution images for me to study. Part of my goal for this site is to provide such images. As a result, this site can be very bandwidth heavy. I'll continue to work to make the initial page loads faster for those of you on modems, time permitting. Also, if you have ideas for the site, or if you'd like me to post photographs of a specific item, please feel free to contact me. Note about linking to my site: I would be honored to have you link to my site, but please be aware that I continue to make changes to the structure of the site. The image or page you see here today may not be there tomorrow. I would encourage you to link to my top level page (http: www.ilord.com) to be safe. Wanted: An original Enigma external rotor case. Here are some examples: Seven rotor storage box: closed , and open Two rotor storage box open , closed front , closed back If you have such a case for sale, please contact me ! I make an effort to make sure these pages work on Microsoft's IE browser and Apple's Safari browser. Having said that my primary browser is Mozilla's Firefox on Windows, my Macintosh, and my Red Hat Linux machine. Firefox is fast, small, feature rich, and perhaps most importantly, it's more secure than IE. See for yourself what you've been missing by clicking on the link below. Be sure to check out the features like tabbed browsing, searching within a web page, and pop-up blocking. Enjoy! Copyright 1998-2005 Bob Lord
German ENIGMA Cipher Machine - History of Solving
Describes the efforts of Polish, France and Great Britain in deciphering the Enigma Machine's code from 1932 to 1945. [English, Polish]
The German Enigma Cipher Machine - History of Solving Main Contents HistoryofSolving Timetable Polish Cryptographers Links Cryptography Resources Literature Enigma Pictures Enigma Simulators Enigma F.A.Q. Movies and Books Reviews "U-571" Movie Review "Enigma" Movie Review Books Reviews Buy the Books and SAVE! Largest Books Selection! School Project Resources K-6 6-12 Comments Send your Comments! Read the Comments Email ENIGMA Machine broken in December of 1932. In the winter of 1932, Marian Rejewski, a twenty-seven-year-old Cryptoanalyst working in the Cipher Bureau of the Polish Intelligence Service in Warsaw, Poland mathematically determined the wiring of the Enigma's first rotor. Since 1933 Poland was able to read thousands of German messages encrypted by the Enigma Machine. The gift of Enigma replicas from Poland, a loyal ally, saved millions of lives during the War. July 24, 1939 is the day to be remembered forever. Cryptoanalysts and heads of the Intelligence Services from France and Great Britain arrived in Pyry, near Warsaw, to receive the Enigma replicas along with all the cryptoanalyst information Poland gathered. Without that, it would take an extra 2 to 3 years to break the Enigma Code. By then, Hitler would be in London. And New York. Marian Rejewski and the Polish Team of Codebreakers again the first to crack the Enigma Cipher, this time during the War! Soon after the War broke out, on October 20 the Polish Team of 15 Cryptographers restarted work on the Enigma Machine in the Chateau de Vignolles, 25 miles northwest of Paris, France in the secret unit named "Bruno". Do you know... ... The names of the Polish Cryptographers, Officers and Engineers working on the Enigma? ... How many Enigma machines were produced? ...How long would it take to try all the Enigma permutations? Marian Rejewski, the Polish Mathematician who solved the Enigma Cipher Machine Why does the new British movie ENIGMA have no historical value whatsoever? New movie produced in UK ( Enigma ) presents a real threat to historical accuracy and common sense, picturing a fictitious Polish Officer collaborating with the Nazis. Why are some Brits still biased against Poles? Try the real Enigma Machine at the National Security Agency The National Security Agency Museum in Fort George Meade, Maryland has a real WW2 Enigma Cipher Machine on display in a special Enigma Exhibit. You can come in to the NSA (yes, you can go to the NSA... I mean the NSA Museum) and try to code and decode the messages on real Enigma Machine. History of Solving | Chronology | Resources | Links | News Enigma Pictures | School Projects | Your Bookstore | Read the Comments | Contact | Text only POLISH VERSION - po polsku Copyright (c) 1996-2001 Lech Maziakowski
A Cryptographic Compendium
Discusses the types of cipher systems that have been used in the past. Page includes illustrations and tables. Written by John Savard.
A Cryptographic Compendium [ Up ] A Cryptographic Compendium Contents Introduction Paper and Pencil Systems Cryptanalyzing the Simple Substitution Cipher Methods of Transposition Improving Substitution Homophones and Nomenclators Polygraphic Ciphers and Fractionation Playfair and its Relatives The Bifid, the Trifid, and the Straddling Checkerboard Fractionated Morse, and Other Oddities The VIC Cipher Two Trigraphic Ciphers, and a Heptagraphic One Polyalphabetic Substitution Code Books Fun With Playing Cards Conclusions Electrical and Mechanical Cipher Machines Early Machine Ciphers The Bazeries Cylinder The Kryha Cryptograph The Hill Cipher The RED Machine The Reihenschieber The A-22 Cryptograph The Hagelin lug and pin machines Simple Cryptanalysis of the Basic Lug and Pin Machine Rotor Machines - and their PURPLE cousins Rotor Machine Basics The Interval Method Isomorphs PURPLE, CORAL, and JADE The Enigma: a unique rotor machine Basic Principles of the Enigma The Uhr Box The Enigma A and Enigma B Relatives of the Enigma Cryptanalysis of the Enigma Cliques on the Rods Indicators and Jefferys Sheets The Bombe and the Diagonal Board An American Achievement: SIGABA, the ultimate rotor machine Miscellaneous Machine Ciphers The Hagelin B-211 Sweden's HC-9 LACIDA Conclusions for Chapter II Fantastic Rotor Machines Child's Play Irregular Rotor Movement Telecipher Machines The Lorenz Schlusselzusatz The Siemens Geheimschreiber T-52 The Swedish SA-1 An American patent Converter M-228 Conclusions for Chapter III The Computer Era LUCIFER The Data Encryption Standard Details of DES Variations of DES Other Block Ciphers And Now For Something Completely Different: SAFER Something Not Quite As Different: IDEA Formerly Secret: SKIPJACK Blowfish ICE The Johnson Algorithm 3-Way MISTY Towards the 128-bit era: AES Candidates The Advanced Encryption Standard (Rijndael) Twofish (finalist) SERPENT (finalist) RC6 (finalist) DEAL MARS (finalist) SAFER+ FROG LOKI-97 CAST-256 Magenta DFC Cryptanalytic Methods for Modern Ciphers Differential and Linear Cryptanalysis Extensions of Differential Cryptanalysis The Boomerang Attack Questions of S-Box Design Quadratic Cryptanalysis Cryptanalysis, Almost by Aimlessly Thrashing About Hidden Markov Methods Block Cipher Modes Basic Block Cipher Modes Enlarging the Key or the Block Protecting Message Integrity Is Integrity-Aware Encryption Difficult? Decorrelated Accumulating Counter Mode Double Counter Double Checksum Mode My Own Humble Contribution: QUADIBLOC Description of QUADIBLOC Euler's Constant and the QUADIBLOC S-boxes Variants with different key sizes The QUADIBLOC FAQ Key Augmentation Quadibloc II Quadibloc III Quadibloc IV Quadibloc V Quadibloc VI Quadibloc S Quadibloc VII Quadibloc VIII The Standard Rounds The Mixing and Whitening Phase The Key Schedule The Rationale of the Design Quadibloc IX Quadibloc X Quadibloc XI Quadibloc XII Quadibloc 2002 Quadibloc 2002A Quadibloc 2002B Quadibloc 2002C Quadibloc 2002D Quadibloc 2002E The Standard Rounds Core Rounds: The Left Half of the Block Core Rounds: The f-function Core Rounds: The Combiner Cipher Overview Key Schedule and Deciphering Variants Quadibloc 2002E DC and SR Quadibloc 2002E W, WS, WD, and SD Quadibloc 2002E U and WU Quadibloc 2002E RA, RC, and RR Quadibloc 2002E ES, RE, RS, RO and WR Quadibloc 2002EA Quadibloc XIX Quadibloc 20 Quadibloc 21 Quadibloc 22 Quadibloc 23 Quadibloc 24 Quadibloc 25 Stream Ciphers Shift-Register Stream Ciphers An Illustrative Example Other Constructions More Realistic Examples The Mersenne Twister Other Stream Ciphers Panama A Note on the Importance of Galois Fields Conclusions for Chapter IV Modified Panama Mishmash Combining Two Unrelated Block Ciphers A Base-Conversion Block Cipher and Other Concepts The Large-Key Brainstorm The Inner Structure of the Feistel Round Public-Key Cryptography Modulus Arithmetic The Rivest-Shamir-Adleman (RSA) method Looking for Primes Finding d from e Large Number Exponentiation Factoring The Diffie-Hellman method El Gamal Digital Signatures Based on Diffie-Hellman Other Methods The Uses of Public-key Cryptography Conclusions for Chapter V Miscellaneous Topics Data Compression The Representation of Speech Semi-Arithmetic Coding Character Codes A Character Code for Gdel-Numbering UTF-8 Extending ITA 2 Error-Correcting Codes Armor, Message Termination, and Base Conversion From 47 bits to 10 letters Armor-Related Fractionation Tying up Loose Ends From 93 bits to 28 digits Keystream Base Conversion Message Blocking Optimized Morse Armor From 45 bits to a Permutation of 16 Items Encrypting the Length of a Message Steganography One-way Hash Functions Description of SHA Hardware Security When Somebody's Looking Over Your Shoulder Key Management The IBM Key Management Scheme for DES Kerberos Protocols and Privacy Amplification Passwords and Protocols Military Key Management Red Thread Resistance Key Escrow Pass Phrases and Randomness The Interlock Protocol Key Distribution Quantum Mechanics and Cryptography Quantum Computing Quantum Cryptography Cryptanalysis The Limits of Cryptanalysis The Nature of Cryptanalysis Security Without Proof The Ideal Cipher Cryptography for Content Protection Fallacies of Cryptography and Compression The Politics of Cryptography Conclusions for Chapter VI Return to Home Page Copyright (c) 1998, 1999 John J. G. Savard [ Up ]
Enigma Cipher Machine by Tony Sale
Explains how the device enciphers letters, background history, components of the machine, and military adaptation by the Germans. Also, includes information about Turing and Polish mathematicians contribution in breaking the code.
The Enigma cipher machine The Enigma cipher machine Tony Sale's Codes and Ciphers The Enigma cipher machine These pages give an introduction to substitution ciphers and then go on to explain exactly how the Enigma machine worked and how it was used. At present the pages are as follows: 1. Substitution ciphers and the principle of the Enigma with a detailed example illustrating how the Enigma enciphers letters. 2. The components of the Enigma machine and its military adaptation with a further page specifying the exact rotor wirings and the reflectors of the Enigma. 3. The military use of the Enigma and the problem facing those trying to break it. This page also allows you to go to Tony Sale's on-line Enigma simulator and to try it out on a message used in the film Enigma. Now you can find out more about Enigma: 4. How the Polish Mathematicians Broke Enigma. 5. Alan Turing, the Enigma and the Bombe. 6. Explore the Breaking of German Naval Enigma. You might like to visit this History of UK code breaking and the birth of modern Signals Intelligence, (SIGINT). To begin the tour, please continue to Page 1. This page is created by Tony Sale ( tsale@qufaro.demon.co.uk ) the original curator of the Bletchley Park Museum Technical assistance from Andrew Hodges
Andy's Enigmatic Web Page
Download an Enigma emulator for Windows
Andy's ENIGMATIC Web Page ENIGMA 2.0 A Windows-based emulator of the 3 rotor service machine. Chances are you already know all about these fascinating machines otherwise it's unlikely you'd be visiting this site. I'm therefore going to save time (and web space) by not going into the history and details of the machine. There are so many excellent web pages already devoted to the subject I feel that I certainly have nothing new to offer. However, I would like to point you to some of my personal favourites by drawing your attention to the links section at the bottom of the page. Below are the details of my program ENIGMA 2.0 for WINDOWS which emulates the 3 rotor service machine. The program is available for download here . I've tried to make the program as intuitive as possible but here are some instructions should you need them. Click on the SET ROTORS button. You will see combo boxes appear. The top row will let you select which particular ROTORS to use in each position (e.g. I, II, III etc.) The Second row of combo boxes are the RING SETTINGS Ringstellung for each rotor. You will also note that you can select which REFLECTOR to use, either B, or C. The reflector selected is indicated to the left of the leftmost rotor window. Once you've set these, click "DONE" and the rotor's will be set. Lastly, set your rotor start positions. Note: The completed rotor settings (including the plugboard settings) can be saved to, and loaded from disk. The addition of the Plugboard, or Stecker Board to the ENIGMA machine greatly increased the number of possible key combinations which could be used. The ENIGMA for Windows program supports this modification. It is extremely simple to use. Setting the PLUGBOARD. The plugboard is accessed by clicking on the SET PLUGBOARD button on the main ENIGMA screen. To create a letter diversion simply click on the letter you wish to divert, it will change colour. Now click on the letter you wish to divert it to. The pair will become connected by a coloured line. Repeat this process to create as many pairings as you require (obviously up to a maximum of 13!) Note that the usual practice was for between 7 and 10 pairs. The remaining letters would be left unpaired, or Self-Steckered. Click on DONE when finished. Notice that the stecker diversions can be seen on the status bar at the bottom of the main Enigma screen. The ENIGMA is now set up, so you can begin typing your message. Use your mouse to operate the ENIGMA keyboard, you will see the rotors step and the encrypted letter illuminate on the lampboard. However, if you have a large amount of typing, then follow the instructions below on how to use the COMPILER. The COMPILER (for want of a better name!) makes using the program a little easier, especially if you've a large amount of text to work with. To access the compiler click on the COMPILER button on the main Enigma screen. Type or paste text into the top (SOURCE) box. Make sure you have set the required rotor and plug settings. Click on the TRANSCRIBE button located on the main Enigma screen. Encrypted Decrypted text appears in the bottom (OUTPUT) box. Note: Speed of Transcription depends on the message length and the speed of your system. Text from either box can be cut or copied to the windows clipboard. When pasting in plain text from another source be aware that the ENIGMA program will ignore any non-alphabetical characters. For instance, if I have the following on the clipboard: My favourite number is "69" What's yours? On pasting into the compiler I would get: MYFAV OURIT ENUMB ERISW HATSY OURS Where numbers and punctuation have been thrown out. Text in the SOURCE and OUTPUT can also be saved to disk. Text in the top box gets the default file extension (*.ETX), while OUTPUT text gets the extension (*.CYP) This is arbitrary, the file formats are exactly the same. Text loaded from file or pasted will always appear in the top box. Other Additions: Notice on the menu of the COMPILER screen the options TEXT and VIEW. Click the TEXT option and you will get the following option: Spacebar Gives "X" By checking this option, when (and ONLY when!!!) you are typing text straight into the compiler source box, pressing the space bar will generate an X which can be used as a word separator. A similar function exists on the EDIT...PASTE INCL X FOR SPACES option. This function parses any text which is being pasted in from the clipboard and inserts an "X" where a space had occured. This can be useful when using the CYPHERVIEWER. Choosing VIEW... CYPHERVIEWER reveals the Cypherviewer screen. The CYPHERVIEWER will parse any text pasted into its text box and remove ALL X's, replacing them instead with a space. This is really only useful if you've used any of the above options. But remember it removes ALL X's, so any words containing it will also be split! Download Enigma 2.0 for Windows The program runs under Windows 3.1x or 95 You can download ENIGMA 2.0 FOR WINDOWS (ZIPPED - 37K) from Here. IMPORTANT! You will also need the following files in your Windows\System Directory: VB40016.dll, OC25.dll, Threed16.ocx, Comdlg16.ocx. This Zipped file (820K) contains all four. Note: I have kept the system files separate from the Enigma.Zip file in order to save you possible download time. There is a possiblilty you may already have them on your machine (search your Windows \ System Directory) As promised, a small sprinkling of ENIGMA related links.. The Bletchley Park Home Page. Bletchley was the wartime headquarers of the Government Code Cypher School. This is the official Home Page of the Bletchley Park trust. The Academic Bletchley Park Home Page. This was the first BP home page. It is now the Academic page - hosted by Cranfield University. The Alan Turing Home Page This Page is maintained by Andrew Hodges, author of "Alan Turing: The Enigma" It details the life of this extraordinary genius. Based at Bletchley, Turing was the inventor of the "Turing Bombe" an electro-mechanical device which was used to find ENIGMA settings. Nautical Brass Some brilliant articles on ENIGMA, a definite must for "Enigmaphiles." Andy Carlson's ENIGMA APPLET This JAVA applet runs straight from your browser. There is also an excellent page on ENIGMA. Frode's Cryptology Page. Includes interesting articles on cryptology. Cryptologia A quarterly journal devoted to all aspects of cryptology. There are often articles relating to ENIGMA, and many back issues are still available. And while you're at it, why not have a look at how the film is progressing: You are visitor number: I would like to thank you from the deepest recesses of my bowels for visitng my humble page. Any comments (especially nice ones) can be emailed to me at the following address: andlaw@globalnet.co.uk (c)Andy Lauwers 1998, 1999, 2000 XLKSE LWXVQ ZBZSF
The TwinTrees Enigma Machine
Enigma emulator for RISC OS
Twintrees Thank you! for visiting the Twintrees Enigma Machine. This has now been shut down. For a better service try http: www.ugrad.cs.jhu.edu ~russell classes enigma twintrees.demon.co.uk has now been superceeded by Threetrees Designs at http: go.to threetrees which contains far more information and includes all the origninal data from the original twintrees site.
Bletchley Park
Museum at the site of the World War II codebreaking center, including a project to rebuild Colossus, the all valve computer used to break the ciphers of German High Command. Britain's best kept secret. WW2 Deciphering location, offering historical tours.
Cranfield University Search Cranfield Home Page Bletchley Park Academic Website, now called Codes and Ciphers in the Second World War, has moved to http: www.codesandciphers.org.uk The computer museum at Bletchley Park is at www.retrobeep.com The Bletchley Park Trust website is at www.bletchleypark.org.uk Published by Cranfield Computer Centre Cranfield University
USS Pampanito - ECM Mark II
What was the ECM Mk II and why was it important.
USS Pampanito - ECM Mark II Electronic Cipher Machine (ECM) Mark II By Rich Pekelney Click on this small photograph to view an ECM Mark II model, CSP 889 2900 (128K image) WHAT IS THE ECM MARK II AND WHY IT WAS IMPORTANT: The ECM Mark II (also known in the Navy as CSP-888 889 or SIGABA by the Army) is a cipher machine. It was used aboard USS Pampanito to encipher messages from ordinary, or what cryptologist (people who study secret communications) call plain text, into secret language, which is called cipher text, under the control of a key (encipherment). A cryptographic system consists of the combination of cipher machine, operating procedures and management of keys. If the system is well designed and implemented correctly, cipher text can only be converted back to plain text (deciphered) by someone with all three elements of the system. In early September 1944 U.S.Fleet Radio Unit Pacific (FRUPAC) in Hawaii recorded a Japanese cipher radio message that originated from Singapore. Unknown to the Japanese, U.S. forces had analyzed many Japanese messages and as a result of much brilliant and hard work were able to reproduce their enemy's inadequately designed and implemented cryptographic system. This is called cryptanalysis or "breaking the system". FRUPAC deciphered (and decoded) the message that announced the route of an important Japanese convoy from Singapore to Japan. The timing and expected path of the convoy from the message was enciphered on an ECM in Hawaii and sent to Pampanito where it was deciphered on an ECM. Although Pampanito's crew did not know how FRUPAC got its information, they were able to go directly to the convoy's path and attack with great efficiency. Pampanito's attack was kept secret by the superior U.S. cryptographic system that revolved around the ECM Mark II. The ECM Mark II based cryptographic system is not known to have ever been broken by an enemy and was secure throughout WW II. The system was retired by the U.S. Navy in 1959 because it was too slow to meet the demands of modern naval communications. Axis powers (primarily Germany) did however periodically break the lower grade systems used by Allied forces. Early in the war (notably during the convoy battle of the Atlantic and the North Africa campaign) the breaking of Allied systems contributed to Axis success. In contrast, the Allies were able to break Axis communications for most of the war supplying many of the targets attacked by Pampanito. Intercepted messages provided not only the location of potential targets, but often insight into the thinking of enemy commanders. In the Pacific, this information was critical to success in the battles of Midway and the Coral Sea in 1942. However, intelligence, including cryptanalysis, can be a double-edged sword. The intercepted message that directed Pampanito to attack the convoy during September 1944 did not indicate that 2000 Australian and British P.O.W.s were aboard the Japanese ships. The full story of this attack and Pampanito's rescue of 73 P.O.W.s is in the Third War Patrol Report . The combination of secure U.S. cryptographic systems and vulnerable Axis systems directly contributed the success of the Allied powers during WW II thereby shortening the war by years and saving countless human lives. More Information On The ECM Mark II: The ECM Mark II's Development Where Is The ECM Mark II Today What Cipher Equipment Was Aboard Pampanito During WW II Details Of The ECM Mark II Cipher Unit Keying (Operating) The ECM Mark II Compliance With Operating Procedures Some ECM Mark II Specifications ECM Mark II Computer Simulation References Additional Reading THE ECM MARK II'S DEVELOPMENT: The ECM Mark II's critical cryptographic innovation (the Stepping Maze) over Hebern's and other precursors was created by Army cryptologists Frank B. Rowlett and William F. Friedman shortly before 15 Jun 1935. During October and November of 1935 Friedman disclosed the details of the "Stepping Maze" to the Navy's cryptologists including Lt. Joseph N. Wenger. Aside from filing secret patent application 70,412 on 23 Mar 1936 little additional development was performed by either the Army or Navy until Lt. Wenger discussed the patent with Cmdr. Laurence Safford during the winter of 1936-37. Cmdr. Safford recognized the potential of the invention and the Navy began sponsoring and financing a new machine including the "Stepping Maze". Additional innovations by Cmdr. Safford, Cmdr. Seiler and the Teletype Corporation including Mr. Reiber and Mr. Zenner added to the security, reliability and manufacturability of the ECM Mark II. Prototypes were soon delivered, and in February 1940 the machine's details were disclosed to the Army. Amazing as it may seem, the Navy had kept its continuing development of the machine secret from the Army. With minor changes suggested by the Army the machine was accepted as the primary cipher machine for use by both Army and Navy. The joint Army-Navy ECM Mark II cryptographic system became effective on 1 Aug 1941, and the two services had the common high-security cryptographic system in place and in use prior to the attack on Pearl Harbor. The use of a common system was of great military value, particularly during the early stages of the war when the distribution of machines and codewheels was incomplete. By 1943, over 10,000 machines were in use. The "Stepping Maze" and use of electronic control were a generation ahead of the systems employed by other countries before and after WW II. No other country is known to have ever broken the ECM Mark II cryptographic system. WHERE IS THE ECM MARK II TODAY: After newer, faster cryptographic systems replaced the ECM Mark II the machines were systematically destroyed to protect the secrets of their design. Today only a few ECMs still exist. The National Cryptologic Museum (a part of the National Security Agency) has 3 machines (they may have more in storage), one of which is on display in their Fort George Meade, MD museum and the other is on display at the Smithsonian Museum of American History. The U.S. Naval Security Group has 2 machines. One is on display in Pensocola, FL. When contacted US Army historians did not believe they had any machines. From July of 1996 until November of 2004 one of the NSG machines was on loan aboard Pampanito. After cleaning, lubrication and minor repair it was put on display. At the time it was returned to the Navy, it was the only fully operable ECM Mark II in existence. This machine was built in June of 1943 as a CSP-889, and sometime ca. 1950 it was modified into a CSP-889-2900. The minor modifications added one switch and a knob that allow operation compatible with CSP-889 machines, or enhanced security when operated as a CSP-2900. After reading the information about ECM Mark IIs on this page, those seeking to know even more about the CSP-2900 that was displayed onboard Pampanito can read the ECM Mark II Curatorial Report . Cryptologic history researchers can operate an ECM Mark II Computer Program . This program and its JAVA language source code are provided for the benefit of researchers, it is not recommended that this algorthm be used for modern cryptography. Pampanito is seeking the other cryptosystems that were used during the war. The Pampanito Wish List contains a list of equipment we are seeking. WHAT CIPHER EQUIPMENT WAS ABOARD PAMPANITO DURING 1944: Just before leaving on each war patrol, one officer and one enlisted man armed with a machine gun would draw the cipher equipment from its secure storage. There were two lists of cipher equipment and manuals, List A included an ECM Mark II and associated documents (Channel 105), List B did not include the ECM. For most patrols List A was used, if the patrol was particularly dangerous and in shallow waters List B was used. The CSP-1500 (Channel 110) would also be added as needed to either the List A or List B. The lists below was used by submarines in the Pacific during 1944. A Channel is the combination of all the equipment, instructions, key lists, etc. that are needed for two parties to communicate in a cipher system. Channel 105 CSP-888 889 = ECM Mark II = M-134-C = SIGABA. This was a high grade, electro-mechanical, rotor wheel cipher machine and the physical component of the primary cryptographic system used by the United States. High grade cryptographic systems are those that you believe cannot be broken by an enemy in a useful period of time even if they are in possession of the physical elements of the system, provided the other elements of the system are preserved (i.e. keys are kept secret, operating procedures are well designed and followed, number and size of messages per key are small, etc.) The first 651 units built were the CSP-888 model that lacked plugs necessary for tandem operation, but were otherwise identical to the later CSP-889 model. CSP-890 = CSP-890(A) = SIGHEK Plugboard rotor for use in the CSP-888 889. CSP-1100 ECM Instructions CSP-1122 ECM Wheels CSP-1190 ECM Key Lists. CSP-1941 = SIGLUR-1 Instructions for CSP-890 ENG-108 Print unit for a CSP-889. ENG-109 ECM spare parts kit. Metal Safe Locker Type 8 - Special safe built into the radio room for CSP-889 Channel 108 CSP-845 = M138A = CSP-1088. This was a medium grade, paper strip cryptographic system that was used by U.S. Submarines when they were on such dangerous missions that they could not risk the capture of an ECM, or if the ECM broke down. It was also used to communicate with forces that did not have an ECM. Medium grade cryptographic systems can be read by an enemy in possession of the physical elements of the system, even if the other elements of the system are preserved. Details of CSP-845 . The related CSP-488 system was used until mid 1943 by Naval forces and is also described. CSP-847 Instructions for use of CSP-845 strip cipher. CSP-1247 8 Key lists for use with strip cipher. Channel 135 CSP-1403 4 Key lists. We have not identified these yet. Channel 143 CSP-1286 Two card style authentication cipher. Details of CSP-1286 . CSP-1521 Authentication Instructions. Channel 144 CSP-1270 = SIGMEN = SIGYAP Chart style authentication cipher. Details of CSP-1270 . CSP-1272 Instructions for CSP-1270. Channel 171 CSP-1524 Call sign instructions. CSP-1525 26 Emergency use call sign instructions. CSP-1750 = Call device MK 2 Call sign cipher. Details of CSP-1750 . CSP-1751 are CSP-1750 instructions. CSP-1756 Strip cipher compatable with CSP-1750. Made of mahogony. CSP-1757 ?? CSP-1752 Key lists. Channel Weather CSP-1300 Weather cipher. CSP-Weather Handbook for Submarines. Channel 110 CSP-1500 = M-209 = C-38. This is a low grade, Hagelin derivative, mechanical cryptographic system. Over 140,000 of these were used by Allied forces during the war and they were regularly broken by the enemy, primarily when the instructions for use were not followed. Pampanito would have used this to communicate with forces that did not have an ECM. Low grade cryptographic systems can be broken by an enemy by purely cryptoanalytical means without possession of any parts of the system. Details of CSP-1500 . Note that CSP stands for Code and Signal Publication, its usage started during WW I. We would appreciate your help in gathering information on any of the systems that are not well described here. Researchers may find our list of cryptographic designators useful. DETAILS OF THE ECM MARK II CIPHER UNIT: Prior to the ECM Mark II many cipher machines incorporated encipherment by means of an electric current passing through a series of cipher wheels or rotors. A character is typed on a keyboard, passed through the rotors and either printed or displayed in a light board for the operator. The rotors are thin disks with contacts on each side that are wired at random to the other side one wire per contact. Typically a rotor will have 26 contacts on each side, each contact representing a letter of the alphabet. A current passing through the rotor disk might enter in the position of letter B and exit in the position of letter G. Encipherment occurs by passing the current through several rotors that are side by side and rotating one or more of the rotors between each character enciphered. If the deciphering machine starts with rotors of the same design and in the same positions as the enciphering machine, it will repeat the motion of the rotors thereby deciphering the text. The most important difference between previous machines and the ECM is how the enciphering rotors are stepped. The "Stepping Maze" uses rotors in cascade formation to produce a more random stepping of the cipher rotors than existed on previous electromechanical cipher machines. The rotor on left is a Cipher or Control rotor, on right an Index rotor. The ECM has fifteen rotors arranged in three rotor banks. The five rotors in the rear are the cipher rotors that convert a plain-text letter into a cipher-text letter as they are irregularly stepped. Electrical currents passing first through the control (middle) rotor bank and then through the index (front) rotor bank determine which cipher rotor(s) step. The center three of five control rotors step in a metered fashion. Control rotor 3 is the fast rotor and steps once for each character typed. Control rotor 4 is the medium rotor and steps once each time control rotor 3 completes a full rotation. Control rotor 2 is the slow rotor and steps once each time control rotor 4 completes a full rotation. Control rotors 1 and 5 do not step. The index rotors are positioned once each day and do not move while operating. The 10 cipher and control rotors are large 26 contact rotors that may be used interchangeably in the cipher or control bank and are reversible. The five smaller, 10 contact, index rotors are only used in the index bank. Four contacts are energized on the first rotor of the control rotor bank. The connections between the last rotor of the 26 contact control bank and the first rotor of the 10 contact index bank are in 9 groups of between 1 and 6 wire(s) each. One of the index bank contacts is not used. The 10 outputs of the last index rotor are attached in pairs to 5 magnets that step cipher rotors when energized. Between 1 and 4 cipher rotors are stepped for each character enchiphered. Click on this small photograph to view an ECM Rotor Cage (128K image) To properly encipher a message, the three banks of rotors must be arranged and aligned in such a way that they can be reproduced by the deciphering operator. The particular arrangement and alignment of the rotors selected by the enciphering operator and transmitted to the deciphering operator in disguised form constitutes the keying instructions. The design of the ECM limited the erratic stepping so that at least 1, and not more than 4 cipher rotors step at a time. Even so, a crude, exhaustive search would require an enemy to check around 10 to the 14th permutations of code, index and control rotor starting positions. The combination of modern algorithms and the availability of high speed computers mean this system is no longer secure, but during its term of service it provided an unprecedented level of security. Click on these small photographs to view the inside of an ECM Mark II, CSP 889 2900 (128K and 152K images) KEYING (OPERATING) THE ECM MARK II: This outline of the June 1945 (SIGQZF-2) keying procedure describes how key lists were used to assemble and align the rotors before enciphering a message. The first instructions from July 1941 (SIGQZF) were changed in June 1945 (SIGQZF-2) and again November 1945 (SGIQZF-3). For example, SIGQZF-3 uses a totally different method of determining message indicators that eliminated the need for a daily rotor alignment of the control and cipher rotors. Changes were made to minimize operator errors, enhance security and speed up the operation. A sample Army manual from 1949 is available online. Although the index rotors were reassembled (changing the order of the rotors) once a day during most of the war (SIGQZF), starting with SIGQZF-2 they were kept in a fixed order not requiring daily reassembly. The operator consults the secret daily keylist and aligns (rotates) the index rotor wheels differently for secret, confidential and restricted messages. The index rotor alignment is only changed when either the day ends, or the classification of message to be encrypted changes. Control and cipher rotors are also reassembled once a day from the secret daily keylist, their alignment however, was changed with each message. After the daily assembly of all rotors and the alignment of the index rotors, a check group is used to verify the initialization and operation of the machine before any real messages are encrypted. The rotors are zeroized, (cipher and control rotors positioned on "O") and the letter A is repeatedly encrypted until 30 cipher text characters are printed. Then the 26th-30th letters are matched with the check group supplied in the secret daily keys. For each message, the secret daily keylist is consulted, and the control and cipher rotors are aligned to an initial position depending on the classification of the message. Now the operator selects a group of any five letters, except Z, at random to be the internal message indicator. This internal message indicator is then enciphered and the external message indicator (enciphered internal message indicator) is printed on the tape and transmitted with the message. The control and cipher rotors are then aligned without printing to the internal message indicator. The rotors are never aligned to the external message indicator (the letters printed on the tape), but always to the internal message indicator. Now the body of the message may be enciphered and transmitted with the external message indicator. If the plain text exceeds 350 5-letter groups, the plain text must be divided into 2 or more equal parts so that no part exceeds 350 groups. For each part a new internal message indicator is selected. COMPLIANCE WITH OPERATING PROCEDURES: The security of a cryptographic system relies as much on the operation of the cipher machine as the machine itself. During WW II the U.S. created organizations to formally train operators and to monitor U.S. operators compliance with procedure. When an error was found the first response was often a memorandum such as the one replicated below. It provides a list of the most common errors that could compromise the security of the cryptographic system. Navy Department Office of Chief of Naval Operations Washington, D.C. CLASSIFICATION: CONFIDENTIAL Date: 27 Dec 1943 MEMORANDUM COMMUNICATION IMPROVEMENT ITEM From: Director Naval Communications To: Commandant, Twelfth Naval District The principles of communication security cannot be overstressed, for such security is vital to the success of operations. Errors which seem minor in themselves may, when accumulated, offer to the enemy an entering wedge for the eventual compromise of a system. The object of this memorandum is to enlist your cooperation in protecting our cipher systems and hence our national security. THE PRICE OF SECURITY IS ETERNAL VIGILANCE. A communication such as COM 112 222105 DECEMBER may endanger our interests because it appears to violate security principles in the following respect(s): DRAFTING: Plain language reference to encrypted dispatches. No reply to this memorandum is necessary, but your cooperation in supressing dangerous communication practices is earnestly solicited. CARELESS COMMUNICATIONS COST LIVES The following is a list of some of common violations of security principles: DRAFTING: Unnecessary word repetition Unnecessary or improper punctuation Plain language reply to encrypted dispatch Classification too high Precedence too high Cancellation in plain language of an encrypted dispatch ENCRYPTION: "XYX" or "X"'s for nulls "XX" "KK" to separate padding from text Same letters at both ends to separate padding from text Continuity of padding Seasonal and stereotyped padding Repetition of generatrices (Ed. Note: CSP-845) Systematic selection of generatrices (Ed. Note: CSP-845) Using plain text column for encryption (Ed. Note: CSP-845) Proper strips not eliminated as prescribed by internal indicator (Ed. Note: CSP- 845) Improper set-up according to date Using system not held by all addressees Failing to use system of narrowest distribution CALLS: Enciphering indefinite call sign Enciphering call signs of shore activities CODRESS might have been used TRANSMISSION: Classified dispatch transmitted in plain language by wire or radio, when not specifically authorized. Dispatch might have gone to some or all addressees by mail. SOME ECM MARK II SPECIFICATIONS: Input: Keyboard or electric via tandem plug. Output: Printed tape or electric via tandem plug. Speed: 45 to 50 Words per minute. Power Supply: 40 70 cycle, 105-125 VAC or 105-125 VDC or 24 VDC 2 amps at 120 volts AC or DC, 3 amps at 24 VDC. Approximate Size: In operation: 15" x 19.25" x 12" or 2.1 cubic feet In carrying case: 17.125" x 23" x 15.5" or 3.5 cubic feet Packed for long term: 19.5" x 27.5" x 18" or 5.6 cubic feet Approximate Weight: In operation: 93.5 lbs. In carrying case: 133.5 lbs. Packed for long term: 195 lbs. Cost: By 1943, 10, 060 ECM Mark II's were purchased at an estimated cost of $2,040 a piece. This does not include the cost of spare parts; additional code wheel sets, code wheel wiring that was done by the military; modifications and upgrades, precursor machine development, etc. REFERENCES: The information enclosed here relating to the ECM Mark II was edited and excerpted from: Army Signal Security Agency (1946) History Of Converter M-134-C (Sigaba) Vol I, II And III This is available from the US National Archives and Records Administration (NARA); NSA Historical Collections 190 37 7 1, Box 799, F: 2292, pp 468. Safford, L.F. (1943) History of Invention And Development of the Mark II ECM (Electric Cipher Machine) This available from NARA. SRH-360 in RG 0457: NSA CSS Finding Aid A1, 9020 US Navy Records Relating to Cryptology 1918- 1950 Stack 190 Begin Loc 36 12 04 Location 1-19. In Feb 1996 the version at NARA was redacted, but the full document is now declassified. Rowlett, F.B. (1998) The Story of Magic. Laguna Hills, CA: Agean Park Press. A first hand description of its invention. Specifications for an ECM Mark II are from: Army Security Agency (1948) Historical and Cryptologic Summary of Cryptosystems; ASAG 23; Vol 1. ECM Mark II Keying, Operating and Maintenance instructions are in: War Department Office of The Chief Signal Officer (1941) Operating Instructions for Converter M-134-C (short title: SIGBWJ) War Department Office of The Chief Signal Officer (1941) Operating Instructions for Converter M-134-C (short title: SIGLVC) Department of the Army (1941) Crypto-Operating Instructions for Converter M-134-C (short title: SIGQZF) Department of the Army (1945) Crypto-Operating Instructions for Converter M-134-C (short title: SIGQZF-2) Department of the Army (1946) Crypto-Operating Instructions for Converter M-134-C (short title: SIGQZF-3) Department of the Army (1949) ASAM 1 1 Crypto-Operating Instructions for ASAM 1. Note the new designation of ASAM 1 for the ECM Mark II after the war. This is available online sample Army manual . War Department (1942) Maintenance Instructions for Converter M-134-C (short title: SIGKKK) War Department (1945) Maintenance Instructions for Converter M-134-C (short title: SIGKKK-2) SIGQZF, SIGBWJ, SIGLVC, SIGKKK, SIGKKK-2 are available from NARA; NSA Historical Collections 190 37 7 1, NR 2292 CBLL36 10622A 19410300. General information including security of the ECM Mark II are in: War Department (1945) General Instructions For Converter M-134-C (short title: SIGBRE-1) This is available from NARA; NSA Historical Collections 190 37 7 1, NR 4588 ZEMA35 13909A 19450600 A list of cipher equipment carried by submarines in the Pacific is in: Submarine Force U.S. Pacific Fleet (1944) Cryptographic Aids Check-Off List This is available from NARA, Pacific Sierra Regional Archive, 181-58-3201, S1313, S372, A6-3 N36 Cryptographic Aids. Information on the overall history of Naval Communications during WW II may be found in: US Naval Administration in WW II, History of Naval Communications, 1939-1945. Op-20A-asz, A12, Serial 00362P20, 7 Apr 1948. This is available from the Naval Historical Center; WW II Command File CNO; Communications History; Microfiche No. F3561. Compliance with Operating Instructions notes are from: Office of Chief of Naval Operations (1943) Memorandum Communication Improvement Item. This is available from the NARA, Pacific Sierra Regional Archive, RG 181-58-3224, 12th ND Commandants Office General Correspondence, A6-2(1) Complaints - Discrepencies, Security-etc. Descriptions of the the Authentication Systems may be found in: Survey Of Authentication Systems 1942-45 (1945) This is available from NARA; NSA Historical Collections 190 37 7 1, NR 3526 CBRK24 12960A 19420728. Many of the primary sources cited are from documents declassified and made available in NARA at College Park, MD by the NSA. ADDITIONAL READING: Other cryptologic history web sites include: The National Cryptologic Museum is part of the United States National Security Agency http: www.nsa.gov . Bletchly Park , was the primary site of the successful British WW II cryptanalytic effort. Cryptologia is a quaterly journal devoted to cryptology. Jerry Proc's Crypto Pages describe the KL-7 and KWR-37 cipher systems that replaced the WW II systems during the late 1950s. History of cryptology: Kahn, D. (1996) The Codebreakers. New York, NY: Scribner. This is the revised and updated version of the 1967 classic. Background on the history of intelligence in the Pacific may be found in: Holmes, W.J. (1979) Double-Edged Secrets. Annapolis, MD: Naval Institute Press. Layton, E., Pineau, R., Costello, J (19 ) And I Was There. New York, NY: William Morrow and Company, Inc. Prados, J. (1995) Combined Fleet Decoded. New York, NY: Random House. The story of Pampanito's third war patrol is in: Blair, C., Blair, J. (1979) Return From the River Kwai. New York, NY: Simon and Schuster. On the subject of Cryptanalysis of rotor systems: Lee, M., Cryptanalysis of the SIGABA, University of California Santa Barbara, June 2003. http: www.cs.ucsb.edu ~kirbysdl broadcast thesis thesis.pdf Savard, J.G., Pekelney, R.S. (1999) The ECM Mark II: Design, History and Cryptology. Cryptologia, Vol XXIII, Number 3, July 1999. Andleman, D., Reeds, J. (1982) On Cryptanalysis of Rotor Machines and Substitution-Permutation Networks. IEEE Transactions on Information Theory, IT-28(4), 578-584. Deavours, C., Kruh, L. (1985) Machine Cryptography and Modern Cryptanalysis. 35-92. Dedham, MA: Artech House Inc. Return to the Pampanito home page . Return to the Maritime Park Association home page . Copyright (C) 1996-2004, Maritime Park Association. All Rights Reserved. Version 2.23, 15 Nov 04
Mathematical Issues and Challenges in Data Assimilation for Geophysical Systems: Interdisciplinary Perspectives
Institute for Pure and Applied Mathematics (IPAM), Los Angeles, CA, USA; 22--25 February 2005.
IPAM - Mathematical Issues and Challenges in Data Assimilation for Geophysical Systems: Interdisciplinary Perspectives This workshop is being co-sponsored by the Statistical and Applied Mathematical Sciences Institute , which has provided additional participant support. Mathematical Issues and Challenges in Data Assimilation for Geophysical Systems: Interdisciplinary Perspectives February 22 - 25, 2005 Schedule and Presentations Program Poster PDF Organizing Committee: Christopher K.R.T. Jones, Chair (University of North Carolina at Chapel Hill) Kayo Ide (UCLA) Robert N. Miller (Oregon State University) Douglas Nychka (National Center for Atmospheric Research) Scientific Background The problem of assimilating data into a geophysical system related to the atmosphere and oceans is both fundamental in that it aims at the estimation and prediction of an unknown, true state and challenging as it does not naturally afford a clean solution. It has two equally important elements: observations and computational models. Observations measured by instruments provide direct information of the true state, whether they are taken in situ or by remote sensing. Such observations are heterogeneous, inhomogeneous in space, irregular in time, and subject to differing accuracies. In contrast, computational models use knowledge of underlying physics and dynamics to provide a complete description of state evolution in time. Models are also far from perfect: due to model error, uncertainty in the initial conditions and computational limitations, model evolution cannot accurately generate the true state. The issue of assimilating data into models arises in all scientific areas that enjoy a profusion of data. In its broadest sense, it is the subject that arises at the meeting point of data and models. Technology has driven the advances on both sides of the equation: new techniques of measurement have led to an enormous surge in the amount of available data and ever faster computers have given us the capability of new levels of computational modeling. The development of effective data assimilation methods must now be viewed as one of the fundamental challenges in scientific prediction. The two explicit goals of this workshop will be: 1) introduce data assimilation to mathematicians and scientists who work in related areas but are not currently involved in data assimilation; 2) outline future directions for mathematical and statistical developments of data assimilation techniques. These goals will be achieved by complementing technical and overview presentations by "brainstorming sessions" in which mathematicians and geophysicists will be brought together in groups to define the big issues and the possible directions that might resolve them. Related Programs Information about programs in a related topic: A semester program Data Assimilation for Geophysical Systems to be held in January - June 2005 at the Statistical and Applied Mathematical Science Institute in the Research Triangle Park, NC, can be found at: http: www.samsi.info 200405 data data-home.html A summer school on "Fusing Models with Data: From Practice to Theory to Practice" to be held for June 12 -23, 2005 at the National Center for Atmospheric Research in Boulder, CO, will become available soon. Speakers Greg Eyink (Johns Hopkins University) Jim Hansen (Massachusetts Institute of Technology) Brian Hunt (University of Maryland) Richard Kleeman (New York University) Arthur Krener (University of California at Davis) Pierre F.J. Lermusiaux (Harvard University) James McWilliams (UCLA) Igor Mezic (UCSB) Carolyn A. Reynolds (Naval Research Laboratory) Leonard A. Smith (London School of Economics) Padhraic Smyth (University of California at Irvine) Chris Snyder (National Center for Atmospheric Research) Richard Sowers (University of Illinois at Urbana-Champaign) Andrew Stuart (University of Warwick) William W. Symes (Rice University) Istvan Szunyogh (University of Maryland) Oliver Talagrand (Ecole Normale Suprieure, France) Edriss Titi (University of California at Irvine Weizmann Institute of Science) Joseph Tribbia (National Center for Atmospheric Research) Poster Session There will be a poster session on Tuesday, February 22, 2005. Those who wish to contribute must do the following: Register online for the workshop Submit title and abstract of the poster for approval to Contact Us: Institute for Pure and Applied Mathematics (IPAM) Attn: DA2005 460 Portola Plaza Los Angeles CA 90095-7121 Phone: 310 825-4755 Fax: 310 825-4756 Email: Website: http: www.ipam.ucla.edu programs da2005 [ Home ] [ People ] [ Events ] Programs [ Visitor Info ] Contact:
Structural Geology Day
Folding Patterns in Structural Geology, Theory and Experiments. University of Bath, UK; Monday 15 December 2003.
CNM Bath - Structural Geology Day, Monday 15 December 2003 Text only | University | Search | A-Z Index Folding Patterns in Structural Geology, Theory and Experiments Room 1W 3.15, University of Bath - Monday, 15th December 2003 Funded with help from the London Mathematical Society . Geologists have long been fascinated by the rich variety of patterns observed in folded (multi-layer) rock. These can include smooth parallel folds, kink bands, chevron folds and more disordered folding patterns on both small and large length scales. Until recently, all studies of such patterns were observational and qualitative. However, there has been recently considerable progress in applying mathematical and engineering based methods to give a quantitative analysis of the possible patterns. This meeting aims to bring together those mathematicians, engineers and geologists who are interested in the analysis, computation and experimental study of folding (and related) patterns with the aim of stimulating future mathematical research into more advanced geological formations and also of comparing theoretical predictions with those observed in the field. The meeting will have talks on theory, recent experimental work and on practical geology. The emphasis will be a strong interchange of ideas between the different communities. Topics to be covered:- Models of deformable rock: experiments and field observations, Parallel rock folding, Kink banding: theory, Kink banding: experiment, Multi-layer folding patterns and the formation of singularities, Computational techniques (including level set methods), Separation (delamination) of rock layers. Discussion: what can geologists learn from mathematicians engineers and vice versa? Programme:- Coffee 10.30-10.40 Welcome and Introduction 10.40-11.20 Dr. John Cosgrove, Department of Earth Science and Engineering, Imperial College London. "The impact of field observations, analogue modelling and theoretical studies on the understanding of the folding of rocks" 11.20-12.00 Rorie Edmunds, Department of Civil and Environmental Engineering, Imperial College London. "A nonlinear model for parallel folding with friction" 12.00-12.40 Dr. John Mackenzie, Department of Mathematics, University of Strathclyde. "Level set methods for interface problems" Lunch in 1W3.5 1.30-2.10 Dr. Dave Waltham, Department of Geology, Royal Holloway College, London. "Fault bend folding in Coulomb materials" 2.10-2.50 Dr. Martin Casey, School of Earth Sciences, University of Leeds. "Fold growth and propagation: indications from the field and from numerical modelling" Tea 3.10-3.50 Dr. Roger Crouch, Department of Civil and Structural Engineering, University of Sheffield. "NAF and kinky: Geomaterial instability and localization under multiaxial stress states" 3.50-4.30 Dr. Ahmer Wadee, Department of Civil and Environmental Engineering, Imperial College London. "Simplified kink banding: Experiments and predictive modelling of localized deformation in layered structures". Close For further information contact: Mrs Ann Linfield Centre for Nonlinear Mechanics, University of Bath, Bath BA2 7AY Tel: +44 (0) 1225 386998 Fax: +44 (0) 1225 386492 E-mail: A.D.Linfield@bath.ac.uk Page created on 30 January 2003 by Jennifer Wright . Last updated: Friday, 12-Dec-2003 10:35:24 GMT. Copyright 2002 University of Bath Disclaimer Privacy Statement
SIAM Conference on Mathematical and Computational Issues in the Geosciences (GS03)
Austin, Texas, USA; 17--20 March 2003.
SIAM GS03
IAMG 2002
Annual Conference of the International Association for Mathematical Geology. On-line registration. Berlin,Germany; 15--20 September 2002.
IAMG'2002 Annual Conference of the International Association for Mathematical Geology Home Page About IAMG'2002 Tentative Technical Program Conference Venue Timetable List of Contributions Addendum About Berlin 2002AnnualConference of the InternationalAssociationforMathematicalGeology - Creation,Management,Distribution,AccessandExploitationofDigitalSpatialData - Berlin,Germany, September15-20 2002 Presse- und Informationsamt Berlin Thie Addendum: photo gallery, figures, conference materials, corrections, late submissions About IAMG'2002 Download the program of IAMG2002 as Word-file (432KB) or as pdf-file (496KB) Download the first circular of IAMG2002 as Word-file (60KB) or as pdf-file (138KB) Download the second circular of IAMG2002 as Word-file (3.1MB) or as pdf -file (292KB) Download the poster of IAMG2002 as pdf-file (1.7MB) Tentative Technical Program How to Reach the Conference Venue Timetable List of Contributions Addendum About Berlin Organizers Sponsors IAMG'2002 ContactAddress: LocalOrganizingCommittee IAMG'2002 - Conference Secretariat FreieUniversittBerlin, Malteser Strasse74-100, 12249BERLIN, Germany phone00493083870570 fax 00493083870723 WebAdministration: AgnesSchumann E-Mail DepartmentofGeoscience, FreeUniversityofBerlin LastModification Disclaimer: Whilst every effort has been made to ensure the accuracy of the information contained within this World Wide Web site, the author(s) can accept no liability whatsoever for any errors, inaccuracies or omissions, or for any matter in any way connected with or arising out of the publication of the information.
Mathematics in Geosciences
IMA Thematic Year; September 2001 -- June 2002.
IMA Thematic Year on Mathematics in Geosciences, September 1, 2001-June 30, 2002 Search Contact Information Program Registration Postdoc Membership Application Program Feedback Material from Talks Audio Video Industrial Programs Program Solicitation IMA Thematic Year on Mathematics in the Geosciences September 1, 2001 - June 30, 2002 Annual Report (pdf) Questions? Contact us at staff@ima.umn.edu . The year is divided into three components: Fall Quarter, September-December, 2001 Dynamical Systems and Ergodic Theory Winter Quarter, January-March, 2002: Multiscale Phenomena and Renormalization Spring Quarter, April-June, 2002: Inverse Problems and the Quantification of Uncertainty Organizers Affiliation Department William I. Newman (Chair) UCLA Earth and Space Sciences David R. Brillinger UC Berkeley Statistics Michael Ghil UCLA Atmospheric Sciences J.M. Hyman Los Alamos National Laboratory Center for Nonlinear Studies Frederic Schoenberg UCLA Statistics William W. Symes Rice University Computational and Applied Mathematics Donald L. Turcotte Cornell University Geological Sciences Mary F. Wheeler University of Texas Center for Subsurface Modeling Organizers Complete Coordinates Postdoctoral Members List of Participants The geosciences began their modern incarnation in 1957 with the 18-month long International Geophysical Year (IGY). The IGY saw a global mobilization of effort to investigate all aspects of the Earth and the space environment. While American and Soviet space vehicles made startling new discoveries about the Earth's magnetic field and the Van Allen belt, strong observational evidence was added to reinforce the plate tectonic revolution. New insights were obtained relating to the structure and dynamics of the earth's interior, both mantle and core. During the 1950s and 1960s, digital computers made it possible to model the atmosphere and oceans and, ultimately, to predict weather and climate as fluid media. The last four decades have been monumental years of discovery and accumulation of facts and detailed data on the solid earth, ocean, atmosphere, and space sciences. Significant theoretical insight concerning these topics has emerged, but deep problems remain to challenge conventional methodologies and insights derived from the physical sciences. The time is ripe to apply mathematical modeling and analysis techniques, including newer methods in continuous and discrete dynamical systems, stochastic processes, homogenization, and multiscale asymptotics to our investigation of these problems. The geosciences today provide an impressive array of important problems that should command the attention of applied mathematicians. In addition, the geosciences offer the opportunity as well as the need to advance the foundations and techniques of applied mathematics to meet this challenge. The time is right to initiate an International Mathematical Geosciences Year (IMGY) to bring mathematicians and geoscientists together in the investigation of our planet and the environment within which it resides. We present a three-quarter program designed to introduce mathematicians to the major themes and techniques of the geosciences, and create a focal point for a multidisciplinary assault on some of the outstanding problems emerging from them. Accordingly, the three quarters are organized along methodological lines, beginning with dynamical systems and ergodic theory, then moving on to multiscale problems and renormalization, and concluding with inverse problems and the quantification of uncertainty. Fall Quarter, September-December, 2001: Dynamical Systems and Ergodic Theory Winter Quarter, January-March, 2002: Multiscale Phenomena and Renormalization Spring Quarter, April-June, 2002: Inverse Problems and the Quantification of Uncertainty Fall Quarter (September - December, 2001) Dynamical Systems and Ergodic Theory Important progress has been made in understanding the dynamics of the earth's crust, especially earthquakes. The availability of new data opens new applications for modern mathematical technique. The theoretical understanding of large-scale atmospheric and oceanic flows, and of the coupled atmosphere-ocean-cryosphere-biosphere climate system, is being revolutionized by the insights provided by dynamical systems theory and its statistical complement, these systems' ergodic theory. Similarly, significant new insights have emerged in applications of dynamical systems theory to problems relevant to the earth's interior. Analysis, simulation, and prediction of geophysical processes, ranging from climates to earthquakes, are likely to make much more rapid progress by bringing the appropriate mathematical and statistical tools to bear on them. Tutorial: Spatio-temporal Patterns in the Geosciences , September 24, 2001 Workshop 1: Spatio-temporal Patterns in the Geosciences , September 25-29, 2001 Special Event: Keilis-Borok 80th Birthday Festschrift , October 5-6, 2001 Workshop 2: Complexity in Geophysical Systems , October 8-12, 2001 Workshop 3: Dynamical Systems in Celestial Mechanics and Climate Dynamics , October 29-November 2, 2001 James Serrin Symposium , November 8-11, 2001 Workshop 4: Time Series Analysis and Applications to Geophysical Systems , November 12-16, 2001 Back to top of page Winter Quarter (January - March, 2002) Multiscale Phenomena and Renormalization The description of many natural phenomena naturally introduces a high degree-of-freedom system which takes the form of a continuum, described by partial differential equations, or of discrete systems. Another venue for multiscale phenomena manifests in the field of point processes, and the development of linear and nonlinear models. Workshop 5: Quantifying Uncertainty and Multiscale Phenomena in Subsurface Processes , January 7-11, 2002 Workshop 6: Reduced Descriptions of Coupled GFD Systems (Slow manifolds in the ocean and atmosphere) , February 11-15, 2002 Short Course: Wavelet Methods in Seismology , February 18-20, 2002 Robert Burridge Lectures: Ray Theory for the Elastic Wave Equation , March 4-6, 2002 Minisymposium 7: Numerical Methods in the Geosciences , March 13-15, 2002 Workshop 8: Nonlinear Continuum Mechanics, Rheology and the Dynamo , March 18-22, 2002 Back to top of page Spring Quarter (April - June, 2002) Inverse Problems and the Quantification of Uncertainty This quarter addresses the quantification of uncertainty in geosciences, through two workshop programs. The first program concerns state and parameter estimation in the presence of imperfection in data acquisition, physical modeling, and numerical simulation. This theme separates into two subthemes in a rough way, according to whether the system changes substantially while it is being observed, or not. In the former case the state estimation problem has come to be called the problem of data assimilation, whereas in the latter case it is often called model inversion. The first two workshops address these two aspects of the first theme. The second theme deals with the application of statistical time series and point process modeling and inference, seismic hazard, and risk assessment. The Fifth Rivire-Fabes Symposium on Analysis and PDE , April 5-7, 2002 Special Symposium: Evolutionary Consequences of Biological Invasions , April 12-13, 2002 Tutorial: Inverse Problems and Data Assimilation , April 19, 2002 Workshop 9: Inverse Problems and Quantification of Uncertainty , April 22-26, 2002 Workshop 10: Data Assimilation in the Oceanic and Atmospheric Sciences , April 29- May 3, 2002 Tutorial: Earthquake Probability Models and Forecasting , May 13, 2002 Workshop 11: Point Process Modeling and Seismological Applications of Statistics , June 10-14, 2002 2002 IMA Summer Schedule Back to top of page [ Homepage ] [ About the IMA ] [ What's Happening Now ] [ Programs and Activities ] [ Preprint Publications ] [ Research Communities ] [ Visitor and Local Information ] [ Program Registration ][ Program Feedback ] [ Talks ][ Directory ] [ "Hot Topics" Workshops ][ People ][ Site Map ] [ Search ] webmaster@ima.umn.edu [ Industrial Programs ] [ Program Solicitation ][ Postdoc Membership Application ] University of Minnesota Online Privacy Statement Last Modified: Thursday, 09-Sep-2004 09:21:17 CDT
Surface Water Waves
Isaac Newton Institute, Cambridge, UK; 13--31 August 2001.
INI Programme SWW Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Participants Long Stay Short Stay Additional Links Contacts Mailing List Isaac Newton Institute for Mathematical Sciences Surface Water Waves 13 Aug--31 Aug 2001 Organisers: Dr SE Belcher (Reading), Professor TJ Bridges (Surrey), Dr SG Sajjadi (John C. Stennis Space Center) Programme theme Of all the various types of fluid wave motion that occur in nature, surface water waves are not only the most easily observed but of great scientific importance because of their impact on coastal and offshore structures and ship dynamics, their implication for sediment transport and coastal morphology and their overall effect on the energy and momentum exchange between the atmosphere and oceans. On the other hand there are fascinating mathematical problems associated with water waves of great interest to both pure and applied mathematicians, and the water wave equations have spawned whole areas of mathematics, for example the theory of the Korteweg-deVries equation. While there has been substantial progress in the theory of water waves - particularly 2D water waves - there is a potential for significant advances in the analytical and numerical aspects of 3D nonlinear waves, including qualitative aspects that heretofore not been predicted or anticipated. In addition, the recent development of mathematical theories for non-linear, interacting and breaking waves have pointed the way to new ideas for theores of waves interacting with wind, turbulence and other waves. In all cases experimental data is beginning to be available to discriminate between and contribute to conflicting mathematical theories, and there are new possibilities for computing critical aspects of these phenomena and these need to be discussed in detail.
Sixth SIAM Conference on Math and Comp Issues in the Geosciences (SIAG GS) (GS01)
Boulder, CO, USA; 11--14 June 2001.
Sixth SIAM Conference on Mathematical and Computational Issues in the Geosciences
Yield Management and Dynamic Pricing
DIMACS Workshop. Rutgers University, NJ, USA; 3--5 August 2005.
DIMACS Workshop on Yield Management and Dynamic Pricing DIMACS Workshop on Yield Management and Dynamic Pricing August 3 - 5, 2005 DIMACS Center, CoRE Building, Rutgers University Organizers: James Dana, Northwestern University, j-dana@kellogg.northwestern.edu Brenda Dietrich, IBM Watson Labs, dietric@watson.ibm.com Presented under the auspices of the Special Focus on Computation and the Socio-Economic Sciences . Workshop Announcement Call for Participation Program Presentation Papers and Slides Registration Form (Pre-registration deadline: July 27, 2005) DIMACS Workshop Registration Fees Pre-register before deadline After pre-registration deadline Regular rate (1 day 2 days 3 days) $140 $280 $400 $160 $320 $450 Academic nonprofit rate* $90 $180 $250 $100 $200 $270 Postdocs $10 day $15 day DIMACS Postdocs $0 $0 Non-Local Graduate Undergraduate students $10 day $15 day Local Graduate Undergraduate students (Rutgers Princeton) $0 $0 DIMACS partner institution employees** $0 $0 DIMACS long-term visitors*** $0 $0 Registration fee to be collected on site, cash, check (payable to Rutgers University), VISA Mastercard accepted. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable). * College University faculty and employees of nonprofit and government organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the pre-registration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, ATT Labs - Research, Bell Labs, NEC Laboratories America and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs, HP Labs, IBM Research, Microsoft Research, and Stevens Institute of Technology are also waived. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. Information on Accommodations Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the workshop. Please park in lot 64 located between the CoRE Building and the Werblin Recreation Center. Important Reimbursement Information Attendees who have been offered support should keep two rules in mind. Reimbursement for air travel can only be made for travel on US Flag Carriers, REGARDLESS OF COST. (For example, travel on airlines such as United, Continental, USAir, and others that are United States based are allowable. Travel on airlines such as Lufthansa, SAS, Air Canada and other airlines based outside the US cannot be reimbursed by DIMACS.) The second rule to keep in mind is to get original receipts for all reimbursable expenses. If you're coming from abroad, check the latest visa requirements (they are changing all the time) and get an early start on obtaining a visa. Other Workshops DIMACS Homepage Contacting the Center Document last modified on January 11, 2005.
Developments in Quantitative Finance
Research session at the Isaac Newton Institute for Mathematical Sciences, Cambridge, UK; 24 January -- 22 July 2005.
INI Programme DQF Institute Home Page Programmes Web-Seminars Programme Home Seminars This Week Next Week Full list Workshops Themed Events Participants Long Stay Short Stay Additional Links Contacts Mailing List Background Programme Plans Junior Membership Isaac Newton Institute for Mathematical Sciences Developments in Quantitative Finance 24 Jan - 22 Jul 2005 Organisers: Prof D Duffie (Stanford), Prof D Hobson (Bath), Prof C Rogers (Cambridge), Prof J Scheinkman (Princeton) Programme theme The field of mathematical finance is comparatively young, and the modern theory can be traced back to the Black-Scholes-Merton solution of the problem of how to price a call option, a financial security whose payoff is contingent on the behaviour of an underlying asset. Over the past three decades the explosive growth in trading of financial derivatives has been reflected in a commensurate growth in the study of financial mathematics, which in turn has helped to support the increasing sophistication of financial markets. As a branch of mathematics, finance is extremely diverse, and the subject has attracted the interest of, and generated research problems for, researchers from a broad spectrum of mathematical disciplines. The theory is based on stochastic models, and there are obvious applications from statistical analysis, but there have also been significant contributions from functional and convex analysis. There are also strong connections with numerical analysis and computational methods, not least because many of the equations which arise have long been studied by applied mathematicians. The healthy development of the subject also needs input from economists and industry professionals. The major themes of this programme are asset price modelling and inference for financial models; market imperfections and derivative pricing in incomplete markets; insurance applications and the modelling and quantification of credit events; computational finance; and financial economics and agent interactions. The aim is that researchers from all related disciplines - from economics, physics and finance as well as pure and applied mathematics and statistics - should meet and interact, to share there knowledge and advance their understanding.
Spring School in Finance
A crash course on risk management of derivative securities and portfolio optimization. Universit di Bologna, Italy. 19--20 May 2005.
Spring School of Finance Crash course on risk management of derivative securities Bologna, May 18-19, 2006 The Spring School will take place in Bologna (Italy) at the Department of Mathematics, on May 18-19, 2006, under the patronage of the University of Bologna and of the Accademia delle Scienze. The aim of the Spring School is to provide self-contained lectures on current research topics in mathematical finance. The invited speakers of the school Professor Bruno Dupire, Bloomberg, New York University (US), Professor Damien Lamberton, University of Marne-la-Valle (France) will lecture on the following topics: B. Dupire: "Volatility modelling" D. Lamberton: "Optimal stopping and American options" Lectures notes of the courses will also be available and there will be ample time for discussion. Audience The Spring School is intended to be addressed to a wide audience and is designed for academics and researchers as well as pratictioners and business people. The aim is to lead the participants to the forefront of research providing short, intensive and up-to-date courses.
Markets as Predictive Devices (Information Markets)
DIMACS Workshop, Rutgers, NJ, USA; 3--4 February 2005.
DIMACS Workshop on Markets as Predictive Devices (Information Markets) DIMACS Workshop on Markets as Predictive Devices (Information Markets) February 2-4, 2005 DIMACS Center, CoRE Building, Rutgers University Organizers: Robin Hanson , George Mason University, John Ledyard , California Institute of Technology, David Pennock , Yahoo! Research Labs, Presented under the auspices of the Special Focus on Computation and the Socio-Economic Sciences , and the following sponsors: Microsoft Research: http: research.microsoft.com Newsfutures: http: www.newsfutures.com Hosting PM2, the Prediction Market Market Yahoo! Research Labs: http: research.yahoo.com Workshop Announcement Call for Participation Program Presentation Slides Registration Form (Pre-registration deadline: January 26, 2005) DIMACS Workshop Registration Fees Pre-register before deadline After pre-registration deadline Regular rate (1 day 2 days 3 days) $140 $280 $400 $160 $320 $450 Academic nonprofit rate* $75 $150 $215 $85 $170 $245 Postdocs $10 day $15 day DIMACS Postdocs $0 $0 Non-Local Graduate Undergraduate students $10 day $15 day Local Graduate Undergraduate students (Rutgers Princeton) $0 $0 DIMACS partner institution employees** $0 $0 DIMACS long-term visitors*** $0 $0 Registration fee to be collected on site, cash, check, VISA Mastercard accepted. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable). * College University faculty and employees of nonprofit and government organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the pre-registration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, ATT Labs - Research, Bell Labs, NEC Laboratories America and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs, HP Labs, IBM Research, Microsoft Research, and Stevens Institute of Technology are also waived. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. Information on Accommodations Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the workshop. Please park in lot 64 located between the CoRE Building and the Werblin Recreation Center. Important Reimbursement Information Attendees who have been offered support should keep two rules in mind. Reimbursement for air travel can only be made for travel on US Flag Carriers, REGARDLESS OF COST. (For example, travel on airlines such as United, Continental, USAir, and others that are United States based are allowable. Travel on airlines such as Lufthansa, SAS, Air Canada and other airlines based outside the US cannot be reimbursed by DIMACS.) The second rule to keep in mind is to get original receipts for all reimbursable expenses. If you're coming from abroad, check the latest visa requirements (they are changing all the time) and get an early start on obtaining a visa. Other Workshops DIMACS Homepage Contacting the Center Document last modified on January 11, 2005.
Advanced Course on Mathematical Finance: Further Models
Euro Summer School. Centre de Recerca Matemtica, Bellaterra (Barcelona) Spain; 1--6 July 2002.
Mathematical Finances Advanced Course on Mathematical Finance: Further Models. A Euro Summer School List of registered participants Programme Lodging information Location of the CRM Dates: July 1 to 6, 2002 Place: Centre de Recerca Matemtica, Campus of the Universitat Autnoma de Barcelona (Bellaterra) Coordinator: Joan del Castillo (Universitat Autnoma de Barcelona) Speakers: Tomas Bjrk (University of Stockholm) Interest rate theory Summary: Bond markets and interest rates. Short rate models. The market price of risk. Martingale modelling. Affine term structures. Inverting the yield curve. Forward rate models: The HJM approach. Change of numeraire: The normalized price system, pricing, forward measures, a general option pricing formula. Thomas Mikosch (University of Copenhagen) GARCH models Heavy-tailed distributions Summary: Dependence (non-zero correlations of the volatility sequence, clusters of high and low level exceedances) and the occurrence of unusually many very high and very low values (heavy-tailed distributions) are typical for returns series of financial time series. We consider stochastic models for adequately describing these properties. In particular, we study the celebrated GARCH process in detail and verify how extremes and dependence are explained by this model. Neil Shephard (Nuffield College, Oxford) Levy process and stochastic volability models Summary: This lecture course will focus on the development of Levy process based stochastic volatility models. An introductory account of Levy processes in finance will be given, before establishing their use in stochastic volatility processes. The associated option pricing results will be discussed, as will the theory of realized volatility built out of these processes. Grants (the deadline for applications is closed) The CRM can offer a limited number of grants to young researchers covering the registration fee and or accommodation. The deadline for application is May 5, 2002. VERY IMPORTANT If you apply for Financial Support please do the following steps: Send the Application Form for Financial Support before the deadline (please do not pay the Registration fee). Once you receive the resolution on your Financial Application (May 15 approximately) you will be asked to send the Registration Form and the Payment Form (if necessary). Application Form for Financial Support Deadline expired Accommodation Participants granted with accommodation are informed that the organisation of the course will take care of their lodging. For those participants who have not received a grant are advised to book themselves for their lodging. Registration and Payment Fee: 150 euros Deadline: May 31, 2002 Registration Form Payment No registration will be considered before the CRM will have received the payment of the fee. For any query contact the secretary This Euro Summer School is supported by the European Commission under contract number HPCF-CT-2000-00082 of the Improving Human Research Potential Programme.
Models of Financial Market Microstructure
Special session of the second International Association of Science and Technology for Development conference on Financial Engineering and Applications (FEA 2004). MIT, Cambridge, MA, USA; 8--10 November 2004.
The International Association of Science and Technology for Development INFORMATION SPECIAL SESSION The 2nd IASTED International Conference on FINANCIAL ENGINEERING AND APPLICATIONS ~FEA 2004~ November 8-10, 2004 MIT Cambridge, MA, USA "Models of Financial Market Microstructure" Dr. Ted Theodosopoulos Drexel University, USA theo@drexel.edu To what extent are equilibrium prices of financial assets determined by the rules of market making? Are there persistent dynamic effects observable in high frequency transactional time series? Can such effects endogenize the empirical mesoscopic randomness that characterizes traditional financial market models? Recent years have seen an unprecedented interest from practitioners, academics, and regulators alike in questions such as these, aiming to probe the short-term dynamics of financial markets. Technological advances enabling effective electronic intra-day trading, coupled with institutional restructuring bringing equity market makers into traditionally risk-managed trading infrastructures in universal banks, have accentuated the need for a new type of risk models. The stochastic models that fueled the financial engineering revolution of the past two decades are manifestly inapplicable to time scales that lack continuity and information symmetry, while arbitrage opportunities are the norm. In the proposed special session we hope to attract papers ranging from methodological considerations (e.g. agent-based, lattice- or graph-based, statistical mechanics approaches), to policy recommendations regarding the optimal design of exchanges (e.g. monopolistic vs. competitive, auction types). Topics of particular interest include investigations of the sources of observed deviations from the Efficient Markets Hypothesis in high frequency transaction data (e.g. fat tails in volume and return distributions, clustered volatility), as well as practical implications to the risk capital requirements for market makers (NYSE-type specialists with an affirmative obligation to intermediate vs. NASDAQ-type brokering) and the classification of the short-term equity response dynamics to exogenous shocks (e.g. corporate news, downgrades etc.). Please send an original contribution of the full paper (in pdf or MS word format) via email to theo@drexel.edu . Please do not send a hard copy of the paper. The length of the paper is limited to six pages and the formatting instructions can be found on the website at http: www.iasted.org formatting-initial.htm . Dr. Ted Theodosopoulos received B.S. degrees in Mathematics, Aeronautics and Astronautics and Political Science, and the M.S. and Ph.D. degrees in Operations Research, all from the Massachusetts Institute of Technology. While at MIT, he worked at the Laboratory for Information and Decision Systems and the Operations Research Center. Subsequently, he held numerous positions in the banking sector, within the financial engineering and capital markets risk management area. During the academic year 2001-2, he was a visiting professor of Operations Research at the American College of Thessaloniki in Greece. He is currently an assistant professor in the department of Decision Sciences at Drexel University's Bennett S. LeBow College of Business. His research interests are in the fields of probability and stochastic processes, and their applications to biology and economics. IMPORTANT DEADLINES Submissions due June 28, 2004 Notification of acceptance July 15, 2004 Camera-ready manuscripts due September 10, 2004 Registration Deadline September 15, 2004 Back to the FEA 2004 Home Page Conferences | Membership | Publications | FAQs | Contact Us | Site Map | Home Copyright 2003 IASTED www.iasted.org Site Designed by Virtual Apex Internet Solutions
FEA 2004
The second IASTED International Conference on Financial Engineering and Applications. MIT, Cambridge, MA, USA; 8--10 November 2004.
The IASTED International Conference on Financial Engineering and Applications (FEA 2004) INFORMATION The 2nd IASTED International Conference on FINANCIAL ENGINEERING AND APPLICATIONS ~FEA 2004~ November 8-10, 2004 MIT Cambridge, MA, USA ***SUBMISSION DEADLINE EXTENDED*** SPONSORS The International Association of Science and Technology for Development (IASTED) Technical Committee on Finance Technical Committee on Management World Modelling and Simulation Forum (WMSF) PLENARY ADDRESS "Financial Engineering of Risk Managed Funds" presented by Prof. Michael Dempster, Director of Research and Professor of Management Studies, Judge Institute of Management Studies, Cambridge University, UK SPECIAL SESSION "Models of Financial Market Microstructure" organized by Dr. Ted Theodosopoulos of Drexel University, USA TUTORIAL "Methods for Superreplication" presented by Dr. Johan Tysk of Uppsala University, Sweden TUTORIAL "Discovering Hidden Financial Patterns with Genetic Programming" presented by Prof. Dr. Shu-Heng Chen of the National Chengchi University, Taiwan, Dr. Tina Yu of the ChevronTexaco Information Technology Company, USA, and Ms. Tzu-Wen Kuo of the National Chengchi University, Taiwan The 2nd IASTED International Conference on Financial Engineering and Applications (FEA 2004) will be held from November 8-10, 2004, at the Massachusetts Institute of Technology in Cambridge, MA, USA. The expanding range of financial instruments available to corporations and individuals, coupled with the increasing complexity of the analytical methods used by financial analysts, strategic planners, investors, creditors, and insurers, have forced these groups to turn to increasingly sophisticated technologies for solutions. The marriage between traditional topics of finance and cutting-edge technology has resulted in the field of Financial Engineering. The purpose of IASTEDs international conference on Financial Engineering and Applications is to provide a forum for experts from academia, business, and the government to exchange information on this interdisciplinary subject. All papers submitted to this conference will be peer evaluated by at least two reviewers. Acceptance will be based primarily on originality and contribution. Highlights of the week will include paper sessions, tutorials, and keynote addresses. Located across the Charles River from Boston, Cambridge offers an exciting multicultural setting as well as two of the world's premier educational institutions, making it the ideal venue for FEA 2004. FEA 2004 will be held in conjuction with the international conferences on Computer and Communication Networks (CCN 2004) and Alliances, Mergers, and Acquisitions (AMA 2004) . IMPORTANT DEADLINES ***UPDATED*** Submissions due July 1, 2004 Notification of acceptance August 1, 2004 Camera-ready manuscripts due September 10, 2004 Registration Deadline September 15, 2004 TECHNICAL COMMITTEE If you are interested in joining the IASTED Technical Committee on Finance or the Technical Committee on Management, please submit your name, address, phone, fax, email, areas of specialty, a list of your most recent publications, and a brief CV by email to calgary@iasted.org . TELL A FRIEND OR COLLEAGUE To send a link to this conference to a friend or colleague who would be interested, click here . Conferences | Membership | Publications | FAQs | Contact Us | Site Map | Home Copyright 2003 IASTED www.iasted.org Site Designed by Virtual Apex Internet Solutions
Computational Issues in Auction Design
DIMACS Workshop, Rutgers University, NJ, USA; 7--8 October 2004.
DIMACS Workshop on Computational Issues in Auction Design DIMACS Workshop on Computational Issues in Auction Design October 7 - 8, 2004 DIMACS Center, CoRE Building, Rutgers University Organizers: Jayant Kalagnanam, IBM Watson Lab, jayant@us.ibm.com Eric Maskin, School of Social Science, Institute for Advanced Study, maskin@ias.edu David Parkes, Harvard University, parkes@eecs.harvard.edu Aleksandar Pekec, Fuqua School of Business, Duke University, pekec@duke.edu Michael Rothkopf, Rutgers University, rothkopf@rutcor.rutgers.edu Presented under the auspices of the Special Focus on Computation and the Socio-Economic Sciences . Workshop Announcement Call for Participation Program Papers and Presentation Slides Registration Form (Pre-registration deadline: September 30, 2004) DIMACS Workshop Registration Fees Pre-register before deadline After pre-registration deadline Regular rate (1 day 2 days) $120 $240 $140 $280 Academic nonprofit rate* $70 $140 $80 $160 Postdocs $10 day $15 day DIMACS Postdocs $0 $0 Non-Local Graduate Undergraduate students $10 day $15 day Local Graduate Undergraduate students (Rutgers Princeton) $0 $0 DIMACS partner institution employees** $0 $0 DIMACS long-term visitors*** $0 $0 Registration fee to be collected on site, cash, check, VISA Mastercard accepted. Our funding agencies require that we charge a registration fee during the course of the workshop. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable). * College University faculty and employees of nonprofit and government organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the pre-registration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, ATT Labs - Research, Bell Labs, NEC Laboratories America and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs, HP Labs, IBM Research and Microsoft Research are also waived. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. Information on Accommodations Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the workshop. Please park in lot 64 located between the CoRE Building and the Werblin Recreation Center. Important Reimbursement Information Attendees who have been offered support should keep two rules in mind. Reimbursement for air travel can only be made for travel on US Flag Carriers, REGARDLESS OF COST. (For example, travel on airlines such as United, Continental, USAir, and others that are United States based are allowable. Travel on airlines such as Lufthansa, SAS, Air Canada and other airlines based outside the US cannot be reimbursed by DIMACS.) The second rule to keep in mind is to get original receipts for all reimbursable expenses. If you're coming from abroad, check the latest visa requirements (they are changing all the time) and get an early start on obtaining a visa. Other Workshops DIMACS Homepage Contacting the Center Document last modified on August 30, 2004.
Numerical Probabilistic Methods for High-dimensional Problems in Finance
American Institute of Mathematics, Palo Alto, CA, USA; 5--8 December 2003.
ARCC Workshop: Numerical probabilistic methods for high-dimensional problems in finance Numerical probabilistic methods for high-dimensional problems in finance December 5 to 8, 2003 at the American Institute of Mathematics , Palo Alto, California organized by Jaksa Cvitanic , and Nizar Touzi This workshop, sponsored by AIM and the NSF , will be devoted to developing and studying efficient numerical algorithms, based on probabilistic methods, for solving high-dimensional optimization nonlinear problems in finance, and exploring the connection with the theory of Forward Backward Stochastic Differential Equations, while at the same time extending that theory. The workshop will bring together researchers in numerical methods, PDE's, Monte Carlo simulation, quantitative finance, Malliavin Calculus, Forward Backward Stochastic Differential Equations, nonparametric regression kernel techniques, and similar. We hope especially to facilitate communication on this topic between mathematicians, researchers from finance departments, and those from finance industry. The main topics for the workshop are Numerical algorithms for american options in high dimensions, Numerical algorithms for portfolio optimization risk minimization in high dimensions, Connections with forward backward stochastic differential equations and PDE's. The workshop will differ from typical conferences in some regards. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and there will be ample time between talks for discussions and for work to be done. The application deadline for funding to participate in this workshop has passed. Go to the American Institute of Mathematics . Return to the AIM Research Conference Center .
Mathematics and Economics: Old Problems and New Approaches
Kantorovich memorial conference. EIMI, St Petersburg, Russia; 8--13 January 2004.
EIMI: Kantorovich Memorial International conference Kantorovich Memorial Mathematics and Economics: Old Problems and New Approaches January 8-13, 2004 EIMI, St Petersburg, RUSSIA Biography of Leonid V. Kantorovich written by Vsevolod L. Kantorovich Leonid V. Kantorovich in pictures designed by Joseph V. Romanovsky Conference Portrait Gallery pictures made by Vladimir F. Demyanov Conference Photo Album pictures made by Elena Novikova and Konstantin Kokhas' SPONSORS AND ORGANIZERS Russian Foundation for Basic Research (RFBR), Hayward R. Alker (John A. McCone Professor of International Relations School of International Relations University of Southern California, Los Angeles), Petersburg Department of Steklov Institute of Mathematics of RAS (POMI RAN), International Euler Mathematical Institute at St. Petersburg (EIMI), St.Petersburg Mathematics Society, Central Institute for Mathematics and Economics of Russian Academy of Science SCIENTIFIC COMMITTEE H. Alker (Los Angeles) L. Faddeev (St. Petersburg) V. Makarov (Moscow) V. Polterovich (Moscow) V. Sergeev (Moscow) A. Vershik (St.Petersburg, Chairman) ORGANIZING COMMITTEE A. Bukhvalov (St.Petersburg) K. Kokhas' (St.Petersburg) E. Novikova (St.Petersburg) V. Pavlov (Moscow) V. Sergeev (Moscow) V. Vasiliev (Novosibirsk) A. Vershik (St.Petersburg, Chairman) The goals of the conference This Conference will be devoted to modern developments in and interconnections of mathematics and economics. Especial attention will be given to the areas that were studied by an outstanding economist and mathematician, a Nobel Prize winner, Leonid Kantorovich. Besides plenary lectures (1 hour) we are planning to organize seminars and round tables on the topics. One such option is "Applications of the Kantorovich-Monge problem in mathematics, economics, and hydrodynamics". We are working on the topics list. Your proposals are very much welcome. If you need a Russian visa, we will provide you with an official invitation needed for visa formalities. Please, fill out the registration form . Since this process requires a certain time, we need this information to be sent not later than November, 20. Final Program Final List of Participants First Announcement First Announcement (in Russian) Second Announcement Poster Email: Contacts: kantorov@pdmi.ras.ru , kpk@kk1437.spb.edu Chairman: vershik@pdmi.ras.ru . Back to the EIMI home-page Back to the Petersburg Department of Steklov Institute of Mathematics
Stochastic Methods in Finance
European Mathematical Society course. Bressanone, Bolzano, Italy; 6--13 July 2003.
Stochastic Methods in Finance Stochastic Methods in Finance Joint course with the European Mathematical Society Cusanus Akademie - Bressanone (Bolzano) - July 6-13, 2003 Course directors: Prof. Marco Frittelli (Univ. di Firenze) marco.frittelli@dmd.unifi.it Prof. Wolfgang Runggaldier (Univ. di Padova) runggal@math.unipd.it Deadline April 20 Informations about course: General info Lodging Course schedule Social Events Lectures: Prof. Kerry Back Univ. of St.Louis Partial and asymmetric information. Lecture notes Abstract Prof. Tomasz Bielecki Northeastern Illinois Univ. Stochastic Methods in Credit Risk Modeling, Valuation and Hedging Lecture notes Abstract Prof. Christian Hipp Univ. of Karlsruhe Financial control methods applied in insurance Abstract Prof. Shige Peng Shandong Univ., China Nonlinear expectations and risk measures. Lecture notes Abstract Prof. Walter Schachermayer Technical Univ. of Vienna Utility Maximization in Incomplete Markets Abstract CIME activity is supported by Ministero degli Affari Esteri - Direzione Generale per la Promozione e la Cooperazione - Ufficio V, UNESCO-ROSTE, M.U.R.S.T. and INdAM
Mathematics of Finance
Joint Summer Research Conference. Snowbird, Utah, USA; 22--26 June 2003.
2003 Joint Summer Research Conference on Mathematics of Finance pop@ams.org 09 04 2003 Mathematics of Finance Sunday, June 22 - Thursday, June 26, 2003 Wendell H. Fleming, Brown University Jean-Pierre Fouque, North Carolina State University George Papanicolaou, Stanford University Bozenna Pasik-Duncan, University of Kansas Stan R. Pliska, University of Illinois at Chicago K. Ronnie Sircar, Princeton University George Yin, Wayne State University (Chair) Qing Zhang, University of Georgia (Cochair) Research in mathematics of finance has witnessed tremendous progress in recent years. The Black-Scholes model and its various extensions for pricing of options have had an influential impact on financial practice and have led to a revolution in the financial industry. The introduction of stochastic analysis and stochastic control techniques has resulted in a number of important advances. To name just a few, these include the study of valuation of contingent claims in complete and incomplete markets, consumption-investment models with or without constraints, portfolio management for institutional investors such as pension funds and banks, and risk assessment and management using financial derivatives. On the other hand, the applications require and stimulate many new and exciting theoretical discoveries. As a rapidly expanding and growing discipline, mathematics of finance involves a wide spectrum of techniques that go far beyond the traditional applied mathematics. Stochastic calculus, dynamic programming, and partial differential equations have become indispensable tools to finance, a discipline that previously relied on "a collection of anecdotes, rules of thumb, and shuffling of accounting data." As a major impetus to the development of financial management and economics, the research in mathematics of finance has had a major impact on the global economy. For instance, using stochastic calculus in the pricing of options has become a standard practice nowadays. It can be anticipated that it will continue to stimulate progress in other areas of mathematics in the years to come. The rapid progress in mathematics of finance has necessitated communication and networking among researchers in different disciplines. To inherit the past and to usher in the future, a Joint Summer Research Conference in mathematics of finance will be sponsored jointly by the AMS, IMS, and SIAM, to be held in June 2003. The main purpose of the proposed conference is to bring together researchers from mathematical sciences, finance, economics, and engineering; to review and update recent advances; and to identify future directions of mathematics of finance. This conference will focus on scientific topics that include but are not limited to valuation of contingent claims and dynamic hedging, consumption-investment models and portfolio management, and risk assessment and management using financial derivatives. Confirmed invited speakers include: M. Avellaneda, T. Bielecki, R. Carmona, P. Carr, M. Davis, T. Duncan, N. El Karoui, R. Elliott, W. H. Fleming, J.-P. Fouque, X. Guo, F. Hanson, U. G. Haussmann, K. Helmes, D. Hernndez-Hernndez, Y. Hu, Y. Kabanov, I. Karatzas, Jin Ma, W. M. McEneaney, T. Pang, G. Papanicolaou, B. Pasik-Duncan, E. Platen, S. R. Pliska, L. C. G. Rogers, W. Runggaldier, M. Rutkowski, S.-J. Sheu, K. R. Sircar, S. E. Shreve, H. M. Soner, J. L. Stein, L. Stettner, R. Stockbridge, S. Stojanovic, M. Taksar, H. Wang, J. W. Wang, J. Westman, D. D. Yao, G. Yin, J. Yong, Th. Zariphopoloulou, Y. Zeng, Q. Zhang, and X. Y. Zhou. Comments: webmaster@ams.org Copyright 2003, American Mathematical Society
Modeling, Optimization, and Risk Management in Finance
Gainesville, FL, USA; 5--7 March 2003.
International Conference on Modeling, Optimization, and Finance ATTENTION: THIS IS A PAST EVENT For new events please follow this link The Conference on "Modeling, Optimization and Risk Management in Finance" will take place on March 5-7, 2003 at the DoubleTree Hotel Conference Center, University of Florida , Gainesville, FL The conference will present state-of-the-art results and latest advances in risk management and finance, including market, credit, and operational risk; algorithms and techniques for portfolio management and optimization; assets and liability management; optimal trading and execution strategies; simulation and optimization approaches to pricing derivatives. The conference will be organized in several sections, including: modern techniques for portfolio management and optimization; theory and practice of risk management; and modeling financial and energy derivatives. The conference is preceded by the Workshop on Integrated Risk-Return Management: New Approaches to Management of Bank Portfolios Foundations and Applications of Innovative Risk Measurement Instruments March 3-4, 2003
Actuarial Science and Finance
2nd Conference. Samos, Greece; 20--22 September 2002.
SAMOS 2002 2nd Conference in Actuarial Science Finance in Samos September 20-22, 2002 UNIVERSITY OF THE AEGEAN Department of Statistics Actuarial Science KATHOLIEKE UNIVERSITEIT LEUVEN UNIVERSITE CATHOLIQUE DE LOUVAIN Department of Applied Economics Institute of Statistics Department of Mathematics
BFS 2002
Bachelier Finance Society, 2nd world congress. Knossos,Crete; 12--15 June 2002.
BFS 2002
Interest Rate Models
Paris, France; 31 May 2002.
Workshop on Interest rate models: theory and implementation (Paris, 31 May 2002) Frontires en Finance has the pleasure of announcing a one-day Workshop on Interest rate models: theory and implementation. Journe Modles de taux d'intrt: thorie et implmentation. Paris, Vendredi 31 Mai 2002. Paris, Friday May 31, 2002 8:30 - 18:00. The aim of this one day workshop is to present a state of the art summary of modeling strategies and numerical methods for interest rate derivatives, with particular emphasis on LIBOR market models and implementation methods, for a public of practitioners and academic researchers. Exposs Talks: Lane HUGHSTON King's College, London. Antoon PELSSER Asset Liability Management, Nationale Nederlanden Econometrics Institute, Erasmus University Using historical and implied covariances in LIBOR market models: an empirical comparison. Rama CONT CNRS - Ecole Polytechnique. Calibration of LIBOR market models: an overview. Alexandre d'Aspremont Stanford University, USA. Calibration of BGM models by semidefinite programming. Lixin WU Department of Mathematics Hong Kong University of Science Technology Optimal Calibration methods for LIBOR market models. Intervenants Speakers : Alexandre d'Aspremont is a PhD candidate at Stanford University. After graduating from Ecole Polytechnique, he worked as a quant in PARIBAS Capital Markets Fixed Income Research team in London. His current research is related to calibration methods for LIBOR and swap market models. Lane HUGHSTON is Professor of Financial Mathematics. He received his D. Phil. in Mathematics from the University of Oxford, where he was a Rhodes Scholar 1972-1976 at Magdalen College. Before joining King's College he was Director of Derivative Product Risk Management at Merrill Lynch, London, where he was responsible for managing the development of pricing and hedging models for interest rate and foreign exchange derivatives, and other products. Before working at Merrill Lynch, he was Head of Far East Trading Research (1988-1991) at Robert Fleming Securities. Prior to that, he was Fellow and Tutor in Applied Mathematics (1980-1987) at Lincoln College, Oxford. His current research interests include: mathematical finance and its applications in an investment banking context; the pricing and risk management of derivative securities; martingale models for interest rate and foreign exchange processes; commodity, credit, equity, energy and inflation derivatives; the impact of transaction costs on derivative prices; stochastic volatility models; and applications of information geometry and stochastic differential geometry. Antoon PELSSER is Manager of the Asset-Liability Matching department of the insurance company Nationale-Nederlanden (a daughter of ING group). The ALM department advises the board of Nationale-Nederlanden on the optimal asset allocation to cover the insurance liabilities. The department is also responsible for the calculation of market values and risk measures of (life-)insurance contracts. He also holds a part-time position as professor of Mathematical Finance at the Econometric Institute at the Erasmus University in Rotterdam. His research interest focuses on pricing models for interest rate derivatives and the application of interest rate derivatives to Asset-Liability Management of insurance contracts. From 1993 until 2000 he worked in the dealing-room of ABN-Amro Bank in Amsterdam, where he was responsible for the development of pricing models for exotic interest rate derivative products. In 1999 his PhD thesis on interest rate derivative models has been awarded the Christiaan Huygens price by the Royal Dutch Academy of Sciences for making a contribution in economics which is of a high academic standard and also has practical application. He has published in several academic journals including Finance and Stochastics, European Journal of Operational Research, Journal of Financial Engineering and the Journal of Derivatives. He is also author of the book Efficient Methods for Valuing Interest Rate Derivatives, published by Springer Verlag. Lixin WU is assistant professor of Mathematics at the Hong University of Science Technology. After undergraduate studies in mathematics at Fudan University ( Shanghai ), he obtained his PhD in mathematics at UCLA in 1992. His research interests include finite difference methods for partial differential equations, numerical methods for American and exotic options and calibration of option pricing models. Inscription Registration: To register, fill out and send us the registration form with your payment or proof of bank transfer before 15 May, 2002. E-mail registration is not accepted. PhD students should include a letter describing their subject of research. Pour vous inscrire, renvoyez le formulaire d'inscription par courrier ou tlcopie avant le 15 Mai 2002. Toute inscription doit tre accompagne du rglement des droits d'inscription. Les bons de commande ne sont pas accepts. Les doctorants et etudiants de 3eme cycle sont pries de joindre a leur demande d'inscription une lettre precisant leur domaine de travail sujet de these. Les inscriptions par courrier lctronique ne sont pas acceptes. Le nombre de participants est limit pour permettre une meilleure interaction entre les exposants et les participants. Tarifs d'inscription Registration fees: Tarifs d'inscription pour la Journe "Methodes statistiques en finance": Workshop Registration fees: Professionels Professionals : 700 Euros. Adhrents de Frontires en Finance : 300 Euros. Doctorants et chercheurs temps plein Academics: 100 Euros. L'inscription comprend: les cours, le djeuner, les pauses caf et les documents de travail (polycopis et livres). Registration includes: lectures, lunch, coffee breaks and documents. Hotel accomodation: Frontiers in Finance does not cater for hotel accomodation of participants, who are kindly requested to make hotel reservations directly. The workshop will be held at Maison des Polytechniciens, 12 rue de Poitiers in the 7th arrondissement of Paris, near Musee d'Orsay. Names and addresses of some other hotels located close to the workshop venue may be found by clicking here or here . Renseignements: For more information contact: libor@frontiers-in-finance.com Pour plus de renseignements, contacter: libor@frontiers-in-finance.com
Global Derivatives 2002
Conference on the latest theoretical and practical insights into the most troublesome derivatives modelling issues. Barcelona, Spain; 15--16 May 2002.
Global Derivatives Risk Management Conference Event Home | ICBI Home | Related Events | Dates Venues | Contact Us | Discounts | Register Industry Feedback Speaking opportunities Sponsorship Exhibiting Attendee breakdown Request a brochure Email this site to a colleague Receive event e-updates The 12th Annual Global Derivatives Risk Management 2006 450+ attendees in 2005! Dates: 9-11 May 2006 Venue: Le Meridien Montparnasse, Paris Cutting-Edge Innovations In Derivatives Pricing, Hedging, Trading Portfolio Management "A unique event - presentations and discussions, both formal and informal never fail to stimulate." Jim Gatheral, Merrill Lynch Telephone Hotline +44 (0)20 7915 5103 Home page | REGISTER | Tell Colleague | Remind Me | Buy Documentation XTmotion London: Website Maintenance Website Management E-Updates If you've not subscribed to ICBI e-updates, click here now to register for your chosen events for FREE!! Just some of the benefits you'll enjoy include: FREE offers, giveaways, competitions and DISCOUNT opportunities exclusive to you as an ICBI e-update subscriber earliest possible notification of event programmes relevant to you as they go on-line latest updates on the events, including the latest programmes and speaker line-ups priority notification of NEW events relevant to you FREE documentation downloads, white papers, industry news and event reviews Click here now to enjoy the exclusive benefits on offer to ICBI e-update subscribers! CLOSE
Financial Mathematics
A 6-month research programme at the Isaac Newton Institute for Mathematical Sciences, University of Cambridge, January to June, 1995.
INI Programme FIN Institute Home Page Programmes Web-Seminars Isaac Newton Institute for Mathematical Sciences Financial Mathematics 1 Jan - 30 Jun 1995 Organisers: MHA Davis (Imperial), SD Hodges (Warwick), I Karatzas (Columbia), LCG Rogers (Bath) Programme theme The programme will comprise visits by many leading academics from the various subjects nowadays involved in the theory and practice of finance, and visits by interested practitioners. There will be two full-scale meetings during the 6 months, the first (supported by the EC) at the beginning of January, designed to introduce themes from mathematical finance to those who have not previously specialised in it, and the second (supported by the Bank of England) in May-June, to present recent developments in the subject. Besides this, there will be a practitioners' workshop at the end of March, and a range of one- or two-week special emphases on specific topics, where attention will be focused on specific problems. Running throughout the six months there will be seminar afternoons on Fridays, approximately once every fortnight. But the most unusual and exciting feature of the programmes at the Newton Institute is that for a prolonged period, many of the world's top people in the subject will be gathered together and interacting, discussing and hopefully solving problems, holding seminars, and generally advancing understanding of the whole area. Meetings and special emphasis January 4--10 Introductory Meeting: Mathematical Finance: Stewart Hodges February 8 LMS Spitalfields Day: Recent Developments in Financial Mathematics: Chris Rogers March 6--10 Relations Between Finance and Insurance: Mark Davis, Paul Embrechts and Helyette Geman March 12--24 Optimal Portfolios Special Emphasis: Ioannis Karatzas (ik@stat.columbia.edu) March 25--31 Practitioners' Workshop: Sam Howison (howison@vax.ox.ac.uk) and Paul Wilmott April 10--14 Numerical Methods Special Emphasis: Alain Bensoussan, Denis Talay (Denis.Talay@sophia.inria.fr), and Agnes Sulem May 1--5 Financial Econometrics and Stochastic Volatility: Andrew Harvey (harveya@vax.lse.ac.uk) May 8--13 World Wide Security Market Anomalies Special Emphasis: Bill Ziemba (william.ziemba@commerce.ubc.ca) May 15--20 World Wide Asset Allocation Special Emphasis: Bill Ziemba (william.ziemba@commerce.ubc.ca) May 21--June 3 Mathematics of Finance: Models, Theories and Computation: Michael Dempster (mahd@essex.ac.uk) June 6--9 Market Imperfections and Differential Information: Stan Pliska (s.r.pliska@newton.cam.ac.uk) and Pete Kyle June 12--16 Term Structure of Interest Rates: Darrell Duffie (duffie@baht.stanford.edu) Professor Stan Pliska has been offered and has accepted a Prudential Distinguished Visiting Fellowship and will be in Cambridge for the whole programme. Participation The following are expected to participate in the programme: K Aase, Y Ait-Sahalia, P Artzner, S Babbs, A Bensoussan, A Bick, T Bjork, P P Boyle, M Bray, M Brennan, H Buhlmann, A Cadenillas, T M Cover, M Crouhy, J Cvitanic, A Dassios, M Davis, F Delbaen, M Dempster, J Detemple, J-C Duan, D Duffie, D Dufresne, B Dumas, P Dybvig, E Eberlein, R J Elliott, P Embrechts, L P Foldes, H Follmer, H Geman, E Ghysels, G S Goodman, P Gottardi, C Gourieroux, F Hahn, A Harvey, D Heath, D G Hobson, S D Hodges, S D Howison, G Huberman, S Jacka, I Karatzas, T Kariya, D Kennedy, P E Kopp, R Korn, D Kramkov, P Kyle, P Lakner, D Lamberton, B Lapeyre, J P Lehoczky, D Lovatt, T Lyons, D B Madan, A Melino, A V Melnikov, M Musiela, A Neuberger, B Oksendal, W Perraudin, E Platen, S Pliska, S Rady, E Renault, H R Richardson, G Roberts, L C G Rogers, W Runggaldier, S E Satchell, W Schachermeyer, J Scheinkman, M Schweizer, L O Scott, M J P Selby, H Shirakawa, A Shiryaev, S Shreve, J Steeley, C Stricker, A Sulem, S M Sundaresan, E Tabakis, D Talay, M Taqqu, S J Taylor, J Vecer, T Vorst, N Webber, W Willinger, P Wilmott, W Zame, T Zariphopoulou, W T Ziemba.
Computational Issues in Game Theory and Mechanism Design
DIMACS Center, Rutgers University, Piscataway, NJ, USA; 31 October -- 2 November 2001.
DIMACS Workshop on Computational Issues in Game Theory and Mechanism Design DIMACS Workshop on Computational Issues in Game Theory and Mechanism Design October 31 - November 2, 2001 DIMACS Center, Rutgers University, Piscataway Organizers: Vijay Vazirani , Georgia Tech, vazirani@cc.gatech.edu Noam Nisan, Hebrew University, Jerusalem, Israel, noam@cs.huji.ac.il Presented under the auspices of Next Generation Networks Technologies and Applications and Social Science Methods and Information Technology. Workshop Announcement Call for Participation Program Papers and Slides Registration Form Our funding agencies require that we charge a registration fee during the course of the workshop. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable). Fees are $40 per person per day for faculty, researchers and "other", and $5 per person per day for postdocs. However, the registration fee is waived for undergraduate students, graduate students, DIMACS postdocs and DIMACS long-term visitors who are in residence at DIMACS. The registration fees for employees of DIMACS partner institutions are waived as well. DIMACS partner institutions are: Rutgers University, Princeton University, ATT Labs - Research, Bell Labs, NEC Research Institute and Telcordia Technologies. Information on Accommodations Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the workshop. Please park in lot 64 located between the CoRE Building and the Werblin Recreation Center. Important Reimbursement Information Attendees who have been offered support should keep two rules in mind. Reimbursement for air travel can only be made for travel on US Flag Carriers, REGARDLESS OF COST. (For example, travel on airlines such as United, Continental, USAir, and others that are United States based are allowable. Travel on airlines such as Lufthansa, SAS, Air Canada and other airlines based outside the US cannot be reimbursed by DIMACS.) The second rule to keep in mind is to get original receipts for all reimbursable expenses. Other Workshops DIMACS Homepage Contacting the Center Document last modified on October 17, 2001.
Managing Uncertainty - New Analysis Tools for Insurance, Economics and Finance
Isaac Newton Institute for Mathematical Sciences, Cambridge; 23 July to 10 August 2001.
INI Programme MUC Institute Home Page Programmes Web-Seminars Programme Home Seminars Full list Workshops Participants Long Stay Short Stay Additional Links Contacts Mailing List Isaac Newton Institute for Mathematical Sciences Managing Uncertainty 23 Jul--10 Aug 2001 Organisers: Professor P Embrechts (Zurich), Dr WJ Fitzgerald (Cambridge), Dr DJ Goodman (British Antartic Survey), Professor RL Smith (North Carolina) Programme theme Corporations and governments are making risk decisions based on perceptions of extreme values. Frequently these decisions are taken with an inadequate framework for handling low probability, high severity events drawn from non-stationary time series. These problems are very diverse and range from analysis of the stability of the UK economy, corporate governance issues, to the reinsurance purchase of a major insurer. Forecasts of future events must take into account possible changes in the structure of the underlying time series, including the possible impact of global changes in the environment. This Short Programme will bring together mathematicians, statisticians, economists and environmental scientists who specialise in the analysis of financial, economic and environmental data. Particular attention is paid to mathematical models and statistical prediction tools for extreme events, and for nonstationarity. Specific problems include the estimation of Value at Risk in nonstationary time series, the development of alternative "measures of risk", incorporation of model uncertainty into statistical calculations, and the extensions of multivariate time series. During the Programme there will be five one day workshops to bring additional participants to the Programme with practical problems to which the tools under investigation can be applied. The workshops will be on the application of extreme value methods and nonstationary analysis tools to insurance, financial risk, economic risk, environmental risk and in corporate governance.
Applications of Levy Processes in Financial Mathematics
EURANDOM, Eindhoven, the Netherlands; 22--23 June 2001.
APPLICATIONS OF LVY PROCESSES IN FINANCIAL MATHEMATICS EURANDOM, Eindhoven, The Netherlands June 22 and 23, 2001 Programme Abstracts| Speakers Participants | Registration | Practical Information The idea of this meeting is to gather researchers (both academic and industrial) concerned with mathematical modeling of financial markets and to present recent developments in the field which make use of a class of stochastic processes known as Lvy processes. Special attention will be given to pricing and hedging of financial options, modeling term structure, particular models in theory and practice, and the modeling of volatility in the markets. The meeting will be concluded with a round table discussion. This discussion will focus on summarizing new directions that have been pursued in recent years and formulating important issues for the future as far as the finance industry is concerned. Financial mathematics has recently enjoyed considerable prestige on account of its impact on the finance industry. In parallel, the theory of Lvy processes has also seen exciting developments in recent years. The fusion of these two fields of mathematics has provided new applied modeling perspectives within the context of finance and further stimulus for deep and intrinsically interesting problems within the context of Lvy processes. The proposed workshop will bring together experts in the field (both academic and industrial) with a view to further cross-fertilization of ideas as well as clarifying future research directions that are relevant to the finance industry. Programme Abstracts Friday, 22 June 2001 Shuttle from the hotel will depart at 9.15 am. Time Speaker Title 09.00-09.50 Registration 09.50-10.00 W. Senden C. de Vries Welcome Chairman Casper de Vries 10.00-10.45 R. Doney Introduction Course 10.45-11.00 Break 11.00-11.35 O.E. Barndorff-Nielsen Some recent developments in OU-based stochastic volatility modelling 11.35-12.10 E. Nicolata Derivative asset analysis in stochastic volatility models based on Lvy driven Ornstein-Uhlenbeck processes 12.00-12.45 W. Schoutens The Meixner Process 12.45-14.00 Lunch Chairman Wim Schoutens 14.00-14.35 D. Madan Stochastic Volatility for Lvy Processes 14.35-15.10 D. Nualart Backward stochastic differential equations driven by Lvy processes 15.10-15.45 L. Nguyen-Ngoc Wiener-Hopf factorization and pricing exotic options with Lvy processes 15.45-16.15 Break 16.15-16.50 J.L. Sol On Lvy processes, Malliavin calculus and market models with jumps 16.50-17.25 M. Yor On perpetuities associated with exponentials of subordinators 19.00 Conference Dinner Saturday, 23 June 2001 Shuttle from the hotel will depart at 8.30 am. Time Speaker Title Chairman Andreas Kyprianou 09.00-09.35 E. Eberlein Application of generalized hyperbolic Lvy motions to finance 09.35-10.10 S. Raible The Lvy measure and option pricing 10.10-10.45 M. Studer Stochastic Taylor expansion for Poisson processes and Applications towards Risk Management 10.45-11.15 Break 11.15-11.50 R. Cont cancelled Implied volatility surfaces in financial models based on Lvy processes 11.50-12.25 F. Avram The Russian option under spectrally one sided exponential Lvy models 12.30-13.15 Lunch Chairman John Einmahl 13.15-13.50 T. Mikosch Stable limits for explosive Poisson shot noise processes 13.50-14.25 Ph. Balland On the Necessity of Lvy Models in Modern Finance 14.30-15.55 Round Table Discussion (led by T. Mikosch) 15.55-16.00 J. Einmahl Closing Speakers and their affiliations Hotel Arrival Departure Hotel Arrival Departure 1 Avram Florin Heriot-Watt University, Edinburgh f.avram@ma.hw.ac.uk PZ 21 25 2 Balland Phillipe Merill Lynch, Londen ballaphi@exchange.uk.ml.com PZ 21 23 3 Barndorff-Nielsen Ole arhus University oebn@imf.au.dk PZ 21 23 4 Cont Rama CNRS Ecole Polytechnique rama.cont@polytechnique.fr PZ 21 24 5 Doney Ron University of Manchester rad@maths.man.ac.uk PZ 21 24 6 Eberlein Ernst Universitt Freiburg eberlein@neyman.mathematik.uni-freiburg.de PZ 21 23 7 Madan Dilip University of Maryland dmadan@rhsmith.umd.edu PZ 21 24 8 Mikosch Thomas Kopenhagen University mikosch@math.ku.dk PZ 21 24 9 Nualart David Universitat de Barcelona nualart@mat.ub.es PZ 21 23 10 Nicolato Elisa Aarhus University, Denmark elisa@imf.au.dk PZ 21 24 11 Nguyen Laurent Deutsche Bank, Londen lolnguyen@hotmail.com PZ 21 24 12 Raible Sebastian Insiders Financial Solutions, Mainz s.raible@insiders-fs.com PZ 21 23 13 Schoutens Wim K.U. Leuven wim.schoutens@wis.kuleuven.ac.be PZ 22 23 14 Sol Josep Lluis Universitat Autonoma jllsole@mat.uab.es PZ 21 24 15 Studer Michael ETH Zrich studerm@math.ethz.ch PZ 21 24 16 Yor Marc Universit de Paris VI none PZ 22 23 Participants Hotel Arrival Departure Hotel Arrival Departure 1 Anderluh Jasper Delft University of Technology j.h.m.anderluh@its.tudelft.nl - 22 23 2 Alink Stan KUN alink@sci.kun.nl - 22 23 3 Berridge Steffan Tilburg University s.j.berridge@kub.nl - 22 23 4 Balkema Guus University of Amsterdam guus@science.uva.nl - 22 23 5 Boguslavskaya Elena University of Amsterdam elena@science.uva.nl - 22 23 6 Boguslavsky Michael Fortis Bank GSLA michael.Boguslavsky@nl.fortisbank.com - 22 23 7 Buchmann Boris TU Mnchen bbuchde@yahoo.de PZ 21 24 8 Campi Luciano Univerist Paris IV lcampi@proba.jussieu.fr Royal 21 23 9 Cartea Alvaro University of Oxford cartea@maths.ox.ac.uk PZ 21 23 10 Drost Feike CentER, Tilburg University f.c.drost@kub.nl - 22 23 11 Dupont Dominique EURANDOM, Eindhoven dupont@eurandom.tue.nl - 22 23 12 Einmahl John EURANDOM Eindhoven University of Technology einmahl@eurandom.tue.nl - 22 23 13 Emmer Suzanne TU Mnchen emmer@mathematik.tu-muenchen.de PZ 21 24 14 Ermakov Alexei Fortis Bank alexei.ermakov@nl.fortisbank.nl - 22 - 15 Ferreira Anna EURANDOM, Eindhoven ferreira@eurandom.tue.nl - 22 23 16 Frijns Bart Maastricht University b.frijns@berfin.unimaas.nl - 22 22 17 Haas Marcus Ceasar Bonn haas@caesar.de Royal 21 23 18 Hendriks Harrie KU Nijmegen hhendr@sci.kun.nl - 22 23 19 Hoogland Jiri CWI jiri@cwi.nl - 22 22 20 Jongbloed Geurt VU Amsterdam geurt@cs.vu.nl - 22 23 21 Khamaladze Estate School of Mathematics, UNSW, Sydney estate@unsw.edu.au PZ 18 24 22 Keijzers Micha KU Nijmegen keyzers@sci.kun.nl - 22 23 23 Kerkhof Jeroen Tilburg University f.l.j.kerkhof@kub.nl - 22 23 24 Klein Haneveld Leo VU Amsterdam doklein@science.uva.nl - 22 23 25 Khn Christoph TU Mnchen kuehn@ma.tum.de PZ 21 24 26 Kyprianou Andreas University of Utrecht kypriano@math.uu.nl PZ 22 23 27 Kunz Andreas TU Mnchen kunz@ma.tu.de PZ 21 24 28 Lehnert Thorsten Maastricht University t.lehnert@berfin.unimaas.nl - 22 23 29 Lin Tao Erasmus University Rotterdam lin@few.eur.nl - 22 23 30 Maller Ross University Western Australia rmaller@kroner.ecel.uwa.edu.au PZ 21 24 31 Mandal Pranab EURANDOM, Eindhoven mandal@eurandom.tue.nl - 22 23 32 Meulen van der Frank Vrije Universiteit Amsterdam meulen@cs.vu.nl - 22 23 33 Mushkudiani Nino Eindhove University of Technology n.a.mushkudiani@tue.nl - 22 23 34 Nguyen Tran Trong University of Twente t.t.nguyen@math.utwente.nl - 22 23 35 Peccati Giovanni Universit de Paris VI gpeccati@proba.jussieu.fr Royal 21 23 36 Peters Remco University of Amsterdam remco@science.uva.nl - 22 23 37 Pistorius Martijn University of Utrecht pistorius@math.uu.nl - 22 23 38 Sbuelz Alessandro Tilburg University a.sbuelz@kub.nl - 22 23 39 Schumacher Hans Tilburg Unversity jms@kub.nl - 22 23 40 Segers Johan K.U. Leuven johan.segers@wis.kuleuven.ac.be PZ 22 23 41 Shelton David Merill Lynch London sheltdav@exchange.uk.ml.com Royal 21 23 42 Sinha Ashoke Kumar Tilburg University a.k.sinha@kub.nl - 22 23 43 Schneegans Joachim IKB-Deutsche Industriebank joachim.schneegans@ikb.de Royal 22 23 44 Spreij Peter University of Amsterdam spreij@science.uva.nl - 22 22 45 Steutel Fred Eindhoven University of Technology steutel@win.tue.nl - 22 22 46 Arta Surya Budhi University of Twente b.a.surya@math.utwente.nl - 22 23 47 Ta Thi Kieu An MRI A.t.t.kieu@math.utwente.nl - 22 23 48 Yassai Sadr Universit de Paris VI syassai@ccr.jussieu.fr Royal 21 23 49 Verschuere Michel K.U. Leuven michel.verschuere@fys.kuleuven.ac.be PZ 22 23 50 Vives Josep Universitat Autonoma de Barcelona vives@mat.uab.es Royal 21 23 51 Vries, de Casper EURANDOM Erasmus University Rotterdam cdevries@few.eur.nl PZ 22 23 52 Weide van der Hans Technical University Delft j.a.m.vanderweide@its.tudelft.nl - 22 23 53 Werker Bas Tilburg University werker@tilburguniversity.nl - 22 23 54 Zuilen van Martien KUN zuijlen@sci.kun.nl Royal 22 23 Registration Please register by filling in the form . PRACTICAL INFORMATION Travel location Eurandom is located on the campus of Eindhoven University of Technology , in the `Laplacegebouw' building. More information about location , including travel possibilities. The university is located at 10 minutes walking distance from Eindhoven railway station (take the entrance north side and walk towards the tall building on the right with the sign TU e. For those arriving by plane, there is a convenient train connection between Amsterdam Schiphol airport and Eindhoven, with only one change at Duivendrecht. This trip will take about an hour and a half. For more detailed information, please consult the NS travel information pages. Hotel For invited speakers we booked a room in Hotel Parkzicht, Alb. Thijmlaan 18, 5615 EB Eindhoven, The Netherlands, phone +31 40-2114100 (fax. +31 40 2114100). Please contact congressoffice@tue.nl for your arrival and departure date. For contributed speakers and participants we made a preliminary group reservation in the above mentioned hotel and in Hotel Royal (Stratumsedijk 23f, 5611 NA, Eindhoven, phone +31 40-2121330). Special price for both is approx. NLG 125,- (incl. breakfast). If you want us to book a room please indicate this on the registration form . Do so as soon as possible, since the number of rooms is restricted. For those who booked a hotel through EURANDOM a shuttle will drive from the hotels to EURANDOM in the morning. For private bookings we suggest to consult the web pages of the Tourist Information Eindhoven , Postbus 7, 5600 AA Eindhoven. Organizers: J. Einmahl (Eindhoven University of Technology EURANDOM, NL), C. de Vries (Erasmus University Rotterdam EURANDOM, NL), W. Schoutens (Catholic University Leuven, Belgium), A. Kyprianou (University of Utrecht, NL) This workshop is sponsored by NWO and EURANDOM Back to homepage Last update 17 09 01
Advanced Computing in the Financial Market (ACFM 2001)
The purpose of this symposium is to bring together leading researchers and interested practitioners in all fields of computational methods and finance. Submissions are especially encouraged in the areas of derivative pricing, risk management, as well as exchange rate and interest rate modeling. Papers that provide new methodologies and techniques or enhance our understanding of existing methods are particularly welcome. Part of the International ICSC Congress on Computational Intelligence: Methods and Applications (CIMA'2001). Bangor, Wales, UK; 19-22 June 2001.
Call For Papers Advanced Computing in the Financial Market Organizer: Christian Haefke , UPF Vice-Chair: Ypke Hiemstra, VU The purpose of this symposium is to bring together leading researchers and interested practitioners in all fields of computational methods and finance. Submissions are especially encouraged in the areas of derivative pricing, risk management, as well as exchange rate and interest rate modeling. Papers that provide new methodologies and techniques or enhance our understanding of existing methods are particularly welcome. Topics (not limited to:) Application areas:* Asset Valuation and Trading* Corporate Distress* Currency Models* Derivatives:* Hedging Strategies* Pricing* Portfolio Management* Retail Finance* Risk Management* Tactical Asset Allocation* Term Structure Models Methodologies:* Adaptive Kalman Filtering Techniques* Automated Reasoning* Classification* Context Free Languages* Econometrics of High Frequency Data* Extreme Value Statistics* Fuzzy Systems and Rough Sets* Genetic Algorithms and Genetic Programming* Global Optimization* Hypothesis Testing and Confidence Intervals* Intelligent Trading Agents* Model Identification, Selection and Specification* Neural Networks and Machine Learning* Probabilistic Modeling Inference* Resampling and Monte Carlo Methods* Robust Model Estimation* Time Series Analysis International Program Committee (ACFM'2001) Ait-Sahalia Y., Princeton University, USA Bollerslev T., Duke University, USA Colemann T., Cornell University, USA Dacorogna M. M., Olsen Associates, Switzerland Dawid H., U of Southern California, USA Gottschling A., Euroquants Consulting, Germany Haerdle W., Humboldt University, Germany Hiemstra Y., Vrije Universiteit Amsterdam, Netherlands Hussain, A., University of Stirling, Scotland, U.K. Hyung N., Tinbergen Institute Rotterdam, Netherlands Kamstra, Mark, Simon Fraser University, Canada Korczak J., Universit Louis Pasteur, France Lehmann B., IRPS, University of California at San Diego, USA Manganelli S., European Central Bank, Frankfurt, Germany Moody J., Oregon Graduate Inst., USA O'Leary D., University of Southern California, USA Politis D., UC San Diego, USA Poon S., University of Strathclyde, Scotland, U.K. Rockinger M., HEC School of Finance, France Skalak D., IBM Data Mining and Analytics Group, USA Soni T., SBS Technologies, USA Tauchen G., Duke University, USA Tzavalis E., Queen Mary Westfield College, U.K. KEYNOTE SPEAKER Wolfgang Haerdle: Quantlets for (Financial) Risk Management SUBMISSION OF PAPERS Prospective authors are requested to send an extended abstract or a draft paper of maximum 7 pages for review by the International Program Committee to Christian Haefke . All submissions must be written in English. The submissions should include: - Title of symposium (ACFM 2001) - Preferred type of the paper (oral poster)- Title of proposed paper- Authors names, affiliations, addresses- Name of author to contact for correspondence- E-mail address and fax number of the contact author- Topics which best describe the paper (max 7 keywords) CALL FOR WORKSHOPS TUTORIALS A workshop tutorial should focus on a particular topic, and consist of several presentations and open discussions. The proposal for a workshop tutorial should include the title, topics covered, proposed speakers, targeted audiences, and estimated length (hours) of the workshop tutorial. The proposal should be submitted either to the congress chair, the corresponding symposium chair or the congress organizer by January 15, 2001. CALL FOR INVITED SESSIONS Proposals for invited sessions are encouraged. A session proposal consists of 4-5 invited papers, the recommended session-chair and co-chair, as well as a short statement describing the title and the purpose of the session. The organizer should send the proposal to the respective symposium chair or the congress organizer. Invited sessions should preferably start with a tutorial paper. The organizer will be responsible for the review of the papers in the session. The registration fee of the session organizer will be waived, if at least 4 authors of invited papers register to the conference. Proceedings and Publications Proceedings will be available at the congress. All accepted and invited papers (oral and poster presentations) will be included in the proceedings, published in print and on CD-ROM by ICSC Academic Press, Canada Switzerland. Extended versions of selected papers can be considered for possible publication in special issues of leading international journals. Important Dates Extended Abstract Submission December 15, 2000 Notification of Acceptance December 31, 2000 Delivery of Full Papers March 1, 2001 CIMA'2001 International Congress June 19 - 22, 2001 Further Information Please contact: Christian Haefke Universitat Pompeu Fabra Department of Economics and Business Ramon Trias Fargas 25-27 E-08005 Barcelona, Spain E-mail: christian.haefke@econ.upf.es Phone: +34 542 2706 Fax: +34 542 1746 or the conference webpage .
Summer School on Stochastics and Finance
Institute of Mathematics at the University of Barcelona (IMUB), Spain; 3--7 September 2001.
SUMMER SCHOOL ON STOCHASTIC AND FINANCE SECOND ANNOUNCEMENT SUMMER SCHOOL ON STOCHASTICS AND FINANCE September 3-7 2001 Mathematical Finance is a field that has been rapidly growing in different directions. The purpose of this advanced course is to provide a forum to people interested in the recent developments of the theory. The main focuses of the course will be on hedging and modelling. This advanced course will have two main series of 5 one hour and a half lectures. The first course will be on "Recent Developments in Hedging", by Prof. I Prof. Ioannis Karatzas, Eugene Higgins Professor of Applied Probability Department of Mathematics Department of Statistics Columbia University http: www.stat.columbia.edu ~ik 1) Introductory Lecture: Models, Basic Problems, Black-Scholes 2) Hedging under Constraints: European Contingent Claims 3) Hedging under Constraints: American Contingent Claims 4) Problems of Partial Hedging and Hypothesis Testing 5) Least-Squares Approximation of Random Variables by Stochastic Integrals; The second course will be on "Change of time and change of measures with applications to the modelling in financial economics" by Prof. Albert N. Shiryaev Steklov Mathematical Institute Moscow, http: www.ras.ru local.docs mian statstoch.html The contents of the course will be 1-2) Time change: basic definitions, constructions, properties, change-time representations of the processes X in strong (X=YoT, a.s) and weak (X=YoT, in law) senses, via "simple" processes Y (Brownian motion, Lvy processes,...) and a change of time T. 2-3) Time change and integral representations: strong representations of the local martingales and weak representations (X=HB+W*(p-q) with a Brownian motion and a Poisson measure). 3-4) Integral transformations Xf = fX of semimartingales and change of measures: cumulant function Kf and a triplet (Bf, Cf, vf) of the processes Xf; Girsanov's theorems, Esscher's type change of measures. 4-5) Applicattions to the modelling in the financial economics: conditions of the absence of arbitrage, stochastic volatility models; innovation, devolatilization, filtering, statistical problems in the analysis of the financial data. There will also be two other smaller short courses as follows: Lvy systems in Finance Prof. Dilip Madan University of Maryland at College Park College of Business and Management, http: alexandra.bmgt.umd.edu ~dmadan Slides: 1 , 2 , 3 Asset Prices are Brownian motion: only in Business Time Purely Discontinuous Asset Price Processes Stochastic Volatility for Lvy Processes Option Valuation Using the Fast Fourier Transform Optimal Investment in Derivative Securities The Variance Gamma Process and Option Pricing Levy based dynamic models for financial economics. Prof. Ole E. Barndorff-Nielsen Aarhus University Department of Mathematical Sciences http: www.imf.au.dk ~oebn
DELPHI 2001
International Conference on the Econometrics of Financial Markets organised by Athens University of Economics and Business. Delphi, Greece; 22--25 May 2001.
International Conference DELPHI 2001 ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS Department of International and European Economic Studies International Conference on the Econometrics of Financial Markets Athens University of Economics and Business (AUEB) Department of International and European Economic Studies, Athens, Greece Invited Speakers: R. Baillie (Michigan University University of London) R. Garcia (University of Montreal) E. Jacquier (Boston College) K. Juselius (European University Institute) E. Renault (University of Montreal) E. Sentana (Centro de Estudios Monetarios y Financieros) E. Tzavalis (University of London) Delphi, May 22-25 2001 URL: http: www.aueb.gr deos In_Eng.htm AUTHOR REGISTRATION FEES The registration fee is GRD 60,000 (approximately USD 150.00) for each participant. This fee covers accommodation, full board at the European Cultural Centre of Delphi and transportation. To avoid a bank collection charge, all foreign cheques should be drawn on a Greek bank and payable in Greek drachmas. Registration fees are not refundable. CONDITIONAL PROGRAM REGISTRATION FORM CONTACT Dr. Antonis Demos E-mail: demos@aueb.gr Dr. Dimitris Georgoutsos E-mail: d.georgoutsos@aueb.gr Athens University of Economics and Business Department of International and European Economic Studies 76 Patission Street Athens, 104 34 Greece
Mathematical Finance
Blackwells. Contents, abstracts: text to subscribers only.
Blackwell Publishing Home Page Partnerships in learning, research and professional practice. Books Journals Subject Index Search E-mail Alerting About Blackwell The Librarian Site Press Room Contact Information Career Opportunities Site Index Privacy Policy Blackwell Synergy Copyright 2004 Blackwell Publishing
Insurance: Mathematics and Economics
Elsevier Science Journal. Contents and abstracts from vol.9 (1990). Full text to subscribers.
Elsevier.com This site requires scripting to be enabled in your browser. Please change your Internet Options, then click here to go to our home page.
International Game Theory Review
Contents and abstracts from vol.1 no.2 (1999). Text to institutional subscribers.
International Game Theory Review (IGTR) News | New Journals | Browse Journals | Search | For Authors | How To Order Contact Us | Free Table of Contents Email Updates | Download Acrobat Reader | Promotions Advertising Enquiries | Journal Prices Home Journals by Subject Mathematics Economics, Finance and Management International Game Theory Review (IGTR) Aims Scope Rapid developments in technology, communication, industrial organization, economic integration, political reforms and international trade have made it increasingly imperative to recognize the causes and effects of strategic interdependencies and interactions. A strategic approach to decision-making is crucial in areas such as trade negotiations, foreign and domestic investments, capital accumulation, pollution control, market integration, regional cooperation, development and implementation of new technology, arms control, international resource extraction, network sharing, and competitive marketing. More ... News Watch this space for news on IGTR. Feature Articles (Free Online Sample Issue) Vol. 6, No. 2 (June 2004) Newtonian Mechanics and Nash Play S. D. Flm and J. Morgan Formalization of Multi-Level Games Kjell Hausken and Ross Cressman Geometry and Computation of the Lorenz Set Javier Arin, Jeroen Kuipers and Dries Vermeulen The Weighted Core with Distinguished Coalitions M. Cantisani and E. Marchi The Forgiving Trigger Strategy: An Alternative to the Trigger Strategy M. Aramendia, L. Ruiz and F. Valenciano Bargaining Model with Sequences of Discount Rates and Bargaining Costs Agnieszka Rusinowska Technical Note: Nontransferable Individual Payoffs in Cooperative Stochastic Differential Games David W. K. Yeung Book Review Book Review: Differential Games in Marketing. By Steffen Jrgensen and Georges Zaccour Simon Pierre Sigu Forthcoming Papers Please watch this space for forthcoming papers. Current Issue | Journal Archive About IGTR: Aims Scope | Editorial Board | Contact IGTR | Recommend This Journal | Abstracting Indexing | Top Accessed Articles How To Order: Order Information | Sales Contact | Price Information | Request for Complimentary Print Copy | Dispatch Dates For Authors: Guidelines for Contributors | Online Submission For Librarians: Hosting Service Providers ISSN: 0219-1989 Current Issue Journal Archive Search this Journal Free Email Updates on Table of Contents About IGTR Aims Scope Editorial Board Contact IGTR Recommend This Journal Abstracting Indexing Top Accessed Articles How To Order Order Information Sales Contact Price Information Request for Complimentary Print Copy Dispatch Dates For Authors Guidelines for Contributors Online Submission For Librarians Hosting Service Providers Related Journals International Journal of Theoretical and Applied Finance (IJTAF) International Journal of Information Technology and Decision Making (IJITDM) Related Books An Inframarginal Approach to Trade Theory Uniting Europe Differential Equations, Bifurcations, and Chaos in Economics Quantitative Methods for Assessing the Effects of Non-Tariff Measures and Trade Facilitation Readings in the Economics of the Division of Labor Theory of Valuation Related Links Economics books Economics, Finance and Management Journals Terms and Conditions | About World Scientific Journals | World Scientific Bookshop World Scientific Home | WorldSciNet Archives World Scientific is a Member of CrossRef Copyright 2005 World Scientific Publishing Co. All rights reserved.
Applied Mathematical Finance
(Routledge) Tables of contents of all volumes. Abstracts from vol.4 (1997). Full text to subscribers.
A Routledge Journal: Applied Mathematical Finance Contact Us Members of the Group All Products Books Journal Article eBooks Alphabetical Listing Journals by Subject New Journals Advertising Commercial Opportunities Copyright Transfer FAQs Customer Services Email Contents Alerting eUPDATES Instructions for Authors Online Information Online Sample Copies Permissions Press Releases Price List Publish with Us Reprints Subscription Information Special Issues Special Offers Webfirst Arenas Preview LibSite Books eBooks Applied Mathematical Finance Editors-in-Chief: Dr Ben Hambly, Mathematical Institute, 24--29 St Giles', Oxford OX1 3LB, UK Dr William Shaw, Mathematical Institute, 24--29 St Giles', Oxford OX1 3LB, UK Email: amf@maths.ox.ac.uk Editorial Information Publication Details: Volume 12, 2005, 4 issues per year ISSN 1350-486X 2005 Subscription Rates Subscribe Online! Institutional: US$934 562 Individual: US$124 75 Taylor Francis is a member of CrossRef SARA (Free contents alerting service) Online Sample Copy Visit the Science Arena! Visit the Business Management Arena! Special Issue: Financial Planning in a Dynamical Setting Instructions for Authors Table of Contents (Volumes 1-3) Table of Contents (Available Online from Volume 4) Aims and Scope: The journal encourages the confident use of applied mathematics and mathematical modelling in finance. The journal publishes papers on the following: modelling of financial and economic primitives (interest rates, asset prices etc); modelling market behaviour; modelling market imperfections; pricing of financial derivative securities; hedging strategies; numerical methods; financial engineering. The journal encourages communication between finance practitioners, academics and applied mathematicians. Both theoretical and empirical research welcomed, as are papers on emerging areas of mathematical finance and interdisciplinary topics. The journal seeks papers reviewing the development of significant practical tools, algorithms and new products.The modelling or solution of problems should demonstrate the capacity for generalization. Original and substantial pieces of research resulting in open problems are welcome; this will also be a forum for the airing of new problems and new areas of activity. All papers are independently peer-reviewed. Abstracting Information: Applied Mathematical Finance is currently abstracted and indexed in IBZ (International Bibliography of Periodical Literature), Journal of Economic Literature (Econlit), Finance Literature Index, EBSCO (Business Source Corporate, Business Source Elite, Business Source Premier, TOC Premier), OCLC ArticleFirst Database, OCLC FirstSearch Electronic Collections Online, Zentralblatt Math top Copyright 2005 Taylor Francis Group, an informa business Privacy Policy Terms and Conditions
Journal of Mathematical Economics
Elsevier. Contents, abstracts from vol.19 (1990). Full text to subscribers.
Elsevier.nl - De pagina kan niet worden weergegeven donderdag 17 november 2005 17:37 ZOEKEN Op deze site Op internet Home Help Sitemap Log in Abonneer Maak Elsevier mijn startpagina DE ZEDENMEESTER Mag seks buiten het huwelijk... Ga naar weblog Nieuws Nederland Politiek Europese Unie Buitenland Economie Wetenschap Cultuur Televisie Sport Society Internet Gadgets Laatste 24 uur Opinie Commentaren Leon de Winter De Zedenmeester Brussels Blog Essays Reacties Onderzoeken Beste woon- gemeenten Studie en werk Beste Scholen Elsevier Webgids Test uw kansen Veiligste gemeenten Wie verdient wat? Beste studies 2005 Persoonlijk Gezondheid Gezin Carrire Geld Eten Uitgaan Mode Wonen Auto Reizen Extra Relatie Auto kopen Hotels Shopping Routeplanner American Express Service Elsevier op uw website of weblog Digitaal Archief RSS Nieuwsflitser Nieuwsbrieven Help Weekblad Deze week Abonneren Adres wijzigen Nabestellen Expat service Over Elsevier Veelgestelde vragen Contact Elsevier THEMA Redactie Adverteren Exclusief Alle covers De eerste Elsevier FOUTMELDING De pagina kan niet worden weergegeven De pagina die u zoekt is misschien verwijderd, de naam van de pagina kan zijn gewijzigd of de pagina is tijdelijk niet beschikbaar. Probeer het volgende: Controleer of u geen typefout hebt gemaakt in het pagina-adres dat u in de adresbalk hebt getypt. Klik op de knop Vorige om een andere koppeling te proberen. Indien u op zoek bent naar de meest actuele informatie op www.elsevier.nl, klik op de link: ' Laatste 24 uur ' om deze informatie in te zien. U kunt ook de introductiepagina openen en kijken of er koppelingen zijn naar de gewenste informatie. HTTP 404 Onze excuses voor het ongemak Hieronder hebben wij een selectie nieuwsberichten van de laatste 24 uur voor u. Misschien staat daar hetgeen u zoekt. 17 november 2005van17tot18 uur Zeeland versnelt voorbereiding op grieppandemie Pintransacties goedkoper voor winkeliers Keizer Leenstra op dreef in Kaapstad 'Permanente zetel Duitsland is een illusie' Belgi eert Tom Boonen Home Adverteer Algemene voorwaarden Disclaimer Privacy zibb.nl beleggersbelangen.nl fembusiness.nl marketingtribune.nl fiscaaltotaal.nl subsidietotaal.nl totaljobs.nl kellysearch.nl Elsevier is een uitgave van 2005 Reed Business Information bv. Het is niet toegestaan om zonder voorafgaande toestemming van Elsevier, door Elsevier gepubliceerde artikelen, onderzoeken of gedeelten daarvan over te nemen, te (doen) publiceren of anderzins openbaar te maken of te verveelvoudigen. Op onze aanbiedingen en overeenkomsten zijn van toepassing onze algemene voorwaarden, welke zijn gedeponeerd bij de Kamer van Koophandel te Amsterdam. Design Satama Interactive
International Journal of Theoretical and Applied Finance
World Scientific. Contents and abstracts of all volumes. Full text to institutional subscribers.
International Journal of Theoretical and Applied Finance (IJTAF) News | New Journals | Browse Journals | Search | For Authors | How To Order Contact Us | Free Table of Contents Email Updates | Download Acrobat Reader | Promotions Advertising Enquiries | Journal Prices Home Journals by Subject Mathematics Economics, Finance and Management International Journal of Theoretical and Applied Finance (IJTAF) Aims Scope The shift of the financial market towards advanced quantitative methods has led to the introduction of state-of-the-art scientific methods into the world of finance. The International Journal of Theoretical and Applied Finance (IJTAF) brings together international experts involved in the theoretical modelling of financial instruments as well as the application of these models to global financial markets. The development of complex financial instruments and financial infrastructure have led to new challenges to the regulatory bodies. Financial instruments which have been designed to serve the needs of the mature capitals market need to be adapted for application in the emerging markets. Issues addressed in IJTAF include: (a) creation of models based on financial insights and sophisticated mathematical principles, (b) calibration of these models based on market information, (c) simulation of such models using efficient computational algorithms, (d) updating of these models in line with market developments, and (e) adaptation of these models by the practitioners in the industry. More ... News As of July 1, 2004, full-text articles of IJTAF are no longer available from Ingenta. Feature Articles (Free Online Sample Issue) Vol. 7, No. 8 (December 2004) An Option-Theoretic Prepayment Model for Mortgages and Mortgage-Backed Securities Andrew Kalotay, Deane Yang and Frank J. Fabozzi The Sequential Estimation of Subset Var with Forgetting Factor and Intercept Variable T. J. O'Neill, J. H. W. Penm and R. D. Terrell A Parsimonious Continuous Time Model of Equity Index Returns: Inferred from High Frequency Data Mascia Bedendo and Stewart D. Hodges An Extreme Value Theory Approach to the Allocation of Multiple Assets Brendan O. Bradley and Murad S. Taqqu On the Validity of the Random Walk Hypothesis Applied to the Dhaka Stock Exchange Mohammad S. Hasan Forthcoming Papers Please watch this space for forthcoming papers. Current Issue | Journal Archive About IJTAF: Aims Scope | Editorial Board | Contact IJTAF | Recommend This Journal | Abstracting Indexing | Top Accessed Articles How To Order: Order Information | Sales Contact | Price Information | Request for Complimentary Print Copy | Dispatch Dates For Authors: Guidelines for Contributors | Online Submission For Librarians: Hosting Service Providers ISSN: 0219-0249 Current Issue Journal Archive Search this Journal Free Email Updates on Table of Contents About IJTAF Aims Scope Editorial Board Contact IJTAF Recommend This Journal Abstracting Indexing Top Accessed Articles How To Order Order Information Sales Contact Price Information Request for Complimentary Print Copy Dispatch Dates For Authors Guidelines for Contributors Online Submission For Librarians Hosting Service Providers Related Journals Advances in Complex Systems (ACS) Stochastics and Dynamics (SD) Related Books Theory of Valuation The World of Hedge Funds Systemic Financial Crises Islamic Banking and Finance in South-East Asia Mathematical Modeling and Methods of Option Pricing Advances in Quantitative Analysis of Finance and Accounting Focus on Financial Management Related Links Finance Books Economics, Finance and Management Journals Terms and Conditions | About World Scientific Journals | World Scientific Bookshop World Scientific Home | WorldSciNet Archives World Scientific is a Member of CrossRef Copyright 2005 World Scientific Publishing Co. All rights reserved.
Journal of Economic Dynamics and Control
Elsevier home page.
ECONbase - Journal of Economic Dynamics and Control Journal of Economic Dynamics and Control ECONbase is closed. You will be redirected to the Journal of Economic Dynamics and Control homepage on the Elsevier web site. In approximately 3 seconds the redirection target page should load. If it does not please click here . Please adjust your favorites or bookmarks to link to the Elsevier Economics and Finance homepage g.wanrooy@elsevier.com - Gerard Wanrooy, Publisher
Econometric Theory
CUP. Online text to subscribers.
Econometric Theory Home Journals Econometric Theory Features Related Journals Journals By Title By Subject Highlights New Journals 2006 New Journals 2005 Advanced Search Cambridge Alerts Free journal TOC alerts New title information alerts Econometric Theory Edited by Peter C. B. Phillips Yale University, USA Editorial Board Instructions for Contributors Advertising Rates Links Aims and Scope Econometric Theory provides an authoritative outlet for original contributions in all of the major areas of econometrics. As well as articles that embody original theoretical research, the journal publishes periodic book reviews, historical studies on the evolution of econometric thought and on its major scholars. Econometric Theory also has an on-going Notes and Problems series and a distinguished ET Interviews series with pre-eminent scholars in the field. Reviews Recommended for econometricians and large universities Magazines For Librarians Print ISSN: 0266-4666 Online ISSN: 1469-4360 Online: 264.00 Print Online: 317.00 Print Only: 279.00 Full pricing details Current volume:21:1 - 21:6, 2005 All issues View a free sample of this journal Cambridge University Press 2005. Privacy Policy . North America: Order by phone 800-872-7423 (U.S. and Canada) 95-800-010-0200 (Mexico) or 845-353-7500, or by fax 845-353-4141. All other countries: Order by phone (+44 (0)1223 326070) or fax (+44 (0)1223 325150)
Studies in Nonlinear Dynamics and Econometrics
MIT Press. Contents from vol.1 (1996). Full text to subscribers.
Studies in Nonlinear Dynamics and Econometrics SNDE is now published by the Berkeley Electronic Press. Please see www.bepress.com for more information.
Journal of Mathematical Economics
Elsevier Science Journal. Contents and abstracts from vol.19 (1990). Full text to subscribers only.
Elsevier.nl - De pagina kan niet worden weergegeven donderdag 17 november 2005 17:09 ZOEKEN Op deze site Op internet Home Help Sitemap Log in Abonneer Maak Elsevier mijn startpagina DE ZEDENMEESTER Mag seks buiten het huwelijk... Ga naar weblog Nieuws Nederland Politiek Europese Unie Buitenland Economie Wetenschap Cultuur Televisie Sport Society Internet Gadgets Laatste 24 uur Opinie Commentaren Leon de Winter De Zedenmeester Brussels Blog Essays Reacties Onderzoeken Beste woon- gemeenten Studie en werk Beste Scholen Elsevier Webgids Test uw kansen Veiligste gemeenten Wie verdient wat? Beste studies 2005 Persoonlijk Gezondheid Gezin Carrire Geld Eten Uitgaan Mode Wonen Auto Reizen Extra Relatie Auto kopen Hotels Shopping Routeplanner American Express Service Elsevier op uw website of weblog Digitaal Archief RSS Nieuwsflitser Nieuwsbrieven Help Weekblad Deze week Abonneren Adres wijzigen Nabestellen Expat service Over Elsevier Veelgestelde vragen Contact Elsevier THEMA Redactie Adverteren Exclusief Alle covers De eerste Elsevier FOUTMELDING De pagina kan niet worden weergegeven De pagina die u zoekt is misschien verwijderd, de naam van de pagina kan zijn gewijzigd of de pagina is tijdelijk niet beschikbaar. Probeer het volgende: Controleer of u geen typefout hebt gemaakt in het pagina-adres dat u in de adresbalk hebt getypt. Klik op de knop Vorige om een andere koppeling te proberen. Indien u op zoek bent naar de meest actuele informatie op www.elsevier.nl, klik op de link: ' Laatste 24 uur ' om deze informatie in te zien. U kunt ook de introductiepagina openen en kijken of er koppelingen zijn naar de gewenste informatie. HTTP 404 Onze excuses voor het ongemak Hieronder hebben wij een selectie nieuwsberichten van de laatste 24 uur voor u. Misschien staat daar hetgeen u zoekt. 17 november 2005van17tot18 uur Nieuwe kroongetuige in Hells Angels-zaak Boskalis ontvangt grote order in Qatar 17 november 2005van16tot17 uur Tamil-Tijgers boycotten Srilankaanse verkiezingen Al 45 getuigen gehoord over moord Nijmegen VS pakten meer dan 83.000 terreurverdachten op Home Adverteer Algemene voorwaarden Disclaimer Privacy zibb.nl beleggersbelangen.nl fembusiness.nl marketingtribune.nl fiscaaltotaal.nl subsidietotaal.nl totaljobs.nl kellysearch.nl Elsevier is een uitgave van 2005 Reed Business Information bv. Het is niet toegestaan om zonder voorafgaande toestemming van Elsevier, door Elsevier gepubliceerde artikelen, onderzoeken of gedeelten daarvan over te nemen, te (doen) publiceren of anderzins openbaar te maken of te verveelvoudigen. Op onze aanbiedingen en overeenkomsten zijn van toepassing onze algemene voorwaarden, welke zijn gedeponeerd bij de Kamer van Koophandel te Amsterdam. Design Satama Interactive
Quantitative Finance
(IOP) Publishes articles that reflect the increasing use of quantitative methods in finance and the growth in practical applications of financial engineering - such as asset creation, pricing and risk management. It also covers new developments such as agent-based modelling and evolutionary game theory. Contents of all volumes. Full text to institutional subscribers.
Quantitative Finance User guide Site map Athens login IOP login: Password: Create account | Alerts | Contact us Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | This Journal Scope Editorial board Guidelines for authors Abstracted in Related content Linking to IOP journals IOP Select IOP Physics Reviews IOP journal news IOP journal archive Journal archive Vol 4, 2004 Vol 3, 2003 Vol 2, 2002 Vol 1, 2001 Featured articles Notice of Sale The IOP journal Quantitative Finance has been acquired by Taylor Francis plc. The acquisition will take effect on 30 June 2004 and the last three issues of Volume 4 (2004), numbers 4, 5 and 6, will be published by Taylor Francis. Further information is available. What's new? User Guide now available IOP Journals Access for Hurricane Katrina Victims Journal history 2001-2004 Quantitative Finance ISSN 1469-7688 (Print) ISSN 1469-7696 (Online) Full Search Help Bioinspiration Biomimetics Biomedical Materials British Journal of Applied Physics (1950-1967) Chinese Physics Chinese Physics Letters Classical and Quantum Gravity Clinical Physics and Physiological Measurement (1980-1992) Combustion Theory and Modelling (1997-2004) Distributed Systems Engineering (1994-1999) European Journal of Physics Inverse Problems Journal of Cosmology and Astroparticle Physics Journal of Geophysics and Engineering Journal of High Energy Physics Journal of Instrumentation Journal of Micromechanics and Microengineering Journal of Neural Engineering Journal of Nuclear Energy, Part C (1959-1966) Journal of Optics (1977-1998) Journal of Optics A: Pure and Applied Optics Journal of Optics B: Quantum and Semiclassical Optics Journal of Physics A: General Physics (1968-1972) Journal of Physics A: Mathematical and General Journal of Physics A: Mathematical, Nuclear and General (1973-1974) Journal of Physics B: Atomic and Molecular Physics (1968-1987) Journal of Physics B: Atomic, Molecular and Optical Physics Journal of Physics C: Solid State Physics (1968-1988) Journal of Physics: Condensed Matter Journal of Physics: Conference Series Journal of Physics D: Applied Physics Journal of Physics E: Scientific Instruments (1968-1989) Journal of Physics F: Metal Physics (1971-1988) Journal of Physics G: Nuclear Physics (1975-1988) Journal of Physics G: Nuclear and Particle Physics Journal of Radiological Protection Journal of Scientific Instruments (1923-1967) Journal of Statistical Mechanics: Theory and Experiment Journal of Turbulence (2000-2004) Journal of the Society for Radiological Protection (1981-1987) Measurement Science and Technology Metrologia Modelling and Simulation in Materials Science and Engineering Nanotechnology Network: Computation in Neural Systems (1990-2004) New Journal of Physics Nonlinearity Nouvelle Revue d'Optique (1973-1976) Nouvelle Revue d'Optique Applique (1970-1972) Nuclear Fusion Physica Scripta Physical Biology Physics Education Physics in Medicine and Biology Physics in Technology (1973-1988) Physiological Measurement Plasma Physics (1967-1983) Plasma Physics and Controlled Fusion Plasma Sources Science and Technology Proceedings of the Physical Society (1926-1948) Proceedings of the Physical Society (1958-1967) Proceedings of the Physical Society of London (1874-1925) Proceedings of the Physical Society. Section A (1949-1957) Proceedings of the Physical Society. Section B (1949-1957) Pure and Applied Optics (1992-1998) Quantitative Finance (2001-2004) Quantum Optics (1989-1994) Quantum and Semiclassical Optics (1995-1998) Reports on Progress in Physics Review of Physics in Technology (1970-1972) Semiconductor Science and Technology Smart Materials and Structures Superconductor Science and Technology Transactions of the Optical Society (1899-1932) Waves in Random Media (1991-2004) Author: Vol Year: Issue Month: Page ArticleNo: Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | Recommend this journal Copyright Institute of Physics and IOP Publishing Limited 2005. Use of this service is subject to compliance with the terms and conditions of use. In particular, reselling and systematic downloading of files is prohibited. Help: Cookies | Data Protection .
The International Journal of Game Theory Home Page
The electronic version of this scientific magazine offers only abstracts of its articles for a recent few years and information of subscription to the journal and its mail-list and submissions.
Dov Samet Dov Samet dovs@tauex.tau.ac.il Home page on the web site of The Leon Recanati Graduate School of Business Administration Before publication Counterfactuals in Wonderland , (1997) The useof counterfactuals in game theory, especially in Aumann's analysis of backward induction, is examined in the dim light of old myths of life-death-rebirth. The literary source of Aumann's theory is found in the story of the short encounter between Humpty Dumpty and Alice. So far I have not been able topublish this parody , because professionaljournals are deadly serious.If you are too, don't click on ! Beware ! Amendment This was all true until October 2005, when the paper was eventually published in Games and Economic Behavior. Learning to Play Games in Extensive Form by Valuation , (with P. Jehiel), (2000) (Reviewed by Ariel Rubinstein for NAJ Economics 2001, forthcoming in Journal of Economic Theory). The success of automated learning, for example Deep Blue for chess, can really make game theorists blue. None of the learning models in game theory can explain this success. Moreover, they cannot be used for writing a learning program for chess. The reason for this is simple. All game theoretic models are either based on the strategic form of the game, or make a heavy use of this form. Obviously, in games with many strategies (in chess there are more strategies than there are particles in the universe) the strategic form is useless. For human minds even games much smaller than chess cannot be dealt with in terms of their strategic form. Here we look at learning models based on valuation of moves rather than strategies. Such valuations serve as a basis to "real world" learning heuristics. Since we are interested in proving convergence theorems, our models are simpler than these heuristics. Nevertheless, unlike previous game theoretic models, ours are realistic in the sense that they can be used to write learning programs, albeit inefficient ones. Click and see what can be learned using valuation of moves. Valuation Equilibria , (with P. Jehiel), (2002) We introduce a new solution concept for games in extensive form with perfect information: the valuation equilibrium. The moves of each player are partitioned into similarity classes. A valuation of the player is a real valued function on the set of her similarity classes. At each node a player chooses a move that belongs to a class with maximum valuation. The valuation of each player is consistent with the strategy profile in the sense that the valuation of a similarity class is the player expected payoff given that the path (induced by the strategy profile) intersects the similarity class. The solution concept is applied to decision problems and multi-player extensive form games. It is contrasted with existing solution concepts. An aspiration-based approach is also proposed, in which the similarity partitions are determined endogenously. The corresponding equilibrium is called the aspiration-based valuation equilibrium (ASVE). While the subgame perfect Nash equilibrium is always an ASVE, there are other ASVE in general. But, in zero-sum two-player games without chance moves every player must get her value in any ASVE. Agreeing to Agree , (with E. Lehrer), (2003) In a seminal paper, Aumann (1976) demonstrated the impossibility of agreeing to disagree . That is, if the agents have a common prior they cannot have common knowledge of their posteriors for event E if these posteriors do not coincide. We ask here under what which conditions is agreeing to agree possible: Given an event E , can the agents have posteriors with a common prior such that it is common knowledge that the posteriors for E do coincide? We show that a necessary and sufficient condition for this is the existence of a nonempty finite event F with the following two properties. First, it is common knowledge at F that the agents cannot tell whether or not E occurred. Second, this still holds true at F , when F itself becomes common knowledge. PowerPoint presentations An ordinal solution to bargaining problems with many players . A family of ordinal solutions to bargaining problems with many players . A double feature: One observation behind two envelope puzzles +Agreeing to agree Between Liberalism and Democracy Probabilities: frequencies viewed in perspective How to commit to cooperation (AAMAS 05 Utrecht) Publications available in e-journals Approximating Common Knowledge with Common Beliefs , (with D. Monderer), Games and Economic Behavior, Vol. 1, No. 2, 1989. Stochastic Common Learning , (with D. Monderer), Games and Economic Behavior, Vol. 9, No. 2, 1995. `Knowing Whether', `Knowing That' and the Cardinality of State Spaces , (with S. Hart and A. Heifetz), Journal of Economic Theory, Vol. 70, No. 1, 1996. Proximity of Information Structures, (with D. Monderer), Math. of Oper. Res., Vol. 21, No. 3, 1996. Hypothetical Knowledge and Games with Perfect Information , Games and Economic Behavior, Vol. 17, No. 2, 1996. Belief Affirming in Learning Processes , (with D. Monderer and A. Sela), Journal of Economic Theory, Vol. 73, No.2, 1997. Knowledge Spaces with Arbitrarily High Rank , (with A. Heifetz), Games and Economic Behavior, Vol. 22, No. 2, 1998. Iterated Expectations and Common Priors , Games and Economic Behavior, Vol. 24, No. 1 1998. Common Priors and the Separation of Convex Sets , Games and Economic Behavior, Vol. 24, No. 1 1998. Topology-Free Typology of Belief , (with A. Heifetz), Journal of Economic Theory, Vol. 82, 1998. Coherent Beliefs are not Always Types , (with A. Heifetz), Journal of Mathematical Economics, Vol. 32, 1999. Bayesianism without Learning , Research in Economics, Vol. 53, 1999. Hierarchies of Knowledge: An Unbounded Stairway , (with A. Heifetz), Mathematical Social Sciences, Vol. 38, 1999. Quantified Beliefs and Believed Quantities , Journal of Economic Theory, Vol. 95, 2000. Learning to Play Games in Extensive Form by Valuation , (with P. Jehiel), NAJ Economics Vol. 1, 2001. Between Liberalism and Democracy , (with D. Schmeidler) Journal of Economic Theory, Vol. 110, 2003. An Ordinal Solution to Bargaining Problems with Many Players (with Z. Safra), Games and Economic Behavior, Vol. 46, 2004 One Observation Behind Two Envelope Puzzles (with I. Samet and D. Schmeidler), American Mathematical Monthly, Vol. 111, 2004. Bargaining with an agenda (with B. O'neill, E. Winter, and Z. Wiener) Games and Economic Behavior, Vol. 48, 2004 Utilitarian Aggregation of Beliefs and Tastes (with I.Gilboa, and D. Schmeidler) J. of Political Economy, Vol. 112, 2004 A family of Ordinal Solutions for bargaining problems with Many Players (with Z. Safra) Games and Economic Behavior, Vol. 50, 2005 Counterfactuals in wonderland Games and Economic Behavior, Vol. 51, 2005 Probabilities as Similarity-Weighted Frequencies (with A. Billot, I. Gilboa, and D. Schmeidler) Econometric, 73, 2005 . Miscellania Poetry Six translations of Der Panther by Rainer Maria Rilke ( into English and Hebrew) Three translations of a poem by Rilke from Das Stundenbuch ( into English and Hebrew) Dedications (Hebrew) To Aumann I dedicated " Counterfactuals in Wonderland " to Bob Aumann who, along with Humpty Dumpty, is one of the main protagonists of the piece. I sent him the article with a dedication as a spiritual Mishloa'ach Manot for Purim. To a colleague Etymology (Hebrew) The prime minister and the "parthemim" in the Book of Esther A lady in paradise? Civil rights in Hebrew: An old concept with a new meaning From the Persian "Dat" to the Hebrew religion Sitting on the "meducha" "At one glance" - on other meanings of the Semitic root s.k.r Pomander
Moravian College
Mathematics Department. (Bethlehem, PA, USA)
Moravian College Department of Mathematics and Computer Science Moravian College Department of Mathematics and Computer Science Math CS Home Mathematics Program The Math Major Minor The Math Course Catalog CS Program The CS Major Minor The CS Course Catalog Department Directory Clubs and Events MoCoSIN Mailing Lists Mathematics Program Moravian College Overview The following is taken from the Moravian College student handbook . The program in mathematics has three major objectives: first, to prepare mathematics majors for graduate study, for teaching mathematics, or for work in business and industry; second, to offer the student in natural, social, and behavioral sciences and the humanities an introduction to the mathematical concepts and skills necessary for the understanding of the use of mathematics in those fields of interest; third, to provide the non specialist with some understanding of the contributions of the mathematics to cultural development and the importance of mathematics in modern society. Graphics calculators and computer programs are use to understand concepts and to investigate applications and modeling of real-world situations. Emphasis is placed on connections between various areas of mathematics and interpretation of results. Curricular info For details on the requirements of a Mathematics Major or Mionor, see our requirements page . For more information on our courses see our Course Catalog . Copyright 2003 webmaster@cs.moravian.edu Last Modified: Monday Sep 27, 2004
University of Minnesota, Duluth
Department of Mathematics and Statistics (Duluth, MN).
Math@UMD Mathematics at UMD ... Math Placement Exam ... For new UMD undergraduate students Frequently Asked Questions about Calculators What you need for your math classes. Undergraduate Studies at UMD ... Major minor requirements. The Loughborough University (UK) UMD Student Exchange Program Summer Undergraduate Research Program ... Funded by the National Science Foundation and the National Security Agency. Graduate Studies at UMD ... The MS Program in Applied and Computational Mathematics. Information About the Department ... Class Schedules Courses ... Descriptions for 1000 level courses Office Hours ... Faculty and Graduate Assistants. Gallery ... Take a look at our home in the Solon Campus Center Computational Facilities ... Meet Paul, George, Ringo, John, along with Dasher, Dancer, Prancer, Cupid, Donner, Blitzen, ... People, Organizations, and Web Resources ... Employment Opportunity: Search for Temporary Faculty Faculty and Staff Graduate Students Math Club Alumni Our Favorite Links Info about Careers in the Mathematical Sciences UMD College of Science and Engineering UMD Home Page Copyright 2005, University of Minnesota, Duluth. The University of Minnesota is an equal opportunity educator and employer. This web page is maintained by the Department of Mathematics and Statistics, and was last updated April 11, 2005. Send comments to math@d.umn.edu .
North Park College
Department of Mathematics (Chicago, IL).
North Park University Home About North Park Athletics Library Admission Giving Academics News Current Students Prospective Students Faculty Staff Alumni Friends Pastors Churches Parents Families North Park University 3225 West Foster Avenue Chicago, Illinois 60625-4895 (773) 244-6200 (800) 888-6728
Gannon University
Department of Mathematics (Erie, PA).
Mathematics The successful study of Mathematics provides the student with important quantitative and analytical skills which qualify a person to pursue careers in actuarial science, data analysis, market research, cryptography, and a myriad of other areas. In addition, opportunities in the field of Mathematics education will abound for the next decade as student populations in grades K-12 increase dramatically. The Mathematics curriculum at Gannon University is designed to allow students to develop a strong secondary interest in an allied field such as business, computer science, economics, biology, chemistry, engineering, and secondary education. Home Faculty Careers
Rose-Hulman Institute of Technology
Department of Mathematics (Terre Haute, IN).
Rose-Hulman Mathematics
Baylor University
Department of Mathematics (Waco, TX).
Baylor University || Baylor Department of Mathematics Undergraduate Graduate People Research News Events B.S. Math B.S. Applied Math B.A. Mathematics Math Minor M.S. Degree Ph.D. Degree Course Schedule Math Careers Problem of the Month Transfer Policy Math Tutors Mathematics Links Baylor Math Home Top News Mathematical Physics Seminar Master's Student wins Fulbright Scholarship Mathematics Colloquium Series ( More ... ) CONTACT US Department of Mathematics Baylor University One Bear Place 97328 Waco, TX 76798-7328 Phone: 254 710-3561 FAX: 254 710-3569 3rd Floor, Room 338 Sid Richardson Science Building E-Mail: Judy_Dees@Baylor.edu About Baylor Mathematics Baylor University offers courses leading to the Bachelor of Science, Bachelor of Arts, Master of Science, and Ph.D. degrees in mathematics. A Bachelor of Science degree is also offered in applied mathematics. It is our mission to provide quality mathematics instruction at all levels, to make significant contributions to the discovery and dissemination of mathematical knowledge, and to develop, within a Christian environment, ethical scholars, skilled professionals, and educated leaders who are sensitive to the needs of society. Announcements Employment Opportunities The Department of Mathematics invites applications for the position of Department Chair to begin August 2005 Read the 2005 departmental newsletter (in PDF format), In Summation . Search | Directory | Ask Baylor | Calendar | Baylor 2012 | Map | News | Libraries | Research | SACS Page last modified: 7:59 am, August 30, 2005 Copyright Baylor University . All rights reserved. Trademark DMCA information. Baylor UniversityWaco, Texas 767981-800-BAYLOR-U
College of Saint Benedict and Saint John's University
Mathematics Department. (St. Joseph and Collegeville, MN)
CSB | SJU - Mathematics Department CSB SJU Inside : A to Z Index : Search : Home Mathematics Department Home Mission Statement Mathematics Requirements Schedule of 200 and 300 Level Courses Pi Mu Epsilon Conference Mathematics Faculty Careers in Mathematics Math Skills Center Department News and Events Department Chair: Dr. Gary Brown Phone: 320-363-5787 Email: gbrown@csbsju.edu Office: HAB 136, College of Saint Benedict, St. Joseph, MN 56374 Secretaries: Ardolf Science Building, College of Saint Benedict, Saint Joseph, MN 56374 Phone: 320-363-5535 Science Center, Saint John's University, Collegeville, MN 56321-3000 Phone: 320-363-3132 Pictured above: Polyhedron model of interlocking cubes from the collection of Fr. Magnus Wenninger . Related Websites: Mathematics Course Catalog Access to the mathematics section of the official course catalog. Local Student Math Society Mathematics Skills Center Computer Science Department Mathematics Information A wealth of resources pertaining to mathematics that is maintained by the library. CSB|SJU Mathematics Department Copyright 2005 College of Saint Benedict | Saint John's University All rights reserved. Maintained by Bob Hesse . Last revised on October 18, 2005.
Wichita State University
Department of Mathematics and Statistics
WSU Mathematics and Statistics Home The main page of the Mathematics and Statistics Department. Research An overview of the research that people are working on within our department. People The people within the Mathematics and Statistics Department. A list of our faculty, students, and staff. Graduate Information for those admitted to our graduate program or those interested in the PhD or MS programs. Undergraduate Information for those interested in an undergraduate degree within Mathematics or Statistics. Or for anyone taking an undergraduate class. Colloquia Events Talks by visiting professors or by professors from our department. Also, any special upcoming events. Dept Info Information on placement tests, credit by exam, courses, mathematics organizations, and alumni. About Information about this website, website usage, and who to email about it. Mathematics and Statistics Headlines * * Upcoming Events * * Problem of the Month * * Undergraduate Inquiries Paul Scheuerman , Assistant to the Chair Graduate Inquiries Kenneth Miller , Graduate Coordinator Algebra Inquiries Stephen Brady , College Algebra Director Scholarship Inquiries Buddy Johns , Chair of Departmental Scholarship Committee General Inquiries Department of Mathematics Statistics Deana Beek, Office Supervisor Wichita State University Wichita, Kansas 67260-0033 Telephone: 316-978-3160 Fax: 316-978-3748 Wichita State Homepage
Whitman College
Department of Mathematics (Walla Walla, WA).
Whitman College Mathematics || Math Faculty || Search || Math Department Information About the Math Department at Whitman... Why Major in Mathematics? Mathematics Department Faculty Calculus Placement Exam Mathcam College and Walla Walla Information Whitman College Home Page Student Homepages at Whitman Walla Walla WWW Portal Walla Walla Factoids . (courtesy US census) Weather Forecast . (courtesy NOAA ) 7 Day Weather History Live weather from the Hall of Science (Or try the small version ) Current local time . Mathematics Links American Mathematical Society Mathematical Association of America Budapest Semesters in Mathematics Math Videos @ Penrose More... Technical Help! Math lab information Help with Unix EFF's (Extended) Guide to the Internet Whitman College Technology Services (WCTS) More... The Rest of the Internet Search the Web: Google! Usenet Alta Vista Yahoo! People Search more... More... In fact, of course, the Internet is a shallow and unreliable repository of dirty pictures, inaccurate rumors, bad spelling and worse grammar, inhabited largely by people with no demonstrable social skills. -- From an opinion in a mock dissent to a mock decision on the CDA, at American University.
Westminster College
Department of Mathematics and Computer Science (New Wilmington, PA).
Westminster College: Academics: Overview About WC Academics Admissions Alumni Athletics News Resources Spiritual Life Student Services Overview Directions to Campus Mission Statement Quick Facts History The Mummy Things to do Vision Statement Economic Impact Cultural Impact Educational Impact Rankings Administration Directory Faculty Directory WC Online Features Site Index Contact Westminster College Overview Majors Programs Academic Affairs Academic Calendar Academic Departments Assessment Testimonials Registrar Summer Session Undergraduate Catalog Westminster Plan Faculty Development Science In Motion First Year Program Overview Majors Programs Apply Online Undergraduate Graduate Program Transfer Admissions Parents Information Lifelong Learning Program Continuing Education Veterans Admissions International Admissions Financial Aid Merit Scholarships Jerb Miller Scholarship Program Young Presbyterian Scholars Program Off-campus Study Inquiry Admissions Staff e-Postcards Campus Map Virtual Tour Overview For Our Future Support Westminster The Westminster Fund Alumni Relations Office Development Office Alumni Email Directory 65th Reunion 60th Reunion 55th Reunion 50th Reunion 45th Reunion 30th Reunion 25th Reunion 10th Reunion Friends of the Library Senior Class Gift Shared Vision - Projects Update Jerb Miller Scholarship Program Contact Alumni Relations Overview Breaking News Directory Facilities Intramurals Links Summer Sports Camps Area Lodging Titan Tradition Towering Titans Varsity Sports Cheerleading Presidents' Athletic Conference Overview Staff News Releases W.C. Weekly W.C. Magazine Style Guide Overview Audio Visual Services Career Center Church Relations College Bookstore Computing (Information Systems) Contacts Duplicating GroupWise Webaccess Human Resources Employment Learning Center Library Online Calendar Online Directory Physical Plant Preschool Registrar Web Advisor Web Student Overview Chapel Office Campus Worship Chapel Vespers Speakers Local Church Listing Church Relations Campus Fellowship Upcoming Events Mission Service Human Rights Student Viewpoints Young Presbyterian Scholars Program Weddings in Wallace Memorial Chapel Hurricane Katrina Information Overview Activities Calendar Career Center New Student Information Student Activities Leadership Development Staff Diversity Residence Life Counseling Services Student Health Center Disability Support Services Celebrity Series Safety Security Ask Student Affairs Dining Services Online Directory Student Handbook GroupWise Webaccess Web Student Web Advisor Overview Department Objectives Curriculum Courses Faculty Search Faculty Staff Facilities and Location Student Activities Internships Alumni News FAQ's Contact Us In the news. . . . Fall, 2005 Department Newsletter. more Secondary Mathematics Teachers Colloquium for Pre-service Teachers. more High School Programming Contest. more Upcoming Events November Thursday, November 17, 7:00-8:00 p.m. KME Career Night. Don't know what to do with your math or computer science degree? Come and hear two alumni share their experiences in the fields of computer science and actuarial science. Hoyt Room 152. Saturday, November 19, 8:30 a.m.-1:00 p.m. Campus Visitation Day. Remick Admissions House. Dr. Barbara Faires, Professor of Mathematics, and Dr. Terri Lenox, Assistant Professor of Computer Science, will be available to meet with prospective students and to answer questions pertaining to Mathematics, Computer Information Systems, and Computer Science. Prospective students welcome! more Wednesday, November 30, 4:00 p.m., Hoyt 152. Tim Smith Colloquium: Personal Encyclopedias and "The Baptism of Russia": Experiments in Interactive Learning Software. more December Saturday, December, 3. Putnam Exam. See Dr. Jim Hall or Dr. Natacha Fontes-Merz for details. Thursday, December 8. 4:00 p.m. Computer Science Colloquium: Bill Bryant. Hoyt Room 152. Additional details to follow. Wednesday, December 14. Mathematics Senior Capstone Presentations. McKelvey Campus Center, Atrium area, 3rd floor. February Thursday, Feb. 2 - Monday, Feb. 6. Mathematical Contest in Modeling. The Mathematical Contest in Modeling (MCM ICM) is designed to provide students with the opportunity to work as team members in a contest that will stimulate and improve their problem solving and writing skills. Please see Dr. Faires for details. more Saturday, Feb. 18. Abstracts due Feb. 14. Pi Mu Epsilon Regional Undergraduate Conference. Youngstown State University. Know something interesting about mathematics? Want to share it with other undergraduates? Then this conference is for you! Please see Dr. Faires for details. more April Saturday, April 1, 1:00 p.m. East Central Colleges Mathematics Competition. Mount Union College. Sample problems available in Math CS Dept. Seminar Room, Hoyt 164. Please Dr. Faires for additional details. Friday, April 7 - Saturday, April 8. Mathematical Association of America, Allegheny Section Meeting. Juniata College. Please see Mathematics faculty for additional details. Contact Us Hoyt Science Center phone: (724) 946-7284 fax: (724) 946-7158 email Office Hours Monday - Friday 8:00 a.m. - 12 noon 1:00 p.m. - 4:30 p.m. Sitemap Contact Us Westminster College 1-800-942-8033 New Wilmington, PA 16172-0001
Weber State University
Mathematics Department
Weber State University Mathematics Department MAA Intermountain Section The Mathematics Department at Weber State University offers a mathematics major and minor, an Honors major, an applied mathematics major, and a teaching major and minor. We also offer many support courses that are provided for the entire campus. For details, see the catalog . For our current semester courses see the university wide list of courses . Tenure track faculty job opening: See html or pdf . Are you looking for the Developmental Math page? The Solution Space ? Need to find out about semester quantitative literacy requirements ? Great moments in Mathematics Department History!
Walla Walla College
Department of Mathematics
Walla Walla College: Mathematics Search A-Z Site Index Contact Us ABOUT WWC ACADEMICS ENROLLMENT CAMPUS LIFE PEOPLE SERVICES myWWC STUDENTS PARENTS ALUMNI News Calendar Campus Locations Ad Building Construction Community Programs Visiting Walla Walla Profile Publications Contact Information Academic Calendar Academic Policies Academic Programs and Degrees Academic Records Advisement Blackboard - Web Courses Bulletins Class Schedule Dean's List Desire2Learn - Web Courses Forms Governance Graduate Departments Library OASIS - Online Student Services Summer Program Undergraduate Programs YOU.wwc.edu - Online Courses Estimated Expenses Financial Services Graduate Students Rosario Students Undergraduate Students ASWWC Athletics Cafeteria Menu Campus Ministries Clubs College Church College Store Collegian Community Service Event Photo Gallery Diversity Services Housing Intramurals Mask Positive Life Radio Spiritual Life Mission Sports Student Administration wwcdrama Club Alumni Central Faculty Staff Homepages Faculty Staff Phone Directory Online Mask Reaching People at WWC Student Homepages DIRECTORY OF SERVICES (PDF) Accounting Advancement Career Center College Relations Copy Postal Center Counseling Testing Services Dining Services Disabilities Support Services Health Services Human Resources Groupwise Webaccess (Email) Information Services Make Online Payment Plant Services Purchasing Risk Safety Management Security Student Employment Student Financial Services Teaching Learning Center (TLC) TSS Web Apps (Timecard) WWC Home Academics Undergraduate Programs Mathematics Department of Mathematics Department Site Bulletin | Guidesheets Mathematics professors at Walla Walla College have expertise in many areas including abstract algebra, approximation theory, coding theory, history of mathematics, numerical analysis, statistics, and combinatorics. As you study mathematics you will probably develop an interest in one particular area. The faculty in the mathematics department can provide you with in-depth help and insights in the area that most interests you. Walla Walla College Department of Mathematics 204 South College Avenue College Place WA 99324 Phone: (509) 527-2751 Fax: (509) 527-2253 Chair: Kenneth L. Wiggins wiggke@wwc.edu Walla Walla College | 204 South College Avenue, College Place, WA 99324 | (509) 527-2615 | (800) 541-8900 | (509) 527-2253 fax Copyright 2004 Walla Walla College | Powered by Typo3
Wabash College
Department of Mathematics and Computer Science
Wabash College: Math CS Crawfordsville, Indiana HOME PEOPLE FINDER SITE INDEX CONTACT Mathematics Computer Science Home Page Problem of the Fortnight Tech Reports News Events Faculty Staff Students Curriculum Facilities Off-Campus Study Internships Jobs Alumni WSIA The mathematics computer science department gives all students who take courses a sense of the nature of mathematics and computer science and their place in society. It provides its majors with an understanding of mathematics and its nature and uses, to help them become effective users of mathematics in their careers. The mathematics major can tailor upper-level courses to his interests (including pure mathematics, applied mathematics and statistics) and career goals (including actuarial science, computer science and secondary education). The department has also seen success in preparing future teachers of mathematics and students interested in continuing graduate study in mathematics or statistics. The study of computer science involves programming, but it delves beyond just writing more complex or eye-catching programs. A good comprehension of computer science helps the student design better programs and understand how to use a computer to solve new problems. Chris Jackson a Mathematics major from Griffith, IN. more Robert Foote Professor of Mathematics Computer Science more Mike Axtell Named CASTL Scholar Mike Axtell, assistant professor of mathematics at Wabash College, has been named one of eight Center of Inquiry Carnegie Scholars for the 2003-2004 school year. The eight Scholars will work together to invent and share new models for teaching, learning, and research in liberal education under the direction and with the support of The Carnegie Academy for the Scholarship of Teaching and Learning (CASTL). more News Wabash Welcomes You to Homecoming Weekend Activities more Division I: Science Department Names Honorees at Annual Awards Chapel more Mackintosh Fellows Named at Annual Awards Chapel more Wabash College - P.O.Box 352, Crawfordsville, IN 47933 - 765-361-6100 - Copyright 2005 - Non-Discrimination Policy - Online Privacy Policy Select a Destination: Future Students Academics Current Students Faculty Staff Alumni Parents Sports About Wabash -------------- News Webmail
Virginia Wesleyan College
Department of Mathematics and Computer Science
VWC: Academics: Programs: Mathematics and Computer Science Skip to Global Site Navigation Skip to Section Navigation Skip all Navigation Let us know if anything on our site can be improved to further meet your accessibility needs. Virginia Wesleyan College MARSIS Blackboard Webmail Contact Us Visit VWC Request Info Search Campus Directory Site Map About us Admissions Academics Athletics Library Student Life Alumni Friends Programs Courses Program Listing Divisions Majors Minors General Studies Graduation Requirements Course Catalog You are here: Home Academics Programs Courses Mathematics and Computer Science Faculty Mrs. Kathy R. Ames, (adjunct) Dr. J. Patrick Lang, Division Chairperson Mr. Stanford C. Pearson Dr. Margaret Reese Dr. Zizhong (John) Wang Ms. Denise Pocta Wilkinson, Program Coordinator See Also: Math and Computer Science Department faculty home page Math and Computer Science course descriptions (PDF) Type size normal | large To think mathematically and to understand the role mathematics plays in human enterprise are characteristics of liberally educated people. Mathematics contributes two of the seven original liberal arts. Its inherent beauty, its search for pattern, form and irrefutable truth, and its ability to provide a language through which the natural world can be described are examples of its power. Mathematics, always a practical and useful art, beckons as well as a path toward freedom of thought. The mission of the Mathematics Computer Science department is to provide an opportunity for all students to gain computational dexterity, to understand the value of mathematics as a human and social endeavor, and to develop the power of mathematical reasoning, while promoting the rigorous reasoning skills that allow students to investigate the interplay between the abstract and the concrete. The mission of the department with respect to computer science is to provide basic instruction in end-user skills for all students and in-depth instruction in theory and applications for both mathematics and computer science majors. One goal of the department with respect the education department is to enable our students to pass required PRAXIS exams related to mathematics. The department has two majors: Mathematics and Computer Science Mathematics. Within each, students may choose between a theoretical emphasis or one which is more applied. Students are encouraged to take advanced courses in both mathematics and computer science. The department, in conjunction with the VWC Education Department, has created 4-year programs which meet the Virginia Standards of Education 2000 for teaching certification at the primary, middle school and secondary levels. Requirements Course listings Course listings and major minor requirements for this program can be viewed or printed by downloading the PDF below. You need a PDF reader, such as Adobe Acrobat Reader , in order to view and print the file. Mac OS X users can use the built-in Preview application for viewing and printing PDFs. Mathematics and Computer Science course catalog information In addition to the program specific PDF offered above, you may also download the entire Virginia Wesleyan Catalog . Please note: The program information contained in the PDF files and in the complete Virginia Wesleyan Catalog are created from the printed catalog. The college reserves the right to make alterations in course offerings and academic policies without prior notice in order to further the institution's purpose. If you have any questions regarding course requirements, please contact the registrar's office . Page maintained by reg@vwc.edu . Copyright 2005 Virginia Wesleyan College Last modified: October 13, 2005 Site map | Feedback
University of Evansville
Department of Mathematics. (Evansville, IN, USA)
University of Evansville : Department of Mathematics Department of Mathematics Department Home Faculty Degree Programs Course Information Sample Exams Careers in Mathematics Undergraduate Research Mathematics Competitions Related Links Welcome to the Department of Mathematics! The Department of Mathematics boasts a dynamic faculty, access to sophisticated computer facilities and an array of courses to serve the needs of math majors as well as students studying engineering, physics, computer science and math education. A distinguishing characteristic of the University of Evansville's Department of Mathematics is its commitment to afford all of its students, through unique general education math courses, the opportunity to gain an appreciation of the discipline of mathematics. We view mathematics not only as a quantitative tool but as an art form, a cumulative product and achievement. Math Department Events: The Mathematics Department at the University of Evansville hosted the Fall 2004 MAA Trisection meeting of Illinois, Indiana, and Kentucky and Midwest History of Mathematics Conference . The conference took place on November 5 and 6 and featured keynote speakers Woody Dudley of Depauw University, Ron Graham, President of the Mathematical Association of America, and Brian Conrey, Executive Director, American Institute of Mathematics. This meeting featured an undergraduate mathematics competition. Results of the competition can be found here . Pictured below is Woody Dudley giving his keynote address titled "Angle Trisectors". 2004 Department of Mathematics-Koch Center Room 314-812-488-1234- math@evansville.edu
University of Dayton
Mathematics Department. (Dayton, OH, USA)
UD College of Arts and Sciences - Department of Mathematics Welcome! EXPLORE MATHEMATICS: ABOUT US ACADEMICS OPPORTUNITIES FACULTY STAFF GRADUATE PROGRAM ADDITIONAL INFORMATION The Department of Mathematics offers a Bachelor of Science in mathematics, a Bachelor of Arts in mathematics, a Bachelor of Science in applied mathematical economics (in collaboration with the Department of Economics and Finance) and a Master of Science in applied mathematics. The Bachelor of Science degree is intended for you if you want to pursue graduate studies in any area of the mathematical sciences, to enter the actuarial science profession, or to enter careers in engineering or science. The Bachelor of Arts degree allows for more electives; hence, you can study mathematics in a broader academic context. With this B.A. degree, you can (and are encouraged to) double major or develop a strong minor in preparation for a career in education, law, business or social science. The Bachelor of Science in applied mathematical economics is intended for you if you intend to study economics at the graduate level. The Bachelor of Science in mathematics can serve that purpose as well. To explore the array of courses available in the Department of Mathematics, click here . To meet faculty in the Department of Mathematics, click here . To view the Mathematics Colloquium schedule, click here . With Schools of Engineering, Education and Allied Professions, and Business Administration, as well as good programs in the sciences and computer science, mathematics at the University of Dayton is rich and has many connections. If you have any questions at all please contact me . Paul Eloe, Ph.D. Chair, Department of Mathematics A New Reason for Beeing... Free Information Technology Certification... Monetary Donation Furnishes ArtStreet Multimedia Room... 300 College Park Dayton, Ohio 45469-2316 Science Center Room 313 937-229-2511 2002 University of Dayton 300 College Park, Dayton, OH 45469 Website Powered by ActiveCampus Software by LiquidMatrix Customization by UD Internet Development Division
University of Dallas
Department of Mathematics and Computer Science (Irving, TX).
University of Dallas - Mathematics Home Mathematics UD Home Mathematics Home Page Much of mathematics has its roots in science but the spirit of mathematical inquiry is not bound to any specific area. Mathematics is an important discipline for every educated person. All students at the University are therefore required to study some mathematics. The goal of the requirement is to strengthen the student's imaginative and deductive powers through the discipline imposed by rigorous mathematical thinking. The precise use of language and logic characteristic of mathematics is developed in the courses which the student may select to meet the core requirement. There are many areas of mathematics from which the student may choose. Each of these areas deals with profound ideas that play an important part in our culture. The courses in Euclidean and Non-Euclidean Geometry, The Calculus, and Linear Point Set Theory are designed explicitly for this purpose. In certain circumstances Calculus I, II, and Linear Algebra also serve the purpose of the core requirement, as do the other more advanced courses in the Department. Useful UD Math Links Fall 2005 Colloquium Schedule Our placement exam for current students thinking of taking Calculus is here . (You need to be registered with the math department to access these exams.) M1.0 For questions or comments regarding the content of this page click here . UD HOME | CONTACT US | SITE MAP | MAPS | EMPLOYMENT OPPORTUNITIES 1845 East Northgate Drive Irving, TX 75062-4736 (972) 721-5000 Copyright University of Dallas 2005
University of Colorado, Colorado Springs
Mathematics Department. (Colorado Springs, CO, USA)
UCCS - School of Engineering and Applied Science Department of Mathematics Math Home Programs Degrees People Courses News Events Student Services Welcome Note Faculty Research Online Enhancements Admission Forms Policies Contacts Quick Links Course Schedule MathOnline Colloquium CMES Math Club Library Welcome to the UCCS Department of Mathematics News Corner Sloan Courses for Hurricane Displaced Students Calculus Refresher Course Soliton Conference Archive AMS Featured Column: The Mathematical Uncertainty Principle ... read more Department of Mathematics, University of Colorado at Colorado Springs, Engineering Building Room 274 1420 Austin Bluffs Parkway, Colorado Springs, Colorado 80933-7150. Phone: 719-262-3311, Fax: 719-262-3605
United States Naval Academy
Mathematics Department. (Annapolis, MD, USA)
Mathematics Department, US Naval Academy The mission of the Mathematics Department is to prepare midshipmen for the technical training they need and to open their minds to the power, beauty, and utility of mathematics. We: Strive to produce Navy and Marine Corps Officers who are well grounded in critical thinking, analysis, and problem solving. Give our majors the opportunity to develop the mathematical foundation required to pursue advanced technical degrees. Provide an active learning evnironment (with appropriate use of technology). Are committed to excellence in teaching and scholarship. Math Dept FAQ Last modified: 10-27-2004 by webmaster .
United States Air Force Academy
Department of Mathematical Sciences. (USAF Academy, CO, USA)
DFMS Home Page United States Air Force Academy Department of Mathematical Sciences Welcome to the DFMS web page. We are the largest academic department here at the Air Force Academy, and we offer undergraduate degrees in Mathematical Sciences and Operations Research. You can contact us at: HQ USAFA DFMS 2354 Fairchild Drive, Suite 6D124 USAF Academy, CO 80840 Phone: (719) 333-4470, DSN 333-4470 Fax: (719) 333-2114, DSN 333-2114 Organizational contact email address Featured Pages Placement Exam Preparation If you're getting ready to attend the Academy, then you'll want to get ready for our math placement exam! Follow the link above to get started. Any questions or comments please email webmaster . Last date this site has been updated: 24 March, 2005 USAF Academy Homepage Privacy Security Statement Notice and Consent
Rochester Institute of Technology
Department of Mathematics and Statistics. (Rochester, NY, USA)
RIT Department of Mathematics and Statistics RIT Undergraduate Research in Mathematics
Penn State Erie, The Behrend College
Mathematics Program (Erie, PA, USA).
Mathematics Department | Penn State Erie - The Behrend College Please select a destination... Programs: Bachelor Degree, Majors, Minors, Options Faculty: The Mathematics Department Faculty at Behrend College Research: Undergrad and Faculty Research, Articles, Scholarships and Awards Math Club at the Behrend College The School of Science's Seminars Schedule Career Opportunities, Job Information, Our Math Grads Interesting Links ======================================================================= Major in Mathematics | Options (choose from the options below) a) General Mathematics b) Applied Mathematics c) Business d) Education Pre-certification e) Computer Science ======================================================================= Minor in Mathematics ======================================================================= What are our Math Graduates doing? Jobs in Mathematics Faculty Research Topics Center for Mathematical Biology Faculty Resources November 28, 2005 BACK If you have an interest in computers, statistics, or the applications of mathematics to a variety of fields, then the Mathematics major at Penn State Erie, The Behrend College, is right for you. This site is the property of the School of Science, Penn State Behrend. Site Maintained by ajs410@psu.edu
Pacific University
Department of Mathematical Sciences.
Mathematics and Computer Science Department at Pacific University News Events Giving Contact Us Alumni Admissions Academics About Pacific People Finder | Directory | Calendar | Pacific Home College of Arts Sciences Natural Sciences Mathematics and Computer Science Mathematics Computer Science Home About Us Faculty Math Majors Minors Major Requirements Minor Requirements Senior Capstone Projects Computer Science Courses Advising Math Links Related Websites Math Club Quick Links Boxer Online myAccount myMail WebCT Contact Info Christine Guenther, Chair Phone: 503-352-2826 Email: guenther@pacificu.edu Offering majors and minors in mathematics and computer science, the Mathematics and Computer Science department at Pacific University is a dynamic, challenging, yet supportive environment in which to pursue your education in these rapidly changing fields. Click here to see a quicktime movie of photos from the Math CS Picnic from September 15. Upcoming Events Nov 30, 2005 Mathematics Colloquium: Dr. Iva Stavrov Pacific University | 2043 College Way Forest Grove, Oregon 97116 877.PAC.UNIV 503.357.6151 Search | Directory | Calendar | Careers at Pacific Copyright Pacific University, all rights reserved Disclaimers
Ohio Northern University
Mathematics Department. (Ada, OH)
Ohio Northern University Mathematics Department Ohio Northern University Mathematics Department Ada, Ohio 45810 Phone: 419-772-2346 Fax: 419-772-2330 Welcome to the Ohio Northern University Mathematics Department. The department offers majors in mathematics and mathematics statistics as well as minors in mathematics, applied mathematics and applied statistics. Courses are offered in mathematics and statistics to complement almost all disciplines in the university. Students with a primary major in the department may choose a general education program leading to either the bachelor of arts degree or the bachelor of science degree. In addition, the department cooperates with the Center for Teacher Education in program planning for liscensure for those desiring to teach at the secondary school level. The secondary education program in mathematics is nationally accredited by the National Council of Teachers of Mathematics. Vision Statement Curriculum for the Mathematics Major Curriculum for the Mathematics Minor Course Syllabi Students Faculty Seminar Tutoring Available Job Openings Careers in Mathematics Pictures The Little MathCorner C Calculus Readiness Test Calculus Readiness Test Answers CCa Calculator Policy Return to ONU Homepage Problems or comments contact: m-raiti@onu.edu Last update: 4 22 05
Occidental College
Mathematics Department. (Los Angeles, CA, USA)
Occidental College Math Department Occidental College Mathematics Department Overview Faculty Students Courses Placement Activities Links Search Contact Us Welcome to the Mathematics Department at Occidental College! Announcements: The BenedictFreedmanPrize for MathematicalPromise , deadline: October 15, 2005 Introducing the 2005 Mathematics Department E-Newsletter This newsletter was written by our junior mathematics majors, as part of the Junior Colloquium course. Many thanks go to the 60+ alumni who responded to our call for contributions. Special thanks goes to Rohan Shah '06 who designed and constructed the page. Mathematics... Mathematics is a unique discipline that provides basic analytical, logical and problem solving skills needed to understand the practical aspects of every day life and the philosophical depth of scientific thinking. Whether or not you have an idea of what you want to do after college, mathematics major may be suitable for your interests and your needs. We have aimed at making the major broad enough to satisfy diverse interests and strong enough to give students a solid analytical background. Occidental's Mathematics program serves the diverse needs of students in the physical and social sciences, and the liberal arts, as well as mathematics. Study and problem-solving in mathematics at all levels provide a paradigm of critical thinking: identifying and questioning premises, inferring patterns from evidence, deducing conclusions from hypotheses, and expressing ideas clearly. Other disciplines rely on mathematics to provide technical tools for precise reasoning and communication. Our majors pursue careers in fields that are impressive in quality and diversity. The department can recommend specific course work leading to graduate study in mathematics, applied mathematics, statistics, or computer science; a career in actuarial science, operations research, or business; certification for secondary teaching; and other career paths. A double major in mathematics and another discipline is also an attractive option for many students. Special Features... We have a quality program in mathematics with emphasis on excellent teaching. Our courses try to meet the challenges of a rapidly changing society by using innovative teaching techniques. A mixture of team-taught classes, group and individual problem solving and regular computer lab work provide our students with a solid foundation in the mathematical sciences. All Calculus courses include a computer laboratory component to give students the opportunity to experience, test, and personally discover mathematical ideas. Two newly built computer classrooms allow this innovative use of computers to extend to other courses, including Multivariate Calculus, Linear Systems, Data Analysis, and Differential Equations. At Occidental College students have plenty of opportunities for one-on-one interaction with professors both in introductory and advanced courses. Upper-level math classes often have ten or fewer students, creating an informal and friendly atmosphere for learning advanced concepts. Faculty encourage majors to work on challenging problems and projects either independently or in groups. Directed seminars are designed so small students groups can investigate a topic of interest with faculty supervision. This work often leads to the senior project. Additional campus resources include the AMP (Academic Mastery Program) and the CTL (Center for Teaching and Learning). AMP holds weekly workshops providing supplemental instruction for Calculus classes. Trained peer and faculty specialists are available daily in the CTL for individual consultation in all aspects of mathematical course work.
Oberlin College
Mathematics Department
Norwich University
Mathematics Department
Norwich University Meet the Faculty Meet Our Students Successful Alumni Careers Biology Life Sciences Chemistry Biochemistry Environmental Science Geology Mathematics Mathematics Curriculum Mathematics Course Descriptions Mathematics Minor Mathematics Resource Links Nursing Physics Home Academics Undergraduate Programs Mathematics and Sciences Mathematics Mathematics The Mathematics Department offers a four-year program leading to the Bachelor of Science degree in Mathematics. The courses offered are intended to: prepare mathematics majors for graduate work in mathematics or careers in computer science, engineering, industry, business, actuary science, or teaching; support the curricula in all disciplines; and supply the students with the mathematics courses necessary to qualify for teacher licensure . If you have questions or would like to learn more about the Mathematics program at Norwich, please contact Department Chair Cathy Frey at frey@norwich.edu . webmaster@norwich.edu 2004 by the President and Trustees of Norwich University.
New Mexico Insitute of Mining and Technology
Mathematics Department (Socorro, NM).
Mathematics Department at New Mexico Tech New Mexico Tech Socorro, NM 87801 Phone: (505)835-5393 Fax: (505)835-5366 math@nmt.edu New Mexico Tech Mathematics Department Welcome! Welcome to the New Mexico Tech Mathematics Department. Here you will find information on our undergraduate and graduate programs. We also provide information on the department faculty and links to descriptions of the courses. Also take a look at our sections outlining careers in mathematics. If you are a student considering attending New Mexico Tech, we hope you find these pages useful and informative. Should you have any questions, please feel free to contact us at math@nmt.edu . The excused absence form is now available for download. Required textbooks for Math classes for spring 2006 are now listed. A resources for grants page has been created for faculty use (available on-campus only). NMT student employment web application -- apply to be a grader, tutor, or SI here! Career opportunities for students Math placement test information: Frequently asked questions Sample test
Mount Union College
Department of Mathematics
Mathematics Department Department of Mathematics Welcome! Jim Albert will teach an MAA short course called "Baseball, Statistics, and the Role of Chance in the Game" at Mount Union College on June 7-9, 2006. Goals of the Mathematics Department How to contact us The Faculty of the Mathematics Department Course descriptions in mathematics Class schedules for mathematics: Spring Semester 2006 Fall Semester 2005 Summer Session III 2005 Class Schedules for Previous Years Course Section Finder - IQ Web - see if courses are full or if there are seats available Requirements for a major in mathematics a minor in mathematics a concentration in statistics honors in mathematics all students (the General Education graduation requirement in mathematics) becoming a mathematics teacher Student scholarships, prizes, and awards: The Mount Union College AMC12 Scholarship Mathematics student award winners The MAA Ohio Section student paper contest winners The $5,000 Tomsich Awards in Mathematics, Computer Science, and the Natural Sciences Student resources: Advanced Placement The Mount Union College Mathematics Placement Exam Mathematics learning assistants (tutors) from the Academic Support Center Student activities: Mathematics Club Pi Mu Epsilon Mathematics Honorary The Putnam Exam The Annual ECC Mathematics Competition The Problem of the Month Professional Associations: Mathematical Association of America (MAA) Ohio Section of the MAA MAA Online Student Page American Mathematical Society (AMS) Society for Industrial and Applied Mathematics (SIAM) American Statistical Association (ASA) Information on careers in mathematics and statistics Internet resources for mathematics and statistics This page last modified on October 26, 2005, by Michael Zwilling .
Millersville University
Department of Mathematics
Millersville University - Department of Mathematics Department Office: Wickersham Hall Address: Department of Mathematics Millersville University P.O. Box 1002 Millersville, PA 17551-0302 Phone: 717-872-3531 Fax: 717-871-2320 For more information about studying mathematics at Millersville, call us at 717-872-3531 or write us at the address above. You can also download our Student Handbook . Undergraduate Degree programs (Majors, Options, and Minors) Faculty Staff Courses Note: Some of the courses have been renumbered. For up-to-date information, please refer to the Student Handbook, or contact the department. Tutoring, Placement, and the Basic Skills Test for 104 105 Tutoring at the Math Assistance Center The Basic Skills Test for Math 104: Test Information Awards, honors, and scholarships Math Department calculator policy Student Handbook (PDF file, 293,396 bytes) Joint Mathematics Colloquium of Millersville University and Franklin Marshall College Alumni may fill out an on-line form to keep the Department of Mathematics up-to-date on your status and whereabouts. Announcements If you're trying to register for a math course but the section you want is closed, you need to visit the Math Department's Drop-Add Table during the first week of class and get on a Waiting List. Individual instructors are not permitted to give overrides for most 100 or 200-level courses. Elementary and Special Education Majors are required to PASS the Math 104 Basic Skills Test before they will be permitted to register for Math 104 or Math 105. (This applies to transfer students, too!) The Department of Mathematics is a Wolfram Research, Inc. Educational Institution grant recipient. Further information about Wolfram Research's software Mathematica may be found here . Page maintained by: Bob Buchanan and Bruce Ikenaga To suggest changes or additions mail to math@marauder.millersville.edu Last updated: October 28, 2005 Millersville University is an Equal Opportunity, Affirmative Action Institution
Middlebury College
Department of Mathematics and Computer Science
Mathematics Search | Directory | Calendars Admissions Academics Campus Life Athletics Arts About Middlebury Administration Home Academics Undergraduate Majors Programs Departments Programs Mathematics Mathematics Our department offers a major and minor in Mathematics. We offer a broad array of courses that cover most areas within this discipline, ranging from abstract algebra to operations research. Faculty members are active in their research areas, and their enthusiasm for their subjects is readily apparent in the courses they teach and in their advising and mentoring of students. Join us for lunch every Friday in LaForce 121, just outside Ross Dining. Middlebury College Department of Mathematics Warner Science Hall Middlebury, Vermont 05753 Phone: 802-443-5565 Fax: 802-443-2080 E-mail: math@middlebury.edu Mathematics Courses Requirements Faculty Office Hours Problem of the Week Weekly Seminars Research Activities Students Alumni Math Links Study Abroad Contact Us Students Parents Alumni Faculty Staff Donors College Store | Library | Job Seekers | Directions | Campus Map | Site Map | Privacy | Help | WebMail | Banner Web Middlebury Vermont 05753 802-443-5000 The President and Fellows of Middlebury College. All Rights Reserved. Log On
Middle Tennessee State University
Department of Mathematical Sciences
Department of Mathmatical Sciences :: Middle Tennessee State University CONTACT :: MAPS DIRECTIONS :: A-Z INDEX :: PIPELINEMT :: WEBMAIL :: WEBMT :: FIND PEOPLE :: CALENDARS :: DEPARTMENT HOME :: MESSAGE FROM THE CHAIR :: FACULTY POSITIONS :: CHAIR POSITION :: FACULTY :: GTA's ADJUNCTS PROGRAMS :: INDUSTRIAL MATHEMATICS :: MATHEMATICS EDUCATION :: PROFESSION MATHEMATICS :: ACTUARIAL SCIENCES COURSES :: UNDERGRADUATE STUDIES :: UNDERGRADUATE RESEARCH :: GRADUATE COURSES :: CAREER INFORMATION Welcome to Department Mathematical Sciences The Department of Mathematical Sciences offers courses designed to prepare students who plan to enter graduate schools or professional schools of medicine or engineering; to teach in elementary schools, secondary schools, or junior colleges; to major in mathematics, in computer science, in the natural or physical sciences, or in other areas with mathematics requirements; or to enter careers in business, industry, or government. Programs in the department lead to the Bachelor of Science or Bachelor of Arts degrees with a major in mathematics. Emphases in Actuarial Science, Industrial Mathematics, Professional Mathematics, and Mathematics Education are available under the Mathematics major. Students seeking licensure in secondary mathematics also complete a minor in Secondary Education. The department offers graduate programs leading to the Master of Science with a major in mathematics and the Master of Science in Teaching with a major in mathematics. COURSE MATERIALS :: MATH 1010 SYLLABUS :: MATH 1610 SYLLABUS :: MATH 1710 SYLLABUS :: MATH 1710 REVIEW SHEET :: MATH 1710 ANSWER KEY DEPARTMENTAL FORMS :: UPPER DIVISION FORMS :: ANNUAL REVIEW STUDENTS FACULTY :: TUTORING CENTER HOURS UPCOMING EVENTS :: COLLOQUIA :: 41ST MIDSOUTH GRAPH THEORY CONFERENCE :: MTSU HOMEPAGE DEPARTMENT HOME | FACULTY | GTA's Adjuncts | INDUSTRIAL MATHEMATICS | MATHEMATICS EDUCATION | PROFESSION MATHEMATICS | UNDERGRADUATE STUDIES | UNDERGRADUATE RESEARCH | GRADUATE COURSES | CAREER INFORMATION | MATH 1610 SYLLABUS | MATH 1710 SYLLABUS | MATH 1710 REVIEW SHEET | MATH 1710 ANSWER KEY | UPPER DIVISION FORMS | ANNUAL REVIEW | TUTORING CENTER HOURS | COLLOQUIA | MTSU HOMEPAGE DEPARTMENT OF MATHEMATICAL SCIENCES Middle Tennessee State University P.O. BOX 34 Murfreesboro, Tennessee 37132 Voice (615) 898-2669 and Fax (615) 898-5422 2003 Middle Tennessee State University:: Terms of Use Policies | webmaster@mtsu.edu Middle Tennessee State University, in its educational programs and activities involving students and employees, does not discriminate on the basis of race, color, national origin, sex, religion, or age. Furthermore, the university does not discriminate against veterans or individuals with disabilities.
Lafayette College
Department of Mathematics
Mathematics at Lafayette College Department of Mathematics Faculty and Staff Directory Mathematics Program Information Math course descriptions Information for first-year students Major programs and requirements Advice for math majors Schedule of advanced courses Special topics and seminars Honors, independent study and research About the department Lafayette-Lehigh Geometry and Topology Seminar Links to other mathematics resources Current Events Welcome! Prospective Students: join us for Game Hour on Friday, November 11! "Option Price Models" by Professor Qin Lu on Wednesday, November 16 Lafayette team wins LVAIC Math Contest Lafayette Problem Group (Thursdays at 4:15pm) Fall Team Barge Competition (Solutions due on Fridays) Game Hour (Fridays at 4:00pm) Prepare for the GRE Advanced Math Subject Exam (Sundays at 6:00pm) Recent Press Releases The Math Department Newsletter 2005-06 [PDF] ( 2004-05 ) Lafayette's Summer REU Program Gallery of Recent Activities Summer REUers Department Activities Barge Competition this semester is hot! The Problem Group has no problem having fun. Research Experiences for Undergraduates in mathematics at Lafayette Summer 2004 REU group at Ringing Rocks REU 2005 Program Information Available Now
Jackson State University
Department of Mathematics.
College of Science, Engineering and Technology Tor Kwembe, Ph.D. Chair, Department of Mathematics Professor of Mathematics 601-979-2161 Fax: : 601-979-5852 Tor.a.kwembe@jsums.edu Department of Mathematics School of Science and Technology P.O. Box 17610 Jackson State University Jackson, Mississippi 39217 Welcome to the Department of Mathematics. This site has an overview of our undergraduate and graduate programs. Select a link to find the specific information you are seeking. We hope what you find is beneficial in helping you make an informed decision about your academic career. If you would like to speak with someone regarding any aspect of this web site, you may contact us at the address below. Undergraduate and Graduate Program Overview The Department of Mathematics in the School of Science and Technology, in cooperation with the School of Education, offers a program leading to the Master of Science in Teaching (MST) degree in mathematics. This Department also offers a Master of Science (MS) degree in pure mathematics for students who seek careers in college or university teaching, government, industry, business, etc. Based on the certification requirements of the State of Mississippi as stated in Bulletin 130, and upon the stated principles and guidelines of The National Council of Teachers of Mathematics, The Mathematics Association of America and The Mississippi Council of Teachers-Mathematics, the successful candidate for graduation with the MST degree should be able to perform the following competencies. - Expose students to various teaching aids in teaching and learning of Mathematics at the junior high, high school and college levels. - Show the basic structure of an idea by means of displays and examples. - Explain abstract ideas and relate them to concrete models by using the most modern techniques. - Bring ideas together to form new concepts in Mathematics. - Turn ideas into words by means of displays, diagrams and examples. Improve the oral and written expression of students in Mathematics. - Stimulate a greater interest in Mathematics to improve the performance of students. Share the idea of teaching and learning with other teachers in the field of Mathematics by being active in professional organizations. - Properly counsel students in the field of Mathematics. - Supervise programs in Mathematics education. - Provide the kind of experiences in Mathematics that will be relevant to the needs of today's youth. - Construct programs in Mathematics that meet the needs of students in modern schools. -Demonstrate the nature of problem solving, proofs and processes involved in the solution of problems and proofs of theorems in general. These degree programs are designed for persons with an adequate background in Mathematics and who wish additional preparation for Mathematics teaching or Mathematics supervision. - admissions information - undergraduate program - admissions information - graduate program
Humboldt State University
Department of Mathematics
Humboldt State University: Math Department Humboldt State University College of Natural Resources Sciences Office: Library 58 Phone: 707-826-3143 Fax: 707-826-3140 Email: math@humboldt.edu Directory Faculty Staff Graduate Students Office Hours Current Students Course Descriptions Course Schedules Math Code Information Mathematics Placement Tests (MPT) Student Activities and Scholarships Prospective Students Degree Programs Scholarships for Transfer Students Facilities QS Laboratory Grants, Research Projects Related Interests Alumni Other Math Websites Math Software Location: Home {location path} Welcome to the Humboldt State University Mathematics Department About the Mathematics Department Popular Links Seminars and Conferences Math 99 Information Fall 2005 Math 99 Tutorial Lab Schedule Why study Math at Humboldt? HSU Math Club Website HSU Alumni Association Undergraduate major contract form Variable Unit Graduate Course Request Form Mathematics Colloquium Schedule Kieval Lecture Series The State of Jefferson Mathematics Congress PMET Workshop Please email comments and suggestions to math@humboldt.edu
Haverford College
Department of Mathematics
Mathematics at Haverford
Florida International University
Department of Mathematics
FIU Mathematics Department MATHEMATICS DEPARTMENT Florida International University Contact General Information Note from the Chair Schedule of Math Courses Faculty Staff Adjunct Research Faculty Research Interests Seminars and Colloquia FIU will host the AMS Spring Southeastern Meeting on April 1-2 2006 Academic Programs Undergraduate Graduate Actuarial Studies Information for Students Undergraduate Course Description Graduate Course Description FIU Schedule of Courses Academic Calendar Final Exam Schedule Online Registration Math Help Math Activities for Students Math Circle Information (A Program for High School Students) Math Club Information FIU Putnam Team News: FIU Math Students Ranked Nationally Jobs Faculty Employment FIU Links FIU Homepage College of Arts and Science Undergraduate Admission Office Graduate Admission Office Registrar Office Financial Aid Office FIU Catalogs Resources FLEX (Faculty-Library Express Delivery Service) FIU Webmail Google Scholar Panthersoft Main Page Panthersoft Support Service Scholarships Computer Science, Engineering and Mathematics Scholarship Miscellaneous Have you ever wondered what a mathematician working in the industry or the government does all day? (Career Information) Mathematics in the Movies CIRS (International Center for Scientific Research) Florida Atlantic University - Math Competition and Actuarial Examination Visit since 11 29 1996 Questions or Comments? Please e-mail the webmaster at josecmencia@yahoo.com University Park, DM 416, Miami, Florida 33199 Tel: 305-348-2742 Fax: 305-348-6158
Eastern Michigan University
Department of Mathematics
Mathematics Department New Students What's New Programs Courses Placement Faculty Staff Facilities Advisors Resources Newsletter Department of Mathematics Eastern Michigan University Site graphics and page design by B.S. Szopo
DeSales University
Department of Mathematics. (Center Valley, PA, USA)
Mathematics Home Events Calendar Library Contact Us Site Index Academics Departments Majors Business Math Computer Science Majors Math Club Staff Contact AITP Alumni Natural Science Nursing and Health Philosophy and Theology Humanities Performing and Fine Arts Social Science Education Undergraduate Studies Graduate Studies Lifelong Learning (ACCESS) Blackboard Distance Learning Resources Faculty Contact Us Popular Links Spirituality of St. Francis de Sales History of DeSales Oblates Prospective Students Current Students Faculty Staff Alumni Friends Parents Family Visitors Community Department of Mathematics Computer Science Mathematics The program leading to the bachelor of science in Mathematics is designed to prepare students for graduate study, secondary teaching, or a career in mathematics or a mathematically-related field. The courses required for the major provide a solid foundation in the major areas of mathematics, while giving students the flexibility to study topics pertinent to their career goals. The curriculum consists of 15 courses in mathematics and related disciplines, divided into 10 core courses and 5electives. Ten Core Courses: MA 121 Calculus I MA 122 Calculus II MA 223 Calculus III MA 224Calculus IV MA 231 Discrete Mathematics MA 301 Probability and Statistics I MA 331 Linear Algebra MA 471 Abstract Algebra CS 121 Introduction to Computer Science I PH 201 or PH 211General Physics I Elective Courses: Elective courses are completed in thefollowing distribution:one course selected from Group A; three additional courses selected from Group A or Group B; one additional course selected from Group A, Group B or Group C. The courses in each group are listed below. Group A, Proof-based Mathematics MA 445 Advanced Calculus MA 451 Fundamentals of Modern Geometry Group B, General Mathematics MA 243 Differential Equations MA 302 Probability and Statistics II MA 334 Introduction to Operations Research MA 341 Numerical Analysis MA 400 Special Topics in Mathematics MA 499 Independent Study Group C, Mathematics Applications and History CS 122 Introduction to Computer Science II MA 260 History of Mathematics MA 399 Mathematics Internship PH 202 or PH 212 General Physics II Certification for teaching mathematics at the secondary level may be obtained through the Education Department. MATHEMATICS 107 (3 credits) Mathematics for Teachers I A course designed to give prospective teachers an understanding of the underlying concepts of fundamental mathematics while encouraging independent problem solving. Topics include set theory, number relations, number theory, fractions and decimals, and problem solving techniques. Open only to Elementary Education Special Education majors or by permission of instructor. (Offered every fall) MATHEMATICS 108 (3 credits) Mathematics for Teachers II The continuation of a course designed to give prospective teachers an understanding of the underlying concepts of fundamental mathematics while encouraging independent problem solving.Topics include geometry and spatial sense, statistics, probability, measurement, and estimation. Open only to Elementary Education Special Education majors or by permission of instructor. (Offered every spring) MATHEMATICS 109 (3 credits) Survey of Mathematics: MOT Mathematics A study of mathematics using an analytical approach with selections from set theory, algebra, geometry, and probability. An emphasis will be placed on developing an appreciation of the way mathematicians think and the contribution of mathematics to the understanding of the world. MATHEMATICS 110 (3 credits) Finite Mathematics: MOT Mathematics An introduction to mathematical concepts and techniques useful in business and the social sciences. Topics include linear functions, matrix algebra, systems of linear equations, linear programming, and mathematics of finance. Applications and elementary mathematical modeling will be stressed. Prerequisite: two years of high school algebra or equivalent. 92 MATHEMATICS 111 (3 credits) Probability and Statistics: MOT Mathematics Emphasizes quantitative methods for decision making. Topics discussed include descriptive statistics, elementary probability theory, tree diagrams, counting techniques, discrete and continuous probability distributions, random sampling, expected value, variance of probability distributions, normal distribution, and confidence intervals. Prerequisite: two years of high school algebra or equivalent. MATHEMATICS 112 (3 credits) Precalculus Mathematics: MOT Mathematics Provides the background necessary to study calculus. Topics include relations, functions and graphs, exponential and logarithmic functions, trigonometric functions and identities, inverse trigonometric functions, and applications. Prerequisite: two years of high school algebra or equivalent. MATHEMATICS 121 (3 credits) Calculus I: MOT Mathematics An introduction to differential calculus.Topics include limits and differentiation of elementary functions, local linear approximations, implicit differentiation, curve sketching, maxima and minima, mathematical modeling, and applications. Prerequisite: MA 112 or precalculus with trigonometry in high school or college. (Offered every fall) MATHEMATICS 122 (3 credits) Calculus II An introduction to integral calculus.Topics discussed include methods of indefinite and definite integration and the Fundamental Theorem. Applications include area, volume, arc length, and growth and decay problems. Prerequisite: MA 121. (Offered every spring) MATHEMATICS 223 (3 credits) (formerly MA 124; not open to students who have taken MA 124) Calculus III A course in multivariable and vector calculus.Topics discussed include polar coordinates, vectors in two and three dimensions, partial derivatives, line integrals, multiple integrals, and the applications of these topics. Prerequisite: MA 122. (Offered every fall) MATHEMATICS 224 (3 credits) (replaces MA 123 and MA 251; not open to students who have taken MA 123 or MA 251) Calculus IV A conclusion to the calculus sequence, covering topics such as infinite sequences and series, additional applications of integration, and conic sections. The remainder of the course will be devoted to an introduction to advanced mathematics, focusing on proof-writing skills and the axiomatic method. Prerequisite: MA 223 or permission of the instructor. (Offered every spring) MATHEMATICS 231 (3 credits) Discrete Mathematics Selected topics from data representation, algorithm analysis, mathematical logic, induction, discrete number systems, basic combinatorics, discrete probability, graph theory, and recursion. Prerequisite: MA 121 or permission of the instructor. (Offered every fall) MATHEMATICS 243 (3 credits) Differential Equations An introduction to techniques of modeling and solution of ordinary differential equations.Topics include complex numbers and exponentials, first-order separable and exact differential equations, linear differential equations, linear independence and the Wronskian, general and particular solutions, Laplace transforms, and numerical methods. Prerequisite: MA 122. MATHEMATICS 260 (3 credits) History of Mathematics A treatment of mathematical concepts from an historical and philosophical point of view.The influence and contributions of various cultures, among them European, Chinese, Arabic, African, and Hindu, are examined. MATHEMATICS 301 (3 credits) (formerly MA 401; not open to students who have taken MA 401) Probability and Statistics I A mathematically oriented introductory course in probability and statistics. Topics include counting techniques and laws of probability, independence, discrete and continuous random variables and distributions, normal distributions, mathematical expectation, moment generating functions, joint distributions and correlation, sampling distributions, the Central Limit Theorem, confidence intervals and hypothesis testing. Prerequisite: MA 122. MATHEMATICS 302 (3 credits) (formerly MA 402; not open to students who have taken MA 402) Probability and Statistics II A continuation of MA 301. Topics include t, chi square, F, Poisson and exponential distributions, point estimation, maximum likelihood estimators, method-ofmoments estimators, tests of hypotheses, best tests, likelihood ratio tests, regression and correlation, Bayesian estimation. Prerequisite: MA 301. MATHEMATICS 331 (3 credits) Linear Algebra An introduction to linear algebra.Topics include solution of linear systems, vector spaces, linear independence, basis and dimension, matrix algebra, determinants, eigenvalues and eigenvectors, diagonalization, and applications. Prerequisite: MA 122. (Offered every spring) MATHEMATICS 334 (3 credits) Introduction to Operations Research A survey of techniques used in the study of operations research. Linear programming with the simplex and revised simplex methods, duality, degeneracy procedures, and sensitivity analysis. Other topics chosen from the transportation problem, the assignment problem, game theory, network problems (including CPM and PERT), inventory problems, queuing theory, and Markov processes. Prerequisite: MA 121. MATHEMATICS 341 (3 credits) Numerical Analysis Topics include linear and nonlinear equations, interpolation and approximation, numerical integration, curve fitting, simultaneous equations, and the analysis of errors. Prerequisites: CS 121, MA 122. 93 MATHEMATICS 399 (3 credits) Mathematics Internship Designed to provide the student with the opportunity to integrate course work with practical work experience in the area of applied mathematics. Regular field work under an employment supervisor as well as tutorial sessions and readings under a faculty advisor are required. Prerequisite: permission of the department chair. MATHEMATICS 400 (3 credits) Special Topics in Mathematics An in-depth coverage of a topic that is not covered extensively elsewhere in the mathematics curriculum. Prerequisite: permission of the instructor. MATHEMATICS 445 (3 credits) (formerly MA 345; not open to students who have taken MA 345) Introduction to Analysis An advanced treatment of concepts in calculus, stressing rigorous definition and proof.Topics include properties of real numbers, least upper bounds, limits and continuity of functions of a real variable, differentiation, Riemann integration, sequences and series. Prerequisites: MA 224 and MA 231 or permission of instructor. MATHEMATICS 451 (3 credits) (formerly MA 351; not open to students who have taken MA 351) Fundamentals of Modern Geometry The examination of the Euclidian postulates and the axioms of Hilbert, non-Euclidian geometries, the influence of geometry on physics and philosophy, and the use of computers in the study of geometrical concepts. Prerequisite: MA 224 and MA 231 or permission of instructor. MATHEMATICS 471 (3 credits) (formerly MA 371; not open to students who have taken MA 371) Abstract Algebra Advanced concepts in algebra. Topics include semigroups and groups, congruence relations, quotient subgroups, homomorphisms, normal subgroups, cosets, factor groups, isomorphisms, automorphisms, series of groups, permutation and cyclic groups, and abelian groups. Prerequisite: MA 224 and MA 231 or permission of instructor. MATHEMATICS 499 (3 credits) Independent Study Reading, research papers, or projects under the guidance of a member of the department. Prerequisite: permission of the instructor.May be repeated for a maximum of 6 credits. Majors Computer Science Mathematics Helpful Information Graduation Requirements Get a complete understanding of all required courses for this major. Admissions Application Apply for this major today...online! Financial Aid Find out what financial aid options are available to you. About DeSales | Academics | Admissions | Athletics | Arts | Student Life Home | Events Calendar | Library | Contact Us | Site Index | Privacy Policy Copyright 2005 - All Rights Reserved
DePaul University
Department of Mathematical Sciences
Department of Mathematical Sciences of DePaul University Undergraduate Graduate Course Descriptions Schedules Syllabi on Blackboard Full-time Faculty Part-time Faculty Staff Tutors Colloquia Analysis Seminars Math Club Algebra Conferences and Seminars Tutoring Advising FAQ List of Tutorial Software Mathematical Links DePaul Links DePaul University - Department of Mathematical Sciences Home Academics People Clubs Events Resources Links Sitemap Quick Links Announcements Current Quarter Course Syllabi Mathematical Sciences Career Information Prospective Students Admission Information Current Tutoring Schedule What's New? Conference on Harmonic Analysis and Ergodic Theory - December 2-4, 2005 Analysis Seminar Joint Major option with CTI! Algebra Conferences and Seminars Statistics Seminar Goldman Retirement Dinner Employment Opportunity About the Department 2320 North Kenmore Ave. Chicago, IL, 60614 773.325.7806 773.325.7807 (FAX) Send us an email Academic Information Undergraduate Studies Graduate Studies Course Descriptions Schedules Course Syllabi on Blackboard People Full-time Faculty Part-time Faculty Administrative Staff Tutors Useful Links Mathematical Links DePaul Links Clubs and Events Department Colloquia Math Club Analysis Seminars Algebra Conferences and Seminars Conference on Harmonic Analysis and Ergodic Theory - December 2-4, 2005 Resources Tutoring Advising Frequently Asked Questions List of Tutorial Software Disclaimer | Math Homepage | DePaul Homepage | CampusConnect | Contact Us | Search
Davidson College
Department of Mathematics
Davidson Math [Home] [ NewsActivities ] [ ProspectiveNewStudents ] [ Faculty ] [ Courses ] [ Programs ] [ MathCenter ] [ StudentJobOpportunities ] Davidson Math Welcome to the Davidson College Mathematics Department. If you don't find what you're looking for on these pages, feel free to contact us directly. Chair: Richard D. Neidinger rineidinger@davidson.edu Dept. Assistant: Vanessa Victor vavictor@davidson.edu Phone: 704-894-2315 Fax: 704-894-2005 Mail: Department of Mathematics Davidson College Box 7129 (USPS) 209 Ridge Road, Box 7129 (other deliveries) Davidson, NC 28035-7129 Science and Mathematics at Davidson
Colorado College
Mathematics Department
Colorado College Math Department
Cedarville University
Department of Science and Mathematics.
Cedarville University - Department of Science and Mathematics http: www.cedarville.edu academics sciencemath index.cfm Skip to Content Admissions :: Services Ministries :: Alumni Friends Cedarville University Home Academics School of Engineering, Nursing Science Science Math Department of Science and Mathematics Science and Math News CU Geoscientist Presents Research Cedarville University Associate Professor of Geology Dr. John Whitmore presented his research findings on the Coconino Sandstone of the Grand Canyon at the 117th annual meeting of the Geological Society of America. More Information All of our outstanding science and mathematics programs benefit from the breadth and variety of course offerings available, a dedicated faculty, and our modern facilities. Cedarville's rigorous academic program prepares you for the career or graduate program of your choice. You will generally be in small classes, all taught by dedicated Christian scientists who are specialists in their fields. You will also benefit from the advanced laboratories and equipment in our Engineering, Nursing, Science Center; ours is one of the best-equipped and largest facilities of its kind among independent colleges. Science Math Academics Faculty Staff Request a Letter of Recommendation Science Math Day Calculus Readiness Exam Pre-Med Program Origins Statement Bioethics Links Contact Department Home Cedarville University About Us Academics Academics Home Continuing Education Graduate Programs Honors Program Library Summer School Travel Study Undergraduate Programs Athletic Training Biblical Education Business Administration Communication Arts Education Engineering Exercise Sport Science Graduate Programs Interdisciplinary Studies Language Literature Music Art Nursing Psychology Science Math Social Science History Schools School of Engineering, Nursing, Science School of Health Human Performance School of Humanities, Fine Arts, Bible School of Social Science Professional Studies Calendar Calendar Home Month View Seven Day View Search CU on the Road Itineraries Download to PDA Departments Departments Home Academic Assistance Academic Division Academic Services Admissions Alumni Relations Annual Fund Athletics Bookstore Buildings Grounds Caf Vecinos Campus Activities Campus Safety Career Services Cashiers CDR Radio Christian Ministries Chuck's (Cafeteria) Churches Schools Community Ministries Computer Services Counseling Services Development Division Discipleship Ministries Drama Touring Teams External Relations Financial Aid Gift Planning HeartSong Touring Teams Human Resources Institutional Research Library Missions Involvement Services Planning Post Office Production Services Public Relations Recreation Center Registrar Student Life Division University Medical Services Writing Center Find a Person Find an Organization Prayer Praise Website Search Please note: This site's design is only visible in a graphical browser that supports Web standards, but its content is accessible to any browser or Internet device. If you are using an old web browser, you will need to upgrade to a Web standards compliant browser to see this site as it was designed. Cedarville University | 251 N. Main St. | Cedarville, OH 45314 USA | 1-800-CEDARVILLE (233-2784) | 1-937-766-7700 Copyright 1996-2005 Cedarville University | All Rights Reserved | Copyright Infringement Notification | Legal Information Please read our Web Disclaimer and Privacy Statement | Send Problems or Questions to the Web Development Coordinator
Carthage College
Mathematics Department
Carthage - Math - Main Home Directory Course Listings Math Major and Minor Faculty Undergraduate Research Public Speakers Secondary Ed Pre-Engineering After Carthage Alumni Pi Mu Epsilon Facilities Web Resources Actuarial Work Mathematics Mathematics@Carthage This site is under construction. To view the current site, please click here . The Mathematics program at Carthage is very active and visible, thanks to dedicated faculty and outstanding students. This short summary doesn't begin to describe all that we do, but it should give you an indication as to the department's strengths and emphases. To really understand Mathematics at Carthage, come see our beautiful campus and meet the faculty and students! For more information, please contact the Department of Mathematics at (262) 551-5856 or contact the department chair directly . Department Assessment Activities The Computation and Visualization Laboratory Home Page
Carleton College
Department of Mathematics and Computer Science
Carleton College: Mathematics and Computer Science Skip Navigation Text Only Printer-Friendly Site Navigation Information for... - Prospective Students - Current Students - International Students - Alumni - Parents Families - Visitors - Faculty Staff Quick Links: - A to Z Guide - Academic Departments - Admissions - Athletics - Campus Offices - Carleton News - Employment Opportunities - Event Calendars - Giving to Carleton - Gould Library - Phone Email Directory - Registrar's Office - Site Map - The Arts at Carleton You are here: Academic Departments Mathematics and Computer Science Mathematics and Computer Science Mathematics and Computer Science Mathematics Computer Science Mathematics and Computer Science pages maintained by Michael Tie This page was last updated on 9 September 2004 Text Only Printer-Friendly
California State University, Monterey Bay
Institute for Mathematical Sciences and Applications
Mathematics and Statistics Department - California State University Monterey Bay This site requires frames
California State University, Los Angeles
Department of Mathematics and Computer Science
The Department of Mathematics at CSULA
California State University, Hayward
Department of Mathematics and Computer Science
MCS Home Page
Bucknell University
Department of Mathematics
Math Department at Bucknell myBucknell | Giving To Bucknell | Bookstore Mathematics Events Students Prospective Students Curriculum Courses Faculty Faculty Positions Department Facilities General Information Alumni Graduate Program Gold Exam Bucknell Information For: Select one Prospective Student Alumni Parents Friends Current Students, Faculty Staff Visitors Home Academics Colleges Departments Academic Departments Math Terms of Use Privacy Statement Site Index Contact Bucknell MOORE AVENUE LEWISBURG PA 17837 (570) 577-2000 Bucknell University All Rights Reserved
Briar Cliff University
Department of Mathematics. (Sioux City, IA, USA)
Mathematics Home Page E-mail Web Advisor BCU Online Password Intranet Search Home academics department of mathematics Courses Major or Minor Learning Outcomes Math Faculty Course Materials Schedules Student Handbook Job Information Skills Assessment Math Links Welcome to the Briar Cliff mathematics home page. Department of Mathematics and Computer Science Briar Cliff University Sioux City IA 51104 Phone: 712.279.5541 E-mail: Mathematics Copyright 2005 Briar Cliff University, 3303 Rebecca Street Sioux City, Iowa 51104 Admissions: 1.800.662.3303 | admissions@briarcliff.edu Web: 1.712.279.5401 | webmaster@briarcliff.edu
Boston College
Mathematics Department.
Mathematics Department - Boston College BCInfo AtoZ SEARCH DIRECTORIES CONTACTBC bc home schools as math Search Math Dept. AS BC Sites MATH DEPARTMENT WHO WE ARE UNDERGRADUATE PROGRAMS UNDERGRADUATE SERVICES GRADUATE PROGRAMS COURSE OFFERINGS AND DESCRIPTIONS SEMINARS COLLOQUIA FACULTY RESEARCH AND PUBLICATIONS CAREERS IN MATHEMATICS INTERNET LINKS AND RESOURCES Contact Find Us Academic Employment Admissions College of Arts and Sciences Graduate School of Arts and Sciences Math Institute BC Case Studies Mathematics Department COLLEGE OF ARTS AND SCIENCES News Items from Carney Hall Spring Registration for Majors and Minors Registration for Spring semester begins for seniors this coming Friday, November 11. Please consult our page of comments on elective and required courses offered for the major and the minor. Spring Course Corrections A few, minor changes were made to the Spring course schedule of MT004 after the schedule was printed in the Schedule of Classes booklet. Of note: the MWF@12 class was rescheduled to 9. Please check the Course Schedule Information page available at the Student Services website for complete and up-to-date course listings. Blue Cross Blue Shield Summer Internships "The Actuarial Internship Program at Blue Cross Blue Shield of Massachusetts is designed to provide undergraduate and graduate students with an interest in pursuing an actuarial career the opportunity to spend their summer working on challenging projects in a professional environment." Read more... (92K PDF) Looking for a Teaching Job? Southern Teachers Agency is the oldest independent teacher placement service in the United States and is the only FREE placement service in the U.S. that works with teachers in both public and private schools. Visit their website at http: www.southernteachers.com . BC Math Society A group of active undergraduates is helping to revive the Mathematics Society. They're looking for a few good members. Learn more at www.bc.edu clubs bcms About the Department Basic Contact Info Department of Mathematics Carney Hall, Room 301 Boston College Chestnut Hill, MA 02467-3806 Telephone: 617.552.3750 FAX: 617.552.3789 EMail: math@bc.edu Who We Are Our faculty is a diverse group of 24 mathematicians who pursue research and publication activities . Aided by several TFs, TAs, and staff , we strive for excellence in the classroom in all of the courses we offer for our students. Graduate Programs Our graduate program leads primarily to an M.A. degree . We also participate with other Schools and Programs in joint master's degree programs. Teaching fellowships are available for most students. Undergraduate Programs Our undergraduate programs afford students an intimate experience and provide a solid background in mathematics at one of the country's premier Liberal Arts institutions. Undergraduate Services As a supplement to tutoring services offered by the The Connors Family Learning Center , we provide our own tutoring service , free of charge, to undergraduate students in core-level and calculus courses. We maintain a separate website for course advisement for non-majors, and offer procedural guidelines and information for registration overrides and course approvals . [ Learn Our Web : Feedback : Top of Page ] Updated: November 12, 2005 Maintained: Math Department URL: http: www.bc.edu schools cas math 2005 The Trustees of Boston College. Legal
Ball State University
Department of Mathematical Sciences
Department of Mathematical Sciences Sorry, this document can be viewed only with a frame-capable browser. We will provide an alternate access soon.
Auburn University, Montgomery
Department of Mathematics
AUM - Auburn University Montgomery aum schools sciences departments and undergraduate programs mathematics and pre-engineering Mathematics Reasons to Consider a Mathematics Degree Program at AUM: Opportunities for Undergraduate Students in Mathematics Programs of Study Courses Math Placement Test at AUM Calculator Policies at the Department of Mathematics at AUM Math Club Message from the Head Montgomery Area Mathematics Seminar Online Math Journals Contact Us (officesandfaculty) Mathematics Mathematics, Mathematics Education, ComputerScienceand Pre-Engineering Thank you for visiting the AUM Department of Mathematics Web site. We have recently updated our website in order to make more information and services available to you. Tenure-Track Positions Available We have two positions available . Apply by November 15th for full consideration. If you are considering entering one of our degree programs in mathematics, mathematics major with an emphasis in computer science, Mathematics Education option or our two-year pre-engineering programplease read the Top Five Reasons why you should consider one of our many degree programs. It is an exciting time to be at AUM, and even more exciting if you are a major in one of our degree programs, or if you are bound to enroll in one of our service courses offered in support of other AUM degree programs. If you are a major of one of our programs, or you are otherwise interested in Mathematics, we strongly encourage you to join our Math Club . Mathematics at AUM... Math Placement Exam ... For new students Undergraduate Studies at AUM ... Major minor requirements Career Outlook Frequently Asked Questions about Calculators Information About the Department... Message from the Head Top reasons for consider one of our programs Class Schedules Courses ... Descriptions of courses and links to sample syllabus are given for state approved core courses. People, Organizations, and Web Resources ... Contact Us ... Faculty and Staff addresses, e-mail, phone numbers and Web pages Math Club Montgomery Area Mathematics Seminar Pictures from 2005 Zassenhaus Group Theory Conference Pictures from SONIA KOVALEVSKY 'S MATHEMATICS DAY March 5 2005 at AUM Pictures from SONIA KOVALEVSKY 'S MATHEMATICS DAY March 13 2004 at AUM Opportunities for Undergraduate Students in Mathematics Our Favorite Links Online math journals accessible at AUM Academics | Prospective Students | Students | Faculty Staff | Administration | Athletics | Alumni | Services About AUM | Ask AUM? | Bookstore | iPlanet | Library | WebComments | WebCT | WebPay | Webster | AUM Home Copyright 2005 Auburn University Montgomery P.O. Box 244023 |Montgomery, AL 36124-4023 | (334) 244-3000
Abilene Christian University
Department of Mathematics and Computer Science. (Abilene, TX, USA)
ACU CS MATH Mathematics and Computer Science Faculty Degrees and Minors Courses Links CS MATH Intranet West Texas Scholars Contact Us Walling Lecture Hall Reservation Request CS MATH Classroom Reservation Request ACU home Academics College of Arts and Sciences Mathematics and Computer Science Welcome! In the Department of Mathematics and Computer Science at Abilene Christian University, we are educating students about quantitative and algorithmic thinking in an environment that encourages moral, principled choices. Math Science Centennial Conference January 2728, 2006 Register to Attend Submit an Abstract Keynote Speakers Conference Home Page BCCTMS Math Science Meet Meet Home Page Online Registration Registration Form Degrees and Minors Computer Science (CS) Actuarial Science (MASC) Mathematics (MATH) Mathematics Teaching (MATT) Minor: Computer Science Minor: Mathematics Course Information MATH 120 MATW 120 Spring 2006 Courses: CS , MATH , MATW ACU Schedule Bulletin People Alumni Focus: Michelle Keyser Faculty Focus: Dr. Riggs Online Math CS Directory For Prospective Students What is Computer Science? What is Mathematics? Sample First-Year Schedules: - Computer Science - Actuarial Science - Mathematics - Mathematics Teaching AP Calculus Credit Information News and Events Student Achievements Graduates of 2005 Faculty Activities Math Science Centennial Conference (Jan 2728, 2006) Problem of the Week Women in Math Some documents on this website require Adobe Reader free software for viewing and printing Adobe Portable Document Format (PDF) files. Adobe Reader is available from the Adobe website. Recommend This Page Last Update: September 05, 2005 http: www.mathcs.acu.edu 05 index.shtml Questions to webmaster@mathcs.acu.edu Copyright 1995-2005 Abilene Christian University. All rights reserved.
San Francisco State University
Department of Mathematics. (San Francisco, CA)
Mathematics Department Home page Welcome Department of Mathematics San Francisco State University Course Information Greetings from the chair Faculty and Staff Undergraduate Program Contact Information Colloquium and Seminars Graduate Program Student Opportunities Teaching Credential Program Math Lab Mathematics Tutoring Tenure-track Hiring Math Club Lecturer Hiring Advisors Calculus Pretest Careers with Mathematics Highlights and News Sites of Interest Upcoming Events Biology and Mathematics in the Bay Area, December 3, 2005 AMS Sectional Meeting, April 29-30, 2006 | Mathematics | SFSU | Other Departments | 1600 Holloway Ave, San Francisco, CA 94132, Telephone : (415) 338-2251, Fax : (415) 338-1461 Contacting Department of Mathematics Questions, comments, suggestions?
East Central University
School of Mathematics and Sciences.
East Central University NAVIGATION School of Mathematics and Sciences SEARCH: Biology Cartography Geography Chemistry Computer Science Environmental Health Science Family Consumer Science Health Information Management Mathematics Nursing Physics Carlock Scholarship Dean's Office Math and Science Programs Math and Science Scholarships Mathematics and Sciences Calendar of Events 2005-2006 Mission Statement Home Academics Schools School of Mathematics and Sciences WELCOME TO THE SCHOOL OF MATHEMATICS AND SCIENCES As one of the largest and most comprehensive academic units of East Central University, the School of Mathematics and Sciences seeks to advance scholarly and creative endeavor through excellence in teaching, research or creative activities, and service. The faculty and staff of the School provide eighteen undergraduate and ten pre-professional programs to its constituents. These programs are located within the academic departments of Biology, Cartography and Geography, Chemistry Physics, Computer Science, Environmental Health Science, Family and Consumer Sciences, Health Information Management, Mathematics and Nursing. Information Dean's Office Information... Resources Oklahoma State Science and Engineering Fair OSSEF Web Site Oklahoma Junior Academy of Science OJAS Web Site News Events Topics Calendar of Events 2005-2006 Math and Science Scholarships More.... 2004 East Central University. All Rights Reserved. Privacy Policy | Legal | SiteMap Site Development by AriaMedia using Content Conductor .
California State University, San Marcos
Department of Mathematics.
CSUSM Department of Mathematics Department of Mathematics [ CSUSM Home ] [ CSUSM Search ] [ Help for this Site ] Page Last Revised on 08 10 2005 Mathematics prepares students for teaching careers in high school and community college, for graduate study, and for jobs in industry. Mathematics majors will develop the ability to explore, to conjecture, and to reason logically, as well as the ability to solve a variety of problems. c ampus maps academi c calender weather freeway speeds CSU San Marcos Dept. of Mathematics 333 S. Twin Oaks Valley Rd San Marcos, CA 92096. Chairperson: Dr. Linda Holt 335 Science Bldg 2 Phone: (760) 750-4092 Email: lholt@csusm.edu Administrative Coordinator: Carrie Dyal 337 Science Bldg 2 Phone: (760) 750-8059 Fax: (760) 750-3439 Email: c dyal @csusm.edu Department links
Christopher Newport University
Department of Mathematics (Newport News, VA).
Department of Mathematics Department of Mathematics WELCOME Welcome to the CNU Department of Mathematics website. There is lots of good information here for you to browse through. We have grouped this info together for the different types of visitors to our site. If you answer YES to a question below, use its link to take you to info that you will probably be interested in. Are you a new undergraduate student at CNU? Thinking of attending CNU as an undergraduate? If YES, visit our New Prospective Undergraduate Student site to learn more about the math department, minimum math course requirements for undergraduate students, and the mathematics scholarship program. Are you a currently a CNU undergrad? You may want to browse the Current Undergraduate Student site if your answer is YES. There you can get information about math requirements for specific majors, detailed math department course offerings, the mathematics major and minor programs, the mathematics tutor and computer labs, and the math department faculty. Are you pursuing or interested in the Masters of Arts in Teaching (MAT) degree? Graduate students and prospective graduate students should visit our Graduate Student site to obtain information about graduate-level mathematics courses. Just visiting or want other information abour CNU's Mathematics Department? YES? Well, we like visitors, too! The Department Information site will allow you to get additional information about the mathematics department, such as where we are located, the mathematics computer and tutoring laboratories, faculty, what's new in the department, and the annual CNU high school mathematics contest. We hope you enjoy your visit with us! If you want specific information, just click on a link on the right side of this page. You will find links on the right side of other pages at this site that will also allow you to go directly to other pages. QUICK LINKS Math Department Location New Student Site Undergraduate Student Site Graduate Student Site Faculty and Staff Undergraduate Course Listing Graduate Course Listing Computer Lab Tutor Lab Department News High School Math Contest College of Liberal Arts and Sciences Page CNU Academics Page Author: John Gallo Comments: jgallo@cnu.edu Last Revision: January 8, 2004 URL: http: www.pcs.cnu.edu math index.html
Northeast Louisiana University
Department of Mathematics (Monroe, LA).
ULM Mathematics ULM Mathematics Monroe, Louisiana General Information Faculty Information Course Descriptions KME Honor Society Prospective Students Algebra Seminar Mathematical Web Links Contact Information Test Out Review Materials Math 093 Videos Math 110 Math 111 Videos Information For Faculty Applicants ULM's Sonia Kovalevski Day
Shawnee State University
Mathematical Sciences. (Portsmouth,OH)
SHAWNEE STATE UNIVERSITY :: Mathematical Sciences Academics Future Students Current Students Faculty Staff Alumni Friends Parents Home Academics Mathematical Science Mathematical Sciences :: Contact Us :: Relevant Links :: Calculator Rental General Information :: Program Information :: Math for the GEP :: Choosing a Course of Study :: Career, Professional, Graduate Opportunities Bachelor of Science in Mathematical Science :: General Information :: Degree Requirements Bachelor of Science in Mathematical Science, Teacher Licensure (Grades 7 - 12) :: General Information :: Degree Requirements Bachelor of Science in Natural Science, Mathematics Concentration :: General Information :: Degree Requirements Bachelor of Science in Natural Science, Mathematics Science, Teacher Licensure (Grades 4 - 9) :: General Information :: Degree Requirements Directories Offices Library Search MySSU This page maintained by Chris O'Conner Shawnee State University 940 Second Street Portsmouth, Ohio 45662-4344 To_SSU@shawnee.edu 740.351.4SSU TTY: 740.351.3159 Last Updated: 10.21.2004 12:47 PM For technical issues, please contact the webmaster at Webmaster@Shawnee.edu 2004 Shawnee State University
Fond du Lac Tribal and Community College
Computer Science and Mathematics Section. (Cloquet, MN)
cs.fdltcc.edu Wetherbee Math Computer Science Wetherbee's Math and CS Information Instructor:::::::::::::::::: Ted Wetherbee Room 214 218-879-0840 ted@fdltcc.edu Fall 2005 Classes Math 1010 Math 2001 Math 0020 CSci 1020 Resources: Math Placement Past Math Courses Past Csci Course Math Path Math Courses CS Degree CS Courses Math Csci Outlines Textbooks and Materials for Wetherbee's Winter 2005 Classes The FDLTCC bookstore will carry these books. If you wish to order them on your own through some online bookstore, new or used, you can, but make sure you get the correct edition. Supplemental materials (solution guides, instructor guides, CD-ROMS, etc.) are usually available. You should have a graphing calculator for algebra, finite math, and calculus. The TI 83, 85, 86, 87, and 89 are suitable. The Casio power graphic at $41.41 (taxes included at Walmart, summer 2005) is adequate and about half the price of a TI. Sharp and HP graphing models will also work. If you already have a graphing calculator, bring it to our first class; it is probably sufficient so that you don't need to buy another. Most students use a TI 83+ or some variant in the TI 83 84 familiy. Courses Math 1015 Trigonometry Schaum's Outline of Trigonometry, Moyer, pub. McGraw-Hill, 3d edition. This costs about $16 new. Math 1040 Finite Mathematics *** not specified yet *** Math 1010 - College Algebra *** not specified yet *** Math 2001 - Calculus 1 (and Math 2002 Calculus 2) Calculus, Thomas Finney, 9th ed., pub. Addison Wesley ISBN: 0201531747 This old 9th edition is almost exactly (matches content page-for-page) the same book as the currently available alternate edition below from Addison Wesley. It can be picked up online, used, for a very reasonable cost. I've seen them sell for less than $6. ------------- OR ------------ Thomas' Calculus - alternate edition, Thomas Finney, pub. Addison Wesley, 9th edition, ISBN 0-321-19363-6 This is the book the FDLTCC bookstore will be selling new. It costs about $110, but this is still less than most calculus textbooks.
Reed College
Mathematics Department
Reed College Mathematics Department
The Citadel
Department of Mathematics and Computer Science (Charleston, SC).
Department of Mathematics and Computer Science - Home Page Home Academic Programs Courses Student Links Faculty Directory Department News Search Citadel Home DepartmentofMathematics and Computer Science The Citadel 171 Moultrie Street Charleston, SC 29409 Phone: 843-953-5048 FAX: 843-953-7391 Thompson Hall Computer Science Faculty Position Available The Department of Mathematics and Computer Science invites applications for a tenure-track faculty position in computer science at the Assistant Professor level beginning August 2006. See our position description for details.
Alfred University
Division of Mathematics and Computer Science (Alfred, NY).
Computer Science at Alfred University Office: 108 Myers Hall Phone: (607)-871-2258 Fax: (607)-871-2339 Secretary: Mrs. Bonnie Schwenn Hours: M-F 8:00 AM to 4:00 PM U.S. Mail: Division of of Mathematics and Computer Science Alfred University Saxon Drive Alfred, NY 14802-1205 Created by Boyan Kostadinov Webmaster: email me at gball [at] alfred [dot] edu Last Updated: AU Homepage | AU @ a Glance | Academics | Admissions Alumni | Parents | Faculty Staff | News | Athletics Research Outreach | Student Life | Technology
University of South Carolina - Aiken
Department of Mathematical Sciences.
Department of Math Computer Science Quick Links About Our Community About Our Faculty About USCA Academic Affairs Academic Calendar Academics Academic Programs Academy for Lifelong Learning Admissions Admission Requirements Admissions Staff Advanced Placement Policies Advisement Alumni Apply Now! Arts and Culture Assessment Office Athletics Bookstore Bulletin Calendars Campus Facts Campus Support Services Campus Visits for Students Campus Tours for Community Career Services Children's Center Chancellor's Office Classified Employees Assembly Clubs Organizations Commission For Higher Education Computer Services Conference Center Continuing Education Cost of Attendance Counseling Center Course Descriptions Course Schedules Cultural Series Current Students Degrees Offered at USCA Development Directions to Campus Directory Information Disability Services Dupont Planetarium Emergency Action Plan Enrollment Services Institutional Planning Etherredge Center Exam Schedules External Affairs Office External Recognition Fact Book Faculty Tech Support Center Fast Facts Fees and Refunds Finance Office Financial Aid FIPSE Grant Foreign Language Graduate Programs Graduation Information History of Campus Honors Program Housing Human Resources Institutional Research International Baccalaureate International Admissions International Programs Internet Resources Intramurals Intranet Library Living on Campus Majors Academic Programs Map MAP Program Math Lab Mission Statement Multicultural Affairs News and Events New Freshmen Transfers Organizational Chart Parents Only Peer Educators Policy Manual Post Time Notes Press Releases Public Safety Purchasing Records Request More Information Residence Life Ruth Patrick Science Center Scholarships Search USCA Web Senior Citizens SeniorNet Site Index Small Business Development Center Self Study Homepage Self Study Report SeniorNet Speakers Directory Strategic Plan Student Government Student Handbook Student Health Plan Student Life Student Life Services Student Organization Handbook Study Abroad Summer Camps Syllabi Transcripts Transfer Students Travel Programs Tuition USC Columbia USCA Committees USCA Committee Minutes USCA Forms USCA Logos USCA Magazine USCA Manuals Policies USCA Merchandise USCA Staff VIP - Online Information Visitors and Parents Wellness Center Natatorium Writing Room HOME ACADEMIC PROGRAM DEPARTMENTAL DIRECTORY STUDENT INFORMATION MATH LAB NEWS AND EVENTS ACTIVITIES RESEARCH RESOURCE ALUMNI Welcome to the Department of Mathematical Sciences The mission of the Department of Mathematical Sciences is to provide students with an understanding and an appreciation of mathematics and the related areas of computer science, engineering, physics, and astronomy. To this end the Department: (a) provides students throughout the University with training in thinking analytically through problem-solving activities and in communicating effectively using graphical and numeric symbols; (b) provides instruction for the first two years of the USC engineering program; (c) provides the mathematical background for pre-service and continuing elementary school teachers and secondary school mathematics teachers; (d) provides Mathematics Computer Science and Industrial Mathematics majors with background for graduate studies or preparation for careers in the mathematical sciences. In addition, the Department seeks to foster the study, learning and appreciation of the mathematical sciences among pre-college students through outreach activities. Did You Know? Click Image above to view video clip ( Requires Quicktime 6 ) 471 University Parkway Aiken, SC 29801 803-648-6851 ? 1-888-WOW-USCA Copyright 2005 by the Board of Trustees of the University of South Carolina. http: www.usca.edu The University Of South Carolina website http: www.sc.edu Email This Page To a Friend Comments to webmaster 01.05.04
Georgia Southern University
Department of Mathematical Sciences.
Mathematical Sciences Department - Georgia Southern University Math Homepage Colloquium Seminars Computing Facilities Degrees and Courses ** News and Events ** People Quick Links Research Resources for Faculty Resources for Students Current Activities Colloquium Math Competitions Math Tournament ** Position Searches ** Statistical Consulting Topology Conference Mathematical Sciences Georgia Southern University 0203 Georgia Ave. Room 3008 Statesboro, GA 30460-8093 Phone: (912) 681-5390 FAX: (912) 681-0654 MATHEMATICAL SCIENCES Welcome to the Department of Mathematical Sciences at Georgia Southern University, the largest university in Southeast Georgia. The department conducts teaching, scholarship, and service in many areas of Mathematics, Statistics, and Mathematics Education. Our faculty members pursue research in a wide range of areas, including Analysis, Approximation Theory, Biomathematics, Data Analysis, Differential and Difference Equations, Education, Geometry, Imaging, Numerical Analysis, Number Theory, Optimization, Statistics, Topology, etc. We offer two undergraduate degrees, the B.S. with a major in Mathematics and the B.S. in Mathematics, and we offer the M.S. degree with concentrations in Mathematics and Statistics. Majors in Mathematics and Statistics learn analytical and computational skills that prepare them for Graduate studies and help them succeed in many careers, including Actuarial Science, Engineering, Computer Programming, Forecasting, Operations Research, and many others. Interested ? Use our menu bars on the left to find out more.
Aurora University
Department of Mathematics (Aurora, IL).
AU - CASB - Mathematics at Aurora University AU Homepage Academics CASB Mathematics Hot List Menu Academic Programs Admission and Financial Aid Apply Now Arts and Culture Athletics Blackboard Calendar Campus Safety Class Schedules Directories and Information Disabilities Services E-mail Employment Library Student Resources Transcript Request Visit AU WebAdvisor College of Arts, Sciences, and Business Department of Mathematics Why Are These Here? The mathematics program at AU provides service courses for students in a wide variety of fields, as well as offering both a major and a minor. The minor in mathematics prepares students for teaching math at the middle school level, while the major prepares students for teaching math at the secondary level, entering business or industry, or pursuing graduate work in mathematics, computer science or related fields. Several of our graduates are currently pursuing graduate degrees; others are teaching in a number of middle schools and high school; some are employed at research institutions such as Fermi National Accelerator Lab and Lucent Technologies; still others are working in a variety of industrial settings. Bachelor of Science in Mathematics Minor in Mathematics Mathematics Course Descriptions Faculty Apply to AU | Library | Search | Virtual Tour | Construction Update | Contact Us Mathematics Homepage | Faculty
Whittier College
Department of Mathematics. (Whittier, CA)
math department Who We Are Math Faculty Mathematics Curriculum Technology in Math Student Life Whittier College Math Group Pictures Alumni Recipients of Pyle Award Cool Links... Whittier College Mathematics Newsletter Board Hello everyone!! The Math Problem-Solving Group will resume its regular meetings during spring semester. We meet in Sci 110 once a week, with refreshments (and sometimes pizza) provided by the math department. See Prof. Lutgen for more information. last updated: February 3, 2004 If you have any suggestions for improving this web site, you can e-mail them to the Department Chair Last updated: August 23, 2004
University of Central Oklahoma
Department of Mathematics and Statistics. (Edmond, OK)
UCO Math Stats
Hood College
Department of Mathematics (Frederick, MD).
Hood College: Academics Mathematics Quick Links Admissions Blackboard Bookstore Calendar of Events Campus News Career Center Course Schedules Graduate School Home IQ.Web Jobs Library News WebMail Department of Mathematics Faculty Curriculum Student Math Organizations Sonia Kovalevsky Math Day Links to Resources Academics Academic Departments Department of Mathematics Department of Mathematics The instruction of children should aim gradually to combine knowing and doing. Among all sciences mathematics seems to be the only one of a kind to satisfy this aim most completely. -- Immanuel Kant In the mathematics department at Hood, we believe in both knowing and doing. In your math classes here, you will perform experiments, collect data, and discover patterns. You will work with other students on group projects. Together with a lab partner, you will explore mathematics on the computer. You will read and write about mathematics. Classes are small, and students and faculty work closely together. Hodson Science and Technology Center We designed Hoods Hodson Science and Technology Center with our teaching methods in mind. Classrooms are designed to support group work as well as more traditional lectures. In our dedicated computer labs there is plenty of room for two lab partners to work together, and we have the latest mathematics and graphics software installed. There are seminar rooms, where we hold classes like our student-run senior seminar in the history of mathematics. And there are comfortable spaces for students to study, talk, relax, or do their homework. We share this space with the Departments of Computer Science, Biology, Chemistry and Physics, so students and faculty can collaborate on interdisciplinary projects. Students can also participate in our summer research institute, working closely with faculty on individual research projects. The major and minor in mathematics We offer a B.A. in mathematics that prepares students for a career in government or industry, or for graduate study. In conjunction with the Education Department, we also offer secondary education certification, preparing students to teach mathematics in middle or high school. Mathematics majors take courses in both pure and applied mathematics, including statistics and computer programming. We use computers in almost every course, and emphasize writing and problem-solving. The math major may also be combined with just about any other major at Hood, for an interesting and useful double major. The mathematics minor introduces students to the two major strands of mathematics, the continuous and the discrete. Students may choose two electives to complete the minor, enabling them to explore an area of mathematics that interests them in greater depth. We also offer a minor in mathematics education, designed for students majoring in early childhood, elementary or special education who have a special interest in mathematics. Dual degree program in engineering In cooperation with George Washington University in Washington, D.C., Hood offers a five-year dual degree program in engineering. Students spend the first three years at Hood as mathematics majors, taking the core courses for engineering and courses in the humanities and social sciences. Then, at GW, they concentrate on a particular branch of engineering. At the successful completion of the five-year program, the student is eligible to receive two degrees, a Bachelor of Arts degree from Hood College and a Bachelor of Science degree from George Washington University. Post-baccalaureate program in secondary mathematics Hood College offers a 15-credit graduate certificate program in Secondary Mathematics Education, for current teachers. The program has been approved by the Maryland Higher Education Commission and is designed to address the teaching of the Maryland Core Learning Goals in mathematics. All courses in this certificate program may be applied towards a Master of Science degree in Curriculum and Instruction with a secondary education concentration.
Gettysburg College
Department of Mathematics and Computer Science.
Gettysburg College-Mathematics Faculty and Staff Courses Programs News Events Students Department Activities Opportunities Information for Applicants Contact Information for the Department of Mathematics Beth Helm Box 0402 Phone: (717) 337-6630 Fax: (717) 337-6638 E-mail: bhelm@gettysburg.edu Welcome to the Department of Mathematics! An education in mathematics is an excellent preparation for a career in either pure or applied mathematics, in academia or in industry. Because physics, chemistry, computer science, economics, and even social sciences rely heavily on mathematical methods, a mathematical background can provide you with an advantage in many different careers. The mathematics curriculum at Gettysburg seeks to provide a foundation for students who will specialize in mathematics or in fields that use mathematics. By carefully selecting your courses, you can prepare for graduate study in mathematics, for secondary school teaching, or for a career in a mathematically related field. Recent graduates have found careers in government, law, management, medicine, and quality control as well as in the more traditional areas of employment for mathematics graduates. The computer has played a major role in the mathematical renaissance. Thus, it is essential that students of mathematics learn to use computer technology as a problem solving tool. We make every effort to integrate the computer into our mathematics courses when appropriate, using such programs as Mathematica and MATLAB. Our department also provides options for those students who wish to focus on the theoretical areas of mathematics. We offer a variety of courses, including abstract algebra, geometry, and combinatorics, for those whose interest lies in these areas. In addition, Gettysburg College offers the Budapest Semesters in Mathematics as an affiliated off campus study program, which provides students the opportunity to study mathematics in an intense environment with distinguished Hungarian instructors. Questions Comments about this site? Gettysburg College
The Catholic University of America
Department of Mathematics (Washington, DC).
The Catholic University of America - Mathematics Department Navigate CUA ------------------------ CUA Home President Admissions CUA Athletics Campus Ministry Home@CUA Web Mail Cardinal Card Phone Book Cardinal Students Mullen Library Public Affairs Summer Sessions Alumni Undergraduate Programs Graduate Programs Faculty News Events Course Descriptions Admissions Alumni Mathematical Contest Functional Analysis Seminar CUA in Washington Search this Website CUA Home Home Site Map Contact Us Text Only Calendar Welcome to the homepage of the Math Department at The Catholic University of America. This page has been created to provide information on a variety of topics. Click on any of the titles that you see on the left to learn more about our degree programs, course offerings, faculty, and special events. We welcome your questions, comments, and suggestions. 207 McMahon Hall The Catholic University of America 620 Michigan Ave NE Washington DC 20064 phone: 202-319-5221 fax: 202-319-5231
American River College
Department of Mathematics. (Sacramento, CA, USA)
American River College : Mathematics Area : Home Mathematics Math Program Faculty Contact MESA Math Classes Statistics Classes Oak Tree Center MMLC Class Schedules Room Locator On-line Classes Math League ARC offers individual classes in a wide range of math and statistics subjects, as well an A.S. degree in mathematics. Courses span a range of subjects, from basic arithmetic and prealgebra all the way through the more advanced topics of statistics, calculus, differential equations and linear algebra. The degree program gives students the opportunity to complete the lower-division coursework in preparation for transfer to a four-year program in mathematics. Mathematicians work as statisticians, analysts, computer programmers, actuaries, researchers, planners, and educators. In addition, a strong mathematics background provides the foundational basis for matriculation in numerous other fields of study in science and engineering. A Mathematics and Statistics Information File (PDF) of the ARC catalog is available. American River College 4700 College Oak Drive Sacramento, CA 95841 (916) 484-8011 Part of the Los Rios Community College District General E-Mail Queries Contact Webmaster
Miami University, Oxford, Ohio
Department of Mathematics Statistics
Miami University - Department of Mathematics and Statistics About the Department Undergraduate Program Graduate Program People Page Contact the Department Annual Conference Why should I take another course? (and other frequently asked questions.) Career Information Penrose Tiling at Bachelor Hall Math Stat CALENDAR of Events SUMSRI Colloquia Research Groups Statistical Consulting Lots of Links Position Announcements: Tenure Track Position in Mathematics and Tenure Track Position in Statistics (PDF format) Banach spaces and their applications in Analysis a conference in honor of Nigel Kalton's 60th birthday Miami University, May 22-27, 2006 Annual Fall Conference 2005: Mathematics and Biology Last year Fall Conference 2004: Mathematics and Symmetry 2005 High School Math Competition Current Fall-2005 Schedule Next Spring-2006 Schedule Course Catalog: Math | Stats Read the current and earlier issues of the Mathstat Newsletters. Index of MathStat Newsletters
Lycoming College
Department of Mathematical Sciences (Williamsport, PA).
Mathematics Computer Science Department MathSci Home Faculty Student Organizations Professional Organizations College Catalog Course Webpages Placement Exam Information Free Tutoring Schedule Mathematical Sciences Department The Department of Mathematical Sciences offers the following majors: Computer Science (B.A. or B.S. degree) Mathematics (B.A. degree) Additionally, the department coordinates an interdisciplinary major in Actuarial Math (B.A. degree) . Minors in mathematics or in computer science are also possible. Details of degree requirements can be found in the appropriate section of the college catalog . Descriptions of individual course offerings can be accessed through the course webpages . FACULTY: Full-time Faculty: Santu S. de Silva, Ph.D David K. Haley, Ph.D Eileen Peluso, Ph.D (Chair) Larry Pritchett, ABD Gene D. Sprechini, Ph.D Cui.Yin, Ph.D Adjunct Faculty: Diane Abercrombie, M.S. Regina Collins, M.A. Roger Davis, M.S. Sherry Fagnano, M.S. Milton Loyer, Ph.D Alan Wilcox, Ph.D. STUDENT ORGANIZATIONS: ACM - Association for Computing Machinery AMIS - Association of Mathematically Interested Students KME - Pennsylvania Sigma Chapter of Kappa Mu Epsilon National Mathematics Honor Society PROFESSIONAL ORGANIZATIONS: American Statistical Association Association for Computing Machinery Association for Women in Mathematics IEEE Computer Society Mathematical Association of America National Council of Teachers of Mathematics Society of Actuaries OTHER LINKS OF INTEREST: DW Simpson Actuary Jobs CONTACT US: Telephone: (570) 321-4280 Fax: (570) 321-4389 Address: Department of Mathematical Sciences Lycoming College, Campus Box 3 700 College Place Williamsport, PA 17701 { HOME | ABOUT | PROSPECTIVE STUDENTS | CURRENT STUDENTS } { ALUMNI | ACADEMICS | ADMIN | SPORTS } { SITE MAP | INFO REQUEST } Tel.: 570-321-4000 700 College Place, Williamsport, Pennsylvania 17701 USA Any questions or problems E-Mail webmaster@lycoming.edu Copyright 2005 Lycoming College
East Carolina University
Department of Mathematics (Greenville, NC).
Department of Mathematics Mathematics Colloquia Careers Contact Us For more information please Contact Us! SCHEDULE FOR PLACEMENT TEST MATH CONTEST INFORMATION Welcome Mathematics Statistics Faculty Lecturers Graduate Students Faculty Positions Staff Undergraduate Program Graduate Program Math Lab Room Schedule Math Club Math Placement Review East Carolina University Department of Mathematics Greenville , North Carolina Phone: (252) 328-6461 Fax: 328-6414 MathWebManager CASWebManager
Denison University
Department of Mathematics and Computer Science (Granville, OH).
Denison University : Math CS Dept HOME CALENDAR DIRECTORY ADMISSIONS ACADEMICS ALUMNI COMMUNITY OFFICES SEARCH Mathematics and Computer Science Math CS Home News Events People Research Projects Contact Us News Events People Courses Majors Research Projects Computer Facilities Software Documentation Alumni Programming Contest Awards George R. Stibitz Related Links Contact Us F.W. Olin Science hall The Department offers BS and BA degrees in both Mathematics and Computer Science , and a BA degree in Mathematics Economics . Our curricula are designed so that students gain a strong theoretical background in their field of study together with a complementary understanding of applications. Students can also choose to engage in a variety of independent research opportunities while at Denison, under the supervision of one of our 10 active faculty members. To support our curricula, we maintain state of the art computing facilties that host a variety of modern operating systems. In addition, we maintain a 16 node Beowulf cluster for use in research and in upper level computer science courses. We are proud to count computer pioneer George R. Stibitz as one of our own. Dr. Stibitz graduated from Denison in 1926 and invented the first digital electronic computer at Bell Labs in 1937. He held at least 34 patents, not counting those assigned to Bell Labs. Announcements FASt Talks are every other Wednesday at 3:45pm. Stop by for refreshments beforehand. The On-line Math Contest for High School Students has come to an end. For more information, contact: Helen Viles Submit a Bug Report 1999-2005, Denison University Last modified: Tuesday, 20-Sep-2005 14:15:11 EDT
Agnes Scott College
Mathematics Department. (Atlanta Decatur, GA)
Agnes Scott College Mathematics Department Agnes Scott College Math Problem of the Week Blackboard Calculus Readiness Test Math Syllabi Fall 2000 Spring 2001 Fall 2001 Spring 2002 Fall 2002 Spring 2003 Fall 2003 Spring 2004 Fall 2004 Spring 2005 Fall 2005 Mathematics Faculty and Support Staff Alan Koch , Associate Professor (2000) B.A. University of Vermont; M.A. SUNY Albany; Ph.D. SUNY Albany Academic areas: algebra, finite groups. Myrtle Lewin , Professor (1983) B.Sc. Witwatersrand University, Johannesburg, South Africa; M.A., Ph.D. University of Wisconsin Academic areas: real analysis, geometry, collaborative learning and gender equity issues in the teaching of mathematics. Larry Riddle , Professor (1989) B.S. Carnegie-Mellon University; M.A., Ph.D. University of Illinois Academic areas: functional analysis, dynamical systems, pedagogy issues involving the use of technology in mathematics. Myrna Schwarzlose, Learning Support Coordinator (1999) B.A. University of Florida; M.A. University of South Florida Academic areas: developmental mathematics, counselor education, math anxiety. Gerry Tansey, Visiting Assistant Professor (2005) B.S. Rhodes Colleges; Ph.D. Emory University Academic areas: extremal graph theory, hamiltonicity, H-linkages. Jim Wiseman , Assistant Professor (2005) B.S. MIT; M.S., Ph.D. Northwestern University Academic areas: dynamical systems, dynamics from a topological viewpoint, voting theory. Department Information Department Fact Sheet (pdf) Degree Requirements Course Schedule for 2005-2006 (pdf) Mathematics Course Descriptions Software Used in Mathematics Courses The Problem of the Week Student Information Math Learning Assistants Schedule Career Opportunities for Mathematics Majors Research Opportunities for Mathematics Majors Recent Independent Studies in Mathematics Other Mathematics Resources WWW Mathematics Resources Mathematical Association of America Student Information American Math Society Undergraduate Web Page Biographies of Women Mathematicians MATHEMATICS 2005 Agnes Scott College 141 East College Avenue Atlanta Decatur, Ga 30030 Main Number: 404 471-6000 Toll-free: 800 868-8602
Albion College
Department of Mathematics. (Albion, MI, USA)
Albion College Mathematics and Computer Science Department Math CS Home People Faculty and Staff Alumni Prospective Students Apply Online Now Mathematics Position Academics Preparation Majors Mathematics Math Economics Math Physics Computer Science Minors Mathematics Computer Science Courses Mathematics Computer Science Spring '05 Schedule Fall '05 Schedule Colloquium Series Off-Campus Opportunities Quantitative Skills Center Awards and Activities Transfer Credit Organizations Kappa Mu Epsilon Albion College Mathematical Society Information News Calendar Facilities Careers Links Welcome! The Mathematics and Computer Science Department at Albion College includes the disciplines of pure and applied mathematics, computer science, and statistics. The department offers majors and minors in Mathematics and Computer Science. See our links on the left for more details. For further information, contact David A. Reimann , Chair Department of Mathematics and Computer Science Albion College Albion , Michigan 49224-5013 mathcs@albion.edu (517) 629-0361 Upcoming Events Today - Math CS Colloquium: Mr. Andrew Lake 11 18 - Visitation Day 12 1 - Math CS Colloquium: Mr. Giovanni DiMatteo 12 3 - William Lowell Putnam Mathematical Competition 12 3 - Visitation Day More Events Recent News 11 10 - Schemmerhorn Talks about Topology 11 5 - Students compete at ACM Regional Programming Contest 10 29 - Six Students Compete In MATH Challenge 10 27 - Schemmerhorn Talks about Elliptic Curves 10 22 - Students Attend MUMC, Fall In Hackenbush More News Notable Quote The science of pure mathematics ... may claim to be the most original creation of the human spirit. --- Alfred North Whitehead Click on your refresh button to generate other content! Albion College Albion, Michigan 517 629-1000 Home | Site Index | People Directory | Search | Contact Us 2005 All rights reserved.
Alma College
Mathematics and Computer Science. (Alma, MI)
Alma College MCS
College of Charleston
Department of Mathematics (Charleston, SC).
CofC : Math Department : Welcome to the Department of Mathematics at the College of Charleston where we are proud to excel in both teaching and research. Follow the links in the bar at the left for more information about us, or call us at 843-953-5730 to speak with someone during regular business hours. News Briefs: Mathematician wins Economics Nobel Prize: Robert J. Aumann has received the 2005 Nobel Memorial Prize in Economic Sciences "for having enhanced our understanding of conflict and cooperation through game-theory analysis". Reality Conditions: Short Mathematical Fiction: Professor Kasman has published a book of short stories about mathematics. DISCOVERY INFORMATICS: Check out the official Website of this new degree program offered by the College which combines cutting edge math and computer science with disciplines like biology, economics, sociology, physiology and astronomy. Or check out our News Archive for more information. Webmaster: Alex Kasman 2005
Grand Valley State University
Department of Mathematics and Statistics
Statistics @ GVSU Welcome to the 2006 Michigan Statistics Poster Competition Homepage The competition is sponsored by The Department of Statistics and the Regional Math and Science Center at Grand Valley State University with support from the Michigan Council of Teachers of Mathematics. 2006 Competition Online Registration Now Available:Announcing the Seventh Annual Michigan Statistics Poster Competition. Entry deadline is March 3, 2006. Click Online Registration to enter posters one at a time. News Flash!: The Department of Statistics at Grand Valley State University is hosting a Statistics Career Day onFriday, October 14, 2005 in the Kirkhof Center on the Allendale campus. For more information and to register for the event click on the Statistics Career Day link. Articles describing poster creation. Please feel free to view and print out the following articles explaining the process of creating a statistics poster. Some of these articles appeared in issues of Interchange: selecting a topic , constructing graphs , and putting it all together . Why enter ? What is it? Who can? How do we? What are the rules? What do we win? Who can help me? Where else can I look? WHY A STATISTICS POSTER COMPETITION? The NCTM Standards for Curriculum and Evaluation in School Mathematics presents the vision that problem-solving is a primary goal of mathematics instruction and recommends student involvement in statistical activities at all grade levels. According to the Standards and the benchmarks in Michigan's Curriculum frameworks, statistical thinking should begin in the primary grades with the creation of student data from class activities. In upper grades, collecting, organizing, summarizing, and interpreting data are emphasized. The statistical poster competition is a powerful tool for attaining these goals while exercising essential communication skills. WHAT IS A STATISTICS POSTER? A statistics poster is a visual display that uses one or more related graphs to summarize data, discuss different points of view, and answer question(s) about the data. WHO CAN ENTER THE COMPETITION? All students in grades K through 12 residing in Michigan are eligible to participate. Entries will be judged in four different grade level categories: Category 1: Grades K-3 Category 2: Grades 4-6 Category 3: Grades 7-9 Category 4: Grades 10-12 HOW CAN I ENTER? There is no entry fee! Click Online Registration to enter posters one at a time for the 2006 competition. We prefer that you use the online registration form. Each poster entry submitted must include: Registration form securely paper-clipped to the poster. DO NOT permanently affix the registration form to the poster. Poster with description (see rules ) securely attached to the poster back. Note: Multiple entries may be mailed together but must have separate registration forms. Please send entries flat between taped sheets of cardboard. Do not send posters rolled in a tube. Posters must be postmarked by March 3, 2006. They should be delivered to: Michigan Statistics Poster Competition Department of Statistics 1133Mackinac Hall Grand Valley State University One Campus Drive Allendale MI 49401-9403 Prize winners will be notified by April 1, 2006 RULES Posters are to measure between 18 to 24 inches by 24 to 30 inches. Any weight of paper is permitted. Standard posterboard is recommended. Be sure that anything attached to the front of the poster is affixed securely. Do not attach perishable items. Posters must be the original design and creation of the students. In the K-3 category, at least one graph is required. In 4-12 categories, at least two graphs are required. The two graphs should impart different information (i.e., a bar graph and a pie chart of the same variable does not meet this criteria). Subject matter is the choice of the participants. Data may be original or published. For published data, a reference must be given. A brief description including the method of collection and purpose must be securely attached to the back of the poster. Posters and the brief description must not contain any marks, names or information that reveal the identity of the individual, team, school, or location. Students may work individually or in teams. For the K-3 category, there is no restriction on the size of the team (it may be as large as the entire class). For the other three categories, the team may have up to four students. For teams with members from different grade levels, the highest grade level determines the category. PERMISSIONS By submitting a poster, students give permission for their work to be displayed at various conferences and special events, in publications and promotional material, and in electronic format on the Internet. Posters become the property of the competition organizers and will not be returned. Top entries will be submitted to the 2006 American Statistical Association Poster Competition . JUDGING AND PRIZES Entries will be judged within the four grade-level categories on the basis of: Overall impact of the display Does the poster catch your eye? Does the poster draw you into the investigation? Clarity of the message Do important relationships and patterns in the data stand out? Can conclusions stand alone without the explanatory paragraph on the back? Appropriateness of the graphs for the data Creativity Content Importance of the topic relative to the grade category. First, second and third prizes in the amounts of $72, $48, and $36 will be awarded in each of the grade-level categories. Winning entrants' schools will receive plaques signifying the honor. Honorable mention certificates will be awarded also. Winning posters will be displayed after mid-morning March 25, 2006 at the Michigan Science Olympiad in the GVSU Fieldhouse on the Allendale campus. You may access the scoring rubric used by the judges ! ADDITIONAL INFORMATION For additional information contact one of the event organizers: John Gabrosek, Chair Phone: (616) 331-3691 Fax: (616) 331-2910 E-mail: gabrosej@gvsu.edu PhyllisCurtiss Phone: (616) 331-3363 Fax: (616) 331-2910 E-mail: curtissp @gvsu.edu Diann Reischman Phone: (616) 331-3365 Fax: (616) 331-2910 E-mail: reischmd@gvsu.edu Kirk Anderson Phone: (616) 331-3674 Fax: (616) 331-2910 E-mail: anderkir@gvsu.edu Online Registration Deadline for postmark of 2006 posters: March 3, 2006 LINKS Michigan Statistics Poster Competition 2005 Winners American Statistical Association National Poster Competition Page Pennsylvania Poster Competition Page (includes previous winners) Visit the American Statistical Association Home Page last updated 9 07 05 Copyright 1995 - 2005 Grand Valley State University is an Equal Opportunity Affirmative Action Institution
Jacksonville University
Department of Mathematics (Jacksonville, Florida).
JU Department of Mathematics | Jacksonville University Jacksonville University graduate Richard Lee was recently named recipient of the Florida Community College at Jacksonville Downtown Campus Outstanding Faculty award for 2005. Richard earned a Master of Arts in Teaching Mathematics degree at Jacksonville University and became a fulltime professor at FCCJ in 1999. Mathematics The Color of Mathematics Tony Anderson Counting Machines and Calculus Reform Stephanie Sundberg Sliding Block Puzzles Min Kim Jacksonville University Department of Mathematics Merritt C. Penticoff Science Building
Kettering University
Applied Mathematics program (Flint, MI).
Applied Mathematics at Kettering University The brightest minds, like Galileo, have long understood that mathematics is the universal language of engineering and science. Students majoring in applied mathematics at Kettering University select a concentration in 1) Applied and Computational Mathematics or 2) Applied Statistics. The degree is very flexible in serving the interests of business and industry, preparing the student for a wide variety of careers. The degree also provides a sound preparation for graduate study. Winners of Kettering University's High School Mathematics Olympiad (April 30, 2005). Program Overview | Applied Computational Math | Applied Statistics | Math Faculty | Kappa Mu Epsilon | Other Math Sites Science Math Dept | Kettering University | Employment Opportunities This site created and maintained by Prof. Kevin G. TeBeest Kettering University 1700 West Third Ave Flint, Michigan 48504 - 4898
Centre College
Department of Mathematics (Danville, Kentucky).
Mathematics at Centre College The Mathematics Program at Centre College The Math Program The Program Course Webpages Study Sessions Tech Documents Course Schedule Topics Courses Info for majors Info for minors Catalog Information The Faculty Who we are Contact Information Brief Bios Pictures Our Students Our Majors Minors Math Club Activities What can a Centre math major do? What's been done Career Links Summer Jobs The Greatest Mathematicians of the 20th Century The study of mathematics transforms the mind and develops a creative and efficient intellect. At Centre College, the professors have a passion for teaching mathematics. We enjoy exploring new ideas with our students and, together, we solve interesting problems with a blend of classical techniques and the latest technologies. Our students master central concepts in mathematics and in the process learn to think precisely and to clearly articulate their ideas. We have an exciting and vibrant mathematics community at Centre College. We invite you to explore these webpages and learn about our program, our people, and our love of mathematics. Any comments or questions about this site can be addressed to the math web master .
Georgia State University
Department of Mathematics and Statistics.
Department of Mathematics Statistics - Georgia State Univeristy Undergraduate Graduate eMail List MathStat Village Forms Contact Us About Us News Events Faculty Staff Research Students Math Help Newsletter The Department of Mathematics and Statistics conducts teaching, research and service in many areas within the disciplines of mathematics and statistics. We provide educational opportunities for both traditional and non-traditional students by offering courses in the day and the evening. We offer baccalaureate degree programs with a commitment to teaching courses in the core curriculum. At the undergraduate level, students can opt for no concentration, or choose from concentrations in actuarial science, computer information systems, computer science, decision science, or statistics. There is also a masters degree for secondary teachers of mathematics. At the graduate level, the Department offers a masters degree. We are actively working to develop a PhD degree program; currently, our proposal is being reviewed by the College of Arts Sciences . News Events Calendar News Events Students The MILE RIMMES Undergraduate Graduate Course Schedules Research Seminars Research Groups Publications Math Prep Courses GMAT , GRE SAT, LSAT PRAXIS I; II Department of Mathematics Statistics College of Arts Sciences Georgia State University
Southern Utah University
Department of Mathematics and Computer Science. (Cedar City, UT)
SUU - Web Services: 404 Page Not Found SUU Home | A-Z Index | Contact Info | Search Page not found Sorry, the page you requested was not found. Please check the URL for proper spelling. If the spelling is correct, the page has either been moved to a new location, or removed from the server. If you're having trouble locating a page on the SUU website, try visiting the SUU home page , or try searching our site. Southern Utah University - 351 West University Boulevard - Cedar City, UT 84720 - 435.586.7700 2005 Southern Utah University | Disclaimer Note: This site is accessible to any browser, although, it will look much better in a browser that supports web standards. To view this page properly, please upgrade your browser. We recommend: Mozilla Firefox (download) Netscape Navigator 7.2 (download)
Maharishi University of Management
Department of Mathematics: applying the principles of Maharishi Vedic Science. (Fairfield, Iowa)
B.S. in Mathematical Sciences of Maharishi University of Management Degree programs in the arts, sciences, business, and humanities Site Map Visitors Weekends Podcasts Audios Apply Online Contact us Home About the University Message from the Founder History Funding from NIH Compare Undergraduate programs Computer Science: Course Titles Course Descriptions Faculty Lab Special Features Bachelor Degree in China Elementary Education Secondary Education Faculty Why Be a Teacher Licensure Courses Titles Course Descriptions Praise for our students Comments from graduates Student Portfolios Research Environmental Science: Self-Sustainability Bio-Geophysiology Green Energy Social-Ecological Interface Organic Agriculture Green Business Economics Eco-Architectural Design Fourth-Year Practicum Faculty Course Titles Course Descriptions Bachelor of Fine Arts: Introduction About Us Programs Course Titles Course Descriptions Faculty Gallery News B.A. in Literature: Literature Program Writing Program Course Titles Course Descriptions Faculty Special Features B.A. in Maharishi Vedic Science: Course Titles Course Descriptions Faculty Special Features What Our Students Say Vedic Literature in Sanskrit New Building B.A. in Management: Special Features Course Titles Course Descriptions Faculty Alumni of the Program Bachelor Degree in China B.S. in Mathematical Sciences: Course Titles Course Descriptions Faculty Maharishis Vedic Mathematics B.A. in Physiology Health: What We Teach Our Unique Approach Summary of Research Hazards of Modern Medicine Course Titles Course Descriptions Faculty Graduate programs MBA Special Features Entrance Requirements Course Titles Course Descriptions Faculty For U.S. Students For International Students M.A. in Maharishi Vedic Science Frequently Asked Questions U.S. Students International Students Entrance Requirements Course Titles Course Descriptions Faculty Ph.D. in Maharishi Vedic Science: Special Features Vedic Literature in Sanskrit New Building Course Titles Course Descriptions Faculty For U.S. Students For International Students Ph.D. in Physiology: Research Activities Faculty Summary of Research Case Histories For U.S. Students For International Students Institute for Natural Medicine and Prevention Ph.D. in Management Program Structure Course Titles Course Descriptions Faculty For U.S. Students For International Students Center for Management Research Elementary Education Secondary Education Faculty Courses Titles Course Descriptions For U.S. Students For International Students Admissions Financial Aid Admissions: Contact Us Visitors Weekends Apply Online Tuition Financial Aid Recommendation Form Financial Aid: U.S. Students: Undergraduate U.S. Students: Graduate International Students: Undergraduate International Students: Graduate Online Resources Tuition Transcendental Meditation Scientific research on TM Creating peace Introduction Message: John Hagelin, Ph.D. Endorsements World Peace Minor National Conference Campus life The Campus Sustainable Living Organic Dining Single Rooms Sports Recreation New Student Center Campus Community Around the Town Visitors Weekends Dates and Description Weekend Schedule Weekend Sign Up Information Weekend Sign Up Form Directions to the University Campus Map Media coverage Site map B.S. in Mathematical Sciences Mathematics symbolically expresses the fundamental orderliness of the intelligence that structures the universe. The Department of Mathematics offers a program in mathematical sciences that combines the study of mathematics with its applications in the natural and social sciences. Half your coursework will be in mathematics and computer science, the remainder in physics, biology, or management, according to your interests. You will understand the full range of mathematics, from its unmanifest source in pure consciousness, your own Self, to its first expression in set theory and then to its applied values in science, technology, and the arts. Entrance Requirements Before entering the mathematical sciences major or minor or the mathematics minor, students must successfully complete Functions and Graphs II (MATH 162). The University is accredited by The Higher Learning Commission www.ncacihe.org Maharishi University of Management Fairfield, Iowa 52557 (800) 369-6480 or (641) 472-1110 Right to Know and Legal Disclosures
University of North Carolina at Pembroke
Department of Mathematics and Computer Science.
Department of Mathematics and Computer Science at UNC Pembroke UNCP Web Navigation ---------- UNCP Home Prospective Students Current Students Faculty Staff Alumni Friends Visitors About UNCP News Events Academics Administration Athletics About The Community UNCP A-Z Addresses Phone Numbers Campus Map Search The Department of Mathematics and Computer Science, through its established mission seeks to assist the University in the fulfillment of its mission throughout its service region. From its early history the department has evolved into a vibrant multifaceted role of support of a liberal arts education; offering majors in mathematics and in computer science; providing service courses for other program areas and working cooperatively with the School of Education to develop licensure programs for prospective teachers in the areas of middle grades and secondary mathematics. Through the Graduate Studies office the department also offers a Masters of Arts in Education program (M.A. Ed.) in mathematics education. Updated: Wednesday, October 9, 2002 2001 The University of North Carolina at Pembroke Department of Mathematics Computer Science Email: mathcs@uncp.edu
Wheeling Jesuit University
Department of Mathematics. (Wheeling, WV)
Page Not Found - Wheeling Jesuit University WJU Home Weare alwaysupdating our web site with useful information for you. Sometimes old pages are removed and information is relocated to another page. That must have happened to the page you attempted to load. If you would like to get to our home page, click on the Flame graphic at the top of the page. You can also use the navigation links across the bottom of the page to jump directly to a specific section of our web site. If you have any problems navigating the site or if you have suggestions for information we can add to the website orif you would just want to say "Go CARDINALS!", send us an email at webmaster@wju.edu . About WJU Academics Admissions Adult Ed Alumni Athletics Student Life Search Berthold Neal Family Exemplifies Spirit, Endows Scholarship Calendar President's Welcome Directory Campus Tour Ways to Give Services Fin. Aid Quick Links Administration Appalachian Institute Apply Online Buy Your Textbooks Campus Directory Campus Ministry Campus Services Cardinal Perspectives Career Development Ctr. Catalogs Ctr. for Educational Technologies CEU Programs Challenger Learning Ctr. Departments Directions Employment HR F05 Final Exam Sched. Facility Rentals FAQs Financial Aid HESS Mentoring Program International Students Jesuit Community Leadership Skills Library Majors Degree Programs National Technology Transfer Ctr. NTTC - RFP Performing Arts 2005-2006 Registrar's Office Request for Readmission Form Speakers' Bureau Submit Your News Story Training Initiatives Tri-State Tax Institute 2005 Wheeling Jesuit University, Inc. 316 Washington Avenue Wheeling, West Virginia 26003 (800) 624-6992 Legal Website Powered by ActiveCampus Software by LiquidMatrix
Truman State University
Division of Mathematics and Computer Science. (Kirksville, MO)
Welcome - Math and Computer Science Department Search: Login Welcome Students Faculty Alumni ContactUs Welcome Mathematics and Computer Science Division The division is located in the newly renovated Violette Hall on Truman State's campus last edited 2005-10-27 16:13:26 by dbindner RecentChanges FindPage HelpContents Edit Show Changes Get Info More Actions: Show Raw Text Show Print View Delete Cache -------- Attachments Check Spelling Show Like Pages Show Local Site Map -------- Rename Page Delete Page MoinMoin Powered Python Powered Valid HTML 4.01 getACL = 0.005s run = 0.098s send_page = 0.094s send_page_content = 0.005s total = 0.100s
University of Akron
Department of Theoretical and Applied Mathematics. (Akron, OH, USA)
Welcome to Mathematics at The University of Akron
John Brown University
Department of Mathematics (St. Siloam Springs, AR)
John Brown University - Department of Mathematics Department of Mathematics:: Science :: Academics :: JBU Home Faculty Degrees Courses Math Dept. Home Division Home Division of Natural Science Department of Mathematics The Department of Mathematics offers courses which provide a solid foundation in the mathematical sciences consistent with a Christian world view. The curriculum is designed to provide the mathematics major with the knowledge and skills necessary to enter a career in teaching, insurance and finance, industry, or to continue into graduate school. The department also offers a Core Curriculum course and support courses for students majoring in engineering, chemistry, biology, business, elementary education, and pre-professional programs. Check out the D.W. Simpson Actuarial Search site (www.actuaryjobs.com ) for math careers. Copyright 2005 John Brown University 2000 W. University St., Siloam Springs, AR 72761 | 479.524.9500 | jbuinfo@jbu.edu contact us | search | privacy
Iona College
Mathematics Department. (New Rochelle, NY)
404 Error - Iona College Error School of Arts and Science Hagan School of Business Libraries Athletics Future Students Current Students Alumni Friends Visitors Fast Facts The page you are looking for cannot be found Iona College has recently undergone a site redesign and many pages have been moved or renamed. It looks like you may be trying to access a page using an old bookmark or through an old search engine query results page. We apologize for this inconvenience... Please try the following: If you typed the page address in the Address bar, make sure that it is spelled correctly. Open the www.iona.edu home page, and then look for links to the information you want. Feel free to search for the page content in question using our search engine . Check our A-Z Index . We may be able to guide you to your intended destination if you fall into any one of these categories... Future Student Current Student Iona College Alumni Iona College Visitor (maybe you're looking for some Fast Facts?) Iona College Faculty or Staff Member If you continue to have trouble finding what you're looking for, please feel free to contact our webmaster and notify us of the situation so that we can resolve the issue posthaste. HTTP 404 - File not found Internet Information Service
Albertson College of Idaho
Mathematics Department. (Caldwell, ID, USA)
Albertson College of Idaho - Page Not Found 404 Error - Page Not Found Prospective Students Current Students Faculty Staff Alumni Friends About ACI Admission Academics 2005-6 Catalog Campus Life Athletics Offices and Services Site Map Site Search: The page you are looking for has not been found. We have recently updated the Albertson College site and it is likely the page has been moved. You can try to locate the page with the site map or our site search below, or navigate from the Albertson College homepage . If you have any further problems, contact the webmaster . Site Search Enter your search below: Site Map Admission Admission Apply Transfer International Dates Deadlines Application Financial Aid Cost Info Academics Why ACI Quick Facts Interact Meet your Counselor Brian A. Bava Erica Heinz Alexis Kenyon Alicia Meza Charlene Brown Counselor by state Tour the Campus Online Current student Profiles Biology Majors Schedule a visit to ACI Housing Academics Academics Departments Terteling Library About the Library Library Hours Library Staff Periodicals 0 - 9 A B C D E F G H I J K L M N O P Q R S T U V W Y Using Databases Off-Campus LiLI Database Information Interlibrary Loan Borrowing Library Materials Reference and Instruction Course Reserves Alumni and Guest Services Tutoring Registrar's Office Request Transcript Fall Academic Calendar Winter Academic Calendar Spring Academic Calendar Study Abroad Why Study Abroad Choose a program Approved Programs Eligibility Apply Health and Safety Travel, Passports FAQ Course Schedules 2005-6 Catalog 2005-6 Catalog About Albertson College History Tradition Mission Liberal Arts The Degree Student Rights and Responsibilities Liberal Arts Core Liberal Arts Curriculum Student Affairs ASACI Campus Life Campus Ministries Campus Safety Student Right to Know Crime Prevention Criminal Statistics Identification Cards Marijuana and Other Drugs Lost and Found Motor Vehicles Parking Stranger and Relationship Violence Center for Experiential Learning Counseling Center Disability Services Disciplinary Affairs Diversity International Program Health Services McCain Student Center Operations New Student Orientations Residence LIfe Staff Residence Halls Living in Residence Halls Lifestyle Options Dues, Funds, and Mealplans Hall Staff and Governance Agreement Cancellation Policies Student Activities Registering Organizations Hazing Advisors Registered Events Study Skills Women's Men's Center Policies Procedures Grades and Transcripts Grade Mediation Policy Academic Misconduct Academic Standing Academic Reprieve Incomplete Marks Pass-Fail Option Registration Enrollment Enrollment Normal Load and Overload Class Attendance Auditing and Non-credit Instruction Withdrawal from Courses Withdrawal from College Leave of Absence Departments and Programs Advising Majors and Concentrations Minors Special Opportunities Pre-professional Programs Independent Study Internships Study Abroad Anthropology Sociology Department Major, Minors, and Concentrations Anthropology Courses - lower division Anthropology Courses - upper division Sociology Courses - lower division Sociology Courses - upper division Department Homepage Art Department Major, Minors, and Concentrations Art Courses - lower division Art Courses - upper division Department Homepage Biology Department Major, Minors, and Concentrations Biology Courses - lower division Biology Courses - upper division Department Homepage Business Department Major, Minors, and Concentrations Business Courses - lower division Business Courses - upper division Department Homepage Chemistry Department Major, Minors, and Concentrations Chemistry Courses - lower division Chemistry Courses - upper division Department Homepage Education Department Certification and Minors Master of Arts in Teaching Course of Study Education Courses - lower division Education Courses - upper division Education Courses - Graduate Department Homepage English Department Majors and Minors Programs English Courses - lower division English Courses - upper division Journalism Courses Writing Courses Department Homepage History Department Majors, Minors, and Concentrations History Courses - lower division History Courses - upper division Department Homepage Mathematical and Physical Sciences Department Majors, Minors, and Dual Degrees Mathematics Courses - lower division Mathematics Courses - upper division Computer Science Courses - lower division Computer Science Courses - upper division Physics Courses - lower division Physics Courses - upper division Geology Courses Geography Courses Department Homepage Modern Foreign Languages Department Majors and Minors Modern Foreign Language Courses - lower division Modern Foreign Language Courses - upper division Department Homepage Music Department Majors, Minors, and Concentrations Additional Requirements Applied Music, Ensembles, and Education Music Courses - lower division Music Courses - upper division Department Homepage Philosophy and Religion Department Majors and Minors Philosophy Courses - lower division Philosophy Courses - upper division Religion Courses - lower division Religion Courses - upper division Department Homepage Physical Education Department Majors and Minors Physical Education Courses - lower division Physical Education Courses - upper division Department Homepage Political Economy Department Majors and Minors Political Economy Courses - lower division Political Economy Courses - upper division Department Homepage Psychology Department Majors and Minors Psychology Courses - lower division Psychology Courses - upper division Department Homepage Theatre Department Majors and Minors Theatre Courses - lower division Theatre Courses - upper division Department Homepage Asian Studies Asian Studies Courses Department Homepage Environmental Studies Major and Minor Core Focus Environmental Studies Courses Department Homepage Health Sciences Department Homepage Cooperative Programs Master of Accountancy - UofI Master of Business Administration - BSU Master of Business Administration - Gonzaga Engineering - BSU Engineering - UofI Engineering - Columbia Engineering - Washington Juris doctor degree - UofI Master of Management - Willamette Master of Natural Resources - UofI Nursing - ISU Clinical Laboratory Science - ISU Speech-Language Pathology and Audiology - ISU Master of Occupational Therapy - ISU Master of Public Health - ISU Master of Physician Assistant Studies - ISU Doctor of Physical Therapy - ISU Doctor of Pharmacy - ISU Admission Admission Categories Freshman Transfer Readmission Homeschool International Students Students with Disabilities Special Students Notification International Baccalaureate Advanced Placement Cost of Attendance Residence Hall Costs Deposits Fees Typical Costs Part-time Enrollment Strategies for Success Program Psycho-Educational Evaluation Financial Arrangements Student Privacy Act Refunds for Withdrawal Leave of Absence Non-Academic Student Petitions Student Financial Assistance Application Procedure Refund Policy for Withdrawals Maintaining Eligibility for Financial Aid Treatment of Special Academic Situation Faculty and Administration Faculty Emeritus Faculty and Staff Presidents Campus Life Campus Life Student Handbook Student Government ASACI Officers Senate Senators Committees Meeting Minutes Voting Records Attendance Records ASACI Code ASACI Constitution Legislation All Senate Orders Coyote - Student Newspaper Student Web Pages Caldwell Fine Arts Rosenthal Gallery Orma J. Smith Museum of Natural History Campus Ministries Late Night Chapel Servantship Graduate Internship Potter's Clay Potter Clay Pictures Meet the Staff Pre-Seminary Internship Diversity on Campus Philosophy and Religion at ACI Health Services Nurse Counseling Residence Life Anderson Hall Hall Staff Room Tour Large Closet Floor Plan Small Closet Floor Plan Single Floor Plan Finney Hall Hall Staff Room Tour Hayman Hall Hall Staff Room Tour Double Floor Plan East West Single Floor Plan North South Single Floor Plan Voorhees Hall Hall Staff The Village Ketchup Floor Plan Mustard Floor Plan Forms and Information Professional Staff Profiles Residence Life Phone List Room Prices What To Bring Forms Study Skills Disability Services Bon Appetit Food Services Student Activities Clubs Organizations Event Registration Banking Compliance Disciplinary Policy Hazing Policy Interest Roster Club Registration Returning Organization Registration Greek Life Kappa Sigma Delta Tau Delta Sigma Chi Kappa Alpha Theta Kappa Kappa Gamma Gamma Phi Beta Intramural Athletics Officers Schedule Football Volleyball Outdoor Program Center for Experiential Learning Graduate Studies Job Postings Teacher Resources Internships Athletics Athletics Cross Country Men's Soccer Women's Soccer Volleyball Men's Basketball Women's Basketball Skiing Swimming Baseball Golf Softball Track Field Women's Tennis Coyote Athletic Association Athletic Department Staff About ACI About ACI Mission Statement Archives History College History Finney Hall History Meet President Hoover Southwest Idaho Liberal Arts Administration Jobs at Albertson Academic Departments Offices and Services Offices and Services Office of Alumni Relations Prominent Alumni Recognition and Awards Alumni Chapters Board of Directors Class Agents Programs and Services Benefits Order an Alumni Card Continuing Education Social and Cultural Events Financial Support Alumni Giving Make a Gift Gift Fund How to Give Endowments Wills Stock and Securities Planned Gifts Matching Funds Campus Safety Lost and Found Personal Safety Security Service Communications Current News Newsletter Press Releases Speakers Submit News Financial Services Downloads Student Employment Human Resources Jobs at ACI Information Technology Help Desk Anti-Virus Installation Connecting to the Network Email Hardware Software Support Kyocera 1815 Scanning to Email Kyocera 5035 Faxing From PC Hardware Software Support Laptop Specifications Mapping Network Drives Printer Installation Windows Updates Wireless Connection Wizard Work Order Request Work Studies Network Information Software Telephones Calls from campus Messaging basics Basic voice mail Voice mail for staff and faculty Voice mail for students Work Order Request Contact Us Bon Appetit Food Services Center for Experiential Learning Health Services Nurse Counseling Disability Services Tutoring Registrar's Office Request Transcript Course Schedules Fall Academic Calendar Winter Academic Calendar Spring Academic Calendar Physical Plant Work Order campus map e-mail site map directories web advisor moodle contact webmaster Albertson College of Idaho | 2112 Cleveland Blvd. | Caldwell, ID 83605 | (208)459-5011 | Fax (208)459-5175 Copyright 2005 Albertson College of Idaho. All rights reserved.
Hiram College
Department of Mathematics. (Hiram, OH)
Hiram College - Department of Mathematics Department of Mathematics Hiram College Hiram, Ohio 44234 330-569-5245 buchananvm@hiram.edu Faculty Courses Major and Minor Programs Student Information Alumni Congratulations to Mihai Cucuringu and Matt Evert on their excellent performance on the December 2004 Putnam Exam! Mihai ranks 327 out of the 3733 students who took the exam. Matt ranks 1123 out of 3733. The Hiram Team rank is 125 out of 515 schools. Send comments or questions to Jimmy Buchanan . Copyright 1999-2005 Hiram College. All rights reserved.
Alabama AM University
Mathematics Department. (Normal, AL)
MathDept This page uses frames, but your browser doesn't support them.
Alvin Community College
Department of Mathematics. (Alvin, TX, USA)
ACC Department of Mathematics Department of Mathematics Alvin Community College provides instruction in a wide range of mathematics courses from pre-algebra, beginning algebra, and intermediate algebra to calculus I, II, and III, and differential equations. Free tutoring service in our Learning Lab as well as state-of-the-art software enhances our classroom instruction. We also offer classes via computer and distance education. For our developmental courses, we provide user-friendly, windows based software that is specifically designed for our textbooks. For our advanced courses, we provide access to Maple, Mathematica, and MathView. We also provide instruction in the effective use of the TI-83 83Plus graphing calculator in our college algebra courses. You may reach us by telephone at 281 756-3705, by FAX at 281 756-3880, or by email at bnelson@alvincollege.edu Student Information Plans Developmental Mathematics Resources College-Level Mathematics Resources Mathematics Faculty Members Bette Nelson, M.A., Department Chair (281 756-3705) bnelson@alvincollege.edu Deanna Dick, M.S. (281 756-3704) ddick@alvincollege.edu James Boler, Ph.D. (281 756-3708) jboler@alvincollege.edu Jennifer Hopkins, M.S. (281 756-3707) jhopkins@alvincollege.edu Tammi Lansford, M.S. (281 756-3706) tlansford@alvincollege.edu Charles Kilgore, M.S. (281 756-3716) ckilgore@alvincollege.edu Ralph Best (281 756-3710) rbest@alvincollege.edu Part-time Faculty (281 756-3720) Return to the Academics Home Page ~ ACC Home ~ Alvin Community College 3110 Mustang Road Alvin, Texas 77511 281-756-3500 Last Updated: August 11, 2005
St. Cloud State University
Department of Mathematics (St. Cloud, MN).
St. Cloud State University Undergraduate Bulletin Skip global navigation Undergraduate and Graduate Bulletins Department of Mathematics (MATH) Address: 139 Engineering Computing Center E-mail: mathdept@stcloudstate.edu Phone: 320.308.3001 Web site: http: www.stcloudstate.edu math Fax: 320.308.4269 Undergraduate Bulletin Information Undergraduate Faculty Undergraduate Programs Bachelor of Arts - Mathematics Bachelor of Science - Mathematics (teaching) Undergraduate Course Descriptions MATH Graduate Bulletin Information Graduate Faculty Graduate Programs Master of Science - Mathematics Graduate Course Descriptions MATH Undergraduate Bulletin Phone: (320) 308-3144 Contact Information Copyright 2005 SCSU Revised: 12:00:00 AM bulletin.stcloudstate.edu departments math.asp St. Cloud State University 720 Fourth Avenue South, St. Cloud, Minnesota 56301-4498 U.S.A. (320)308-0121 St. Cloud State University is an affirmative action equal opportunity educator and employer.
American University
Mathematics and Statistics Department.
Mathematics and Statistics Mathematics and Statistics Department Homepage :: Contact Us The College of Arts and Sciences offers students an excellent combination of resources for advanced education in the mathematical sciences. Undergraduate and graduate degrees are offered in mathematics, mathematics education, and statistics. Faculty interests include real and complex analysis, numerical analysis, geometry, number theory, history of mathematics, decision theory, statistical computing, mathematics education, applied statistics, time series analysis, genetics, and multivariate analysis. Students receive a solid foundation in mathematical and statistical theory along with opportunities to participate in research and applications, often arising from practical experience with problems of national scope. Departmental ties to governmental agencies such as the National Oceanic and Atmospheric Administration, Environmental Protection Agency, Food and Drug Administration, and National Institutes of Health offer students exposure to practical, civic, and even cultural issues that require skills in the formation, analysis, and solution of quantitative problems. Department of Math Statistics, American University, 4400 Massachusetts Ave, NW, Washington, DC 20016 Phone: (202) 885-3120Fax: (202) 885-3155E-mail: mathstat@american.edu
Hofstra University
Department of Mathematics.
Mathematics About Hofstra Academic Calendars Apply Online Ask Us Campus Map Commencement Computing Courses Directions E-mail Events Faculty Grades Hofstra Headlines Hofstra Online January Session Libraries Registration See Hofstra Summer Tuition-Fees Viewbook Home Academics HCLAS Math Main Navigation Academics Admissions Alumni Athletics Campus Life Community Computer Center Current Students Events Faculty Giving to Hofstra Graduate Studies Hofstra News Libraries Parents Families President Prospective Students Provost Student Services DEPARTMENT OF MATHEMATICS HOFSTRA UNIVERSITY ABOUT OUR DEPARTMENT Department at a Glance People Academic Programs Courses Student Activities Calendar Scholarships MATH LINKS Careers in Mathematics (Annotated Links) Other Math Links Questions or comments contact the Department of Mathematics Webmaster About Hofstra | Apply | Bulletin | Contact Us | Forms | Info Center | Job Opportunities | Policies | Tuition Fees This site is compliant with the W3C-WAI Web Content Accessibility Guidelines HOFSTRA UNIVERSITY Hempstead, NY 11549-1000 (516) 463-6600 2000 Hofstra University Please enable javascript in your browser preferences in order to gain access to all dynamic navigational links
Angelo State University
Department of Mathematics.
Mathematics Home of Mathematics ASU Home Mathematics Home Faculty Staff Degree Programs Course Descriptions Department Contacts Math Lab Hours Departmental Documents Students Alumni Opportunities in Mathematics Everywhere you look in our world, you see the offspring of mathematics. From the outermost reaches of advanced technology to the innermost processes of life itself, mathematics is used to analyze problems and synthesize solutions. Direct career paths for mathematics majors include such diverse fields as economics, engineering and technology, computer science, medicine, and teaching. Additionally, the reasoning and problem-solving skills that are developed through mathematical studies make its graduates attractive to industry, government agencies, and professional schools. A mathematics degree serves as a foundation upon which you can build nearly any kind of career that you wish to pursue. Departmental Highlights All mathematics courses are taught by highly qualified faculty whose focus is teaching. Most upper division classes have fewer than 20 students, and lower division classes average fewer than 40 students. A staffed Math Lab providing help and peer assistance is open afternoons and evenings. The Department sponsors a variety of lecture series, which feature talks by faculty, students, and guests. Students who major in mathematics may be eligible for one of ASUs prestigious Special Academic Scholarships, with awards up to $9,000. The Mathematics Department is recognized as having one of the top-ranked teacher certification programs in the state. Our majors regularly engage in one-to-one research projects with faculty who are involved in a wide variety of research areas. The Department sponsors several active student groups, including a student chapter of the Mathematical Association of America ( MAA ), a local chapter of the Pi Mu Epsilon national mathematics honor society, and Mathematics Teachers of Tomorrow (MT2), a club for students preparing to teach mathematics. Degrees Offered Bachelor of Arts Bachelor of Science Majors Available Mathematics Mathematics with teacher certification The chief aim of all investigations of the external world should be to discover the rational order and harmony which has been imposed on it by God and which He revealed to us in the language of mathematics. - Johannes Kepler (1571-1630) Comments: Dr. Andrew Siefker, andrew.siefker@angelo.edu , Web Oversight Committee, web.oversight@angelo.edu , Angelo State University
Howard University
Department of Mathematics
Mathematics Department Homepage Howard University Department of Mathematics Department Mission Weekly Colloquium Department Directory Mathematics Majors Graduate Students Past final exams Seminars Undergraduate Programs Graduate Programs WeBWorK at Howard College Algebra Outline Job Announcement Undergraduate Courses Graduate Courses 2001 Howard University , all rights reserved.
University of Indianapolis
Department of Mathematics. (Indianapolis, IN, USA)
University of Indianapolis Mathematics and Computer Science Mathematics Programs Mathematics Courses Computer Science Programs Computer Science Courses Faculty Advising Links Sample Student Work Admissions Financial Aid Registrar UINDY Home Department of Mathematics and Computer Science The Department of Mathematics provides instruction in the disciplines of Mathematics and Computer Science. In each of these disciplines, students will encounter and develop a set of precise language and procedural tools to formalize, explore, and solve problems. Each course combines the development of specific practical knowledge with important underlying concepts; this will refine critical thinking and problem-solving skills and prepare students for further academic and professional demands. A knowledge of Mathematics is essential for every educated person. Students majoring in Mathematics or Mathematics Teaching will achieve a genuine depth of understanding of mathematics, providing excellent preparation for future employment or further studies. The programs in Mathematics are designed in compliance with guidelines from the major professional societies in this field, the MAA and the AMS; the major in Mathematics Teaching also complies with state and national guidelines for teacher preparation. Computer Science is the art and science of solving problems using computers. Both the major program in Computer Science and the individual courses in this program are designed to provide students with a strong practical background, including specific experiences and current knowledge about practices in computing. This is leveraged by an understanding of the powerful ideas that underlie the discipline and profession of computing; these ideas form an important piece of each course in Computer Science. The program and its courses are designed to comply with curriculum recommendations of the two major professional societies in computing, IEEE and ACM. Students who are interested in a career in computing, or in obtaining practical knowledge and in exploring the ideas behind computing, should consider majoring in Computer Science or taking several of the courses in the program. The Department of Mathematics offers a variety of literacy and service courses in both Mathematics and Computer Science. These are designed to provide excellent and appropriate instruction in both of these crucial areas of knowledge, and to help students attain goals in numerical literacy and computer literacy. University of Indianapolis 1400 East Hanna Avenue Indianapolis, Indiana 46227U.S.A. (317)78833688002328634 math.uindy.edu math@uindy.edu
United States Military Academy
Department of Mathematical Sciences. (West Point, NY, USA)
Department of Mathematical Sciences, United States Military Academy This site requires the Macromedia Flash Player. Get Flash
Pacific Union College
Mathematics Department. (Angwin, CA, USA)
Pacific Union College Mathematics Department
University of Alaska, Anchorage
Mathematical Sciences Department
Mathematical Sciences
Our Lady of the Lake University
Mathematics Department. (San Antonio, TX, USA)
Our Lady of the Lake University | College of Arts Sciences | Math Department Welcome to the Our Lady of the Lake University Math Department where everybody counts! Click on one of the following options: Faculty Degree Options Courses Math Society Where to get help Back to CAS homepage Back to OLLU Home page
Pacific Lutheran University
Department of Mathematics. (Tacoma, WA, USA)
Pacific Lutheran University Department of Mathematics This page uses frames, but your browser doesn't support them.
Anderson University
Program in Mathematics. (Anderson, IN, USA)
Anderson University Academic Index: Academics - Mathematics Quick Links ----------------- Make A Gift Online AU Bookstore AU Press AccessAU Adult Learning Business Office Campus Calendar Campus Directory Career Development Educational Support Services Human Resources INvision Kardatzke Wellness Center Kissinger Learning Center Mail Center Nicholson Library Police Security Services Reardon CPE Registrar Office Signatures Online Student Life Student Financial Services Tri-S Program WQME 98.7 Warner Sallman Academics Academics - Mathematics Faculty Majors Minors Alumni Outcomes Catalog Home Academic Index Academics - Mathematics The program in mathematics has three major objectives: to provide the non-specialist with some understanding of the contributions of mathematics to cultural development; to offer students in natural, social and behavioral sciences the mathematics necessary for understanding their own fields of interest; and to prepare mathematics majors for graduate study, for teaching at the secondary level, or for work in business and industry. Students considering careers in mathematics should realize that the emphasis in mathematics courses changes as progress is made through the undergraduate program. The early emphasis on problem solving is later subordinated to the task of formulating and dealing effectively with mathematical structures and abstract ideas. Students who plan to major in mathematics should consult the chair of the department as soon as possible. Students who have pursued accelerated mathematics programs in high school may request advanced placement. Such requests should be made through correspondence with the department chair before registration. Credit will be granted for high school work in calculus through the Advanced Placement Program of the College Entrance Board. Students interested in actuarial studies should consult the chair of the department of Mathematics or the director of the statistics program. Students interested in the Mathematics - Economics major should consult with Dr. Barry Ritchey in the Falls School Business. Majors Mathematics Computer Science Mathematics Mathematics Economics Mathematics Teaching Minors Mathematics Teaching Mathematics Faculty Stanley Laverne Stephens Professor of Mathematics Chair, Department of Mathematics B.A., Anderson University; M.S., Ph.D., Lehigh University [1971] Darrel Annan Austin Associate Professor of Mathematics B.A., Mid-America Nazarene College; M.S., University of Michigan; D.A., Illinois State University [1986] Paul Wayne Saltzmann Professor of Mathematics B.S., Anderson University; M.S., University of Illinois [1959] Kenneth Vernon Turner, Jr. Professor of Mathematics Director, Statistics B.A., Anderson University; M.A., Ball State University; Ph.D., Purdue University [1966] Date in [] indicates year first appointed to AU full-time faculty. HOME Site Map Site Credits Webmaster Copyright 2002 - 2005 Anderson University 1100 East Fifth Street Anderson, IN 46012
Drew University
Department of Mathematics and Computer Science. (Madison, NJ)
Drew University Math CS Department Courses : Mathematics and Computer Science courses offered at Drew University. Course schedules and prerequisites. Placement information. Faculty : The Mathematics and Computer Science faculty. Their interests and contact information. For Majors : Major and minor requirements. Course Planning Guides for students and advisors. Recommendations for Majors. MaCS News: The Mathematics and Computer Science Department Newsletter. Department news and announcements. Student information. Mathematics, which is based on abstraction, logical argument, and an analytical approach to problems, lies at the heart of the liberal arts. Mathematics also finds ubiquitous application, from the natural sciences, through the social sciences and finance, to the humanities and the arts. Precise abstraction and quantification play an increasingly important role in these diverse areas and the study of mathematics can provide a foundation for any of them. Digital computers were developed in the twentieth century, originally to do fast arithmetic. Soon the discipline of computer science emerged to study algorithms, computation, and programming, using a full array of mathematical and logical techniques, as well as inventing many of its own. Students in the mathematics and computer science department may major in computer science, in mathematics, or may choose a joint major that includes core courses and electives in both disciplines. These studies provide rigor of thought and a background that is in demand not only in mathematics and computer science but also in such areas as law and business, where clear thinking and analysis are indispensable. Questions? Comments? Contact the department chair.
Adams State College
Department of Mathematics, Computer Science, and Physics. (Alamosa, CO, USA)
Adams State College Mathematics, Computer Science, Physics Department Welcome to the Home of the Adams State College Department of Mathematics, Computer Science and Physics General Information Faculty Programs Mathematics Placement Course Listings Interesting Web Sites Mathematics Problem of the Month Webmaster: Matt Nehring Last Modified 8 05
Northwestern Oklahoma State University
Mathematics Department
Faculty Faculty LS-OKAMP Current Course Schedules Math Degree Requirements Course Descriptions 2-year cou