Resumé Contact Information Mailing address: Nagy, Daniel Rákospatak park 2/15 Budapest, H-1142 Hungary E-mail: nagydani@epointsystem.org PGP: 84C6 4245 F039 5B32 71E5 B8A0 A47C 89CB C167 EFEF Telephone: +36 30 2158843 Work experience ePoint Systems Ltd., Budapest, Hungary, founder 2008- Product development, management AgilEight Kft., Budapest, Hungary, Security Architect, part time employee 2006-2009 Information security analysis, software development Eötvös Lóránd University of Science Budapest, Hungary, part time researcher 2005- Information security research, seminar on cryptography Self-employed information security consultant 2005-2006 Information security analysis, training, consulting Queen's Univ. Kingston, ON, Canada, course instructor 2005 Source Coding and Quantization (4th yr., graduate) Queen's Univ. Kingston, ON, Canada, teaching assistantship 2004 Multivariate Calculus (2nd yr.), Stochastic Processes (4th yr.) 2001-2003 Numerical Methods (2nd year undergraduate course), 2001-2003 Linux/Solaris system administration Queen's Univ. Kingston, ON, Canada, research assistantship 2001-2005 Research into efficient lossless data compression (PhD project) 2003 Monte-Carlo simulations for computational evolutionary biology Mission Critical Linux Inc. Budapest, Hungary, part time employment 2001 Cluster software development and localization Morphologic Kft Budapest, Hungary, internship 2000-2001 Linguistic database acquisition (Master's thesis project) Budapest Univ. of Tech. and Econ. Budapest, Hungary, teaching assistantship 2000-2001 Discrete Math. (number theory, graph theory, lin. alg., algorithms) 1998-1999 Discrete Mathematics (1st and 2nd year undergraduate course) AT&T Shannon Laboratories Florham Park, NJ, USA, internship 2000 summer. Testing of an online learning algorithm CAIP, Rutgers State Univ. Piscataway, NJ, USA, research assistantship 1999-2000 (1 acad. year). Development of an online learning algorithm Anteus Informatika Bt. Budapest, Hungary, founding member 1998-2001 Web server administration, software development Fazekas M. High School Budapest, Hungary, volunteer work 1997-1999 System and network administration and planning (as a part of an overall reconstruction and development program) Education Doctoral Studies: 2001-2005 Queen's University in Kingston, Ontario, Department of Mathematics and Statistics, Communications Group, field of research: information theory Successful PhD thesis defense: January 26, 2006 University: 1995-2001 Budapest University of Technology and Economics, Faculty of Electrical Engineering and Informatics, Department of Telecommunications and Telematics, EE MS program, major: Telecommunications, minor: CATV High School: 1991-1995, Fazekas M. Főv. Gyak. Gimnázium, special mathematical program Primary school: 1983-1991 Free Software projects ePoint: A peer-to-peer cryptographic payment system ePointPGP: Lightweight OpenPGP implementation in Java libavl: Lightweight AVL tree implementation in ANSI C libbstree: Binary Suffix Tree library in ANSI C Workshops, conference presentations, publications Financial Cryptography and Data Security 2008 Cozumel, Mexico, "OpenPGP-based Financial Instruments and Dispute Arbitration" International Conference on E-Commerce and Telecommunication Networks 2005 Reading, UK, "On Digital Cash-like Payment Systems" Queen's Biannual Symposium on Information Theory 2004 Kingston, ON, Canada, "Higher Order Markov Modeling of Block-Markov Sources" IEEE Data Compression Conference 2003 Snowbird, UT, USA, "Experimental Study of a Binary Block-Sorting Compression Scheme", poster Canadian Workshop on Information Theory 2003 Waterloo, ON, Canada North American Association for Computational Linguistics, Annual Conference 2001 Pittsburgh, PA, USA, "Towards a Hungarian wordnet", poster Speech Recognition Systems Training Workshop 2000 Mississippi State University, MS, USA International Workshop on Combinatorial Optimization 1999 Košice, Slovakia, "An algorithm for drawing planar graphs with straight edges" 5th International Czech-Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications 1998 Prague, Czech Republic, "An algorithm for drawing planar graphs with straight edges" Research interests digital payment, cryptography, combinatorics and applications, advanced data structures, information theory, computational linguistics Technical strengths, experience Embedded software development (embedded Linux, Java 2 ME/SE, C, C++, assembler), Project management (Agile methodology, Scrum), Languages English (fluent), Russian (native), Hungarian (native), German (intermediate), French (basic), Slovak (basic)