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

Fundamental circuits and cut-sets used in cryptography

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

DOI10.1080/09720529.2012.10698381zbMath1349.94131OpenAlexW2035078435MaRDI QIDQ2833283

R. Selvakumar, Nishant Gupta

Publication date: 17 November 2016

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2012.10698381


zbMATH Keywords

data encryption standardprivate key cryptographyfundamental circuiTfundamental cutesT


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (3)

The elliptic scalar multiplication graph and its application in elliptic curve cryptography ⋮ Inner magic and inner antimagic graphs in cryptography ⋮ Some graph-based encryption schemes



Cites Work

  • Unnamed Item
  • Secret sharing schemes for graph-based prohibited structures
  • Graph theory and the amateur cryptographer




This page was built for publication: Fundamental circuits and cut-sets used in cryptography

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