+

Kunihiro et al., 2000 - Google Patents

New methods for generating short addition chains

Kunihiro et al., 2000

Document ID
14526935880261938075
Author
Kunihiro N
Yamamoto H
Publication year
Publication venue
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences

External Links

Snippet

Power exponentiation is an important operation in modern cryptography. This operation can be efficiently calculated using the concept of the addition chain. In this paper, two new systematic methods, a Run-length method and a Hybrid method, are proposed to generate a …
Continue reading at search.ieice.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/725—Finite field arithmetic over elliptic curves
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators

Similar Documents

Publication Publication Date Title
Tao et al. The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures
Blake et al. Computing logarithms in finite fields of characteristic two
US6611597B1 (en) Method and device for constructing elliptic curves
Kunihiro et al. New methods for generating short addition chains
Babai et al. Polynomial-time theory of matrix groups
Schoof Four primality testing algorithms
KR20050023326A (en) Testing probable prime numbers for cryptographic applications
Olshevsky et al. A displacement approach to efficient decoding of algebraic-geometric codes
Bordage et al. Interactive oracle proofs of proximity to algebraic geometry codes
Bernard et al. Log-S-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
Babai et al. Black-box recognition of finite simple groups of Lie type by statistics of element orders
Gligoroski et al. Edon-R, An Infinite Family of Cryptographic Hash Functions.
Chen et al. Reverse mathematics of complexity lower bounds
Fiorini et al. How to fake an RSA signature by encoding modular root finding as a SAT problem
Ajani et al. SAT and lattice reduction for integer factorization
CN112887096A (en) Prime order elliptic curve generation method and system for signature and key exchange
Basiri et al. Implementing the arithmetic of C 3, 4 curves
JP2002540653A (en) Method, system, and apparatus for proving message integrity and / or authenticity using entity authenticity and / or special prime factors
Ding et al. Some new methods to generate short addition chains
Lapiha Comparing Lattice Families for Bounded Distance Decoding near Minkowski’s Bound.
Babai et al. Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups
Wedeniwski Primality tests on commutator curves
Anashin Pseudorandom number generation by $ p $-adic ergodic transformations
Yacobi Fast exponentiation using data compression
Ellis et al. The cycles of the multiway perfect shuffle permutation
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载