Black-box models of computation in cryptology /
<p>Generic group algorithms solve computational problems defined over algebraic groups without exploiting properties of a particular representation of group elements. This is modeled by treating the group as a black-box. The fact that a computational problem cannot be solved by a reasonably re...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Wiesbaden :
Vieweg+Teubner Verlag
2012.
|
| Subjects: | |
| Online Access: | Click here to view the full text content |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
System Under Maintenance
Our Library Management System is currently under maintenance.
Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance: