Reusable secret sharing schemes based on Chinese Remainder Theorem by Endurthi Anjaneyulu; supervised by V.Ch. Venkaiah
Anjaneyulu, Endurthi| Call Number | PR001.6 An56R |
| Author | Anjaneyulu, Endurthi |
| Title | Reusable secret sharing schemes based on Chinese Remainder Theorem by Endurthi Anjaneyulu; supervised by V.Ch. Venkaiah |
| Publication | Hyderabad: University of Hyderabad, 2014. |
| Physical Description | 44p. |
| Notes | Project report ( M. Tech.) - School of Computer and Information Science - University of Hyderabad. |
| Added Author | Venkaiah, V.Ch.; Supervisor |
| Subject | COMPUTER SCIENCE |
Total Ratings:
0
00807nam a2200205 a 4500
001
vtls001578768
003
VRT
005
20181114122800.0
008
180914 m 000 0eng d
039
9
$a 201811141228 $b thirupathi $c 201810041449 $d FAH $y 201809141016 $z FAH
082
$a PR001.6 $b An56R
100
1
$a Anjaneyulu, Endurthi
245
1
$a Reusable secret sharing schemes based on Chinese Remainder Theorem $c by Endurthi Anjaneyulu; supervised by V.Ch. Venkaiah
260
$a Hyderabad: $b University of Hyderabad, $c 2014.
300
$a 44p.
500
$a Project report ( M. Tech.) - School of Computer and Information Science - University of Hyderabad.
650
0
$a COMPUTER SCIENCE
700
1
$a Venkaiah, V.Ch.; Supervisor
999
$a VIRTUA40
999
$a VTLSSORT0080*0820*1000*2450*2600*3000*5000*6500*7000*9992
No Reviews to Display
| Notes | Project report ( M. Tech.) - School of Computer and Information Science - University of Hyderabad. |
| Subject | COMPUTER SCIENCE |