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...
保存先:
| 第一著者: | |
|---|---|
| 団体著者: | |
| フォーマット: | eBook |
| 言語: | English |
| 出版事項: |
Wiesbaden :
Vieweg+Teubner Verlag
2012.
|
| 主題: | |
| オンライン･アクセス: | Click here to view the full text content |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
このレコードへの初めてのコメントを付けませんか!