-
Notifications
You must be signed in to change notification settings - Fork 0
/
Reference.bib
232 lines (204 loc) · 6.94 KB
/
Reference.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
@ARTICLE{ref:Pholig1978,
author={Pohlig, S.C. and Hellman, M.E.},
journal={Information Theory, IEEE Transactions on},
title={An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)},
year={1978},
volume={24},
number={1},
pages={106-110},
keywords={Cryptography;Galois fields;Logarithms;Acoustics;Convolution;Convolutional codes;Cryptography;Decoding;Error correction codes;Notice of Violation;Reed-Solomon codes;Speech;Systems engineering and theory},
doi={10.1109/TIT.1978.1055817},
ISSN={0018-9448},}
@ARTICLE{ref:Elgamal1985A,
author={Elgamal, T.},
journal={Information Theory, IEEE Transactions on},
title={A subexponential-time algorithm for computing discrete logarithms over },
year={1985},
volume={31},
number={4},
pages={473-481},
keywords={Cryptography;Galois fields;Logarithmic arithmetic;Helium;Information systems;Milling machines;National security;Polynomials;Public key cryptography},
doi={10.1109/TIT.1985.1057075},
ISSN={0018-9448},}
@ARTICLE{ref:Elgamal1985,
author={Elgamal, T.},
journal={Information Theory, IEEE Transactions on},
title={A public key cryptosystem and a signature scheme based on discrete logarithms},
year={1985},
volume={31},
number={4},
pages={469-472},
keywords={Cryptography;Logarithmic arithmetic;Digital signatures;Galois fields;Helium;Information security;Information systems;Milling machines;Public key;Public key cryptography},
doi={10.1109/TIT.1985.1057074},
ISSN={0018-9448},}
@inproceedings{ref:Haber:2001:SCP:501983.502013,
author = {Haber, Stuart and Pinkas, Benny},
title = {Securely Combining Public-key Cryptosystems},
booktitle = {Proceedings of the 8th ACM Conference on Computer and Communications Security},
series = {CCS '01},
year = {2001},
isbn = {1-58113-385-5},
location = {Philadelphia, PA, USA},
pages = {215--224},
numpages = {10},
url = {http://doi.acm.org/10.1145/501983.502013},
doi = {10.1145/501983.502013},
acmid = {502013},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{IEEEexample:article_typical,
author = "S. Zhang and C. Zhu and J. K. O. Sin and P. K. T. Mok",
title = "A Novel Ultrathin Elevated Channel Low-temperature
Poly-{Si} {TFT}",
journal = IEEE_J_EDL,
volume = "20",
month = nov,
year = "1999",
pages = "569-571"
}
@ARTICLE{ref:Diffie1976,
author={Diffie, W. and Hellman, M.E.},
journal={Information Theory, IEEE Transactions on},
title={New directions in cryptography},
year={1976},
volume={22},
number={6},
pages={644-654},
keywords={Cryptography;Application software;Communication system security;Computer aided instruction;Computer networks;Costs;Hardware;Information theory;Postal services;Public key cryptography;Telecommunication computing},
doi={10.1109/TIT.1976.1055638},
ISSN={0018-9448},}
@article{ref:Odlyzko1990,
author = "A. M. Odlyzko",
title = "The rise and fall of knapsack cryptosystem",
journal = "Cryptology and Computational Number Theory",
volume = "42",
year = "1990",
pages = "75-88"
}
@book{ref:Bach1996,
author = "E. Bach and J. Shallit",
title = "Algorithmic Number Theory",
volume = "1: Efficient Algorithms",
publisher = "MIT Press",
address = "Cambridge, Massachusetts",
year = "1996",
}
@book{ref:menezes2010handbook,
title={Handbook of applied cryptography},
author={Menezes, Alfred J and Van Oorschot, Paul C and Vanstone, Scott A},
year={2010},
publisher={CRC press}
}
@incollection{ref:Boer1990,
year={1990},
isbn={978-0-387-97196-4},
booktitle={Advances in Cryptology — CRYPTO’ 88},
volume={403},
series={Lecture Notes in Computer Science},
editor={Goldwasser, Shafi},
doi={10.1007/0-387-34799-2_38},
title={Diffie-Hellman is as Strong as Discrete Log for Certain Primes},
url={http://dx.doi.org/10.1007/0-387-34799-2_38},
publisher={Springer New York},
author={Boer, Bert},
pages={530-539},
language={English}
}
@incollection{ref:Maurer1994,
year={1994},
isbn={978-3-540-58333-2},
booktitle={Advances in Cryptology — CRYPTO ’94},
volume={839},
series={Lecture Notes in Computer Science},
editor={Desmedt, YvoG.},
doi={10.1007/3-540-48658-5_26},
title={Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms},
url={http://dx.doi.org/10.1007/3-540-48658-5_26},
publisher={Springer Berlin Heidelberg},
author={Maurer, UeliM.},
pages={271-281},
language={English}
}
@article{ref:Matsumoto1986,
author = "T. MATSUMOTO and Y. TAKASHIMA and H. IMAI",
title = "On seeking smart public key distribution systems",
journal = "The Transactions of the IECE of Japan",
volume = "E69",
number = "2",
month = feb,
year = "1986",
pages = "99-106"
}
@book{Knuth:1997:ACP:270146,
author = {Knuth, Donald E.},
title = {The Art of Computer Programming, Volume 2 (3rd Ed.): Seminumerical Algorithms},
year = {1997},
isbn = {0-201-89684-2},
publisher = {Addison-Wesley Longman Publishing Co., Inc.},
address = {Boston, MA, USA},
}
@electronic{sarlabous2000introduction,
title={Introduction to cryptography},
author={Sarlabous, Jorge Estrada},
url={http://cel.archives-ouvertes.fr/cel-00374740},
year={2000}
}
@article{pomerance2008tale,
title={A tale of two sieves},
author={Pomerance, Carl},
journal={Biscuits of Number Theory},
volume={85},
year={2008}
}
@article{boneh1999twenty,
title={Twenty years of attacks on the RSA cryptosystem},
author={Boneh, Dan and Rivest, Ron and Shamir, Adi and Adleman, Len and others},
journal={Notices of the AMS},
volume={46},
number={2},
pages={203--213},
year={1999}
}
@article{Shor:1994jg,
author = "Shor, Peter W.",
title = "{Polynomial time algorithms for prime factorization and
discrete logarithms on a quantum computer}",
journal = "SIAM J.Sci.Statist.Comput.",
volume = "26",
pages = "1484",
doi = "10.1137/S0097539795293172",
year = "1997",
eprint = "quant-ph/9508027",
archivePrefix = "arXiv",
primaryClass = "quant-ph",
SLACcitation = "%%CITATION = QUANT-PH/9508027;%%",
}
@article{wong2005timing,
title={Timing attacks on RSA: revealing your secrets through the fourth dimension},
author={Wong, Wing H},
journal={Crossroads},
volume={11},
number={3},
pages={5--5},
year={2005},
publisher={ACM}
}
@book{stamp2011information,
title={Information security: principles and practice},
author={Stamp, Mark},
year={2011},
publisher={John Wiley \& Sons}
}
@electronic{Evgeny2009The,
title={The RSA Algorithm},
url={http://www.math.washington.edu/~morrow/336_09/papers/Yevgeny.pdf},
author={Evgeny, Milanov},
year={2009}
}
@electronic{Dan2007The,
title={The RSA Algorithm},
author={Dan, Wright},
url={http://imps.mcmaster.ca/courses/SE-4C03-07/wiki/wrighd/rsa_alg.html},
year={2007}
}