Mathematics of Information Technology and Complex Systems


Homepage
 
Research
 
Project Highlights
 
Team Members
 
Partner Organizations
 
Students
 
Publications
 
Events
 
MITACS Home
 

Publications (2002-2007)

Articles to appear

  1. O. Ahmadi, "The trace spectra of polynomial bases for GF(2^n)", Applicable Algebra in Engineering, Communication and Computing, to appear.
  2. O. Ahmadi and I. Shparlinski, "Geometric progressions in sum-sets over finite fields", Monatshefte fur Mathematik, to appear.
  3. O. Ahmadi and I. Shparlinski, "Distribution of matrices wth restricted entries over finite fields", Indagationes Mathematicae, to appear.
  4. O. Ahmadi and G. Vega, "On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields", Finite Fields and Their Applications, to appear.
  5. O. Ahmadi, D. Hankerson and F. Rodriguez-Henriquez, "On parallel formulations of scalar multiplications on Koblitz curves", Journal of Universal Computer Science, to appear.
  6. O. Ahmadi, I. Shparlinski and J. Voloch, "On multiplicative order of Gauss periods", submitted.
  7. M. Bauer, M. Jacobson , Y. Lee and R. Scheidler, "Construction of Hyperelliptic Function Fields of High Three-Rank", Mathematics of Computation, to appear.
  8. K. Cheng and H. Williams, "Some Results Concerning Certain Continued Fractions", Acta Arithmetica, to appear.
  9. I. Dechene, "On the security of generalized Jacobian cryptosystems", Advances in Mathematics of Communications, to appear.
  10. K. Hoeper and G. Gong, "Preventing or utilizing key escrow in identity-based schemes employed in mobile ad hoc networks", International Journal of Security and Jetworks, to appear.
  11. K. Hoeper and G. Gong, "Bootstrapping security in mobile ad hoc networks using identity-based schemes", Security in Distributed and Networking Systems, to appear.
  12. K. Hoeper and G. Gong, "Pre-authentication and authentication model in ad hoc networks", Wireless/Mobile Network security, to appear.
Technical Reports (2007)
  1. B. Ansari and M. Anwar Hasan, "Revisiting finite field multiplication using Dickson bases", 2007.
  2. S. Flon, R. Oyono and C. Ritzenthaler, "Fast addition on non-hyperelliptic genus 3 curves", 2007.
  3. D. Freeman, M. Scott and E. Teske, "A taxonomy of pairing-friendly elliptic curves", 2007.
  4. X. Fan and G. Gong, "Efficient explicit formulae for genus 2 hyperelliptic curves over prime fields and their implementations", 2007.
  5. A. Menezes and B. Ustaoglu, "Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard", 2007.
  6. M. Nandi, "Improved security analysis of OMAC", 2007.
  7. M. Nandi, "A simple security analysis of hash-CBC and a new efficient one-key online cipher", 2007.
  8. M. Nandi and A. Mandal, "An improved collision probability for CBC-MAC and PMAC", 2007.
  9. M. Nandi and A. Mandal, "Improved security analysis of PMAC", 2007.
  10. B. Ustaoglu, "Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS", 2007.
Theses (2007)
  1. R. deGraaf, M.Sc., "Enhancing Firewalls" Conveying User and Application Identification to Network Firewalls".
  2. N. Ebeid, Ph.D., "Power Analysis Attacks on Elliptic Curve Cryptosystems and Key Randomization Countermeasures".
  3. J. Hinek, Ph.D., "On the Security of Some Variants of RSA".
  4. K. Hoeper, Ph.D., "Authentication and Key Exchange in Mobile Ad Hoc Networks".
  5. Y. Nawaz, Ph.D., "Design of Stream Ciphers and Cryptographic Properties of Nonlinear Functions".
  6. N. Sullivan, M.Sc., "Fast Algorithms for Arithmetic on Elliptic Curves Over Prime Fields".
  7. T. Krivoruchko, M.Sc., "Robust Coercion-Resistant Registration for Remote Electronic Voting".
  8. A. Silvester, M.Sc., "Fast and Unconditional Principal Ideal Testing".
  9. K. Bergmann, M.Sc., "Cryptanalysis Using Nature-Inspired Optimization Algorithms".
