Computing Root Modulo a composite
Publish place: 3rd Iranian Security Community Conference
Publish Year: 1384
Type: Conference paper
Language: English
View: 2,510
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
ISCC03_037
Index date: 21 May 2007
Computing Root Modulo a composite abstract
In this paper, we introduce a new computational problem and show that solving this problem is no easier than Factoring. As will be discussed, this new computational problem can be used to construct a new public key encryption scheme. The new public key encryption scheme will
be provably secure, based on intractability of factoring problem.
Computing Root Modulo a composite Keywords:
Computing Root Modulo a composite authors
Koshiar Azimian
Electronic Research Center, Sharif University of Technology, Department of Computer Engineering, Sharif University of Technology
Ali Bagherzandi
Department of Computer Engineering, Sharif University of Technology
Javad Mohajeri
Electronic Research Center, Sharif University of Technology
Mahmoud Salmasizadeh
Electronic Research Center, Sharif University of Technology
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :