Patent application number | Description | Published |
20110261956 | Simultaneous Scalar Multiplication Method - In computing point multiples in elliptic curve schemes (e.g. kP and sQ) separately using, for example, Montgomery's method for the purpose of combining kP+sQ, several operations are repeated in computing kP and sQ individually, that could be executed at the same time. A simultaneous scalar multiplication method is provided that reduces the overall number of doubling and addition operations thereby providing an efficient method for multiple scalar multiplication. The elements in the pairs for P and Q method are combined into a single pair, and the bits in k and s are evaluated at each step as bit pairs. When the bits in k and s are equal, only one doubling operation and one addition operation are needed to compute the current pair, and when the bits in k and s are not equal, only one doubling operation is needed and two addition operations. | 10-27-2011 |
20120072975 | Circumstantial Authentication - An authentication system is provided. The authentication system comprises a first component configured to obtain information specific to an individual, a second component configured to dynamically formulate at least one challenge question based on the information, a third component configured to cause the at least one challenge question to be presented on a device when the device is used to perform an act that involves authentication, and a fourth component configured to judge authenticity based on an answer to the at least one challenge question. | 03-22-2012 |
20120230494 | Accelerated Verification of Digital Signatures and Public Keys - Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained. | 09-13-2012 |
20130003964 | Simultaneous Scalar Multiplication Method - In computing point multiples in elliptic curve schemes (e.g. kP and sQ) separately using, for example, Montgomery's method for the purpose of combining kP+sQ, several operations are repeated in computing kP and sQ individually, that could be executed at the same time. A simultaneous scalar multiplication method is provided that reduces the overall number of doubling and addition operations thereby providing an efficient method for multiple scalar multiplication. The elements in the pairs for P and Q method are combined into a single pair, and the bits in k and s are evaluated at each step as bit pairs. When the bits in k and s are equal, only one doubling operation and one addition operation are needed to compute the current pair, and when the bits in k and s are not equal, only one doubling operation is needed and two addition operations. | 01-03-2013 |
20130064367 | ACCELERATED VERIFICATION OF DIGITAL SIGNATURES AND PUBLIC KEYS - Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained. | 03-14-2013 |
20140344579 | Accelerated Verification of Digital Signatures and Public Keys - Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n)+wQ=O with z and w of reduced bit length This is beneficial in digital signature verification where increased verification can be attained. | 11-20-2014 |
20140365779 | GENERATING DIGITAL SIGNATURES - Methods, systems, and computer programs for generating a digital signature are disclosed. In some aspects, a symmetric key is accessed. The symmetric key is based on an ephemeral public key. The ephemeral public key is associated with an ephemeral private key. A ciphertext is generated based on the symmetric key and a message. An input value is obtained based on the ciphertext independent of a hash function. A digital signature is generated from the ephemeral private key, the input value, and a long term private key. | 12-11-2014 |
Patent application number | Description | Published |
20140324943 | DRAG-AND-DROP CLIPBOARD FOR HTML DOCUMENTS - Techniques are disclosed for editing pages in a client-server architecture, such as in the context of cloud-based webpage editing applications. In one embodiment, a Clipboard Module running in the client browser is invoked in response to a copy operation that is requested with respect to a selected piece of content on a given page presented at the client. The Clipboard Module is configured to store the copied content in a local storage, and to also present a UI clipboard element for viewing by the user. The UI clipboard element can be dragged-and-dropped at a target drop location within the document being edited. A drop zone indicator can be visually displayed so that user can see where the clipboard content will be placed upon release of the drag-and-drop operation. Upon release, the clipboard content is pasted or otherwise inserted into the DOM of the target page at the current drop zone. | 10-30-2014 |
20150074612 | NAVIGATION IN A HIERARCHICAL NODE STRUCTURE - Techniques are disclosed for navigation in a hierarchical node structure. A first graphical element representing a parent node in a hierarchical node structure is displayed via a graphical user interface (GUI). One or more second graphical elements, each representing a first child node of the parent node, are further displayed via the GUI on a first imaginary curve adjacent to or at least partially surrounding the parent node. In response to a user selection of one of the first child nodes, one or more third graphical elements each representing a second child node of the first child node are displayed via the GUI on a second imaginary curve adjacent to or at least partially surrounding the selected child node. | 03-12-2015 |
20150082242 | Providing Context Menu Based on Predicted Commands - Systems and methods are disclosed for providing a context menu based on predicted commands. One embodiment involves identifying historical commands previously performed in an application. The embodiment also involves determining that each of a subset of commands from the historical commands has a higher correlation with a trigger command than others of the plurality of historical commands. The embodiment also involves generating a context menu including the subset of commands in response to receiving a request for the context menu after performing the trigger command in the application. | 03-19-2015 |
20150106426 | TEMPORARY CONTENT VERSIONING ON A CLIENT IN A REST-BASED SYSTEM - Techniques are disclosed for maintaining different versions of a web resource. A client-side application observes and tracks all asynchronous requests for web resources sent from the client to a server. Every time a user attempts to modify a resource on the server, the application stops or otherwise pauses the execution of the request and retrieves a representation of the resource from the server in an original state. The representation is stored locally on the client in a local storage, such as browser persistent storage, and may be stored with a timestamp and the corresponding resource URL. Subsequently, the request to modify the resource is executed. In this manner, a representation of the resource is retained in an original state prior to modification. The locally-stored representation can be used to restore the resource back to the original state in response to a so-called undo request by the user. | 04-16-2015 |
20150106695 | Visual Path Resolution in a Context Separated Authoring Environment of a REST- and Component- Based Content Management System - Techniques are disclosed for providing visual path resolution in a context separated authoring environment of a REST- and component-based content management system. A web page editor is activated for editing a web page having a plurality of Document Object Model components. A structured document is generated and configured to present the web page components and at least a portion of the web page editor in a common frame of a browser window, as well as visual indications of regions of the web page that contain one or more of the components. In response to receiving an input that selects one of the components, the structured document is updated to present information about a property of the selected component, such as a path to a location of the selected component and/or a type of the selected component, in the same region of the web page that contains the selected component. | 04-16-2015 |
20150319197 | REAL-TIME CONTENT SHARING BETWEEN BROWSERS - Techniques are provided for selectively broadcasting information from a sender's computer to one or more recipient computers in real-time. A user connects to a networked content server and browses selected content items which are determined to be of interest to other collaborators. The user activates a content sharing mode and indicates which content is to be shared. A reference to the shared content is sent to the server which in turn pushes the referenced content to identified content recipients. Content recipients can be identified based on a variety of factors, such as by subscription to a listening channel opened by the content sender, by individual selection by the content sender, and/or by geolocation. The shared content can be automatically displayed to each identified content recipient non-intrusively. Content can be pushed to the content recipients via a persistent open communication channel established between the content server and content recipients. | 11-05-2015 |
20150319403 | CROSS-DEVICE INFORMATION EXCHANGE VIA WEB BROWSER - Techniques are disclosed for exchanging information between devices. Each device is configured to execute a web browser application. One of the devices is referred to as a streamer device, and the other a receiver device. The receiver device includes a camera for receiving images displayed by the streamer device. A user of the streamer device can orient the display of the streamer towards the camera of the receiver device. The receiver device uses the camera to observe images displayed by any streamer devices that are present within the field of view of the camera. The receiver device, via the camera, analyzes each video frame displayed by the streamer device for a pattern. If the pattern is detected and matches a predefined pattern, the receiver device can retrieve information associated with the pattern, and display that information in the web browser. | 11-05-2015 |