Articles in Refereed Publications (2007)
  1. O. Ahmadi and A. Menezes, "Irreducible polynomials of maximum weight" Utilitas Mathematica, 72 (2007), 111-123.
  2. O. Ahmadi, "On the distribution of irreducible trinomials over F3", Finite Fields and Their Applications, 13 (2007), 659-664.
  3. O. Ahmadi, D. Hankerson and A. Menezes, "Formulas for cube roots in GF(3^m)", Discrete Applied Mathematics, 155 (2007), 260-170.
  4. R. de Haan, M. Jacobson and H. Williams, "A Fast, Rigorous Technique for Computing the Regulator of a Real Quadratic Field", Mathematics of Computation, 76 (2007), 2139-2160.
  5. M. Jacobson, R. Scheidler and A. Stein, "Cryptographic protocols on real hyperelliptic curves", Advances in Mathematics of Communications, 1 (2007), 197-221.
  6. M. Jacobson, R. Scheidler and A. Stein, "Fast arithmetic on hyperelliptic curves via continued fraction expansions", Advances in Coding Theory and Cryptology, 2007, 201-244.
  7. N. Koblitz and A. Menezes, "Another look at `provable security'", Journal of Cryptology, 20 (2007), 3-37.
  8. N. Koblitz and A. Menezes, "Another look at generic groups", Advances in Mathematics of Communications, 1 (2007), 13-28.
  9. A. Menezes, "Another Look at HMQV", Journal of Mathematical Cryptology, 1 (2007), 47-64.
  10. M. Nandi and D. Stinson, "Multicollision attacks on a class of generalized hash functions", IEEE Transactions on Information Theory, 53, 2007.
  11. R. Scheidler and A. Stein, "Class number approximation in cubic function fields", Contributions to Discrete Mathematics, 2 (2007), 107-132.
  12. Q. Wu and R. Scheidler, "An explicit treatment of biquadratic function fields", Contributions to Discrete Mathematics, 2 (2007), 43-60.
Articles in Refereed Conference Proceedings (2007)
  1. O. Ahmadi, D. Hankerson and A. Menezes, "Software implementation of arithmetic in GF(3^m)", Proceedings of WAIFI 2007, Lecture Notes in Computer Science, 4547 (2007), 85-102.
  2. J. Aycock, M. Jacobson and R. Vogt, "Army of botnets", Proceedings of NDSS 2007, 111-123.
  3. V. Dimitrov, K. Jarvinen, M. Jacobson, W. Chan and Z. Huang, "FPGA implementation of point multiplication on Koblitz curves using Kleinian integers,
  4. S. Erikson, M. Jacobson, N. Shang, S. Shen and A. Stein, "Explicit formulas for real hyperelliptic curves of genus 2 in affine representation", Proceedings of WAIFI 2007, Lecture Notes in Computer Science, 4547 (2007), 202-218.
  5. R. Granger, F. Hess, N. Theriault, Oyono and F. Vercauteren, "Ate pairing on hyperelliptic curves", Proceedings of EUROCRYPT 2007, Lecture Notes in Computer Science, 4515 (2007), 430-447.
  6. P. Mishra and V. Dimitrov, "Efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation", Proceedings of ISC 2007, Lecture Notes in Computer Science, 4779 (2007), 390-406.
  7. P. Mishra, P. Pal and P. Sarkar, "Towards minimizing memory requirement for implementation of hyperelliptic curve cryptosystems", Proceedings of ISPEC 2007, Lecture Notes in Computer Science, 4464 (2007), 269-283.
  8. D. Stebila and N. Theriault, "Unified point addition formulae and side-channel attacks", Proceedings of CHES 2006, Lecture Notes in Computer Science, 4249 (2007), 354-368.
Technical Reports (2006)
  1. R. Avanzi, N. Theriault and Z. Wang, "Rethinking low genus hyperelliptic jacobian arithmetic over binary fields: Interplay of field arithmetic and explicit formulae", 2006.
  2. J. Chung and A. Hasan, "Montgomery reduction algorithm for modular multiplication using low-weight polynomial form integers", 2006.
