Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Sidelnikov, V.M. |
| Copyright Year | 1994 |
| Description | Author affiliation: Moscow State Univ., Russia (Sidelnikov, V.M.) |
| Abstract | Diffie and Hellman (1976) proposed to use exponentiation module a prime for constructing the key generation system. A security of this system is based on the supposed hardness of the following problem (A): given /spl eta//sup x/ and /spl eta//sup y/ compute /spl eta//sup xy/. Sidelnikov, Cherepniov, and Yaschenko (1993) considered a system based on the noncommutative group G. We assume that G is a certain subgroup of the group GL/sub n/(F/sub p/) of n/spl times/n matrices over the finite field F/sub p/. We consider the representation of the group GL/sub n/(F/sub p/) with the aid of exponentiation in a subsidiary cyclic group U of order p and investigate of the security of the resulting key generation systems. The group of F/sub q/-rational point on elliptic curve and the subgroup U= of the multiplicative group of the subsidiary finite field F/sub q/, where p|q-1, /spl eta//spl isin/F/sub q/, /spl eta//sup p/=1, /spl eta//spl ne/1, are the examples of the group U. We consider the group /spl Uscr/ of affine transformations of the field F/sub p/ which is isomorphic to a certain subgroup of GL/sub 2/(F/sub p/). In this case the security of the key generation system under certain conjecture (which simplifies the task of adversary) is based on the hardness of the following problem (B): given /spl eta//sup x/,/spl eta//sup y/,/spl beta//sup z/ compute /spl eta//sup xy/z/. It seems impossible reduce this problem to several Diffie-Hellman problems (A). The system being considered uses a universal key, which does not exist in the Diffie-Hellman system and is presumably a new element for key generation systems. The knowledge of k is supposed to be a necessary condition to compute the private key. |
| File Size | 95692 |
| File Format | |
| ISBN | 0780320158 |
| DOI | 10.1109/ISIT.1994.395112 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 1994-06-27 |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Security Public key Elliptic curves Galois fields |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|