70 lines
3.7 KiB
BibTeX
70 lines
3.7 KiB
BibTeX
|
|
@incollection{chacon_102_nodate,
|
|
title = {10.2 {Git} {Internals} - {Git} {Objects}},
|
|
url = {https://git-scm.com/book/en/v2/Git-Internals-Git-Objects},
|
|
urldate = {2026-01-03},
|
|
booktitle = {Pro {Git}},
|
|
author = {Chacon, Scott and Straub, Ben},
|
|
}
|
|
|
|
@misc{vuk_git-intro_nodate,
|
|
title = {git-intro},
|
|
url = {https://git.fri.uni-lj.si/martin.vuk/git-intro},
|
|
abstract = {Short introduction to Git},
|
|
language = {en-US},
|
|
journal = {git-intro},
|
|
author = {Vuk, Martin},
|
|
file = {Snapshot:/home/martinv/Zotero/storage/3V3R4YCH/git-intro.html:text/html},
|
|
}
|
|
|
|
@misc{noauthor_git_nodate,
|
|
title = {Git - hash-function-transition {Documentation}},
|
|
url = {https://git-scm.com/docs/hash-function-transition},
|
|
urldate = {2026-01-09},
|
|
file = {Git - hash-function-transition Documentation:C\:\\Users\\marti\\Zotero\\storage\\A9YDF4KZ\\hash-function-transition.html:text/html},
|
|
}
|
|
|
|
@article{brink_probably_2012,
|
|
title = {A (probably) exact solution to the {Birthday} {Problem}},
|
|
volume = {28},
|
|
issn = {1572-9303},
|
|
url = {https://doi.org/10.1007/s11139-011-9343-9},
|
|
doi = {10.1007/s11139-011-9343-9},
|
|
abstract = {Given a year with n≥1 days, the Birthday Problem asks for the minimal number such that in a class of students, the probability of finding two students with the same birthday is at least 50 percent. We derive heuristically an exact formula for and argue that the probability that a counter-example to this formula exists is less than one in 45 billion. We then give a new derivation of the asymptotic expansion of Ramanujan’s Q-function and note its curious resemblance to the formula for .},
|
|
number = {2},
|
|
journal = {The Ramanujan Journal},
|
|
author = {Brink, David},
|
|
month = jun,
|
|
year = {2012},
|
|
pages = {223--238},
|
|
}
|
|
|
|
@inproceedings{stevens_first_2017,
|
|
address = {Cham},
|
|
title = {The {First} {Collision} for {Full} {SHA}-1},
|
|
isbn = {978-3-319-63688-7},
|
|
abstract = {SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoretical attacks.},
|
|
booktitle = {Advances in {Cryptology} – {CRYPTO} 2017},
|
|
publisher = {Springer International Publishing},
|
|
author = {Stevens, Marc and Bursztein, Elie and Karpman, Pierre and Albertini, Ange and Markov, Yarik},
|
|
editor = {Katz, Jonathan and Shacham, Hovav},
|
|
year = {2017},
|
|
pages = {570--596},
|
|
}
|
|
|
|
@inproceedings{merkle_digital_1988,
|
|
address = {Berlin, Heidelberg},
|
|
title = {A {Digital} {Signature} {Based} on a {Conventional} {Encryption} {Function}},
|
|
isbn = {978-3-540-48184-3},
|
|
doi = {10.1007/3-540-48184-2_32},
|
|
abstract = {A new digital signature based only on a conventional encryption function (such as DES) is described which is as secure as the underlying encryption function -- the security does not depend on the difficulty of factoring and the high computational costs of modular arithmetic are avoided. The signature system can sign an unlimited number of messages, and the signature size increases logarithmically as a function of the number of messages signed. Signature size in a ‘typical’ system might range from a few hundred bytes to a few kilobytes, and generation of a signature might require a few hundred to a few thousand computations of the underlying conventional encryption function.},
|
|
language = {en},
|
|
booktitle = {Advances in {Cryptology} — {CRYPTO} ’87},
|
|
publisher = {Springer},
|
|
author = {Merkle, Ralph C.},
|
|
editor = {Pomerance, Carl},
|
|
year = {1988},
|
|
keywords = {Count Field, Encryption Function, Infinite Tree, Modular Arithmetic, Signature Size},
|
|
pages = {369--378},
|
|
file = {Full Text PDF:C\:\\Users\\marti\\Zotero\\storage\\9CPCST7H\\Merkle - 1988 - A Digital Signature Based on a Conventional Encryption Function.pdf:application/pdf},
|
|
}
|