Vipul Te Gupta, 541725 Sardonyx Ct, Livermore, CA 94550

6643701, Nov 4, 2003

Nov 17, 1999

09/441451

Ashar Aziz - Freemont CA
Geoffrey Baehr - Menlo Park CA
Germano Caronni - Sunnyvale CA
Amit Gupta - Fremont CA
Vipul Gupta - Fremont CA
Glenn C. Scott - Mountain View CA

Sun Microsystems, Inc. - Santa Clara CA

G06F 1516

709227, 709203, 709217, 709219, 709228, 713150, 713155, 713201, 705 64, 705 65

Methods and systems of the present invention include providing a connection between a first computer and a second computer by receiving, at a third computer, information regarding one of the first and second computers to facilitate establishment of a secure connection between the first computer and the second computer, creating a first end-to-end security link between the first computer and third computer, and creating a second end-to-end security link between the second computer and the third computer to establish the secure connection. The first and second computers could be a client and a server on the Internet, and these methods and systems can, for example, increase the possible number of new secure connections to the server. The third computer also permits processing of information transmitted between the client and server in the third computer. For example, the information could be reformatted or used in testing a process of one of the first and second computers.

7461115, Dec 2, 2008

Mar 11, 2003

10/387009

Hans Eberle - Mountain View CA, US
Nils Gura - San Carlos CA, US
Russell A. Brown - Palo Alto CA, US
Vipul Gupta - Los Altos CA, US

Sun Microsystems, Inc. - Santa Clara CA

G06F 7/00
H04L 9/00

708491, 708492, 380 28

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(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e. g. , by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

7508936, Mar 24, 2009

Mar 11, 2003

10/387007

Hans Eberle - Mountain View CA, US
Nils Gura - San Carlos CA, US
Daniel Finchelstein - Toronto, CA
Vipul Gupta - Los Altos CA, US

Sun Microsystems, Inc. - Santa Clara CA

H04L 9/00
H04L 9/32
H04L 9/30
H04L 9/28
G06F 1/02
G06F 7/38

380 30, 380 28, 708270, 708490, 708491, 708492

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 generic curves using arbitrary irreducible polynomials, which correspond to respective ones of the generic curves. The elliptic curve processing apparatus may include hardwired reduction circuits in the functional unit for use with respective named curves. A storage location in the elliptic curve processing apparatus may be used to specify whether an operation is for one of the named curves or for one of the generic curves. The elliptic curve processing apparatus responds to an arithmetic instruction to utilize a respective one of the hardwired reduction circuits for reduction for respective named curves and a multiplier circuit for reduction for a plurality of generic curves, the multiplier coupled to perform reduction for respective generic curves using arbitrary irreducible polynomials, the arbitrary irreducible polynomials corresponding to respective ones of the generic curves. The elliptic curve processing apparatus operable on elliptic curves specified over binary polynomial fields performs a conditional branch according to whether a curve being processed is a generic curve or a named curve.

7881206, Feb 1, 2011

Dec 31, 2007

11/967416

Robert P. St. Pierre - San Jose CA, US
Vipul Gupta - Los Altos CA, US
Pradip S. De - Arlington TX, US

Oracle America, Inc. - Redwood City CA

H04L 12/26
G06F 15/173

370238, 370229, 709242

Method and apparatus for optimizing mesh routing for stability and system lifetime maximization in networks, for example in wireless networks. A routing module may be instantiated in nodes on the network. The routing module may implement a link quality and node health aware routing protocol on the network that considers a combination of link quality and node health/residual lifetime metrics in the calculation of the desirability of nodes and links between nodes as parts of an overall route. A route selection metric for each route may be determined from routing cost metrics for the nodes on the route and the number of hops on the route. A node may then select a best route according to the determined route selection metrics for the routes.

8037443, Oct 11, 2011

Jul 2, 2009

12/497340

Venkatram Krishnaswamy - Los Altos CA, US
Vipul Gupta - San Jose CA, US

Calypto Design Systems, Inc. - Santa Clara CA

G06F 17/50

716133, 716108, 716109, 716120, 716132, 716127

A system, method and computer program product are provided for optimizing an altered hardware design utilizing power reports. In use, a first hardware design is synthesized. Additionally, a first power report is generated for the synthesized first hardware design. Further, the first hardware design is altered. Further still, the altered hardware design is synthesized. Also, a second power report is generated for the synthesized altered hardware design. Furthermore, the altered hardware design is optimized utilizing the first power report and the second power report.

8176110, May 8, 2012

Oct 22, 2008

12/256295

Hans Eberle - Mountain View CA, US
Nils Gura - San Carlos CA, US
Russell A. Brown - Palo Alto CA, US
Vipul Gupta - Los Altos CA, US

Oracle America, Inc. - Redwood City CA

G06F 7/38
H04L 9/00

708491, 708492, 380 28

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(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e. g. , by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

8533473, Sep 10, 2013

Mar 4, 2005

11/072061

Vipul Gupta - Los Altos CA, US
Nils Gura - Mountain View CA, US
Arvinderpal S. Wander - Fremont CA, US

Oracle America, Inc. - Redwood City CA

H04L 29/06
H04L 9/32
H04L 12/66

713171, 713153, 380210, 370352, 709247, 709202, 709229, 709231, 709235

A secure end to end connection is established between a remote device having a wireless link and a control/monitoring location for the remote device through a gateway. During the establishing of the secure connection, a compressed message representation is used to communicate between the gateway and the remote device over the wireless link and an uncompressed message representation is used to communicate between the gateway and the first location. The establishment of the secure connection utilizes public-key algorithms.

2007005, Mar 15, 2007

Sep 27, 2005

11/236435

Vipul Gupta - Los Altos CA, US
Michael Wurm - Graz, AT

H04L 12/56

370392000, 370401000

A client node is communicatively coupled to a gateway node via a TCP/IP network. One or more constrained devices that include a wireless receiver/transmitter circuit communicate with the gateway node via a wireless network. The gateway node includes a web server that provides a dynamic web page accessible by the client node that has a list of the one or more active constrained devices on the wireless network. Each device entry in the list includes a URL that acts as an entry point for the client node to communicate with a web server in a corresponding constrained device. The gateway node automatically discovers a new device on the wireless network and populates the list of the one or more active constrained devices with the newly present constrained device. The new constrained device may be detected based on a periodic message sent by the constrained device indicating the constrained device has turned on its receiver/transmitter circuit for a period of time.