Relevant bibliographies by topics / Schnorr

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Schnorr'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Schnorr.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Schnorr"

1

Franklin, Johanna N. Y. "Hyperimmune-free degrees and Schnorr triviality." Journal of Symbolic Logic 73, no. 3 (September 2008): 999–1008. http://dx.doi.org/10.2178/jsl/1230396761.

Full text
Abstract:
AbstractWe investigate the relationship between lowness for Schnorr randomness and Schnorr triviality. We show that a real is low for Schnorr randomness if and only if it is Schnorr trivial and hyperimmune free.
APA, Harvard, Vancouver, ISO, and other styles
2

Downey, Rodney G., and Evan J. Griffiths. "Schnorr randomness." Journal of Symbolic Logic 69, no. 2 (June 2004): 533–54. http://dx.doi.org/10.2178/jsl/1082418542.

Full text
Abstract:
Abstract.Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-Löf randomness. After its initial development in the 1970s the notion received considerably less attention than Martin-Löf randomness, but recently interest has increased in a range of randomness concepts. In this article, we explore the properties of Schnorr random reals, and in particular the c.e. Schnorr random reals. We show that there are c.e. reals that are Schnorr random but not Martin-Löf random, and provide a new characterization of Schnorr random real numbers in terms of prefix-free machines. We prove that unlike Martin-Löf random c.e. reals, not all Schnorr random c.e. reals are Turing complete, though all are in high Turing degrees. We use the machine characterization to define a notion of “Schnorr reducibility” which allows us to calibrate the Schnorr complexity of reals. We define the class of “Schnorr trivial” reals, which are ones whose initial segment complexity is identical with the computable reals, and demonstrate that this class has non-computable members.
APA, Harvard, Vancouver, ISO, and other styles
3

Franklin, Johanna N. Y. "Schnorr triviality and genericity." Journal of Symbolic Logic 75, no. 1 (March 2010): 191–207. http://dx.doi.org/10.2178/jsl/1264433915.

Full text
Abstract:
AbstractWe study the connection between Schnorr triviality and genericity. We show that while no 2-generic is Turing equivalent to a Schnorr trivial and no 1-generic is tt-equivalent to a Schnorr trivial, there is a 1-generic that is Turing equivalent to a Schnorr trivial. However, every such 1-generic must be high. As a corollary, we prove that not all K-trivials are Schnorr trivial. We also use these techniques to extend a previous result and show that the bases of cones of Schnorr trivial Turing degrees are precisely those whose jumps are at least 0″.
APA, Harvard, Vancouver, ISO, and other styles
4

DOWNEY, RODNEY, WOLFGANG MERKLE, and JAN REIMANN. "Schnorr dimension." Mathematical Structures in Computer Science 16, no. 05 (October 2006): 789. http://dx.doi.org/10.1017/s0960129506005469.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Franklin, Johanna N. Y., and Frank Stephan. "Schnorr trivial sets and truth-table reducibility." Journal of Symbolic Logic 75, no. 2 (June 2010): 501–21. http://dx.doi.org/10.2178/jsl/1268917492.

Full text
Abstract:
AbstractWe give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey. Griffiths and LaForte.
APA, Harvard, Vancouver, ISO, and other styles
6

Isnaini, Herdita Fajar, and Karyati Karyati. "Penerapan skema tanda tangan Schnorr pada pembuatan tanda tangan digital." PYTHAGORAS: Jurnal Pendidikan Matematika 12, no. 1 (June 4, 2017): 57. http://dx.doi.org/10.21831/pg.v12i1.11631.

