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

Generic Case Complexity and One-Way Functions

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

DOI10.1515/GCC.2009.13zbMath1156.94369MaRDI QIDQ3617414

Alex D. Myasnikov

Publication date: 23 March 2009

Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)



Mathematics Subject Classification ID

Cryptography (94A60)





Cites Work

  • Probabilistic encryption
  • Generic-case complexity, decision problems in group theory, and random walks.
  • The halting problem is decidable on a set of asymptotic probability one
  • New directions in cryptography
  • MULTIPLICATIVE MEASURES ON FREE GROUPS




This page was built for publication: Generic Case Complexity and One-Way Functions

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