Search Patents
  • Asymmetric cryptography using shadow numbers
    Patent number: 8811606
    Abstract: A method and an apparatus for enciphering and deciphering content with symmetric and asymmetric cryptography with the use of the shadow numbering system where two or more shadow values are used with two or more base values with a two side equation, on one side the value to encipher is multiplied with one of the shadow value then the modulus taken with the base value, to decipher the enciphered value is multiplied with the shadow value that didn't take part of the first equation then the modulus is taken with the base value, thus, deciphering the enciphered value.
    Type: Grant
    Filed: October 13, 2010
    Date of Patent: August 19, 2014
    Assignee: UnoWeb Inc.
    Inventor: John Almeida
  • Non-autonomous dynamical orbit cryptography
    Patent number: 7215769
    Abstract: NADO is a process for encrypting and decrypting information in a variety of cryptographic devices. The underlying process is a fast stream-like cipher that can be implemented efficiently in analog or digital hardware or in software. The NADO process makes use of three novel methods in cryptography: 1) A sequence of permutations which scrambles and spreads out the encrypted information; (2) A state generator built with a non-autonomous dynamical system to generate an unpredictable sequence of states; (3) One or more perturbators which perturb both the non-autonomous dynamical system and the sequence of permutations in a non-periodic way.
    Type: Grant
    Filed: October 25, 2003
    Date of Patent: May 8, 2007
    Assignee: Fiske Software LLC
    Inventor: Michael Fiske
  • METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR EFFICIENT ELLIPTIC CURVE CRYPTOGRAPHY
    Publication number: 20110176676
    Abstract: A method, apparatus and computer program product are provided to more efficiently perform aspects of elliptic curve cryptography such as by more efficiently multiplying an integer k by a point P on an elliptic curve by decomposing the integer into integers k1 and k2. In this regard, respective bounds for k1 and k2 may be determined (100, 102) and, subject to the respective bounds, k1 and k2 may then be determined (114, 116) such that the product of k and the point P on the elliptic curve may be determined based upon k1 and k2 without requiring the point P to be multiplied by k.
    Type: Application
    Filed: September 23, 2009
    Publication date: July 21, 2011
    Applicant: NOKIA CORPORATION
    Inventor: Kaisa Nyberg
  • Public key cryptography method
    Patent number: 6459791
    Abstract: The invention features a public key cryptography method based on the discrete logarithm which computes a value Gkmod p. Two solutions are proposed to reduce the number of multiplications, one consisting in generating “hollow” k exponents with a few bits of value 1, but of sufficient length to maintain the total security of the system, and the other consisting of performing calculations of the powers of g in parallel while combining the exponents with each other in order to prevent repeating the same power computations twice for a given exponent. The invention is useful for generating digital signatures, authentication and encryption.
    Type: Grant
    Filed: August 24, 1999
    Date of Patent: October 1, 2002
    Assignee: Gemplus
    Inventors: David M'Raihi, David Naccache
  • Quantum cryptography key distribution system and method
    Patent number: 7555127
    Abstract: In a quantum cryptography key distribution system for sharing a secret key between a transmitter and a receiver site, an unbalanced interferometer system in the transmitter site has a Mach-Zehnder interferometer switch with a phase modulator while the receiver site records photon arrival time slots. The system utilizes a whole of arrival photons in the receiver site and dispenses with any phase modulator in the receiver site. This system serves to improve a photon utilization efficiency.
    Type: Grant
    Filed: February 21, 2003
    Date of Patent: June 30, 2009
    Assignee: NEC Corporation
    Inventors: Yoshihiro Nambu, Toshiyuki Kambe
  • Polynomial multiplication for side-channel protection in cryptography
    Patent number: 11792004
    Abstract: Polynomial multiplication for side-channel protection in cryptography is described. An example of an apparatus includes one or more processors to process data; a memory to store data; and polynomial multiplier circuitry to multiply a first polynomial by a second polynomial, the first polynomial and the second polynomial each including a plurality of coefficients, the polynomial multiplier circuitry including a set of multiplier circuitry, wherein the polynomial multiplier circuitry is to select a first coefficient of the first polynomial for processing, and multiply the first coefficient of the first polynomial by all of the plurality of coefficients of the second polynomial in parallel using the set of multiplier circuits.
    Type: Grant
    Filed: September 17, 2021
    Date of Patent: October 17, 2023
    Assignee: INTEL CORPORATION
    Inventors: Santosh Ghosh, Manoj Sastry
  • SYSTEMS AND METHODS FOR USING SECURE, ENCRYPTED COMMUNICATIONS ACROSS DISTRIBUTED COMPUTER NETWORKS TO EFFICIENTLY UPDATE CRYPTOGRAPHY-BASED DIGITAL REPOSITORIES FOR PERFORMING BLOCKCHAIN OPERATIONS IN DECENTRALIZED APPLICATIONS
    Publication number: 20230269085
    Abstract: Methods and systems are described herein for facilitating blockchain operations in decentralized applications by offering enhanced efficient when conducting blockchain operations using cryptography-based, digital ledgers through the use of specialized indexing. For example, as opposed to relying on raw blockchain data to power decentralized applications, the methods and systems use a blockchain indexer. The blockchain indexer provides a queryable record of a subset of blockchain operations.
    Type: Application
    Filed: February 23, 2022
    Publication date: August 24, 2023
    Applicant: Coinbase, Inc.
    Inventors: Ben SCHRECK, Ankit CHIPLUNKAR, Matt MOORE, Olivia THET, Peter Jihoon KIM, Trevor ARON
  • SYSTEMS AND METHODS FOR SELECTING SECURE, ENCRYPTED COMMUNICATIONS ACROSS DISTRIBUTED COMPUTER NETWORKS FOR CRYPTOGRAPHY-BASED DIGITAL REPOSITORIES IN ORDER TO PERFORM BLOCKCHAIN OPERATIONS IN DECENTRALIZED APPLICATIONS
    Publication number: 20230269084
    Abstract: Methods and systems are described herein for facilitating blockchain operations in decentralized applications by offering enhanced efficient when conducting blockchain operations using cryptography-based, digital ledgers through the use of specialized indexing. For example, as opposed to relying on raw blockchain data to power decentralized applications, the methods and systems use a blockchain indexer. The blockchain indexer provides a queryable record of a subset of blockchain operations.
    Type: Application
    Filed: February 23, 2022
    Publication date: August 24, 2023
    Applicant: Coinbase, Inc.
    Inventors: Ben SCHRECK, Ankit Chiplunkar, Matt Moore, Olivia Thet, Peter Jihoon Kim, Trevor Aron
  • Systems and methods for post-quantum cryptography optimization
    Patent number: 11902431
    Abstract: Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example method includes receiving data. The example method further includes generating a set of data attributes about the data. The example method further includes generating a data envelope based on the set of data attributes. Subsequently, the example method includes generating an enveloped data structure based on the data envelope and the data.
    Type: Grant
    Filed: February 21, 2023
    Date of Patent: February 13, 2024
    Assignee: Wells Fargo Bank, N.A.
    Inventors: Robert L. Carter, Jr., Ravi K. Maganti, Bradford A. Shea, M. Erik Meinholz, Jeff J. Stapleton, Peter Bordow, Pierre Arbajian, Abhijit Rao
  • System and method for implementing elliptic curve scalar multiplication in cryptography
    Patent number: 8649508
    Abstract: A system and method for implementing the Elliptic Curve scalar multiplication method in cryptography, where the Double Base Number System is expressed in decreasing order of exponents and further on using it to determine Elliptic curve scalar multiplication over a finite elliptic curve.
    Type: Grant
    Filed: September 29, 2008
    Date of Patent: February 11, 2014
    Assignee: Tata Consultancy Services Ltd.
    Inventor: Natarajan Vijayarangan
  • METHOD FOR EFFICIENTLY PROTECTING ELLIPTIC CURVE CRYPTOGRAPHY AGAINST SIMPLE POWER ANALYSIS ATTACKS
    Publication number: 20160134417
    Abstract: A method and device for protecting elliptic curve cryptography against simple power attacks is disclosed. The method is based on a processor such as a computer equipped to encrypt and decrypt communications and selecting and entering a point P on an elliptic curve in the computer. The processor provides k copies of the point P (kP). The processor is used to divide a string of Ks into two equal length partitions that are scanned from right to left and performing point doubling operation and delay the point addition operation by storing the some doubled points in a buffer for later performing of addition operation.
    Type: Application
    Filed: November 10, 2014
    Publication date: May 12, 2016
    Inventors: Hilal Houssain, Turki F. Al-Somani
  • System and method for creating a security application for programmable cryptography module
    Publication number: 20060059537
    Abstract: A system and method of the present invention creates a security application for a programmable cryptography module, which includes a security policy software module and mirror security policy data structures. A processor determines a security policy for an implementation specific application as a set of rules governing cryptographic security policy functions of the security policy software module. The processor is operative for generating a binary security policy file representative of the security policy and comparing the binary security policy file with the mirror security policy data structures to determine a violation of the security policy or a successful comparison.
    Type: Application
    Filed: August 25, 2004
    Publication date: March 16, 2006
    Applicant: Harris Corporation
    Inventors: John Alvermann, David Babich, William Black
  • Method of cryptography with public key based on the discrete logarithm
    Patent number: 5946397
    Abstract: Method of public key cryptography based on the discrete logarithm that makes use of the computation of the variable r=g.sup.k modp where p is a prime number called a modulus, the exponent k is a random number usually with a length of N bits and g is an integer called a base, wherein an entity E carries out operations of authentication and/or of signature, including exchanges of signals with another entity in which this variable comes into play.
    Type: Grant
    Filed: September 24, 1997
    Date of Patent: August 31, 1999
    Assignee: Gemplus S.C.A.
    Inventors: David M'Raihi, David Naccache, Jacques Stern, Serge Vaudenay
  • Multiple algorithm cryptography system
    Patent number: 8995651
    Abstract: A system includes an interface module, an addressing module, and a multiplier module. The interface module is configured to (i) receive operands and configuration data for a Rivest-Shamir-Adleman (RSA) operation or an Elliptic Curve Cryptography (ECC) operation, and (ii) control access to a random access memory (RAM). The addressing module is configured to allocate memory space within the RAM for storage of the operands. The multiplier module includes a Montgomery multiplier configured to perform Montgomery multiplication operation for both the RSA operation and the ECC operation.
    Type: Grant
    Filed: June 9, 2011
    Date of Patent: March 31, 2015
    Assignee: Marvell International Ltd.
    Inventors: Sean Lee, Chang Shu, Fei Sun
  • Method and device for code-based generation of a key pair for asymmetric cryptography
    Patent number: 12192333
    Abstract: According to various embodiments, a method for code-based generation of a key pair for asymmetric cryptography is described including generating a private key defining a linear code, determining a parity check or generator matrix for the linear code, blinding a sub-matrix of the parity check or generator matrix, generating a blinded inverse matrix by inverting the blinded sub-matrix or by inverting a quadratic matrix contained in the blinded sub-matrix, de-blinding the blinded inverse matrix to generate an inverse matrix and generating a public key for the private key using the inverse matrix.
    Type: Grant
    Filed: July 5, 2022
    Date of Patent: January 7, 2025
    Assignee: Infineon Technologies AG
    Inventor: Rainer Urian
  • Systems and methods for post-quantum cryptography optimization
    Patent number: 11626983
    Abstract: Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example method includes receiving data. The example method further includes generating a set of data attributes about the data. The example method further includes generating a data envelope based on the set of data attributes. Subsequently, the example method includes generating an enveloped data structure based on the data envelope and the data.
    Type: Grant
    Filed: September 10, 2019
    Date of Patent: April 11, 2023
    Assignee: Wells Fargo Bank, N.A.
    Inventors: Robert L. Carter, Jr., Ravi K. Maganti, Bradford A. Shea, M. Erik Meinholz, Jeff J. Stapleton, Peter Bordow, Pierre Arbajian, Abhijit Rao
  • System and method for single session sign-on with cryptography
    Patent number: 7353383
    Abstract: A method and system for single session sign-on across multiple content servers using public/private key cryptography. Session certificates are issued by an authentication authority and stored or held in volatile memory by a browser. Session certificates are used by browsers to obtain session credentials from a session authority and stored or held in volatile memory by the browser. Use of public and private keys supports authentication and non-repudiation, and eliminates some of the disadvantages of permanent certificates and PKI.
    Type: Grant
    Filed: March 14, 2003
    Date of Patent: April 1, 2008
    Assignee: JPMorgan Chase Bank, N.A.
    Inventor: Bruce James Skingle
  • Methods for coordinating access to memory from at least two cryptography secure processing units
    Publication number: 20070168676
    Abstract: Electronic circuit chips which include cryptography functions are arranged in multichip configurations through the utilization of a shared external memory. Security of the chips is preserved via a handshaking protocol which permits each chip to access limited portions of the memory as defined in a way that preserves the same high security level as the tamper proof chips themselves. The chips may be operated to work on different tasks or to work on the same task thus providing a mechanism for trading off speed versus redundancy where desired.
    Type: Application
    Filed: January 13, 2006
    Publication date: July 19, 2007
    Applicant: International Business Machines Corporation
    Inventors: Camil Fayad, John Li, Siegfried Sutter
  • Visual cryptography system
    Publication number: 20060227969
    Abstract: The present invention relates to a visual cryptography system. The system comprises a first and a second display device (1, 2), arranged for, upon being superimposed on each other, reconstructing a graphical message from two respective shares. At least one of said display devices (1, 2) comprise means for facilitating determination of the resolution and pixel size of the other. At least one, preferably both, of, said display devices (1, 2) is arranged to scale the resolution and pixel size of its share to a mutually supported resolution and pixel size, and preferably to a mutually supported smallest common multiple resolution and pixel size.
    Type: Application
    Filed: March 1, 2004
    Publication date: October 12, 2006
    Applicant: Koninklijke Philips Electronics N.V.
    Inventors: Mark Johnson, Pim Tuyls, Thomas Kevenaar
  • Systems and methods for post-quantum cryptography on a smartcard
    Patent number: 12219058
    Abstract: Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example system includes a PQC smartcard. The smartcard may include a PQC cryptographic algorithm selection circuitry configured to select a PQC cryptographic technique from a set of PQC cryptographic techniques for encrypting the data. The smartcard may further include a PQC cryptographic circuitry configured to encrypt data based on a generated set of PQC encryption attributes and the PQC cryptographic technique.
    Type: Grant
    Filed: November 15, 2022
    Date of Patent: February 4, 2025
    Assignee: Wells Fargo Bank, N.A.
    Inventors: Abhijit Rao, Adam Sanders, Ramanathan Ramanathan, Ramesh Yarlagadda, Pierre Arbajian, Andrew J. Garner
Narrow Results

Filter by US Classification