Full text
Abstract:
Tanda tangan digital dapat dijadikan sebagai salah satu cara untuk menjamin keaslian pesan atau informasi yang diterima. Salah satu skema yang dapat digunakan dalam membentuk tanda tangan adalah skema tanda tangan Schnorr. Skema tanda tangan ini berdasarkan pada masalah logaritma diskret. Skema ini memerlukan penggunaan fungsi hash yang akan menghasilkan nilai hash pesan untuk pembuatan tanda tangan, yang menjadi salah satu alasan keamanan dari skema ini. Skema tanda tangan Schnorr terdiri dari tiga proses, yaitu: pembentukan kunci, pembuatan tanda tangan serta verifikasi. Kajian ini akan membahas mengenai skema tanda tangan Schnorr dalam membentuk tanda tangan digital sebagai pengaman keaslian informasi, yang dibahas per prosesnya, meliputi: pembentukan kunci, pembuatan tanda tangan yang disertai perhitungan nilai hash serta verifikasi. Hasil dari kajian ini adalah didapatkan algoritma – algoritma dari skema tanda tangan Schnorr, yaitu algoritma pembentukan kunci publik dan kunci privat, algoritma pembuatan tanda tangan, serta algoritma verifikasi tanda tangan.Kata Kunci: tanda tangan digital, skema tanda tangan Schnorr, nilai hash, kunci publik, kunci privat. Implementation of Schnorr Signature Scheme in The Form of Digital Signature AbstractDigital signature can be used as a way to ensure the authenticity of a received message or information. There is a scheme that can be used to form a signature called Schnorr signature scheme. This signature scheme is based on discrete logarithm problem. This scheme requires the use of hash function that will result to a message digest to form the signature, which is the reason of this scheme’s security. Schnorr signature scheme consists of three processes, namely: the key generation, signature formation, and verification. This study will discuss the Schnorr signature scheme in the form of digital signatures as a safeguard of an information’s authenticity, which is discussed process by process, including: the key generation, signature formation as well as the calculation of message digest and verification. The results of this study obtained algorithms - algorithms of Schnorr signature scheme, which is an algorithm of a public key and a private key generation, an algorithm of the signature formation, and an algorithm of signature verification.Keywords: digital signature, Schnorr signature scheme, message digest, public key, privat key
APA, Harvard, Vancouver, ISO, and other styles
7

Chin, Ji-Jian, Syh-Yuan Tan, Swee-Huay Heng, and Raphael Chung-Wei Phan. "Twin-Schnorr: A Security Upgrade for the Schnorr Identity-Based Identification Scheme." Scientific World Journal 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/237514.

Full text
Abstract:
Most identity-based identification (IBI) schemes proposed in recent literature are built using pairing operations. This decreases efficiency due to the high operation costs of pairings. Furthermore, most of these IBI schemes are proven to be secure against impersonation under active and concurrent attacks using interactive assumptions such as the one-more RSA inversion assumption or the one-more discrete logarithm assumption, translating to weaker security guarantees due to the interactive nature of these assumptions. The Schnorr-IBI scheme was first proposed through the Kurosawa-Heng transformation from the Schnorr signature. It remains one of the fastest yet most secure IBI schemes under impersonation against passive attacks due to its pairing-free design. However, when required to be secure against impersonators under active and concurrent attacks, it deteriorates greatly in terms of efficiency due to the protocol having to be repeated multiple times. In this paper, we upgrade the Schnorr-IBI scheme to be secure against impersonation under active and concurrent attacks using only the classical discrete logarithm assumption. This translates to a higher degree of security guarantee with only some minor increments in operational costs. Furthermore, because the scheme operates without pairings, it still retains its efficiency and superiority when compared to other pairing-based IBI schemes.
APA, Harvard, Vancouver, ISO, and other styles
8

Saputra, Robi Adi, and Agus Sidiq Purnomo. "Implementasi Algoritma Schnorr Untuk Tanda Tangan Digital." JMAI (Jurnal Multimedia & Artificial Intelligence) 2, no. 1 (February 19, 2018): 21–26. http://dx.doi.org/10.26486/jmai.v2i1.69.

Full text
Abstract:
Tanda tangan merupakan alat yang digunakan untuk melegalkan atau sebagai penanda bahwa suatu dokumen adalah asli dari pihak pertama (pembuat) atau bukan. Hal tersebut berlaku pada dokumen nyata dalam hal ini dokumen cetak atau tertulis. Selanjutnya bagaimana jika dokumen ataupun file tersebut bersifat digital. Pada saat ini media digital bukan hal awam lagi, hampir semua aktivitas bisnis maupun sehari-hari sudah menggunakan internet. Maka dari itu perlu adanya pengganti tanda tangan yang dibuat dalam bentuk digital untuk melegalkan dokumen digital. Dalam penelitian ini digunakan algoritma schnorr. Algoritma schnorr merupakan pengembangan dari algoritma El-gamal sehingga sistem keamanan dari El-gamal terdapat pada schnorr. Pembuatan tanda tangan dengan mengubah informasi yang terdapat pada file ke dalam bentuk ASCII kemudian diubah kebentuk message digest menggunakan fungsi hash. Dengan menggunakan algoritma schnorr sign dan private key dihasilkan tanda tangan dari file tersebut. Proses verifikasi tanda tangan menggunakan public key dan file signature menggunakan algoritma schnorr verify. Jika nilai verifikasi sama dengan proses sign maka data dapat dikatakan asli. Sebaliknya jika hasil dari proses verifikasi tidak sama dengan proses sign maka data tersebut sudah mengalami perubahan informasi atau kunci yang dimasukkan tidak sesuai. Tanda tangan digital yang dihasilkan dari setiap file berbeda-beda walaupun dengan kunci yang sama. Besar kecilnya bilangan dalam pembentukan kunci juga mempengaruhi hasil dari tanda tangan digital. Penambahan fungsi hash sangat membantu untuk menambah keamanan pada tanda tangan digital.
APA, Harvard, Vancouver, ISO, and other styles
9

