M. Jason Hinek

According to our database, M. Jason Hinek authored at least 9 papers between 2002 and 2012.

Collaborative distances:

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

2012

Attribute-based encryption without key cloning.

M. Jason Hinek, Shaoquan Jiang, Reihaneh Safavi-Naini, Siamak Fayyaz Shahandashti

Int. J. Appl. Cryptogr., 2012

2010

Common modulus attacks on small private exponent RSA and some fast variants (in practice).

M. Jason Hinek, Charles C. Y. Lam

J. Math. Cryptol., 2010

2009

Trading decryption for speeding encryption in Rebalanced-RSA.

Hung-Min Sun, Mu-En Wu, M. Jason Hinek, Cheng-Ta Yang, Vincent S. Tseng

J. Syst. Softw., 2009

Another look at some fast modular arithmetic methods.

M. Jason Hinek, Charles C. Y. Lam

J. Math. Cryptol., 2009

2008

On the security of multi-prime RSA.

M. Jason Hinek

J. Math. Cryptol., 2008

Attribute-Based Encryption with Key Cloning Protection.

M. Jason Hinek, Shaoquan Jiang, Reihaneh Safavi-Naini, Siamak Fayyaz Shahandashti

IACR Cryptol. ePrint Arch., 2008

2007

Dual RSA and Its Security Analysis.

Hung-Min Sun, Mu-En Wu, Wei-Chi Ting, M. Jason Hinek

IEEE Trans. Inf. Theory, 2007

2006

Another Look at Small RSA Exponents.

M. Jason Hinek

Proceedings of the Topics in Cryptology, 2006

2002

On some Attacks on Multi-prime RSA.

M. Jason Hinek, Mo King Low, Edlyn Teske

IACR Cryptol. ePrint Arch., 2002