Theses (2006)
  1. O. Ahmadi, Ph.D., "Distribution of irreducible polynomials over finite fields".
  2. J. Chou, M.Sc., "Point counting algorithms on elliptic curves".
  3. J. Chung, Ph.D., "Montgomery reduction algorithm for modular multiplication based on low-weight polynomial form integers.
  4. A. Feldman, M.Math., "A survey of attacks on multivariate cryptosystems".
  5. C. Foster, M.Sc., "Catalan's conjecture is true".
  6. K. Karabina, M. Math., "On Prime-Order Elliptic Curves with Embedding Degrees 3, 4 and 6".
  7. S. Ramachandran, M.Sc., "Numerical results on class groups of imaginary quartic fields".
Articles in Refereed Publications (2006)
  1. O. Ahmadi, "Self-Reciprocal Irreducible Pentanomials over F2", Designs, Codes and Cryptography, 38 (2006), 395-397.
  2. J. Aycock, R. deGraaf and M. Jacobson, "Anti-disassembly using cryptographic hash functions", Journal of Computer Virology, 2 (2006), 79-85.
  3. R. Dahab, D. Hankerson, F. Hu, M. Long, J. Lopez and A. Menezes, "Software multiplication using Gaussian normal bases", IEEE Transactions on Computers, 55 (2006), 974-984.
  4. M. Jacobson, R. Sawilla and H. Williams, "Efficient ideal reduction in real quadratic fields", International Journal of Mathematics and Computer Science, 1 (2006), 83-116.
  5. M. Jacobson, R. Scheidler and H.C. Williams, "An Improved Real Quadratic Field Based Key Exchange Procedure", Journal of Cryptology, 19 (2006), 211-239.
  6. A. Menezes and E. Teske, "Cryptographic Implications of Hess' Generalized GHS Attack", Applicable Algebra in Engineering, Communication and Computing, 16 (2006), 439-460.
  7. E. Teske, "An elliptic curve trapdoor system", Journal of Cryptology, 19 (2006), 115-133.
Articles in Refereed Conference Proceedings (2006)
  1. A. Antipa, D. Brown, R. Gallant, R. Lambert, R. Struik and S. Vanstone, "Accelerated Verification of ECDSA Signatures", Selected Areas in Cryptography - SAC 2005, Lecture Notes in Computer Science, 3897 (2006), 307-318.
  2. D. Chang, K. Gupta and M. Nandi, "RC4-Hash: A new hash function based on RC4", Progress in Cryptology - INDOCRYPT 2006, Springer LNCS 4329, 2006.
  3. D. Chang, M. Nandi and M. Yung, "Indifferentiable security analysis of popular hash function with prefix-free padding", Advances in Cryptology - ASIACRYPT 2006, Springer LNCS, 2006.
  4. K. Hoeper and G. Gong, "Key revocation for identity-based schemes in mobile ad hoc networks", Proceedings of 5th International Conference on AD-HOC Networks}, Lecture Notes in Computer Science, 4104 (2006), 224-237.
  5. M. Jacobson, S. Ramachandran and H. Williams, "Numerical results on class groups of imaginary quadratic fields", Algorithmic Number Teory - ANTS-VII, Lecture Notes in Computer Science, 4076 (2006), 87-101.
  6. N. Koblitz and A. Menezes, "Another look at `provable security'. II'', Progress in Cryptology - INDOCRYPT 2006, Springer LNCS 4329, 2006, pp. 148-175.
  7. J. Lee and D. Stinson, "Tree-Based Key Distribution Patterns", Selected Areas in Cryptography - SAC 2005, Lecture Notes in Computer Science, 3897 (2006), 189-204.
  8. A. Menezes and B. Ustaoglu, "On the importance of public-key validation in the MQV and HMQV key agreement protocols'', Progress in Cryptology - INDOCRYPT 2006, Springer LNCS 4329, 2006, pp. 133-147.
  9. M. Nandi, "A simple and unified method of proving indistinguishability", Progress in Cryptology - INDOCRYPT 2006, Springer LNCS 4329, 2006.
  10. N. Theriault, "SPA Resistant Left-to-Right Integer Recodings", Selected Areas in Cryptography - SAC 2005, Lecture Notes in Computer Science, 3897 (2006), 345-358.
  11. K. Wooding and H. Williams, "Doubly-focused enumeration of pseudosquares and pseudocubes", Algorithmic Number Teory - ANTS-VII, Lecture Notes in Computer Science, 4076 (2006), 208-221.