Miyabe, Kenshi. "Reducibilities Relating to Schnorr Randomness." Theory of Computing Systems 58, no. 3 (October 2, 2014): 441–62. http://dx.doi.org/10.1007/s00224-014-9583-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Franklin, Johanna N. Y. "Schnorr Trivial Reals: A construction." Electronic Notes in Theoretical Computer Science 167 (January 2007): 79–93. http://dx.doi.org/10.1016/j.entcs.2006.08.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Schnorr"

1

Teichmann, Michael. "Julius Schnorr von Carolsfeld (1794-1882) und seine Ölgemälde : Monographie und Werkverzeichnis /." Frankfurt am Main : P. Lang, 2001. http://catalogue.bnf.fr/ark:/12148/cb38988913f.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

D'Alterio, Candida. "Schemi di identificazione e protocollo a conoscenza zero di Schnorr." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/15898/.

Full text
Abstract:
Questa tesi è incentrata sul protocollo di Schnorr, schema di identificazione basato sull'assunzione della difficoltà del logaritmo discreto e implementabile su smart-card (richiede, quindi, poca memoria). Si analizzano le sue proprietà e se ne dimostra il livello di sicurezza: è completo, corretto e a conoscenza zero perfetta. Infine si descrivono i diversi livelli di conoscenza zero: perfetta, computazionale, statistica.
APA, Harvard, Vancouver, ISO, and other styles
3

