✦ LIBER ✦

Considerations for New Public-Key Algorithms

✍ Scribed by Burt Kaliski

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 171 KB
Volume: 2000
Category: Article
ISSN: 1353-4858
DOI: 10.1016/s1353-4858(00)09025-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New hierarchical assignment without Publ

New hierarchical assignment without Public Key cryptography

✍ Hung-Yu Chien; Jinn-Ke Jan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 124 KB

## The access privileges in many distributed systems can be effectively organized as a hierarchical tree. Distributing distinct cryptographic keys to distinct entities, according to their privileges, provides a good solution to the hierarchical access control problem. Many existing key assignment sc

Global public key security for PCs

📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 139 KB

On using primes for public key encryptio

On using primes for public key encryption systems

✍ E.Dennis Huthnance; Joe Warndof 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 221 KB

It is shown that the popular RSA public key encryption scheme does not require two primes but that probable primes may be used instead. A method for finding probable primes is given and the security of systems based on probable primes is discussed.

Requirements for a trusted global public

Requirements for a trusted global public key initiative

✍ Nanette Di Tosto 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 613 KB

## An irresistible force In the time it is taking me to write this sentence hundreds of new information nodes have gone online. Messages of great importance and of no importance at all are being drafted and transmitted. Data is being stored. Some of this information is encrypted; much is not. An u

An implementation for a fast public-key

An implementation for a fast public-key cryptosystem

✍ G. B. Agnew; R. C. Mullin; I. M. Onyszchuk; S. A. Vanstone 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 795 KB

An algorithm for modelling key terms

✍ D. Cai; C. J. van Rijsbergen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

The ability to formally analyse and represent semantic relations of terms is a major challenge for many areas of computing science and an intriguing problem for other sciences. In applications of evidence theory to, for instance, information retrieval, the problem of analysis and representation beco