000			01598nam a2200265 u 4500
001			10106141
003			upatras
005			20210117204240.0
008			010524s eng
020			_a3 540 58496 X
040			_aΒιβλιοθήκη ΕΑΙΤΥ _cΒιβλιοθήκη ΕΑΙΤΥ
040			_aXX-XxUND _cΒιβλιοθήκη ΕΑΙΤΥ
245	1	0	_aDistributed Programming Paradigms with Cryptography Applications _cJonathan S. Greenfield
260			_aBerlin _bSpringer - Verlag _c1994
300			_axi, 182 p., fig., tab.
490	0		_aLecture Notes in Computer Science. 870
504			_aBibliography pp. 167-173, Index pp. 175-176
505	1		_acontents: 1.Overview, 2.The RSA public-key cryptosystem, 3.Notation for distributed algorithms, 4.The competing servers array, 5.A distributed algorithm to find safe RSA keys, 6.Distributed factoring with competing servers, 7.The synchronized servers pipeline, 8.Message block chaining for distributed RSA enciphering, 9.Generating deterministically certified primes, Appendix 1:A proof of Lucas' theorem, Appendix 2:Multiple_length arithmetic, Appendix 3:Strong prime generation, Appendix 4:Pollard p-1 factoring, Appendix 5:RSA enciphering, Appendix 6:RSA deciphering, Appendix 7:Deterministic prime certification, Bibliography, Index, LIst of figures, List of tables, List of algorithms.
650		4	_aΔιπλωματικές _955728
650		4	_aLNCS _9113061
650		4	_aCRYPTOGRAPHY _921659
700	1		_aGREENFIELD, JONATHAN S. _4aut _9125976
942			_2ddc
999			_c91340 _d91340