Result 1 to 18 of 18 total
Finding discrete logarithms with a set orbit distinguisher. (English)
J. Math. Cryptol. 6, No. 1, 1-20 (2012).
1
On maximal $k$-limited packings. (English)
Congr. Numerantium 205, 113-119 (2010).
2
Limited packings in graphs. (English)
Discrete Appl. Math. 158, No. 12, 1357-1364 (2010).
3
Finding discrete logarithms with a set orbit distinguisher (English)
IACR Cryptology ePrint Archive 2010, 370 (2010).
4
Limited packings in graphs (English)
Electronic Notes in Discrete Mathematics 30, 15-20 (2008).
5
The 2-chart problem - contemplating system behavior in the aggregate (English)
ECBS, 473-482 (2008).
6
Using greenfoot and a Moon scenario to teach Java programming in CS1 (English)
ACM Southeast Regional Conference, 118-121 (2008).
7
Accelerated verification of ECDSA signatures. (English)
Preneel, Bart (ed.) et al., Selected areas in cryptography. 12th international workshop, SAC 2005, Kingston, ON, Canada, August 11‒12, 2005. Revised selected papers. Berlin: Springer (ISBN 978-3-540-33108-7/pbk). Lecture Notes in Computer Science 3897, 307-318 (2006).
8
Accelerated verification of ECDSA signatures (English)
Selected Areas in Cryptography, 307-318 (2005).
9
Provably secure implicit certificate schemes. (English)
Syverson, Paul F. (ed.), Financial cryptography. 5th international conference, FC 2001, Grand Cayman, British West Indies, February 19‒22, 2001. Proceedings. Berlin: Springer (ISBN 3-540-44079-8). Lect. Notes Comput. Sci. 2339, 156-165 (2002).
10
Faster point multiplication on elliptic curves with efficient endomorphisms. (English)
Kilian, Joe (ed.), Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2139, 190-200 (2001).
11
Provably secure implicit certificate schemes (English)
Financial Cryptography, 147-156 (2001).
12
Engineering of computer-based systems -A proposed curriculum for a degree program at bachelor level (English)
ECBS, 344-356 (2001).
13
Faster point multiplication on elliptic curves with efficient endomorphisms (English)
CRYPTO, 190-200 (2001).
14
Improving the parallelized Pollard lambda search on anomalous binary curves. (English)
Math. Comput. 69, No. 232, 1699-1705 (2000).
15
Improving the parallelized Pollard lambda search on anomalous binary curves (English)
Math. Comput. 69, No. 232, 1699-1705 (2000).
16
Java-prototyping of hardware/software CBS using a behavioral OO model (English)
ECBS, 73-81 (2000).
17
Measuring the effectiveness of introducing new methods in the software development process (English)
EUROMICRO, 20800-20807 (1998).
18
Result 1 to 18 of 18 total
Start
Contact
Print
General Help