Schnorr, Andrea Verfasser], Torsten [Akademischer Betreuer] [Kuhlen, and Christoph [Akademischer Betreuer] Garth. "Feature tracking for space-filling structures / Andrea Schnorr ; Torsten Kuhlen, Christoph Garth." Aachen : Universitätsbibliothek der RWTH Aachen, 2021. http://d-nb.info/1230661697/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schnorr-Bäcker, Susanne [Verfasser]. "Ein Simulationsansatz zur Beurteilung der Güterversorgung der Bevölkerung unter räumlichem Aspekt / Susanne Schnorr-Bäcker." Gießen : Universitätsbibliothek, 2017. http://d-nb.info/112640201X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schnorr, Sabine [Verfasser], and Andreas [Akademischer Betreuer] Ludwig. "Die Rolle von HCN2 bei neuropathisch und entzündlich bedingtem Schmerz / Sabine Schnorr. Betreuer: Andreas Ludwig." Erlangen : Universitätsbibliothek der Universität Erlangen-Nürnberg, 2013. http://d-nb.info/1029869367/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Schnorr, Vanessa [Verfasser]. ""Wer kann ich werden - Wer soll ich sein?" : Selbstbildungsprozesse junger Menschen in der Jugendhilfe / Vanessa Schnorr." Koblenz : Universitätsbibliothek Koblenz, 2011. http://d-nb.info/101022428X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schnorr, Stephan [Verfasser], Friedrich [Akademischer Betreuer] Thießen, and Uwe [Gutachter] Götze. "Der Einfluss von Maßnahmen auf den Ausgang einer Sanierung / Stephan Schnorr ; Gutachter: Uwe Götze ; Betreuer: Friedrich Thießen." Chemnitz : Universitätsbibliothek Chemnitz, 2013. http://d-nb.info/1214246249/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schnorr, Kirsten [Verfasser], and Robert [Akademischer Betreuer] Moshammer. "XUV Pump-Probe Experiments on Electron Rearrangement and Interatomic Coulombic Decay in Diatomic Molecules / Kirsten Schnorr ; Betreuer: Robert Moshammer." Heidelberg : Universitätsbibliothek Heidelberg, 2014. http://d-nb.info/1177811189/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schnorr, Julia [Verfasser]. "Charakterisierung parenteraler Eisenkomplexe: Untersuchungen zu Physikochemie, In-vitro-Verhalten und Austauschbarkeit von Eisen „non-biological complex drugs“ / Julia Schnorr." Mainz : Universitätsbibliothek Mainz, 2018. http://d-nb.info/1160689938/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tade, Foluwaso Olunkunle. "Receiver architectures for MIMO wireless communication systems based on V-BLAST and sphere decoding algorithms." Thesis, University of Hertfordshire, 2011. http://hdl.handle.net/2299/6400.

Full text
Abstract:
Modern day technology aspires to always progress. This progression leads to a lot of research in any significant area of improvement. There is a growing amount of end-users in the wireless spectrum which has led to a need for improved bandwidth usage and BER values. In other words, new technologies which would increase the capacity of wireless systems are proving to be a crucial point of research in these modern times. Different combinations of multiuser receivers are evaluated to determine performance under normal working conditions by comparing their BER performance charts. Multiple input, multiple output (MIMO) systems are incorporated into the system to utilise the increased capacity rates achievable using the MIMO configuration. The effect of MIMO on the technologies associated with modern day technological standards such as CDMA and OFDM have been investigated due to the significant capacity potentials these technologies normally exhibit in a single antenna scenario. An in-depth comparison is established before comparison is made with a conventional maximum likelihood (ML) detector. The complexity of the ML detector makes its realization evaluated in such a manner to achieve the same or near ML solution but with lower computational complexity. This was achieved using a proposed modification of the Schnorr-Euchner Sphere decoding algorithm (SE-SDA). The proposed sphere decoder (P-SD) adopts a modification of the radius utilised in the SE-SDA to obtain a near ML solution at a much lower complexity compared to the conventional ML decoder. The P-SD was configured to work in different MIMO antenna configurations. The need for the highest possible data rates from the available limited spectrum led to my research into the multi-user detection scenario and MIMO.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Schnorr"

1

Carolsfeld, Julius Schnorr von. Julius Schnorr von Carolsfeld: Zeichnungen. München: Prestel, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Carolsfeld, Julius Schnorr von. Julius Schnorr von Carolsfeld, 1794-1872. Edited by Guratzsch Herwig, Museum der Bildenden Künste (Leipzig, Germany), and Kunsthalle Bremen. Leipzig: Edition Leipzig, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Julius Schnorr von Carolsfeld: Druckgraphik und Zeichnungen. Dresden: Sächsische Landesbibliothek - Staats- und Universitätsbibliothek, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schnorr von Carolsfeld, Julius, 1794-1872., Valter Claudia, Haus der Kunst München, and Staatliche Kunstsammlungen Dresden Kupferstich-Kabinett, eds. "--ein Land der Verheissung": Julius Schnorr von Carolsfeld zeichnet Italien. Köln: Wienand, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

PONS Praxiswörterbuch: Englisch-deutsch, deutsch-englisch / [bearb. von: Veronika Schnorr ...]. Barcelona: Klett Sprachen, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nagy, Sigrid. Julius Schnorr von Carolsfelds "Bibel in Bildern" und ihre Popularisierung. Würzburg: Bayerische Blätter für Volkskunde, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Weisses Gold im Erzgebirge?: Veit Hans Schnorr von Carolsfeld, 1644-1715. [Niederfrohna]: Mironde-Verlag, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schnorr von Carolsfeld, Julius, 1794-1872., ed. Julius Schnorr von Carolsfeld (1794-1872) und seine Ölgemälde: Monographie und Werkverzeichnis. Frankfurt am Main: P. Lang, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Carolsfeld, Julius Schnorr von. Julius Schnorr von Carolsfeld: Aus dem Leben Karls des Grossen : Kartons für die Wandbilder der Münchner Residenz. Köln: Wienand, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

1939-, Kuhn Rudolf, ed. Kompositionsfragen: Beispiele aus fünf Jahrhunderten : Cranach, Dürer, Rubens, Ignaz Günther und Bernini, Schnorr von Carolsfeld, Manet, Marées, Liebermann, Picasso und Raffael. Frankfurt: P. Lang, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Schnorr"

1

Downey, Rodney, Wolfgang Merkle, and Jan Reimann. "Schnorr Dimension." In New Computational Paradigms, 96–105. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11494645_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Just, Mike. "Schnorr Identification Protocol." In Encyclopedia of Cryptography and Security, 1083. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_95.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Just, Mike, and Carlisle Adams. "Schnorr Identification Protocol." In Encyclopedia of Cryptography, Security and Privacy, 1–2. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-642-27739-9_95-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Boneh, Dan. "Schnorr Digital Signature Scheme." In Encyclopedia of Cryptography and Security, 1082–83. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beunardeau, Marc, Aisling Connolly, Houda Ferradi, Rémi Géraud, David Naccache, and Damien Vergnaud. "Reusing Nonces in Schnorr Signatures." In Computer Security – ESORICS 2017, 224–41. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66402-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Camenisch, Jan, Aggelos Kiayias, and Moti Yung. "On the Portability of Generalized Schnorr Proofs." In Advances in Cryptology - EUROCRYPT 2009, 425–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01001-9_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fleischhacker, Nils, Tibor Jager, and Dominique Schröder. "On Tight Security Proofs for Schnorr Signatures." In Lecture Notes in Computer Science, 512–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45611-8_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hühnlein, Detlef. "Faster Generation of NICE-Schnorr-Type Signatures." In Topics in Cryptology — CT-RSA 2001, 1–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45353-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Backes, Werner, and Susanne Wetzel. "Improving the Parallel Schnorr-Euchner LLL Algorithm." In Algorithms and Architectures for Parallel Processing, 27–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24650-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hühnlein, Detlef, and Johannes Merkle. "An Efficient NICE-Schnorr-Type Signature Scheme." In Public Key Cryptography, 14–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-46588-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Schnorr"

1

He, Zhonghua, and Lina Ge. "ID-Based Signature Under the Schnorr Signature." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.1118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lv, Xin, Feng Xu, Ping Ping, Xuan Liu, and Huaizhi Su. "Schnorr Ring Signature Scheme with Designated Verifiability." In 2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES). IEEE, 2015. http://dx.doi.org/10.1109/dcabes.2015.48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhao, Wei, Yong Peng, Feng Xie, and Dongqing Chen. "Nominative signature scheme based on Schnorr signature." In 2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE). IEEE, 2012. http://dx.doi.org/10.1109/csae.2012.6272694.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liang, Han-Wen, Wei-Ho Chung, Hongke Zhang, and Sy-Yen Kuo. "A parallel processing algorithm for Schnorr-Euchner sphere decoder." In 2012 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2012. http://dx.doi.org/10.1109/wcnc.2012.6214442.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fouque, Pierre-Alain, Delphine Masg, and Frédéric Valette. "Fault Attack on Schnorr Based Identification and Signature Schemes." In 2009 Workshop on Fault Diagnosis and Tolerance in Cryptography, FDTC. IEEE, 2009. http://dx.doi.org/10.1109/fdtc.2009.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nick, Jonas, Tim Ruffing, Yannick Seurin, and Pieter Wuille. "MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces." In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3372297.3417236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ma, Tianchen. "White-box Schnorr Signature for Internet of Things Security." In 2020 5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE). IEEE, 2020. http://dx.doi.org/10.1109/icmcce51767.2020.00425.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nguyen, Xuan-Nghia, Minh-Tuan Le, Ngoc-Nam Pham, and Vu-Duc Ngo. "A pipelined Schnorr-Euchner sphere decoder architecture for MIMO systems." In 2015 International Conference on Advanced Technologies for Communications (ATC). IEEE, 2015. http://dx.doi.org/10.1109/atc.2015.7388353.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ahn, Junil, Heung-No Lee, and Kiseon Kim. "Schnorr-Euchner sphere decoder with statistical pruning for MIMO systems." In 2009 6th International Symposium on Wireless Communication Systems (ISWCS 2009). IEEE, 2009. http://dx.doi.org/10.1109/iswcs.2009.5285307.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Samuel, Michael, and Michael Fitz. "Efficient iterative sphere detectors based on the Schnorr-Euchner enumeration." In 2009 IEEE Information Theory Workshop on Networking and Information Theory (ITW). IEEE, 2009. http://dx.doi.org/10.1109/itwnit.2009.5158548.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Schnorr"

1

Hao, F., ed. Schnorr Non-interactive Zero-Knowledge Proof. RFC Editor, September 2017. http://dx.doi.org/10.17487/rfc8235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Murray, M. E., K. S. Brown, and R. D. Foley. Results of the independent radiological verification survey at the former C.H. Schnoor and Company Site, 644 Garfield Street, Springdale, Pennsylvania (CPV001). Office of Scientific and Technical Information (OSTI), September 1995. http://dx.doi.org/10.2172/116606.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Coleman, R. L., M. E. Murray, and K. S. Brown. Results of the supplementary radiological survey at the former C. H. Schnoor and Company site, 644 Garfield Street, Springdale, Pennsylvania (CVP001). Office of Scientific and Technical Information (OSTI), April 1995. http://dx.doi.org/10.2172/82401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Schnorr' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography