作者: Gottfried Herold , Julia Hesse , Dennis Hofheinz , Carla Ràfols , Andy Rupp
DOI: 10.1007/978-3-662-44371-2_15
关键词: Prime (order theory) 、 Computer science 、 Point (geometry) 、 Algebra 、 Order of magnitude 、 Transformation (function) 、 Composite number 、 Polynomial 、 Cryptosystem
摘要: At Eurocrypt 2010, Freeman presented a framework to convert cryptosystems based on composite-order groups into ones that use prime-order groups. Such transformation is interesting not only from conceptual point of view, but also since for relevant parameters, operations in are faster than by an order magnitude. Since Freeman’s work, several other works have shown improvements, lower bounds the efficiency such conversions.