Technical Reports (2005)
  1. K. Hoeper and G. Gong, Efficient Key Exchange Protocols for Wireless Networks and Mobile Devices", 2005.
  2. M. Jacobson, R. Scheidler and A. Stein, "Faster Cryptographic Key Exchange on Hyperelliptic Curves", 2005.
  3. S. Jiang and G. Gong, "Security of a Server-Assisted Group Password-Authenticated Key Exchange Protocol", 2005.
Theses (2005)
  1. N. Alexander, M.Math., "Algebraic Tori in Cryptography".
  2. K. Giuliani, Ph.D., "Sequences Over Finite Fields and Elliptic Curves Over Rings in Cryptography".
  3. G. Jain, M.Sc., "Security Aspects of Mobile IP".
  4. S. Jiang, Ph.D., "A Study on Security of Multi-User Systems and Stream Ciphers".
  5. J. Lee, Ph.D., "Combinatorial Approaches to Key Predistribution for Distributed Sensor Networks".
  6. M. MacKague, M.Math., "Design and Analysis of RC4-Like Stream Ciphers".
  7. J. Muir, Ph.D., "Efficient Integer Representations for Cryptographic Operations".
  8. E. Ng, M.Math., "Security Models and Proofs for Key Establishment Protocols".
  9. C. Smith, M.Math., "Digital Signcryption".
Articles in Refereed Publications (2005)
  1. O. Ahmadi and A. Menezes, "On the Number of Trace-one Elements in Polynomial Bases for GF(2n)", Designs, Codes and Cryptography, 37 (2005), 493-507.
  2. M. Bauer, E. Teske and A. Weng, "Point Counting on Picard Curves in Large Characteristics", Mathematics of Computation, 74 (2005), 1983-2005.
  3. S. Galbraith and A. Menezes, "Algebraic Curves and Cryptography", Finite Fields and Their Applications, 11 (2005), 544-577.
  4. E. Teske and A. Stein, "Optimized Baby Step-Giant Step Methods", The Journal of the Ramanujan Mathematical Society, 20 (2005), 27-58.
Articles in Refereed Conference Proceedings (2005)
  1. V. Dimitrov, L. Imbert and P. Mishra, "Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains", Advances in Cryptology - ASIACRYPT 2005, 3788 (2005), 59-78.
  2. R. de Graaf, J. Aycock and M. Jacobson, "Port Knocking with Strong Authentication", ACSAC 2005, IEEE Computer Society, 2005, 109-418.
  3. A. Hirt and J. Aycock, "Anonymous and Malicious", Virus Bulletin Conference, 2005, 2-8.
  4. A. Hirt, M. Jacobson and C. Williamson, "A Practical Buses Protocol for Anonymous Network Communication", Third Annual Conference on Privacy and Trust, 2005, 233-236.
  5. N. Koblitz and A. Menezes, "Pairing-Based Cryptography at High Security Levels", Proceedings of the Tenth IMA International Conference on Cryptography and Coding, Lecture Notes in Computer Science, 3796 (2005), 13-36.
Articles in Refereed Publications (2004)
  1. K. Fong, D. Hankerson, J. Lopez and A. Menezes, "Field Inversion and Point Halving Revisited", IEEE Transactions on Computers, 53 (2004), 1047-1059.
  2. D. Hankerson, A. Menezes and S. Vanstone, Guide to Elliptic Curve Cryptography, Springer-Verlag, 2004.
  3. M. Jacobson, A. Menezes, and A. Stein, "Hyperelliptic Curves and Cryptography", High Primes and Misdemeanors - Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications Series, 41 (2004), 255-282.
  4. N. Koblitz and A. Menezes, "A Survey of Public-key Cryptosystems", SIAM Review, 46 (2004), 599-634.
  5. H. Koblitz and A. Menezes, "Obstacles to the Torsion-subgroup Attack on the Decision Diffie-Hellman Problem", Mathematics of Computation, 73 (2004), 2027-2041.
  6. A. Menezes and N. Smart, "Security of Signature Schemes in a Multi-user Setting", Designs, Codes and Cryptography, 33 (2004), 261-274.
  7. R.A. Mollin, "A Continued Fraction Approach to the Diophantine Equation ax2-by2=+-1", Journal of Algebra, Number Theory and Applications, 4 (2004), 159-207.
  8. S. Mueller, "On the Computation of Square Roots in Finite Fields", Designs, Codes, and Cryptography, 31 (2004), 301-312.
  9. S. Mueller, "On the Computation of Cube Roots Modulo p", High Primes and Misdemeanours - Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications Series, 41 (2004), 293-304.
  10. R. Patterson and A.J. van der Poorten, "Jeepers, Creepers", High Primes and Misdemeanours - Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications Series, 41 (2004), 305-316.
  11. E. Teske, "An Elliptic Curve Trapdoor System", High Primes and Misdemeanours - Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications Series, 41 (2004), 341-352.
Articles in Refereed Conference Proceedings (2004)
  1. P. Berrizbeitia, S. Mueller and H.C. Williams, "Pseudocubes and Primality Testing", Proceedings of Algorithmic Number Theory, Sixth International Symposium, ANTS-6, Lecture Notes in Computer Science 3076 (2004), 102-116.
  2. K. Giuliani and G. Gong, "Efficient Key Agreement and Signature Schemes Using Compact Representation in $GF(p^{10})$", IEEE International Symposium on Information Theory, June 28 - July 2, 2004, Chicago, IL. 13--13.
  3. K. Giuliani and G. Gong, "New LFSR-Based Cryptosystems and the Trace Discrete Logarithm Problem", The Third International Conference on Sequences and Their Applications - SETA'04.
  4. M. Jacobson, "The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders", Proceedings of ACISP 2004, Lecture Notes in Computer Science 3108 (2004), 149-156.
  5. M. Jacobson, H. C. Williams, K. Wooding, "Imaginary Cyclic Quartic Fields with Large Minus Class Numbers", Proceedings of Algorithmic Number Theory, Sixth International Symposium, ANTS-6, Lecture Notes in Computer Science 3076 (2004), 280-292.
  6. S. Jiang and G. Gong, "Multi-service Oriented Broadcast Encryption", Australian Conference on Information Security and Privacy, Lecture Notes in Computer Science, 3108 (2004), 1-12.
  7. C. Lam and Guang Gong, "A Lower Bound for the Linear Span of Filtering Sequences", Proceedings of the Conference on State of the Art of Stream Ciphers, Brugge, Belgium, pp. 220-233, 2004.
  8. A. Menezes, E. Teske and A. Weng, "Weak fields for ECC", Topics in Cryptology CT-RSA 04, Lecture Notes in Computer Science, 2964 (2004), 366-386.
  9. R. Scheidler, "An Algorithmic Perspective of Cubic Function Fields", Proceedings of Algorithmic Number Theory, Sixth International Symposium, ANTS-6, Lecture Notes in Computer Science 3076 (2004), 395-410.
Articles in Refereed Publications (2003)
  1. D. Brown and A. Menezes, "A small subgroup attack on a key agreement protocol of Arazi", Bulletin of the ICA, 37 (2003), 45-50.
  2. J. Huhnlein, M. Jacobson, and D. Weber, "Towards Practical Non-interactive Public-key Cryptosystems Using Non-maximal Imaginary Quadratic Orders", Designs, Codes, and Cryptography, vol. 30 (2003), No. 3, pp.281-299.
  3. M. Jacobson, Jr., A. Pinter, and P. Walsh, "A Computational Approach for Solving y2 = 1k + 2k +... + xk", Math. Comp. 72 (2003), no. 244, 2099-2110.
  4. L. Law, A. Menezes, M. Qu, J. Solinas and S. Vanstone, "An efficient protocol for authenticated key agreement", Designs Codes and Cryptography, 28 (2003), 119-134.
  5. Y. Lee, R. Scheidler and C. Yarrish, "Computation of the Fundamental Units and the Regulator of a Cyclic Cubic Function Field", Experimental Mathematics 12 (2003), 211-225.
  6. S. Mueller, "A Probable Prime Test with Very High Confidence for n=3 mod 4", J. Cryptology, vol. 16, no. 2, 2003, pp. 117-139.
  7. H. te Riele and H. Williams, "New Computations Concerning the Cohen-Lenstra Heuristics", Experimental Mathematics, 12(2003), 99-113.
  8. E. Teske, "Computing discrete logarithms with the parallelized kangaroo method", Discrete Applied Mathematics, 130 (2003), 61-82.
