Fast RSA-Type cryptosystems using N-Adic expansion

Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

Abstract

We propose two RSA-type cryptosystems using n-adic expansion, where n is the public key. These cryptosystems can have more than one block as a plaintext space, and the decrypting process is faster than any other multi-block RSA-type cryptosystem ever reported. Deciphering the entire plaintext of this system is as intractable as breaking the RSA cryptosystem or factoring. Even if a message is several times longer than a public key n, we can encrypt the message fast without repeatedly using the secret key cryptosystem.

Original languageEnglish
Title of host publicationAdvances in Cryptology — CRYPTO 1997 - 17th Annual International Cryptology Conference, Proceedings
EditorsB.S. Kaliski
PublisherSpringer Verlag
Pages372-384
Number of pages13
ISBN (Print)3540633847, 9783540633846
DOIs
Publication statusPublished - 1997
Event17th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 1997 - Santa Barbara, United States
Duration: Aug 17 1997Aug 21 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1294
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 1997
CountryUnited States
CitySanta Barbara
Period8/17/978/21/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast RSA-Type cryptosystems using N-Adic expansion'. Together they form a unique fingerprint.

Cite this