Publication: Efficient recovering of operation tables of black box groups and rings
Efficient recovering of operation tables of black box groups and rings
Date
Date
Date
Citations
Zumbraegel, J., Maze, G., & Rosenthal, J. (2008). Efficient recovering of operation tables of black box groups and rings. In IEEE (Ed.), Information Theory, 2008.ISIT 2008. (pp. 639–643). IEEE. https://doi.org/10.1109/ISIT.2008.4595064
Abstract
Abstract
Abstract
People have been studying the following problem: Given a finite set S with a hidden (black box) binary operation ∗ : S × S → S which might come from a group law, and suppose you have access to an oracle that you can ask for the operation x ∗ y of single pairs (x, y) ∈ S2 you choose. What is the minimal number of queries to the oracle until the whole binary operation is recovered, i.e. you know x ∗ y for all x, y ∈ S? This problem can trivially be solved by using |S|2 queries to the oracle, so the question arises under which circumstan
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Zumbraegel, J
- Maze, G
- Rosenthal, J
Editors
Title of Book
Title of Book
Title of Book
Place of Publication
Place of Publication
Place of Publication
Publisher
Publisher
Publisher
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Metrics
Downloads
Views
Citations
Zumbraegel, J., Maze, G., & Rosenthal, J. (2008). Efficient recovering of operation tables of black box groups and rings. In IEEE (Ed.), Information Theory, 2008.ISIT 2008. (pp. 639–643). IEEE. https://doi.org/10.1109/ISIT.2008.4595064
