1

Sheueling Chang, Robert Rochetti:
Method and system for electronic bill payment.
Sun Microsystems,
Gary S Williams Flehr Hohbach Test Albritton & Herbert,
March 16, 1999:
US05884288
(377 worldwide citation)

A method and system for providing a fully automated electronic bill processing capability that is integrated with banking institutions and their customers is herein disclosed. The electronic bill payment system includes a community of payors, payees, payor banks, and payee banks that are associated ...

2

Sheueling Chang, Stuart Marks:
Security system and method for financial institution server and client web browser.
Sun Microsystems,
Pennie & Edmonds,
August 15, 2000:
US06105012
(222 worldwide citation)

The financial transaction processing system includes at least one financial server connected through a public network to a number of users associated with client computers. Each user accesses the financial server through a web browser. The web browser is provided with the capabilities to generate en ...

3

Hans Eberle, Nils Gura, Daniel Finchelstein, Sheueling Chang Shantz, Vipul Gupta:
Hardware accelerator for elliptic curve cryptography.
Sun Microsystems,
Robert C Kowert, Meyertons Hood Kivlin Kowert & Goetzel PC,
March 24, 2009:
US07508936
(46 worldwide citation)

An elliptic curve processing apparatus that performs operations on elliptic curves specified over binary polynomial fields includes a functional unit that has a digit serial multiplier with a digit size of at least two bits. The elliptic curve processing apparatus performs reduction for respective g ...

4

Sheueling Chang:
Method for efficient modular polynomial division in finite fields f(2{circumflex over ( )}m).
Sun Microsystems,
Zagorin O&apos Brien & Graham,
April 13, 2004:
US06721771
(18 worldwide citation)

The present invention provides a method for performing an inversion and multiply in a single operation as a polynomial divide operation. As a result, the invention reduces the number of mathematical operations needed to perform point doubling and point addition operations. An elliptic curve cryptosy ...

5

Hans Eberle, Nils Gura, Russell A Brown, Sheueling Chang Shantz, Vipul Gupta:
Modular multiplier.
Sun Microsystems,
Robert C Kowert, Meyertons Hood Kivlin Kowert & Goetzel P C,
December 2, 2008:
US07461115
(17 worldwide citation)

Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X( ...

6

Sheueling Chang:
Method for efficient modular division over prime integer fields.
Sun Microsystems,
Zagorin O&apos Brien & Graham,
August 3, 2004:
US06772184
(10 worldwide citation)

The invention provides a method for performing modular division adapted for division in integer fields. Integer modular divisions are used in the computation of Elliptic Curve digital signature generation and verification. The algorithm can be implemented to provide division in integer fields comple ...

7

Sheueling Chang:
Method for efficient computation of point doubling operation of elliptic curve point scalar multiplication over finite fields F(2m).
Sun Microsystems,
Zagorin O&apos Brien Graham,
November 30, 2004:
US06826586
(7 worldwide citation)

The present invention provides a method for performing a point doubling operation with only one modular division and no multiply per operation. As a result, the invention reduces the number of mathematical operations needed to perform point doubling operations in elliptic curve computation. An ellip ...

8

Sheueling Chang Shantz, Leonard Rarick, Lawrence Spracklen, Hans Eberle, Nils Gura:
Method and apparatus for implementing processor instructions for accelerating public-key cryptography.
Oracle America,
Robert C Kowert, Meyertons Hood Kivlin Kowert & Goetzel P C,
July 3, 2012:
US08213606
(3 worldwide citation)

In response to executing an arithmetic instruction, a first number is multiplied by a second number, and a partial result from a previously executed single arithmetic instruction is fed back from a first carry save adder structure generating high order bits of the current arithmetic instruction to a ...

9

Hans Eberle, Nils Gura, Russell A Brown, Sheueling Chang Shantz, Vipul Gupta:
Modular multiplier.
Oracle America,
Robert C Kowert, Meyertons Hood Kivlin Kowert & Goetzel P C,
May 8, 2012:
US08176110
(2 worldwide citation)

Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X( ...

10

Leonard D Rarick, Sheueling Chang Shantz, Shreyas Sundaram:
Multiply execution unit for performing integer and XOR multiplication.
Sun Microsystems,
Park Vaughan & Fleming,
November 21, 2006:
US07139787
(2 worldwide citation)

A multiply execution unit that is operable to generate the integer product and the XOR product of a multiplicand and a multiplier. The multiply execution unit includes a summing circuit for summing a plurality of partial products. The partial products may be Booth encoded. The summing circuit can ge ...