The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase maximal orders (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1987-2009 (15) 2012 (1)
Publication types (Num. hits)
article(9) inproceedings(7)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 5 keywords

Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu Maximal Orders in the Design of Dense Space-Time Lattice Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Yongtae Kim, Chang Han Kim, Taek-Young Youn On the Security of Multilevel Cryptosystems over Class Semigroups of Imaginary Quadratic Non-maximal Orders. Search on Bibsonomy EuroPKI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Key generation algorithm, Class semigroup, Key exchange system, Hierarchy
2Hwankoo Kim, Sang-Jae Moon Public-Key Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders. Search on Bibsonomy ACISP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Nicole Sutherland Efficient computation of maximal orders in radical (including Kummer) extensions. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Camilla Hollanti, Hsiao-feng Lu Construction Methods for Asymmetric and Multiblock Space-Time Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu Maximal Orders in the Design of Dense Space-Time Lattice Codes Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Michael J. Jacobson Jr., Renate Scheidler, Daniel Weimer An Adaptation of the NICE Cryptosystem to Real Quadratic Orders. Search on Bibsonomy AFRICACRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Camilla Hollanti, Hsiao-feng Lu Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes. Search on Bibsonomy AAECC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Asymmetric space-time block codes (ASTBCs), cyclic division algebras (CDAs), dense lattices, diversity-multiplexing tradeoff (DMT), maximal orders, multi-block, multiple-input multiple-output (MIMO) channels, nonvanishing determinant (NVD), discriminants
1Jyrki T. Lahtonen, Roope Vehkalahti Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory. Search on Bibsonomy AAECC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael Baake, Peter A. B. Pleasants, Ulf Rehmann Coincidence Site Modules in 3-Space. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael J. Jacobson Jr. The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders. Search on Bibsonomy ACISP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2003 DBLP  DOI  BibTeX  RDF non-maximal imaginary quadratic order, non-interactive cryptography, discrete logarithm, identity based cryptography
1Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2000 DBLP  DOI  BibTeX  RDF non-maximal imaginary quadratic order, non-interactive cryptography, discrete logarithm, identity based cryptosystem
1Gábor Ivanyos, Lajos Rónyai Finding Maximal Orders in Semisimple Algebras Over Q. Search on Bibsonomy Computational Complexity The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Lajos Rónyai Algorithmic Properties of Maximal Orders in Simple Algebras over Q. Search on Bibsonomy Computational Complexity The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1David J. Ford The Construction of Maximal Orders Over a Dedekind Domain. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #16 of 16 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.