Neal Koblitz

International Association for Cryptologic Research

Neal Koblitz Search web for home page

	year	title	booktitle	pages
1	2010	A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree $k>2$	eprint	online
2	2010	Intractable Problems in Cryptography	eprint	online
3	2008	Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift	eprint	online
4	2007	Another Look at Automated Theorem-Proving	eprint	online
5	2007	Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems	eprint	online
6	2007	Another Look at "Provable Security"	jofc	3-37
7	2006	Another Look at "Provable Security". II	eprint	online
8	2006	Another Look at Generic Groups	eprint	online
9	2005	Pairing-Based Cryptography at High Security Levels	eprint	online
10	2004	Another Look at ``Provable Security''	eprint	online
11	1998	An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm	crypto	327-337
12	1998	The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes - Okamoto - Vanstone Algorithm	jofc	141-145
13	1992	Kid Krypto	crypto	371-389
14	1991	Elliptic Curve Implementations of Zero-Knowledge Blobs	jofc	207-213
15	1991	CM-Curves with Good Cryptographic Properties	crypto	279-287
16	1990	Constructing Elliptic Curve Cryptosystems in Characteristic 2	crypto	156-167
17	1989	Hyperelliptic Cryptosystems	jofc	139-150
18	1988	A Family of Jacobians Suitable for Discrete Log Cryptosystems	crypto	94-99