Výsledky vyhledávání - "Hinek, M. Jason"

Dissertation/ Thesis

Autor: Hinek, M. Jason

The RSA cryptosystem, named after its inventors, Rivest, Shamir and Adleman, is the most widely known and widely used public-key cryptosystem in the world today. Compared to other public-key cryptosystems, such as elliptic curve cryptography, RSA req

Externí odkaz: http://hdl.handle.net/10012/2988

Zobrazit plný text záznamu

Akademický článek

NMR detection of liquid-like wood polymer component in dry aspen wood

Autor: Peemoeller, Hartwig, Weglarz, Wladyslaw P., Hinek, M. Jason, Holly, Rick, Lemaire, Claude, Teymoori, Roshanak, Liang, Jianzhen, Crone, Joshua, Mansour, Firas K., Hartley, Ian D.

Publikováno v: In Polymer 28 February 2013 54(5):1524-1529

Zobrazit plný text záznamu

Akademický článek

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

Autor: Hinek M. Jason, Lam Charles C.Y.

Publikováno v: Journal of Mathematical Cryptology, Vol 4, Iss 1, Pp 58-93 (2010)

In this work we re-examine two common modulus attacks on RSA. First, we show that Guo's continued fraction attack works much better in practice than previously expected. Given three instances of RSA with a commonmodulus N and private exponents each s

Externí odkaz: https://doaj.org/article/6c3289d6424f420a96d6a9bd3593d773

Zobrazit plný text záznamu

Akademický článek

Another look at some fast modular arithmetic methods

Autor: Hinek M. Jason, Lam Charles C. Y.

Publikováno v: Journal of Mathematical Cryptology, Vol 3, Iss 2, Pp 165-174 (2009)

In this work we re-examine a modular multiplication and a modular exponentiation method. The multiplication method, proposed by Hayashi in 1998, uses knowledge of the factorization of both N + 1 and N + 2 to compute a multiplication modulo N. If both

Externí odkaz: https://doaj.org/article/00b9d4c5bd1c41528f8b2d5446497573

Zobrazit plný text záznamu

Akademický článek

On the security of multi-prime RSA

Autor: Hinek M. Jason

Publikováno v: Journal of Mathematical Cryptology, Vol 2, Iss 2, Pp 117-147 (2008)

Multi-prime RSA is a variant of RSA in which the modulus is the product of more than two distinct primes. In this work we collect the strongest known algebraic attacks on multi-prime RSA, including factoring, small private exponent, small CRT exponen

Externí odkaz: https://doaj.org/article/940bf31b12e841ea961b86bd289354a5

Zobrazit plný text záznamu