Computationally efficient algorithms for a one-time pad scheme

DOI10.1007/BF00991623zbMath0525.68063OpenAlexW1970610172MaRDI QIDQ3038660

No author found.

Publication date: 1983

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00991623

zbMATH Keywords

cryptographysecurityciphersdata protectioncomputationally efficient algorithms for the implementation of a one-time pad scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication, information (94A99) Data structures (68P05) Information storage and retrieval of data (68P20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of algorithms for the translation of polynomials
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• An implementation of Vincent's theorem
• Secure communications over insecure channels
• Exact algorithms for the implementation of cauchy's rule

This page was built for publication: Computationally efficient algorithms for a one-time pad scheme