Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A method for computing Lucas sequences

From MaRDI portal
Publication:1975706
Jump to:navigation, search

DOI10.1016/S0898-1221(99)00297-7zbMath0969.68069MaRDI QIDQ1975706

Chu-Hsing Lin, Ching-Te Wang, Chin-Chen Chang

Publication date: 15 July 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)


zbMATH Keywords

public-key cryptosystems


Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)


Related Items (1)

AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • On the security of the Lucas function
  • Parallel computation of the multi-exponentiation for cryptosystems
  • A public key cryptosystem and a signature scheme based on discrete logarithms
  • New directions in cryptography
  • Computing Sequences with Addition Chains
  • A method for obtaining digital signatures and public-key cryptosystems




This page was built for publication: A method for computing Lucas sequences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1975706&oldid=14431315"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki