Computationally efficient algorithms for a one-time pad scheme

DOI10.1007/BF00991623MaRDI QIDQ3038660zbMATH OpenOpenAlexFDO

Authors

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

cipherscomputationally efficient algorithms for the implementation of a one-time pad schemecryptographydata protectionsecurity

Mathematics Subject Classification ID

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

Cites work

• An implementation of Vincent's theorem
• Exact algorithms for the implementation of cauchy's rule
• scientific article; zbMATH DE number 3926212 (Why is no real title available?)
• scientific article; zbMATH DE number 3983114 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3375582 (Why is no real title available?)
• On the complexity of algorithms for the translation of polynomials
• Secure communications over insecure channels
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038660)