Ken Nakamula

According to our database, Ken Nakamula authored at least 9 papers between 2001 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

Improvement of key generation for a number field based knapsack cryptosystem.

Yasunori Miyamoto, Ken Nakamula

JSIAM Lett., 2013

2010

On a knapsack based cryptosystem using real quadratic and cubic fields.

Keiichiro Nishimoto, Ken Nakamula

JSIAM Lett., 2010

NZMATH 1.0.

Satoru Tanaka, Naoki Ogura, Ken Nakamula, Tetsushi Matsui, Shigenori Uchiyama

Proceedings of the Mathematical Software, 2010

2008

Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials.

Satoru Tanaka, Ken Nakamula

Proceedings of the Pairing-Based Cryptography, 2008

2007

Comparing Implementation Efficiency of Ordinary and Squared Pairings.

Christine Abegail Antonio, Satoru Tanaka, Ken Nakamula

IACR Cryptol. ePrint Arch., 2007

Implementing Cryptographic Pairings over Curves of Embedding Degrees 8 and 10.

Christine Abegail Antonio, Satoru Tanaka, Ken Nakamula

IACR Cryptol. ePrint Arch., 2007

2003

Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": [J. Algorithms 42 (2002) 304-316].

Hatem M. Bahig, Ken Nakamula

J. Algorithms, 2003

2002

Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True.

Hatem M. Bahig, Ken Nakamula

J. Algorithms, 2002

2001

Some Results for Some Conjectures in Addition Chains.

Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula

Proceedings of the Combinatorics, 2001