Fibonacci linear forms and parallel arithmetic algorithms for large numbers

DOI10.1007/BF02366518zbMath0865.11020OpenAlexW1980297685MaRDI QIDQ1918742

Anatoly V. Anisimov

Publication date: 25 August 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

efficient parallel algorithms for modular exponentiation and factorizationFibonacci linear treepositive definite Fibonacci linear formrepresentation of integers by linear forms of Fibonacci numbers

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Factorization; primality (11A51) Distributed algorithms (68W15)

Related Items

Efficient algorithms for remainder computation and exponentiation of long numbers, Carryless addition, Addition machines, automatic functions and open problems of Floyd and Knuth, Encoding trees by linear recurrence sequences, Two-base numeration systems, Integer representation in the mixed base \((2,3)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Features of the PARUS technology
• Addition Machines
• Inverse fibonacci transformation
• Programming of parallel processors in control spaces
• A method for obtaining digital signatures and public-key cryptosystems