TAILIEUCHUNG - Handbook of Applied Cryptography - chap4

The efficient generation of public-key parameters is a prerequisite in public-key systems. A specific example is the requirement of a prime number p to define a finite field Zp for use in the Diffie-Hellman key agreement protocol and its derivatives (). In this case, an element of high order in Z p is also required. Another example is the requirement of primes p and q for an RSA modulus n = pq (). | This is a Chapter from the Handbook of Applied Cryptography by A. Menezes P. van Oorschot and S. Vanstone CRC Press 1996. For further information see hac CRC Press has granted the following specihc permissions for the electronic version of this book Permission is granted to retrieve print and store a single copy of this chapter for personal use. This permission does not extend to binding multiple chapters of the book photocopying or producing copies for other than personal use of the person creating the copy or making electronic copies available for retrieval by others without prior permission in writing from CRC Press. Except where over-ridden by the specihc permission above the standard copyright notice from CRC Press applies to this electronic version Neither this book nor any part may be reproduced or transmitted in any form or by any means electronic or mechanical including photocopying microhlming and recording or by any information storage or retrieval system without prior permission in writing from the publisher. The consent of CRC Press does not extend to copying for general distribution for promotion for creating new works or for resale. Specihc permission must be obtained in writing from CRC Press for such copying. @1997 by CRC Press Inc. Chapter Public-Key Parameters Contents in Brief Probabilistic primality True Primality Prime number Irreducible polynomials over Generators and elements of high Notes and further Introduction The efficient generation of public-key parameters is a prerequisite in public-key systems. A specific example is the requirement of a prime number p to define a finite field Zp for use in the Diffie-Hellman key agreement protocol and its derivatives . In this case an element of high order in Zp is also required. Another example is the requirement of primes p and q for an RSA modulus n .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.