Black-Box Models of Computation in Cryptology
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 restricted...
Κύριος συγγραφέας: | Jager, Tibor (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Wiesbaden :
Vieweg+Teubner Verlag,
2012.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Reduced Order Methods for Modeling and Computational Reduction
Έκδοση: (2014) -
Numerical Methods in Matrix Computations
ανά: Björck, Åke
Έκδοση: (2015) -
Scientific Computing - An Introduction using Maple and MATLAB
ανά: Gander, Walter, κ.ά.
Έκδοση: (2014) -
Scientific Computing with MATLAB and Octave
ανά: Quarteroni, Alfio, κ.ά.
Έκδοση: (2010) -
Advanced Computing
Έκδοση: (2013)