Neal Koblitz

Affiliations:
  • University of Washington, Seattle, USA


According to our database1, Neal Koblitz authored at least 50 papers between 1988 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Concrete Analysis of Approximate Ideal-SIVP to Decision Ring-LWE Reduction.
IACR Cryptol. ePrint Arch., 2022

2021
Cryptanalysis of 'MAKE'.
IACR Cryptol. ePrint Arch., 2021

2019
Critical perspectives on provable security: Fifteen years of "another look" papers.
Adv. Math. Commun., 2019

2017
Cryptography during the French and American Wars in Vietnam.
Cryptologia, 2017

2016
A Riddle Wrapped in an Enigma.
IEEE Secur. Priv., 2016

Another Look at Tightness II: Practical Issues in Cryptography.
IACR Cryptol. ePrint Arch., 2016

Cryptocash, cryptocurrencies, and cryptocontracts.
Des. Codes Cryptogr., 2016

Time for a Paradigm Shift in Our Disciplinary Culture?
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016

2015
The random oracle model: a twenty-year retrospective.
Des. Codes Cryptogr., 2015

2014
Another Look at Security Theorems for 1-Key Nested MACs.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

2013
Another Look at Security Theorems for 1-Key Nested MACs.
IACR Cryptol. ePrint Arch., 2013

Another look at non-uniformity.
Groups Complex. Cryptol., 2013

Another look at security definitions.
Adv. Math. Commun., 2013

2012
Another look at HMAC.
IACR Cryptol. ePrint Arch., 2012

Crypto Galore!
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
Another Look at Automated Theorem-Proving. II.
IACR Cryptol. ePrint Arch., 2011

2010
Discrete Logarithms, Diffie-Hellman, and Reductions.
IACR Cryptol. ePrint Arch., 2010

Intractable Problems in Cryptography.
IACR Cryptol. ePrint Arch., 2010

A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree k>2.
IACR Cryptol. ePrint Arch., 2010

Secret Codes and Online Security: A Seminar for Entering Students.
Cryptologia, 2010

Getting a Few Things Right and Many Things Wrong.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

2008
Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift.
IACR Cryptol. ePrint Arch., 2008

2007
Another Look at "Provable Security".
J. Cryptol., 2007

Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems.
IACR Cryptol. ePrint Arch., 2007

Another Look at Automated Theorem-Proving.
IACR Cryptol. ePrint Arch., 2007

Another look at generic groups.
Adv. Math. Commun., 2007

2006
Another Look at "Provable Security". II.
IACR Cryptol. ePrint Arch., 2006

2005
Pairing-Based Cryptography at High Security Levels.
IACR Cryptol. ePrint Arch., 2005

2004
A Survey of Public-Key Cryptosystems.
SIAM Rev., 2004

Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem.
Math. Comput., 2004

2003
Explaining cryptographic systems.
Comput. Educ., 2003

2001
Almost Primality of Group Orders of Elliptic Curves Defined over Small Finite Fields.
Exp. Math., 2001

2000
The State of Elliptic Curve Cryptography.
Des. Codes Cryptogr., 2000

Guest Editorial.
Des. Codes Cryptogr., 2000

Analysis of the Xedni Calculus Attack.
Des. Codes Cryptogr., 2000

1998
Book Review: Discrete Mathematics in the Schools. Ed. by Joseph G. Rosenstein, Deborah S. Franzblau, and Fred S. Roberts (American Mathematical Society).
SIGACT News, 1998

The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes - Okamoto - Vanstone Algorithm.
J. Cryptol., 1998

An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm.
Proceedings of the Advances in Cryptology, 1998

Algebraic aspects of cryptography
Algorithms and computation in mathematics 3, Springer, ISBN: 978-3-540-63446-1, 1998

1997
Cryptography as a Teaching Tool.
Cryptologia, 1997

1994
A course in number theory and cryptography, Second Edition.
Graduate texts in mathematics 114, Springer, ISBN: 978-3-540-94293-1, 1994

1993
Fixed-Parameter Complexity and Cryptography.
Proceedings of the Applied Algebra, 1993

1992
Self-Witnessing Polynomial-Time Complexity and Prime Factorization.
Des. Codes Cryptogr., 1992

Kid Krypto.
Proceedings of the Advances in Cryptology, 1992

1991
Elliptic Curve Implementations of Zero-Knowledge Blobs.
J. Cryptol., 1991

CM-Curves with Good Cryptographic Properties.
Proceedings of the Advances in Cryptology, 1991

1990
Constructing Elliptic Curve Cryptosystems in Characteristic 2.
Proceedings of the Advances in Cryptology, 1990

1989
Discrete Logarithms and discreet Curves.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Hyperelliptic Cryptosystems.
J. Cryptol., 1989

1988
A Family of Jacobians Suitable for Discrete Log Cryptosystems.
Proceedings of the Advances in Cryptology, 1988


  Loading...