Conference and journal papers

 

• Adam Back, Ulf Möller and Anton Stiglic

Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems.

Proceedings of the 4^th International Workshop on Information Hiding (IHW 2001), volume 2127 of Lecture Notes in Computer Science, Springer-Verlag, 2001.

 

• Anton Stiglic

Computations with a Deck of Cards

Theoretical Computer Science (259) 1-2, pp. 671-678, 2001

 

 

 

White papers and technical reports

 

• Anton Stiglic

Why Migrating to Triple-DES is not easy

Okiok Ltd white paper, Montreal, Canada, December 2001

 

• Ariel Glenn, Ian Goldberg, Frédéric Légaré and Anton Stiglic

A Description of Protocols for Private Credentials.

Cryptology ePrint Archive, Report 2001/082, 2001.

 

• Jean-François Raymond and Anton Stiglic

Security Issues in the Diffie-Hellman Key Agreement Protocol

Zeroknowledge Inc white paper, Montreal, Canada, September 2000.

 

• Adam Smith and Anton Stiglic

Multiparty computation unconditionally secure against Q^2 adversary structures.

Cryptology SOCS-98.2, School of Computer Science, McGill University, Montreal, Canada, 1998.

 

 

Miscellaneous

 

• Anton Stiglic

Prime number

(and the following other short entries: Certificate of primality; Primality proving algorithm; Primality test; Certificate of primality; Primality proving algorithm; Primality test; Prime generation; Probalistic primality test; Pseudoprime; Safe prime; Strong prime;)

Entry in the Encyclopedia of Cryptography and Security, Tilborg, Henk C.A. van (Ed.), Springer, 2005.

 

• Michel Hétu, Anton Stiglic, Claude Vigeant

Using SPML to provision dynamic XACML rules to manage privacy and access control in Web security infrastructure. Available at: http://lotos.site.uottawa.ca/ncac05/vigeant_18500162.pdf

Ottawa New Challenges for Access Control Workshop, 27 April, 2005

• Anton Stiglic

The PRIMES is in P little FAQ

Initial version August 2002, last updated October 2004.

 

• Anton Stiglic

Class notes in cryptology

(these class notes are now maintained by Claude Crépeau)

NotesA: Basic number theory (GCD calculations and multiplicative inverse, Legendre and Jacobi Symbols, Fermat-Euler, Fast modular exponentiation, Prime numbers, Extracting square roots modulo p, Chinese remainder theory, Quadratic Residuosity problem), Finite fields.

NotesB: Symmetric crypto system, Classic simple systems, Cryptanalysis: classes of attacks, Authentication codes (symmetric, strongly universal hash functions), Identification schemes,

NotesC: Information theory, Perfect Secrecy, Key Equivocation, Unicity Distance, Pseudo-Randomness

NotesD: Modes of operation, DES,