Littérature scientifique sur le sujet « Baby-step giant-step »

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Baby-step giant-step ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Baby-step giant-step"

1

Malek, Kaqish. "Improvements to Shank`s Baby-step Giant-step Algorithm." Journal of Applied Sciences 6, no. 1 (2005): 76–79. http://dx.doi.org/10.3923/jas.2006.76.79.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Bach, Eric, and Bryce Sandlund. "Baby-step giant-step algorithms for the symmetric group." Journal of Symbolic Computation 85 (March 2018): 55–71. http://dx.doi.org/10.1016/j.jsc.2017.07.003.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Terr, David C. "A modification of Shanks' baby-step giant-step algorithm." Mathematics of Computation 69, no. 230 (1999): 767–74. http://dx.doi.org/10.1090/s0025-5718-99-01141-2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Lee, Sang-Un. "Modified Baby-Step Giant-Step Algorithm for Discrete Logarithm." Journal of the Korea Society of Computer and Information 18, no. 8 (2013): 87–93. http://dx.doi.org/10.9708/jksci.2013.18.8.087.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Basu, S., M. F. Roy, M. Safey El Din, and É. Schost. "A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets." Foundations of Computational Mathematics 14, no. 6 (2014): 1117–72. http://dx.doi.org/10.1007/s10208-014-9212-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

D. Galbraith, Steven, Ping Wang, and Fangguo Zhang. "Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm." Advances in Mathematics of Communications 11, no. 3 (2017): 453–69. http://dx.doi.org/10.3934/amc.2017038.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Stinson, D. R. "Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem." Mathematics of Computation 71, no. 237 (2001): 379–92. http://dx.doi.org/10.1090/s0025-5718-01-01310-2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Yokoyama, Kazuhiro, Masaya Yasuda, Yasushi Takahashi, and Jun Kogure. "Complexity bounds on Semaev’s naive index calculus method for ECDLP." Journal of Mathematical Cryptology 14, no. 1 (2020): 460–85. http://dx.doi.org/10.1515/jmc-2019-0029.

Texte intégral
Résumé :
AbstractSince Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as Pollard’s rho method and the baby-step and giant-step method (BSGS). In this paper, we provide a deep analysis of Gröbner basis computation for solving polynomial systems appearing in the point decomposition problem (PDP) in Semaev’s naive index calculus method. Our analysis relies on linear algebra under simple statistical assumptions on s
Styles APA, Harvard, Vancouver, ISO, etc.
9

Abro, Adeel, Zhongliang Deng, and Kamran Ali Memon. "A Lightweight Elliptic-Elgamal-Based Authentication Scheme for Secure Device-to-Device Communication." Future Internet 11, no. 5 (2019): 108. http://dx.doi.org/10.3390/fi11050108.

Texte intégral
Résumé :
Device-to-Device (D2D) is a major part of 5G that will facilitate deployments with extended coverage where devices can act as users or relays. These relays normally act as decode and forward relays (semi-intelligent devices) with limited computational and storage capabilities. However, introducing such a technology, where users can act as relays, presents a wide range of security threats, in particular, rogue relay devices or man in the middle attacks (M-I-T-M). Second, passing fewer control messages is always advisable when considering authenticity and secrecy. To mitigate M-I-T-M and to redu
Styles APA, Harvard, Vancouver, ISO, etc.
10

Rumyantseva, G. N., V. N. Kartashev, Marina V. Dolinina, I. B. Osipov, A. I. Osipov, and L. A. Alekseeva. "A rare case of bilateral obstructive megaureter with a giant uretal ureterocele on the left." Russian Journal of Pediatric Surgery 24, no. 3 (2020): 205–9. http://dx.doi.org/10.18821/1560-9510-2020-24-3-205-209.

Texte intégral
Résumé :
The article discusses a case of 4-year-old patient with a bilateral obstructive megaureter of a non-functioning left kidney and with the opening of this kidney ureter into the urethra with extravasal location of a giant ureterocele. The malformation of the urinary system was accompanied by a comorbid disease of bronchopulmonary system in the form of tuberculosis of the lungs and intra-thoracic lymph nodes. At the age of one month, due to decompensation of the only functioning right kidney, urine was withdrawn by applying a ureterostomy. Later, a proximal lateral cutaneous ureterostomy was put
Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet "Baby-step giant-step"

1

Kouchaki, Barzi Behnaz. "Points of High Order on Elliptic Curves : ECDSA." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-58449.

Texte intégral
Résumé :
This master thesis is about Elliptic Curve Digital Signature Algorithm or ECDSA and two of the known attacks on this security system. The purpose of this thesis is to find points that are likely to be points of high order on an elliptic curve. If we have a point P of high order and if Q = mP, then we have a large set of possible values of m. Therefore it is hard to solve the Elliptic Curve Discrete Logarithm Problem or ECDLP. We have investigated on the time of finding the solution of ECDLP for a certain amount of elliptic curves based on the order of the point which is used to create the digi
Styles APA, Harvard, Vancouver, ISO, etc.
2

Hitchcock, Yvonne Roslyn. "Elliptic Curve Cryptography for Lightweight Applications." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15838/.

Texte intégral
Résumé :
Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security
Styles APA, Harvard, Vancouver, ISO, etc.
3

Yoshida, Kayo. "Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem." Thesis, 2009. http://hdl.handle.net/10012/4219.

Texte intégral
Résumé :
The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model.
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Baby-step giant-step"

1

Blackburn, Simon R., and Edlyn Teske. "Baby-Step Giant-Step Algorithms for Non-uniform Distributions." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10722028_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Asghar, Hassan Jameel, Josef Pieprzyk, and Huaxiong Wang. "A New Human Identification Protocol and Coppersmith’s Baby-Step Giant-Step Algorithm." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13708-2_21.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Coron, Jean Sébastien, David Lefranc, and Guillaume Poupard. "A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis." In Cryptographic Hardware and Embedded Systems – CHES 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11545262_4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Matsuo, Kazuto, Jinhui Chao, and Shigeo Tsujii. "An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45455-1_36.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Baby-step giant-step"

1

Kushwaha, Prabhat, and Ayan Mahalanobis. "A Probabilistic Baby-step Giant-step Algorithm." In 14th International Conference on Security and Cryptography. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006396304010406.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Bach, Eric, and Bryce Sandlund. "Baby-Step Giant-Step Algorithms for the Symmetric Group." In ISSAC '16: International Symposium on Symbolic and Algebraic Computation. ACM, 2016. http://dx.doi.org/10.1145/2930889.2930930.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Wang, Yong, Taoli Yang, and Jiang Qian. "A baby step for China but a giant leap for humans: Three basic issues with Chinese initiative of moon-based earth observation SAR system." In IGARSS 2016 - 2016 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2016. http://dx.doi.org/10.1109/igarss.2016.7730639.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!