Articles in Refereed Conference Proceedings (2003)
  1. A. Antipa, D. Brown, A. Menezes, R. Struik and S. Vanstone, "Validation of elliptic curve public keys", Proceedings of PKC 2003, Lecture Notes in Computer Science, 2567 (2003), 211-223.
  2. M. Bauer and S. Hamdy, "On Class Group Computations Using the Number Field Sieve", Advances in Cryptology-ASIACRYPT 2003, Springer LNCS 2894, 2003, pp. 311-325.
  3. G. Gong and K. Khoo, "Additive Autocorrelation of Resilient Boolean Functions", Proceedings of Tenth Annual Workshop on Selected Areas in Cryptography, 2003.
  4. G. Gong and S. Jiang, "The Editing Generators and its Cryptanalysis", Annual International Workshop on Cryptology and Network Security, 2003, 673-678.
  5. J. Hinek, M. Low and E. Teske, "On some attacks on multi-prime RSA", Proceedings of SAC 2002, Lecture Notes in Computer Science, 2595 (2003), 385-404.
Articles in Refereed Publications (2002)
  1. C. Blundo, B. Masucci, D. Stinson and R. Wei, Constructions and bounds for unconditionally secure non-interactive commitment schemes, Designs, Codes and Cryptography, 26 (2002), 97-110.
  2. C. Carlet and P. Sarkar, Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions, Finite Fields and their Applications, 8(1) (2002), 120-130.
  3. P. Eisen and D. Stinson, Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels, Designs, Codes and Cryptography, 25 (2002), 15-61.
  4. L. Encinas, J. Masque and A. Menezes. Isomorphism classes of genus-2 hyperelliptic curves over finite fields, Applicable Algebra in Engineering, Communication and Computing, 13 (2002), 57-65.
  5. G. Gong, "New Designs for Signal Sets with Low Cross-correlation, Balance Property and Large Linear Span: GF(p) Case", IEEE Trans. on Inform. Theory, vol.48, no.11, November 2002, pp. 2847-2867.
  6. G. Gong and A. Youssef, "Cryptographic Properties of the Welch-Gong Transformation Sequence Generators", IEEE Trans. on Inform. Theory, vol.48, no.11, November 2002, pp. 2837-2846.
  7. T. Helleseth and G. Gong, "New Nonbinary Sequences with Ideal Two-level Autocorrelation Functions", IEEE Trans. on Inform. Theory, vol.48, no.11, November 2002, pp. 2868-2872.
  8. M. Jacobson and H. Williams, "New Quadratic Polynomials with High Densities of Prime Values", Math. Comp., vol. 72, 2002, pp. 499-519.
  9. M. Jacobson and H. Williams, "Modular Arithmetic on Elements of Small Norm in Quadratic Orders", Designs, Codes and Cryptography, vol. 27, 2002, pp. 93-110.
  10. S. Magliveras, D. Stinson and T. van Trung, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, Journal of Cryptology, 15 (2002), 285-297.
  11. S. Maitra and P. Sarkar, Cryptographic Modifications of Patterson-Weidemann Functions, IEEE Transactions on Information Theory, 48(1) (2002), 278-284.
  12. F. Saidak, "An Elementary Proof of a Theorem of Delange", Comptes Rendus (Canada), 24 (2002), 144-151.
  13. P. Sarkar and S. Maitra, Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes, Theory of Computing Systems, 31(1) (2002), 39-57.
  14. A. Stein and E. Teske, The parallelized Pollard kangaroo method in real quadratic function fields, Mathematics of Computation, 71 (2002), 793-814.
  15. A. Stein and E. Teske, Explicit bounds and heuristics on class numbers in hyperelliptic function fields, Mathematics of Computation, 71 (2002), 837-861.
Articles in Refereed Conference Proceedings (2002)
  1. D. Brown, R. Gallant and S. Vanstone, Provably secure implicit certificates schemes, Proceedings of Financial Cryptography 2001, Lecture Notes in Computer Science, 2339 (2002), 178-195.
  2. C. Blundo, P. D'Arco, A. de Santis and D. Stinson, New results on unconditionally secure distributed oblivious transfer, Proceedings of SAC 2002, Lecture Notes in Computer Science, 2002.
  3. P. D'Arco and D. Stinson, On unconditionally secure robust distributed key distribution centers, Proceedings of ASIACRYPT 2002, Lecture Notes in Computer Science, 2002.
  4. P. Ebinger and E. Teske, Factoring N=pq2 with the elliptic curve method, Proceedings of ANTS V, Lecture Notes in Computer Science, 2369 (2002), 475-490.