A Probabilistic Baby-step Giant-step Algorithm

Prabhat Kushwaha; Ayan Mahalanobis

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

A Probabilistic Baby-step Giant-step Algorithm

Topics: Security Protocols

In Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 0ICETE, 401-406, 2017 , Madrid, Spain

Authors: Prabhat Kushwaha and Ayan Mahalanobis

Affiliation: IISER Pune, India

Keyword(s): Discrete Logarithm Problem, Baby-step Giant-step Algorithm, NIST Curves Over Prime Fields, Parallelized Collision Search.

Related Ontology Subjects/Areas/Topics: Information and Systems Security ; Security Protocols

Abstract: In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are considered to be the most conservative and safest curves among all NIST curves.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.139.81.58

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Kushwaha, P. and Mahalanobis, A. (2017). A Probabilistic Baby-step Giant-step Algorithm. In Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017) - SECRYPT; ISBN 978-989-758-259-2; ISSN 2184-3236, SciTePress, pages 401-406. DOI: 10.5220/0006396304010406

@conference{secrypt17,
author={Prabhat Kushwaha. and Ayan Mahalanobis.},
title={A Probabilistic Baby-step Giant-step Algorithm},
booktitle={Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017) - SECRYPT},
year={2017},
pages={401-406},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006396304010406},
isbn={978-989-758-259-2},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017) - SECRYPT
TI - A Probabilistic Baby-step Giant-step Algorithm
SN - 978-989-758-259-2
IS - 2184-3236
AU - Kushwaha, P.
AU - Mahalanobis, A.
PY - 2017
SP - 401
EP - 406
DO - 10.5220/0006396304010406
PB - SciTePress