Entry Baker:1992:CAB from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Baker:1992:CAB,
  author =       "H. G. Baker",
  title =        "Computing {$A * B \pmod{N}$} efficiently in {ANSI C}",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "1",
  pages =        "95--98",
  month =        jan,
  year =         "1992",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Thu Dec 14 17:21:15 MST 1995",
  abstract =     "The modular product computation $A * B \mod{N}$ is a
                 bottleneck for some public-key encryption algorithms,
                 as well as many exact computations implemented using
                 the Chinese remainder theorem. The author shows how to
                 compute $A * B \pmod{N}$ efficiently, for
                 single-precision $A$, $B$, and $N$, on a modern RISC
                 architecture (Intel 80860) in ANSI C. On this
                 architecture, the method computes $A * B \pmod{N}$
                 faster than ANSI C computes $A \% N$, for unsigned
                 longs $A$ and $N$.",
  acknowledgement = ack-nhfb,
  affiliation =  "Nimble Comput. Corp., Encino, CA, USA",
  classification = "C5230 (Digital arithmetic methods); C6110 (Systems
                 analysis and programming); C6130S (Data security);
                 C6140D (High level languages)",
  keywords =     "ANSI C; Chinese remainder theorem; Exact computations;
                 Intel 80860; Modular product computation; Public-key
                 encryption algorithms; RISC architecture;
                 Single-precision",
  thesaurus =    "C language; Cryptography; Digital arithmetic;
                 Programming",
}

Related entries