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 D0L-T0L public key cryptosystem

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

DOI10.1016/0020-0190(87)90044-5zbMath0637.94014OpenAlexW184257566MaRDI QIDQ1099130

Rani Siromoney, K. G. Subramanian, P. Jeyanthi Abisha

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90044-5


zbMATH Keywords

cryptographyformal languageL system


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Grammars and rewriting systems (68Q42)


Related Items (4)

Attacking a public key cryptosystem based on tree replacement ⋮ Mathematical problems in cryptology ⋮ A public key cryptosystem based on Lyndon words ⋮ Lyndon trees




Cites Work

  • Unnamed Item




This page was built for publication: A D0L-T0L public key cryptosystem

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